Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "n = int(input())\r\np = list(map(int,input().split()))\r\nT = int(input())\r\np.sort()\r\nfs = 0\r\nmaxx = 0\r\nfor i in range(n):\r\n while fs<n and p[fs]-p[i]<=T:\r\n fs+=1\r\n maxx = max(maxx,fs-i)\r\nprint(maxx)", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = sorted(read())\r\nT = int(input())\r\nans = 0\r\nj = 0\r\nfor i in range(n):\r\n while j < n and a[j] - a[i] <= T:\r\n j += 1\r\n ans = max(ans, j - i)\r\nprint(ans)\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nth=int(input())\r\nt.sort()\r\nk=0\r\nfor i in range(n):\r\n k1=0\r\n j=i\r\n while j!=n and abs(t[j]-t[i])<=th:\r\n j+=1 \r\n k1+=1\r\n if k1>k:\r\n k=k1\r\nprint(k)", "n = int(input())\r\nmass = list(map(int,input().split()))\r\nt = int(input())\r\nmass.sort()\r\nl = 0\r\nr = n\r\nwhile l + 1 != r:\r\n x = (l + r) // 2\r\n count = 0\r\n for i in range(n - x):\r\n if mass[i + x] - mass[i] <= t:\r\n count += 1\r\n break\r\n if count > 0:\r\n l = x\r\n else:\r\n r = x\r\nprint(l + 1)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nt=int(input())\r\nst=0\r\nmaxi=0 \r\nfor end in range(n):\r\n while l[end]-l[st]>t:\r\n st+=1 \r\n if end-st+1>maxi:\r\n maxi=end-st+1 \r\n ans=(st,end)\r\nprint(maxi)\r\n#print(ans)", "n=int(input())\r\ns=sorted([int(x) for x in input().split()])\r\nt=int(input())\r\np1,p2=0,0\r\nmaxnum=0\r\nwhile p2<len(s):\r\n if s[p2]-s[p1]<=t:\r\n maxnum=max(maxnum,p2-p1+1)\r\n p2+=1\r\n else:\r\n p1+=1\r\n if p2<p1:\r\n p2=p1\r\nprint(maxnum)\r\n", "n=int(input())\nt=list(map(int,input().split()))\nT=int(input())\nt.sort()\nm=1\ncount=0\nfor i in range(n):\n for j in range(i,n):\n if (t[j]-t[i]<=T):\n count+=1\n m=max(count,m)\n count=0\nprint(m)\n \t \t\t \t\t\t\t\t \t \t\t \t \t \t\t\t", "n=int(input())\na=list(map(int,input().split()))\nt=int(input())\na.sort()\nm=1\ncount=0\nfor i in range(n):\n for j in range(i,n):\n if (a[j]-a[i]<=t):\n count+=1\n m=max(count,m)\n count=0\nprint(m)\n\t\t \t\t \t\t\t\t\t \t\t\t \t\t\t\t \t \t \t \t", "class CodeforcesTask386BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.times = []\n self.t = 0\n\n def read_input(self):\n self.n = int(input())\n self.times = [int(x) for x in input().split(\" \")]\n self.t = int(input())\n\n def process_task(self):\n result = 0\n\n self.times.sort()\n\n for start in set(self.times):\n in_range = 0\n for time in self.times:\n if start <= time <= start + self.t:\n in_range += 1\n result = max(result, in_range)\n\n self.result = str(result)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask386BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=int(input())\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n j=i\r\n count=0\r\n while(j<n):\r\n if((a[j]-a[i])<=t):\r\n count+=1\r\n j+=1\r\n else:\r\n break\r\n if(count>ans):\r\n ans=count\r\nprint(ans)\r\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", "def halyava(lst, t):\r\n count = 1\r\n for i in range(len(lst)):\r\n for j in range(i + 1, len(lst)):\r\n if sorted(lst)[j] - sorted(lst)[i] <= t:\r\n count = max(j - i + 1, count)\r\n return count\r\n\r\n\r\nn = int(input())\r\nb = [int(x) for x in input().split()]\r\nT = int(input())\r\nprint(halyava(b, T))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=int(input())\r\na.sort()\r\nv=0\r\nfor i in range(n):\r\n j=i\r\n d=0\r\n while(j<n):\r\n if((a[j]-a[i])<=b):\r\n d+=1\r\n j+=1\r\n else:\r\n break\r\n if(d>v):\r\n v=d \r\nprint(v)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=int(input())\r\na.sort()\r\nm=1\r\ncount=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if (a[j]-a[i]<=t):\r\n count+=1\r\n m=max(count,m)\r\n count=0\r\nprint(m)", "n = int(input())\r\n*t, = map(int, input().split())\r\nk = int(input())\r\nt.sort()\r\ncnt = 1\r\nfor i in range(n):\r\n cur_cnt = 1\r\n for j in range(i + 1, n):\r\n if t[j] - t[i] <= k:\r\n cur_cnt += 1\r\n else:\r\n break\r\n cnt = max(cnt, cur_cnt)\r\nprint(cnt)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=int(input())\r\nl.sort()\r\na=[]\r\ni=0\r\nj=0\r\nwhile i<n:\r\n while j<n and l[j]-l[i]<=t:\r\n j+=1\r\n a.append(j-i)\r\n i+=1\r\nprint(max(a))", "n=int(input())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nT=int(input())\r\n\r\nX=[0]*1005\r\n\r\nfor i in range(len(L)):\r\n X[L[i]]+=1\r\n\r\nfor i in range(1,1005):\r\n X[i]+=X[i-1]\r\nbest=0\r\nfor i in range(1+T,1005):\r\n if(X[i]-X[i-T-1]>best):\r\n best=X[i]-X[i-T-1]\r\nprint(best)\r\n", "num_of_student=int(input())\r\nstudents_time_interval=[int(x) for x in (input().split())]\r\nfreebies_time_interval=int(input())\r\nmax_students=-1\r\nstudents_time_interval.sort()\r\nfor i in range(0,len(students_time_interval)):\r\n num=0\r\n for j in range(i,len(students_time_interval)):\r\n if students_time_interval[j]<=(students_time_interval[i]+freebies_time_interval):\r\n num+=1\r\n else:\r\n break\r\n max_students=max(max_students,num)\r\nprint(max_students)\r\n\r\n", "n, t = input(), [0] * 1002\r\nfor i in map(int, input().split()): t[i] += 1\r\nT = int(input()) + 1\r\nfor i in range(1000): t[i + 1] += t[i]\r\nprint(max(t[i + T] - t[i] for i in range(-1, 1001 - T)))", "n = int(input())\r\np = list(map(int,input().split()))\r\nt = int(input())\r\np.sort()\r\nans = 0\r\ni = 0\r\nfor j in range(n):\r\n while p[j]-p[i]>t:\r\n i=i+1\r\n ans=max(ans,j-i+1)\r\nprint(ans)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=int(input())\r\nb.sort()\r\ne=0\r\nfor i in range(a):\r\n j=i\r\n d=0\r\n while j<a:\r\n if (b[j]-b[i])<=c:\r\n d+=1\r\n j+=1\r\n else:\r\n break\r\n if d>e:\r\n e=d\r\nprint(e)\r\n ", "n=int(input())\r\nt=list(map(int,input().split()))\r\nth=int(input())\r\nt.sort()\r\nk=0\r\nj=0\r\nfor i in range(n):\r\n k1=0\r\n while j!=n and abs(t[j]-t[i])<=th:\r\n j+=1 \r\n if abs(i-j)>k:\r\n k=abs(i-j) \r\nprint(k)", "n=int(input())\r\nt=list(map(int,input().split()))\r\nT=int(input())\r\nt.sort()\r\ng=0\r\nfor i in range (n):\r\n j=i \r\n d=0 \r\n while j<n:\r\n if(t[j]-t[i])<=T:\r\n j+=1 \r\n d+=1 \r\n else:\r\n break\r\n if d>g:\r\n g=d \r\nprint(g)\r\n ", "n = int(input())\r\ntime = list(map(int, input().split()))\r\nt = int(input())\r\nnum = []\r\ntime.sort()\r\ntmax = time[-1]\r\ntmin = time[0]\r\nif time[-1] - time[0] <= t:\r\n print(n)\r\nelse:\r\n la = 0\r\n stu = 0\r\n for i in range(n):\r\n if time[i] <= tmin + t:\r\n stu += 1\r\n la = i\r\n else:\r\n break\r\n num.append(stu)\r\n for i in range(1, n):\r\n if time[i] + t > tmax:\r\n break\r\n if time[i] == time[i - 1]:\r\n stu -= 1\r\n else:\r\n x = time[i] + t\r\n stu -= 1\r\n if x <= time[la]:\r\n break\r\n else:\r\n for j in range(la + 1, n):\r\n if time[j] <= x:\r\n stu += 1\r\n la = j\r\n num.append(stu)\r\n print(max(num))\r\n", "n = int(input())\ntimes = sorted(int(i) for i in input().split())\nT = int(input())\n\nmax_students, l = 0, 0\nfor r, v in enumerate(times):\n while l <= r and v - times[l] > T:\n l += 1\n max_students = max(max_students, r - l + 1)\n\nprint(max_students)\n", "n = int(input())\nx = sorted(list(map(int, input().split())))\nt = int(input())\nlp, rp = 0, 0\nres = 1\nwhile True:\n while x[rp] - x[lp] <= t:\n res = max(res, rp - lp + 1)\n rp += 1\n if rp == n:\n break\n if rp == n:\n break\n while x[rp] - x[lp] > t:\n lp += 1\nprint(res)\n\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\narr = sorted(R())\r\ngap = int(input())\r\nj = 0\r\nres = 0\r\nfor i in range(n):\r\n while arr[i] - arr[j] > gap:\r\n j += 1\r\n res = max(res, i - j + 1)\r\nprint(res)", "n, v= int(input()), list(sorted(map(int, input().split())))\nt = int(input())\n\nans = 0\n\nfor i in range(n):\n k = 0\n for j in range(i + 1, n):\n if v[j] - v[i] <= t:\n k += 1\n ans = max(ans, k + 1);\n\nprint(ans)\n\n\n\n\n", "import bisect \r\n\r\nn = int(input())\r\narr = sorted(map(int , input().split()))\r\nt = int(input())\r\n\r\nres = 0 \r\n\r\nfor i in range(n) :\r\n end = bisect.bisect_right(arr , t + arr[i]) \r\n res = max(res , end - i)\r\n\r\nprint(res)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nt = int(input())\r\nlst.sort()\r\nres=0\r\nfrom bisect import bisect\r\nfor i,x in enumerate(lst):\r\n j=bisect(lst,x+t)\r\n res=max(res,j-i)\r\nprint(res)", "n = int(input())\r\nv = list(map(int, input().split()))\r\nt = int(input())\r\n\r\nv.sort()\r\nret = 1\r\nlef = 0\r\nrit = 1\r\nwhile rit < n:\r\n while rit < n and v[rit] - v[lef] <= t:\r\n rit = rit + 1\r\n\r\n ret = max(ret, rit - lef)\r\n lef = lef + 1\r\n\r\nprint(ret)\r\n", "import bisect\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\nT = int(input())\r\nt.sort()\r\nresult = 0\r\nfor i in range(n):\r\n result = max(bisect.bisect(t, t[i]+T) - i, result)\r\nprint(result)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nt = int(input())\r\nl.sort()\r\nans = 0\r\nstart = 0\r\nfor end in range(n):\r\n while l[end] - l[start] > t:\r\n start += 1\r\n if end-start+1 > ans:\r\n ans = end-start+1\r\nprint(ans)", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nt=int(input())\r\nresult=0\r\nfor x in range(n):\r\n for y in range(n):\r\n if abs(l[x]-l[y])<=t:\r\n result=max(result,(y-x)+1)\r\n \r\nprint(result)", "n = int(input())\r\nt = list(map(int, input().split()))\r\ntem = int(input())\r\nt.sort()\r\nrmax = 1\r\nfor cont in range(0,n-1):\r\n r = 1\r\n for cont2 in range(cont+1,n):\r\n if t[cont2] -t[cont] <= tem:\r\n r += 1\r\n else:\r\n break\r\n if r > rmax:\r\n rmax = r\r\n\r\nprint(rmax)", "n = int(input())\r\nidk = input()\r\na = [int(i) for i in idk.split()]\r\nt = int(input())\r\na.sort()\r\nans = 0\r\nfor i in range (0, n):\r\n for j in range (i, n):\r\n if a[j] - a[i] <= t:\r\n ans = max(ans, j - i + 1)\r\n else:\r\n break\r\nprint(ans) ", "n = int(input())\nt = sorted(list(map(int, input().split())))\nT = int(input())\nans = 0\nl = 0\nr = 0\nwhile r < n:\n ans = max(ans, r - l + 1)\n if r == n - 1:\n break\n if t[r + 1] - t[l] <= T:\n r += 1\n else:\n l += 1\nprint(ans)" ]

[ "n=int(input())\na = [0]*(n+1)\nfor i in range(n-1):\n for i in input().split():\n a[int(i)]+=1\nl = a.count(1)\nprint ((l*2**(n-l+1)+(n-l)*(2**(n-l)))%(10**9+7))\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\ncnt = [[] for _ in range(n)]\r\nfor i in range (n - 1):\r\n fr, to = map(int, input().split())\r\n cnt[fr - 1].append(to - 1);\r\n cnt[to - 1].append(fr - 1);\r\nl = 0\r\nfor i in range(n):\r\n if (len(cnt[i]) == 1):\r\n l += 1\r\nans = (n - l) * pow(2, n - l, 10 ** 9 + 7)\r\nans += l * pow(2, n - l + 1, 10 ** 9 + 7)\r\nprint (ans % (10 ** 9 + 7))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nmod = 10 ** 9 + 7\r\ndegs = [0] * n\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n degs[u] += 1\r\n degs[v] += 1\r\n\r\nleaves_count = degs.count(1)\r\nprint((n + leaves_count) * pow(2, n - leaves_count, mod) % mod)", "I=input;n=int(I());d=[0]*n\r\nfor _ in range(n-1):\r\n for u in I().split():d[int(u)-1]+=1\r\nl=d.count(1);print((l*2**(n-l+1)+(n-l)*2**(n-l))%(10**9+7))", "'''\r\njohn以好心情开始、在n个“由n-1条双向边连通”的城市间旅行，每个城市呆一天，然后选择相邻未访问的城市，\r\n到达有赌场的城市时john一定会试下身手，并且赌博会改变心情，即由好变坏、或反之，\r\n求使得john总是会以好心情结束旅程的“选择起始城市和设赌场的”方案数。\r\n\r\ndfs计数，超时。\r\n描述问题：在树上任意选择根节点并将每个节点描为红或黑色，\r\n求满足“从根节点到任意叶节点的路径上包含偶数个黑节点”的方案数。\r\n考虑如何使“路径上包含偶数个黑节点”，……答案是其他节点任意设颜色、由叶节点来修正\r\n做完这题给人带来的直觉是，关于奇偶性的问题，解法可以是简单的。\r\n'''\r\nI=input;n=int(I());d=[0]*n\r\nfor _ in range(n-1):\r\n for u in I().split():d[int(u)-1]+=1\r\nl=d.count(1);print((l*2**(n-l+1)+(n-l)*2**(n-l))%(10**9+7))", "def quick_mod(b, p) :\r\n s = 1\r\n while (p != 0) :\r\n if (p & 1) : s = s * b % mod\r\n p = p // 2\r\n b = b * b % mod\r\n return s\r\ns = input().split()\r\nn = int(s[0])\r\nN = 100000\r\nmod = 1000000007\r\nenter = []\r\nfor i in range(1, N + 5) :\r\n enter.append(0)\r\nfor i in range(1, n) :\r\n s1 = input().split()\r\n enter[int(s1[0])] += 1\r\n enter[int(s1[1])] += 1\r\ntot = 0\r\nfor i in range(1, n + 1) :\r\n if (enter[i] == 1) : tot += 1\r\nprint((n + tot) * quick_mod(2, n - tot) % mod)" ]

[ "n = int(input())\r\n\r\narr = [int(z) for z in input().split()]\r\n\r\nb = [int(z) for z in input()]\r\n\r\nl, r = -10**9, 10**9\r\n\r\nfor i in range(1, n):\r\n\r\n if b[i] != b[i-1]:\r\n\r\n if b[i] == 1:\r\n for k in range(5):\r\n l = max(l-1, arr[i-k]) + 1\r\n if b[i] == 0:\r\n for k in range(5):\r\n r = min(r+1, arr[i-k]) - 1\r\n\r\nprint(l, r)", "for pratyush in range(1):\r\n n=int(input())\r\n a=list(map(float,input().split()))\r\n s=input()\r\n l,r,x,y=-1000000001.,1000000001.,a[:5],[0]*4\r\n for i in range(4,n):\r\n x[i%5],b=a[i],s[i]=='1'\r\n if b:\r\n if not any(y) and l<max(x):\r\n l=max(x)\r\n else:\r\n if all(y) and r>min(x):\r\n r=min(x)\r\n y[i%4]=b\r\n print(int(l)+1,int(r)-1)", "n = int(input())\na = [*map(int, input().split())]\nb = input()\n\nl, r = -10**9, 10**9\n\nfor i in range(4, n):\n\tif b[i] == b[i - 1]:\n\t\tcontinue\n\tmx = max(a[i - 4:i + 1])\n\tmn = min(a[i - 4:i + 1])\n\tif b[i] == '0':\n\t\tr = min(r, mn - 1)\n\telse:\n\t\tl = max(l, mx + 1)\n\nprint(l, r)", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef check_al(x):\r\n i = 0\r\n d = deque([])\r\n while i < 4:\r\n d.append(l[i])\r\n i += 1\r\n\r\n prev = '0'\r\n while i < n:\r\n d.append(l[i])\r\n if s[i] == '1':\r\n if prev == '0':\r\n for j in d:\r\n if x <= j:\r\n return False\r\n\r\n prev = s[i]\r\n d.popleft()\r\n i += 1\r\n\r\n return True\r\n\r\n\r\ndef check_ar(x):\r\n i = 0\r\n d = deque([])\r\n while i < 4:\r\n d.append(l[i])\r\n i += 1\r\n\r\n prev = '0'\r\n while i < n:\r\n d.append(l[i])\r\n if s[i] == '0':\r\n if prev == '1':\r\n for j in d:\r\n if x >= j:\r\n return False\r\n\r\n prev = s[i]\r\n d.popleft()\r\n i += 1\r\n\r\n return True\r\n\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\ns = input()\r\nlow,high = -1*(10**9),10**9\r\nal,ar = -1,-1\r\nwhile low <= high:\r\n mid = (low+high)//2\r\n if check_al(mid):\r\n al = mid\r\n high = mid-1\r\n\r\n else:\r\n low = mid+1\r\n\r\nlow,high = -1*(10**9),10**9\r\nwhile low <= high:\r\n mid = (low + high) // 2\r\n if check_ar(mid):\r\n ar = mid\r\n low = mid + 1\r\n\r\n else:\r\n high = mid - 1\r\n\r\nprint(al,ar)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(input())\r\nb = list(map(int,b))\r\ninf = int(1e9)\r\nl = [-inf,inf]\r\nr = [-inf,inf]\r\n\r\nfor i in range(4,n):\r\n Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])\r\n Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])\r\n\r\n if b[i] == 0:\r\n if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:\r\n r[1] = min(r[1],Min - 1)\r\n elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):\r\n l[1] = max(l[1],Max)\r\n else:\r\n if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:\r\n r[0] = max(r[0],Min)\r\n elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):\r\n l[0] = max(l[0],Max + 1)\r\nprint(l[0],r[1])\r\n \r\n", "import re\r\ninput()\r\na = list(map(int, input().split()))\r\nb = input()\r\nl, r = -10**9, 10**9\r\n\r\n# a: a a a a a > r\r\n# b: 1 1 1 1 0\r\nfor m in re.finditer(\"11110\", b):\r\n\ti = m.start(0)\r\n\tr = min([r + 1] + a[i:i+5]) - 1\r\n\r\n# a: a a a a a < l\r\n# b: 0 0 0 0 1 \t\t\r\nfor m in re.finditer(\"00001\", b):\r\n\ti = m.start(0)\r\n\tl = max([l - 1] + a[i:i+5]) + 1\r\n\t\t\r\nprint(l, r)", "n = int(input())\na = list(map(int, input().split()))\nb = input()\nr = 1000000000\nl = -r\nfor i in range(4, n):\n if b[i - 1] != b[i]:\n if b[i] == '0':\n r = min(r, min(a[i - 4: i + 1]) - 1)\n else:\n l = max(l, max(a[i - 4: i + 1]) + 1)\nprint(l, r)\n\n", "n, a, b, l, r = int(input()), list(map(int, input().split())), input(), -10**9, 10**9\r\nfor i in range(4, n):\r\n if b[i-4:i+1]==\"00001\": l = max(l, max(a[i], a[i-1], a[i-2], a[i-3], a[i-4])+1)\r\n if b[i-4:i+1]==\"11110\": r = min(r, min(a[i], a[i-1], a[i-2], a[i-3], a[i-4])-1)\r\nprint(l, r)", "if __name__==\"__main__\":\r\n n=int(input())\r\n a = list(map(int,input().split()))\r\n s = str(input())\r\n lmin=rmin=-1e9\r\n lmax=rmax=1e9\r\n for i in range(4,len(s)):\r\n if((s[i]=='0' and s[i-1]=='0') or(s[i]=='1' and s[i-1]=='1')):\r\n lmax=min(lmax,max([a[i-j] for j in range(5)]))\r\n rmin=max(rmin,min([a[i-j] for j in range(5)]))\r\n elif(s[i]=='1' and s[i-1]=='0'):\r\n lmin=max(lmin,max([a[i-j] for j in range(5)])+1)\r\n else:\r\n rmax=min(rmax,min([a[i-j] for j in range(5)])-1)\r\n print(int(lmin),int(rmax))\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = input()\r\n\r\nminl = int(-1e9)\r\nmaxr = int(1e9)\r\n\r\nfor i in range(4, n):\r\n if not (b[i-4] == b[i-3] == b[i-2] == b[i-1] != b[i]):\r\n continue\r\n #print('working for', i)\r\n if b[i] == '0':\r\n maxr = min(maxr+1, a[i], a[i-1], a[i-2], a[i-3], a[i-4])-1\r\n if b[i] == '1':\r\n minl = max(minl-1, a[i], a[i-1], a[i-2], a[i-3], a[i-4])+1\r\n\r\nprint(minl, maxr)", "def main():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n b = input()\r\n\r\n re = int(1e9)\r\n le = -re\r\n x = True\r\n for i in range(n):\r\n if b[i] == ('1' if x else '0'):\r\n for j in a[i - 4:i + 1]:\r\n if x:\r\n if le <= j:\r\n le = j + 1\r\n else:\r\n if re >= j:\r\n re = j - 1\r\n x = not x\r\n print(le, re)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\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 = list(map(int, input().split()))\r\nb = list(input().rstrip())\r\ninf = pow(10, 9)\r\nl, r = -inf, inf\r\nla = b[0]\r\nfor i in range(n):\r\n if la == b[i]:\r\n continue\r\n la = b[i]\r\n if la & 1:\r\n for j in range(i, i - 5, -1):\r\n l = max(l, a[j] + 1)\r\n else:\r\n for j in range(i, i - 5, -1):\r\n r = min(r, a[j] - 1)\r\nprint(l, r)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = input()\r\nl = -10**9\r\nr = 10**9\r\n\r\nfor i in range(4, n):\r\n if b[i-4] == b[i-3] == b[i-2] == b[i-1] != b[i]:\r\n if b[i] == '0':\r\n r = min(r, min(a[i-4:i+1])-1)\r\n if b[i] == '1':\r\n l = max(l, max(a[i-4:i+1])+1)\r\n\r\nprint(l, r)\r\n\r\n\r\n", "n=int(input())\na=[int(x) for x in input().split()]\nb=[int(x) for x in input()]\nz=[0]*4\no=[1]*4\n\nk=1000000000\nlmin=-k\nrmax=k\nrmin=-k\nlmax=k\nfor i in range(4,n):\n\ta1=min(a[i-4:i+1])\n\ta2=max(a[i-4:i+1])\n\tb1= b[i-4:i]==o\n\tb2= b[i-4:i]==z\n\tif b1 and b[i]==0:\n\t\trmax=min(rmax,a1-1)\n\n\telif b2 and b[i]==1:\n\t\tlmin=max(lmin,a2+1)\n\n\telif b1:\n\t\trmin=max(rmin,a1+1)\n\t\n\telif b2:\n\t\tlmax=min(lmax,a2-1)\n\n\nprint(lmin,rmax)\n\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns=[int(el) for el in input()]\r\nl=-10**9\r\nr=10**9\r\ni=4\r\nwhile i<n:\r\n t=set()\r\n for j in range(i-1,i-5,-1):\r\n t.add(s[j])\r\n if 0 in t and 1 in t:\r\n i+=1\r\n else:\r\n if 0 in t and s[i]==1:\r\n l=max(l,arr[i]+1,arr[i-1]+1,arr[i]+1,arr[i-2]+1,arr[i-3]+1,arr[i-4]+1)\r\n i+=1\r\n elif 1 in t and s[i]==0:\r\n r=min(r,arr[i]-1,arr[i-1]-1,arr[i]-1,arr[i-2]-1,arr[i-3]-1,arr[i-4]-1)\r\n i+=1\r\n else:\r\n i+=1\r\nprint(l,r)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns=input()\r\nptr=4\r\nl=-10**9\r\nr=10**9\r\n#print(s,si)\r\nwhile ptr<n:\r\n if s[ptr-4:ptr+1]==\"00001\":\r\n l=max(max(arr[ptr-4:ptr+1])+1,l)\r\n elif s[ptr-4:ptr+1]==\"11110\":\r\n r=min(min(arr[ptr-4:ptr+1])-1,r)\r\n ptr+=1\r\nprint(l,r)\r\n \r\n ", "import sys,os\r\nfrom math import gcd,log \r\nfrom bisect import bisect as bi\r\nfrom collections import defaultdict,Counter\r\ninput=sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\nfrom heapq import heappush,heappop\r\nimport random as rd\r\n\r\nn, = I()\r\nlt = I()\r\nr = -10**9\r\nl = 10**9\r\nb = input().strip()\r\nfor i in range(n-4):\r\n\tif b[i:i+5] == '00001':\r\n\t\tr = max(r,max(lt[i:i+5])+1)\r\n\telif b[i:i+5] == '11110':\r\n\t\tl = min(l,min(lt[i:i+5])-1)\r\nprint(r,l)", "n, a, b, l, r = int(input()), list(map(int, input().split())), input(), -10**9, 10**9\r\nfor i in range(4, n):\r\n if b[i-4:i+1]==\"00001\": l = max(l, max(a[i-4:i+1])+1)\r\n if b[i-4:i+1]==\"11110\": r = min(r, min(a[i-4:i+1])-1)\r\nprint(l, r)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, list(input()[:-1])))\r\nl, r = -10**9, 10**9\r\n\r\nfor i in range(4, n):\r\n s = b[i-1]+b[i-2]+b[i-3]+b[i-4]\r\n \r\n if s==0 and b[i]==1:\r\n l = max(l, max(a[i], a[i-1], a[i-2], a[i-3], a[i-4])+1)\r\n elif s==4 and b[i]==0:\r\n r = min(r, min(a[i], a[i-1], a[i-2], a[i-3], a[i-4])-1)\r\n\r\nprint(l, r)", "import time\r\nimport math\r\n\r\ndebug = False\r\n\r\nnDayQuant = int(input())\r\nTemps = list(map(int, input().split(' ')))\r\nStatus = input()\r\n\r\nnMaxTemp = 1000000000\r\nnMinTemp = -1000000000\r\n\r\nnLowTempMin = nMinTemp\r\nnLowTempMax = nMaxTemp\r\nnHighTempMin = nMinTemp\r\nnHighTempMax = nMaxTemp\r\n\r\nif debug : print(\"---\")\r\nbegin = time.time()\r\n\r\ndef max5(nDay):\r\n\tglobal Temps\r\n\tnRet = Temps[nDay]\r\n\tfor i in range (nDay-4, nDay):\r\n\t\tif Temps[i] > nRet:\r\n\t\t\tnRet = Temps[i]\r\n\treturn nRet\r\n\r\ndef min5(nDay):\r\n\tglobal Temps\r\n\tnRet = Temps[nDay]\r\n\tfor i in range (nDay-4, nDay):\r\n\t\tif Temps[i] < nRet:\r\n\t\t\tnRet = Temps[i]\r\n\treturn nRet\r\n\r\nnLastStatus = \"0\"\r\nnOffCount = 4\r\nnOnCount = 0\r\nfor i in range(4, nDayQuant):\r\n\tif debug : print(\"i: \", i)\r\n\tif Status[i] == \"1\":\r\n\t\tnOnCount += 1\r\n\t\tnOffCount = 0\r\n\telse:\r\n\t\tnOnCount = 0\r\n\t\tnOffCount += 1\r\n\r\n\tif (Status[i] != nLastStatus):\r\n\t\tif debug : print(\"Status[i]: \", Status[i])\r\n\t\tif Status[i] == \"1\":\r\n\t\t\tnCurrTemp = max5(i)\r\n\t\t\tif debug : print(\"nCurrTemp: \", nCurrTemp)\r\n\t\t\tif nCurrTemp >= nLowTempMin:\r\n\t\t\t\tnLowTempMin = nCurrTemp+1\r\n\t\t\t\tif debug : print(\"(Change) nLowTempMin: \", nLowTempMin)\r\n\t\telse:\r\n\t\t\tnCurrTemp = min5(i)\r\n\t\t\tif debug : print(\"nCurrTemp: \", nCurrTemp)\r\n\t\t\tif nCurrTemp <= nHighTempMax:\r\n\t\t\t\tnHighTempMax = nCurrTemp-1\r\n\t\t\t\tif debug : print(\"(Change) nHighTempMax: \", nHighTempMax)\r\n\t\tnLastStatus = Status[i]\r\n\telse:\r\n\t\tif nOnCount > 4:\r\n\t\t\tnCurrTemp = min5(i)\r\n\t\t\tif debug : print(\"nCurrTemp: \", nCurrTemp)\r\n\t\t\tif nCurrTemp > nHighTempMin:\r\n\t\t\t\tnHighTempMin = nCurrTemp\r\n\t\t\t\tif debug : print(\"(Save) nHighTempMin: \", nHighTempMin)\r\n\t\tif nOffCount > 4:\r\n\t\t\tnCurrTemp = max5(i)\r\n\t\t\tif debug : print(\"nCurrTemp: \", nCurrTemp)\r\n\t\t\tif nCurrTemp < nLowTempMax:\r\n\t\t\t\tnLowTempMax = nCurrTemp\r\n\t\t\t\tif debug : print(\"(Save) nLowTempMax: \", nLowTempMax)\r\n\r\nif debug : print(nLowTempMin, nLowTempMax, nHighTempMin, nHighTempMax)\r\n\r\nif nHighTempMin < nLowTempMin:\r\n\tnHighTempMin = nLowTempMin\r\nif nLowTempMax > nHighTempMax:\r\n\tnLowTempMax = nHighTempMax\r\n\r\nif debug : print(nLowTempMin, nLowTempMax, nHighTempMin, nHighTempMax)\r\n\r\nif nLowTempMax <= nHighTempMin:\r\n\tprint(nLowTempMax, nHighTempMin)\r\nelif nHighTempMin != nMinTemp:\r\n\tprint(nHighTempMin, nHighTempMin)\r\nelse:\r\n\tprint(nLowTempMax, nLowTempMax)\r\n\r\nif debug : print(time.time() - begin)\r\nif debug : print(\"---\")\r\n\r\n#print(nLowTemp, nHighTemp)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nlis = list(map(int,input().split()))\r\ns = input()\r\nl,r = 0,0\r\nmaxx,minn = -10**9,10**9\r\nllow,lhigh = maxx,minn\r\nrlow,rhigh = maxx,minn\r\nlast = 0\r\nprev = '0'\r\nfor i in range(4,n):\r\n curr = s[i]\r\n val = lis[last:last+5]\r\n last+=1\r\n if curr=='1':\r\n if prev=='0':\r\n llow = max(llow,max(val)+1)\r\n else:\r\n rlow = max(rlow,min(val))\r\n else:\r\n if prev=='0':\r\n lhigh = min(lhigh,max(val))\r\n else:\r\n rhigh = min(rhigh,min(val)-1)\r\n prev = curr\r\nprint(llow,rhigh)\r\n \r\n \r\n \r\n \r\n", "class SegTree:\n def __init__(self, init_val, ide_ele, segfunc):\n self.n = len(init_val)\n self.num = 2**(self.n-1).bit_length()\n self.ide_ele = ide_ele\n self.segfunc = segfunc\n self.seg = [ide_ele]*2*self.num\n # set_val\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n # built\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])\n\n def update(self, k, x):\n k += self.num\n self.seg[k] = x\n while k:\n k = k >> 1\n self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])\n\n def query(self, l, r):\n if r <= l:\n return self.ide_ele\n l += self.num\n r += self.num\n lres = self.ide_ele\n rres = self.ide_ele\n while l < r:\n if r & 1:\n r -= 1\n rres = self.segfunc(self.seg[r], rres)\n if l & 1:\n lres = self.segfunc(lres, self.seg[l])\n l += 1\n l = l >> 1\n r = r >> 1\n res = self.segfunc(lres, rres)\n return res\n\nINF = 10**18\n\ndef main():\n n = int(input())\n A = list(map(int, input().split()))\n B = str(input())\n\n ms = SegTree(A, INF, min)\n Ms = SegTree(A, -INF, max)\n\n\n r = INF\n l = -INF\n for i in range(4, n):\n if B[i] == '0' and B[i-1] == '1' and B[i-2] == '1' and B[i-3] == '1' and B[i-4] == '1':\n r = min(r, ms.query(i-4, i+1)-1)\n if B[i] == '1' and B[i-1] == '0' and B[i-2] == '0' and B[i-3] == '0' and B[i-4] == '0':\n l = max(l, Ms.query(i-4, i+1)+1)\n if r > 10**9:\n r = 10**9\n if l < -10**9:\n l = -10**9\n print(l, r)\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ns = list(map(int,input()))\r\nt1 = [0,0,0,0,1]\r\nt2 = [1,1,1,1,0]\r\nwindow = []\r\nl,r = -10**9,10**9\r\nfor i in range(4):\r\n window.append(s[i])\r\ncnt = 0\r\nfor i in range(4,n):\r\n window.append(s[i])\r\n if window==t1:\r\n x = max(arr[cnt:cnt+5])\r\n l = max(l,x+1)\r\n elif window==t2:\r\n x = min(arr[cnt:cnt+5])\r\n r = min(r,x-1)\r\n window.pop(0)\r\n cnt+=1\r\nprint(l,r)" ]

[ "f = lambda: map(int, input().split())\r\na, b, h, w, n = f()\r\nc = sorted(list(f()), key=lambda x: -x)\r\nd = {(h, w), (w, h)}\r\nfor i, q in enumerate([1] + c):\r\n for u, v in d.copy():\r\n h, w = u, v * q\r\n if a <= w and b <= h or a <= h and b <= w:\r\n print(i)\r\n exit()\r\n d.add((h, w))\r\n d.add((w, h))\r\nprint(-1)" ]

[ "from math import gcd,lcm,sqrt,factorial\r\ndef solve():\r\n s=sum(a)\r\n AVG=s//n\r\n if s%n:print(0);return\r\n li,ans=[],0\r\n for i in range(n):\r\n if AVG==a[i]:\r\n li.append(i+1)\r\n ans+=1\r\n print(ans)\r\n print(*li)\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n a=[int(x) for x in input().split()]\r\n solve()\r\n", "import sys\nS = sys.stdin.read()\nS = [int(x) for x in S.split('\\n')[1].split()]\ns = sum(S)\nn = len(S)\nT = [i+1 for i in range(n) if n*S[i] == s]\nprint(len(T))\nprint(' '.join([str(x) for x in T]))\n \t\t\t \t \t\t\t\t \t\t\t\t \t\t \t \t\t", "n, t = int(input()), list(map(int, input().split()))\r\ns = sum(t)\r\ntemp = [i + 1 for i in range(n) if t[i] * n == s]\r\nprint(len(temp))\r\nprint(' '.join(map(str, temp)))", "n = int(input())\r\na = [int(c) for c in input().split()]\r\nk = sum(a) / len(a)\r\nb = []\r\nfor i in range(len(a)):\r\n if a[i] == k:\r\n b.append(i+1)\r\nprint(len(b))\r\nprint(*b)", "n = int(input())\na = []\ns = 0\n\na = list(map(int, input().split()))\ns = sum(a)\n\nindices = []\nfor i in range(n):\n mid = (s - a[i]) / (n - 1)\n if mid.is_integer() and int(mid) == a[i]:\n indices.append(i + 1)\n\nprint(len(indices))\nfor i in indices:\n print(i, end=\" \")\n\n# Tue May 02 2023 01:12:11 GMT+0300 (Moscow Standard Time)\n", "#rOkY\r\n#FuCk\r\n\r\n################################ kOpAl ############################################\r\n\r\na=int(input())\r\nk=a-1\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\ncount=0\r\nl1=[]\r\nfor i in range(0,len(l),1):\r\n if(((s-l[i])%k)==0):\r\n if((s-l[i])//k==l[i]):\r\n count+=1\r\n l1.append(i+1)\r\nprint(count)\r\nfor i in l1:\r\n print(i,end=' ')\r\nprint()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = ''\r\nss = 0\r\ns = 0\r\nfor j in range(n):\r\n s += a[j]\r\nfor i in range(n):\r\n if (s - a[i]) / (n - 1) == a[i]:\r\n res += str(i + 1)\r\n res += ' '\r\n ss += 1\r\nprint(ss)\r\nprint(res)\r\n\n# Wed May 10 2023 21:32:23 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = []\r\nsrar = 0\r\n\r\n\r\nfor i in range(n):\r\n srar += A[i]\r\nsrar = srar/n\r\n\r\n\r\n\r\nfor i in range(n):\r\n if ((srar * n) - A[i]) / (n-1) == A[i]:\r\n B.append(i+1)\r\n \r\n \r\nprint(len(B))\r\nfor i in range(len(B)):\r\n print(B[i], end = ' ')", "# coding=utf-8\nn=int(input())\r\nla=list(map(int,input().split()))\r\nave=sum(la)/len(la)\r\nt=0\r\nfor a in la:\r\n if abs(a-ave)<=0.00001:\r\n t+=1\r\nprint(t)\r\nfor i in range(len(la)):\r\n if abs(la[i]-ave)<0.0001:\r\n print(i+1,end=\" \")\n \t \t \t\t \t\t \t\t\t \t \t\t\t \t\t", "\r\nn=int(input())\r\nA=[int(i) for i in input().split(\" \")]\r\n \r\nres=0\r\nans=[]\r\n \r\navg=sum(A)/n\r\n \r\nfor i in range(n):\r\n if A[i]==avg:\r\n res+=1\r\n ans.append(i+1)\r\nprint(res)\r\nprint(*ans)", "i1 = int(input())\r\na = [int(i) for i in input().split()]\r\nl = len(a) - 1\r\ns = sum(a)\r\nc = []\r\nn = 0\r\nfor i in range(i1):\r\n if a[i] == (s - a[i]) / l:\r\n c.append(i+1)\r\n n += 1\r\nprint(n)\r\nprint(*c)\n# Sat May 06 2023 09:20:17 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=sum(a)/n\r\nt=[]\r\nfor i in range(n):\r\n if a[i]==z:\r\n t.append(i+1)\r\nprint(len(t))\r\nprint(*t)", "#!/usr/bin/env python\n\ndef main( ):\n n = int( input( ) )\n a = list( map( int, input( ).split( ) ) )\n\n s = sum( a )\n res = list( )\n\n for i in range( len( a ) ):\n if ( s - a[ i ] ) / ( n - 1 ) == a[ i ]:\n res.append( i + 1 )\n\n print( len( res ) )\n if len( res ) > 0:\n print( \" \".join( map( str, res ) ) )\n\nif __name__ == '__main__':\n main( )\n\n", "n = int(input())\nm = list(map(int, input().split()))\nans = []\nsumm = sum(m)\nfor i in range(n):\n if (summ - m[i]) / (n - 1) == m[i]:\n ans.append(i + 1)\nprint(len(ans))\nprint(*ans)\n\n# Tue May 02 2023 16:45:22 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = input().split()\r\na = [int(x) for x in a]\r\n\r\nmean = sum(a)/n\r\nlist1 = []\r\nfor i,x in enumerate(a):\r\n if(x == mean):\r\n list1.append(i+1)\r\n \r\nprint(len(list1))\r\nfor x in list1:\r\n print(x,end=' ')", "n = int(input())\r\n\r\nnums = []\r\nsum = 0\r\n\r\nanswers = []\r\nansCount = 0\r\n\r\nnums=list(map(int, input().split()))\r\n\r\nfor num in nums:\r\n sum += num\r\n \r\nfor i in range(n):\r\n srA = (sum - nums[i]) / (n-1)\r\n\r\n if (nums[i] == srA):\r\n ansCount += 1\r\n answers.append(i+1)\r\n\r\nprint(ansCount)\r\nfor i in range(ansCount):\r\n print(answers[i], end=' ')\n# Tue May 09 2023 13:41:06 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\n\ns = sum(a)\n\nans = []\nfor i in range(n):\n \n if (s - a[i]) / (n-1) == a[i]:\n ans.append(i+1)\n\nprint(len(ans))\nif len(ans) > 0:\n print(*ans)\n# Tue May 09 2023 18:03:14 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\ns = sum(a)\nif s/n==s//n:\n print(a.count(s//n))\n for i in range(len(a)):\n if a[i]==s//n:\n print(i+1, end=\" \")\nelse:\n print(0)\n# Sun May 07 2023 18:07:54 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum_a = sum(a)\r\ns = n - 1\r\nsumma = 0\r\nc = []\r\nfor i in range(n):\r\n b = (sum_a - a[i]) / s\r\n if b == a[i]:\r\n summa += 1\r\n c.append(i + 1)\r\nprint(summa)\r\nprint(' '.join(map(str, c)))\n# Sun May 07 2023 11:38:02 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nsum = 0 \r\nfor i in a:\r\n sum += i\r\nsum = sum / len(a)\r\nres = []\r\nnum = 0\r\nfor i in range(len(a)):\r\n if a[i] == sum:\r\n res.append(i+1)\r\n num +=1\r\nprint(num)\r\nprint(*res)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = sum(a)\r\ncount = 0\r\nindices = []\r\nfor i in range(n):\r\n if (s - a[i]) / (n - 1) == a[i]:\r\n count += 1\r\n indices.append(i+1)\r\n\r\nprint(count)\r\nprint(*indices)\n# Thu May 11 2023 22:06:39 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nm = list(map(int, input().split()))\nk = sum(m)\na = 0\nb = []\nfor i in range(n):\n c = m[i]\n if c == (k - c) / (n - 1):\n a += 1\n b.append(i + 1)\nprint(a)\nprint(*b)\n# Sun May 14 2023 11:00:23 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ntotal_sum = sum(a)\r\nnum_elements = len(a)\r\nsuitable_indexes = []\r\n\r\nfor i in range(num_elements):\r\n if (total_sum - a[i]) / (num_elements - 1) == a[i]:\r\n suitable_indexes.append(i+1)\r\n\r\nprint(len(suitable_indexes))\r\nprint(*suitable_indexes)\n# Tue May 02 2023 17:15:32 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nsequence = list(map(int, input().split()))\r\n\r\ntotal_sum = sum(sequence)\r\naverage = total_sum / n\r\n\r\nmatching_indexes = []\r\nfor i in range(n):\r\n if sequence[i] == average:\r\n matching_indexes.append(i+1)\r\n\r\nprint(len(matching_indexes))\r\nprint(\" \".join(map(str, matching_indexes)))\n# Tue Jul 04 2023 17:08:07 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\ns = sum(a)\nans = []\nfor i in range(n):\n if a[i] == (s - a[i]) / (n - 1):\n ans.append(i + 1)\n\nprint(len(ans))\nprint(*ans)\n# Mon May 08 2023 21:20:04 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\nsm = sum(ls)\r\narr = []\r\nfor i in range(n):\r\n if (sm - ls[i]) / (n - 1) == ls[i]:\r\n arr.append(i + 1)\r\nprint(len(arr))\r\nfor i in arr:\r\n print(i, end=\" \")", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nsm = sum(arr)\r\n\r\nlst = []\r\ncount = 0\r\n\r\nfor i in arr:\r\n count += 1\r\n if (sm-i)/(n-1) == i:\r\n lst.append(count)\r\n\r\nprint(len(lst))\r\n\r\nfor i in lst:\r\n print(i)", "kolvo = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\nsum1 = sum(a)\r\nansw = []\r\nfor i in range(kolvo):\r\n if sum1 / kolvo == a[i]:\r\n c += 1\r\n answ += [i + 1]\r\nprint(c)\r\nprint(' '.join(map(str,answ)))\n# Tue Jul 04 2023 11:57:01 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\n\r\nL=list(map(int,input().split()))\r\n\r\ns=sum(L)\r\nAns=\"\"\r\ncnt=0\r\nfor i in range(n):\r\n x=(s-L[i])//(n-1)\r\n if(x*(n-1)!=s-L[i]):\r\n continue\r\n if(x==L[i]):\r\n Ans+=str(i+1)+\" \"\r\n cnt+=1\r\nprint(cnt)\r\nif(cnt!=0):\r\n print(Ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nind = []\r\ntotal = sum(a)\r\nfor i in range(n):\r\n\tif a[i]==(total-a[i])/(n-1):\r\n\t\tcount+=1\r\n\t\tind.append(i+1)\r\n\r\nprint(count)\r\nprint(*ind)\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nq,r=sum(a),[]\r\nfor i in range(n):\r\n if (q-a[i])/(n-1)==a[i]:\r\n r.append(i+1)\r\nl=len(r)\r\nif l==0:\r\n print(0)\r\nelse:\r\n print(l,\"\\n\",*r)", "n=int(input())\r\nc=0\r\ns=0\r\nb=[]\r\nli= list(map(int,input().strip().split()))[:n]\r\ns=sum(li)\r\nfor i in range(0,len(li)):\r\n mean=(s-li[i])/(n-1)\r\n if(mean==li[i]):\r\n b.append(i+1)\r\nprint(len(b))\r\nprint(\" \".join(map(str,b)))", "n=int(input())\r\nnums=list(map(int, input().split()))\r\ns=sum(nums)\r\nindices=[]\r\nfor i in range(n):\r\n if (s - nums[i]) / (n - 1) == nums[i]:\r\n indices.append(str(i + 1))\r\nprint(len(indices))\r\nprint(' '.join(indices))\r\n\n# Sun May 14 2023 20:32:51 GMT+0300 (Moscow Standard Time)\n", "import os,sys,io,math\r\nfrom tokenize import Triple\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\nl=I()\r\nc=0\r\nr=[]\r\ns=sum(l)\r\nfor i in range(n):\r\n if (s-l[i])/(n-1)==l[i]:\r\n c+=1\r\n r.append(i+1)\r\n# for i in l:\r\n# if (s-i)/(n-1)==i:\r\n# c+=1\r\n# r.append(l.index(i)+1)\r\nprint(c)\r\nprint(*r)", "n = int(input())\na = list(map(int, input().split()))\nb = sum(a)\nc = []\nfor i in range(n):\n if a[i] == (b - a[i]) / (n - 1):\n c.append(i + 1)\nprint(len(c))\nprint(*c)\n# Tue May 02 2023 13:48:24 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nans = []\r\nfor i in range(n):\r\n if a[i] == (s - a[i]) / (n - 1):\r\n ans.append(i + 1)\r\nprint(len(ans))\r\nprint(*ans)\r\n\n# Sat May 06 2023 17:01:06 GMT+0300 (Moscow Standard Time)\n", "# coding=utf-8\r\n#问题 A: 一锐搜索均值★★\r\nn=int(input())\r\na=[int(t) for t in input().split()]\r\nave=sum(a)/n\r\nb=[]\r\nif ave!=int(ave):\r\n print(0)\r\nelse:\r\n s=0\r\n for i in range(n):\r\n if a[i]==ave:\r\n s+=1\r\n b.append(i+1)\r\n print(s)\r\n for i in range(s):\r\n print(b[i],end=' ')\r\n\t \t \t \t \t\t\t \t \t \t \t \t\t \t", "a = int(input())\r\nx = input().split()\r\nb = []\r\ns = 0\r\nn = len(x)\r\ngot = []\r\nfor i in range(n):\r\n b.append(int(x[i]))\r\n s += int(x[i])\r\nfor i in range(n):\r\n if b[i] == ((s - b[i]) / (n - 1)):\r\n got.append(i + 1)\r\nprint(len(got))\r\nfor i in range(len(got)):\r\n print(got[i], end=' ')\n# Fri May 12 2023 22:15:34 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\ns = sum(A)\r\nB = [i + 1 for i in range(len(A)) if s - A[i] == A[i] * (n - 1)]\r\nprint(len(B))\r\nprint(*B)\n# Sun May 07 2023 19:17:05 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = sum(a)\r\n\r\nans = []\r\nfor i, j in enumerate(a):\r\n if (s - j)/(n - 1) == j:\r\n ans.append(i + 1)\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "N = int(input())\r\nnums = list(map(int, input().split()))\r\nsum_ = sum(nums)\r\n\r\nans, N = [], len(nums)\r\nfor i in range(N):\r\n curr_sum = sum_ - nums[i]\r\n if curr_sum/(N-1) == nums[i]:\r\n ans.append(i+1)\r\n\r\nprint(len(ans))\r\nans = \" \".join(list(map(str, ans)))\r\nprint(ans)", "if __name__ == '__main__':\r\n cin = input\r\n n = int(cin())\r\n a = [int(i) for i in input().split()]\r\n s = sum(a)\r\n b = [str(i + 1) for i in range(n) if a[i] * (n - 1) == s - a[i]]\r\n print(len(b))\r\n print(\" \".join(b))", "n=int(input())\r\na=list(map(int,input().split()))\r\nu=sum(a)\r\nif u%n!=0:\r\n print(0)\r\nelse:\r\n res=[]\r\n u//=n\r\n for i in range(n):\r\n if a[i]==u:\r\n res.append(i+1)\r\n print(len(res))\r\n print(*res)\r\n \r\n \r\n ", "n = int(input())\nnums = [int(i) for i in input().split()]\n\nss = sum(nums)\nidxs = []\nfor i in range(n):\n if abs(nums[i] - (ss - nums[i]) / (n -1)) < 1e-9:\n idxs.append(i + 1)\n\nprint(len(idxs))\nfor i in idxs:\n print(i, end = ' ')\nprint()\n\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\nb = []\r\ns = 0\r\nfor i in a:\r\n s += i\r\nfor i in range(n):\r\n if a[i] == ((s - a[i]) / (n - 1)):\r\n b.append(i + 1)\r\nprint(len(b))\r\nprint(*b, sep=\" \")\r\n\r\n", "a = int(input())\nc =0\nb = list(map(int, input().split()))\nd = []\ng = sum(b)\nfor i in range(a):\n if b[i] == (g-b[i])/(a-1):\n d.append(str(i+1))\nprint(len(d))\nprint(\" \".join(d))\n# Tue Jul 04 2023 12:01:11 GMT+0300 (Moscow Standard Time)\n", "n=int(input());a=list(map(int,input().split()))\r\nq,r=sum(a),[]\r\nr=[i+1 for i in range(n) if a[i]*n==q]\r\nl=len(r)\r\nprint(0 if l==0 else l,\"\\n\",*r)\r\n", "n = int(input())\nsequence = list(map(int, input().split()))\n\nsum = sum(sequence)\nindices = []\n\nfor i in range(n):\n if sequence[i] * (n - 1) == sum - sequence[i]:\n indices.append(i + 1)\n\nprint(len(indices))\nprint(' '.join(map(str, indices)))\n# Tue Jul 04 2023 11:46:43 GMT+0300 (Moscow Standard Time)\n", "numElems = int(input())\nelems = [int(x) for x in input().split()]\nsumElems = sum(elems)\n\noutput = []\n\ni = 1\nfor elem in elems:\n if (sumElems - elem)/(numElems - 1) == elem:\n output.append(i)\n i += 1\n\nprint(len(output))\nfor i in range(len(output)):\n if i >= len(output) - 1:\n print(output[i], end=\"\")\n else:\n print(output[i], end=\" \")\n\t \t \t\t \t \t\t\t\t \t\t\t\t\t \t\t \t", "n = int(input())\na = list(map(int,input().split()))\nk = sum(a)\nres = 0\ns = ''\nfor i in range(n):\n if k - a[i] == a[i] * (n - 1):\n res += 1\n s += str(i + 1) + ' '\nprint(res)\nprint(s)\n# Thu May 11 2023 23:17:42 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\nsumi=sum(v)\r\na=[]\r\nfor i in range(n):\r\n if v[i]==(sumi-v[i])/(n-1):\r\n a.append(i+1)\r\nprint(len(a))\r\nprint(*a)", "n=int(input())\r\na=list(map(int,input().split()))\r\nv=sum(a)\r\nans=0\r\nb=[]\r\nfor i in range(n):\r\n if(v-a[i])/(n-1)==a[i]:\r\n ans+=1\r\n b.append(i+1)\r\nprint(ans)\r\nprint(*b)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\naverage = 0\r\nfor i in nums:\r\n average+=i\r\nans=[]\r\nfor i in range(n):\r\n if(nums[i]==(average-nums[i])/(n-1)):\r\n ans.append(i+1)\r\nprint(len(ans))\r\nprint(*ans)\r\n\n# Sun May 14 2023 13:33:48 GMT+0300 (Moscow Standard Time)\n", "#!/usr/bin/env python3\n\nn = int(input())\narr = [int(i) for i in input().split(' ')]\ns = 0\nresult = []\n\nfor item in arr:\n s += item\n\ns = s/n\n\ncount = 0\npos = 1\nfor item in arr:\n if item == s:\n count += 1\n result.append(str(pos))\n pos += 1\n\nprint(count)\nprint(' '.join(result))\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nindex=[]\r\nd=sum(lis)\r\nc=len(lis)\r\nfor i in range(n):\r\n e=d-lis[i]\r\n f=c-1\r\n if e==lis[i]*f:\r\n index.append(i+1)\r\nif len(index)>0:\r\n print(len(index))\r\n print(*index)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nav = sum(a)/n\r\nans = []\r\nfor i, j in enumerate(a):\r\n\tif av == j:\r\n\t\tans.append(i+1)\r\nprint (len(ans))\r\nprint (*ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 1 12:07:04 2022\r\n\r\n@author: gupta\r\n\"\"\"\r\n\r\n#Average\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nr=sum(t)/len(t)\r\nc=t.count(r)\r\nprint(c)\r\nif c>0:\r\n for i in range(len(t)):\r\n if t[i]==r:\r\n print(i+1,end=' ')\r\n\r\n", "eps = 10**-7\ndef eq(n1,n2):\n return abs(n1-n2) < eps\nc = 0\nll = []\nn = int(input())-1\nl = list(map(int,input().split()))\ns = sum(l)\nfor i in range(n+1):\n if eq((s-l[i])/n,l[i]):\n c += 1\n ll.append(i+1)\nprint(c)\nif c != 0:\n print(*ll)\n# Tue Jul 04 2023 11:11:18 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nsm=sum(ar)\r\nif(sm//n*n!=sm):\r\n print(0)\r\nelse:\r\n vl=sm//n\r\n print(ar.count(vl))\r\n print(*[x+1 for x in range(n) if ar[x]==vl])", "a=int(input())\nl=list(map(int,input().split()))\nq=[]\nq1=0\nx=sum(l)\nfor i in range(a):\n s=(x-l[i])/(a-1)\n if s==l[i]:\n q.append(i+1)\n q1+=1\nprint(q1)\nprint(*q)\n\n# Tue Jul 04 2023 12:37:24 GMT+0300 (Moscow Standard Time)\n", "i=int(input())-1\r\nl=list(map(int,input().split()))\r\nt=sum(l);c=[]\r\nfor x in range(i+1):\r\n if (t-l[x])/i==l[x]:c.append(x+1)\r\nprint(len(c))\r\nprint(*c)", "n=int(input())\r\na=list(map(int,input().split()))\r\ng=a.copy()\r\ng.sort()\r\nif len(set(a))==1:\r\n print(n)\r\n for i in range(n):\r\n print(i+1,end=' ')\r\nelse:\r\n j=sum(a)/n\r\n p=0\r\n k=[]\r\n for i in range(n):\r\n if a[i]==j:\r\n p+=1\r\n k.append(i+1)\r\n print(p)\r\n print(*k)\n# Wed May 10 2023 17:12:21 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\n\r\ntotal_sum = sum(mas)\r\ntarget_value = total_sum / (n - 1)\r\n\r\nans = [i+1 for i in range(n) if mas[i] * (n-1) == total_sum - mas[i]]\r\nif len(ans) == 0:\r\n print(0)\r\n exit()\r\nprint(len(ans))\r\nprint(*ans)\r\n\n# Fri May 05 2023 19:56:05 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\nt = sum(a)\ntemp = [i + 1 for i in range(n) if t == a[i] * n]\nprint(len(temp))\nprint(' '.join(map(str, temp)))\n", "n = int(input())\na = list(map(int, input().split()))\ns = sum(a)\nb = []\nfor i in range(n):\n if a[i] * n == s:\n b.append(str(i + 1))\nprint(len(b))\nprint(' '.join(b))\n# Thu May 04 2023 20:50:34 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nsum_val = sum(v)\r\nindi = []\r\n\r\nfor i in range(n):\r\n if v[i] == (sum_val - v[i]) / (n - 1):\r\n indi.append(i + 1)\r\n\r\nprint(len(indi))\r\nprint(*indi)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ns = sum(arr)\r\nans = [i+1 for i in range(n) if arr[i] == (s-arr[i])/(n-1)]\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\narr = list(map(int, input().strip().split()))\ntotal = sum(arr)\nanswers = []\nfor i, number in enumerate(arr):\n if (total - number) / (n - 1) == number:\n answers.append(i + 1)\nprint(len(answers))\nprint(*answers)\n", "n = int(input())\r\nA = [int(i) for i in input().split(\" \")]\r\n\r\nres = 0\r\nans = []\r\n\r\navg = sum(A)/n\r\n\r\nfor i in range(n):\r\n if A[i] == avg:\r\n res += 1\r\n ans.append(i+1)\r\nprint(res)\r\nprint(*ans)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nsu = sum(s)\r\ng = 0\r\nh = []\r\nfor i in range(n):\r\n if (su - s[i]) / (n - 1) == s[i]:\r\n g += 1\r\n h.append(i + 1)\r\n \r\nprint(g)\r\nprint(*h)\n# Sun May 14 2023 14:36:12 GMT+0300 (Moscow Standard Time)\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n arr = [int(i) for i in input().split()]\r\n val = sum(arr)\r\n ans = []\r\n for i in range(n):\r\n if arr[i] == ((val - arr[i]) / (n-1)):\r\n ans.append(i+1)\r\n print(len(ans))\r\n print(*ans)", "n = int(input())\r\nnum = list(map(int, input().split()))\r\ncount = []\r\nsm = sum(num)\r\n#print(sm)\r\nfor i in range(n):\r\n if (sm-num[i])/(n-1) == num[i]: count.append(i+1)\r\nprint(len(count))\r\nfor i in range(len(count)):\r\n print(count[i], end=\" \")", "n = int(input())\r\n\r\nvalue = list(map(int, input().split()))\r\n\r\nmean = sum(value) / len(value)\r\n\r\nres = []\r\nnum_means = 0\r\nfor num in range(len(value)):\r\n if value[num] == mean:\r\n num_means += 1\r\n res.append(num + 1)\r\n\r\nprint(num_means)\r\nprint(*res)", "n = int(input())\na = list(map(int, input().split()))\n\ntotal_sum = sum(a)\nans = 0\nans_i = []\n\nfor i in range(n):\n mean_without_i = (total_sum - a[i]) / (n - 1)\n if a[i] == mean_without_i:\n ans += 1\n ans_i.append(str(i + 1))\n\nprint(ans)\nprint(' '.join(ans_i))\n\n# Mon May 08 2023 11:00:47 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\nres = []\nsu = sum(a)\ns = 0\nfor i in range(n):\n if (su - a[i]) / (n - 1) == a[i] and (su - a[i]) % (n - 1) == 0:\n res.append(i + 1)\n s += 1\nprint(s)\nprint(*res)\n# Sat May 13 2023 17:37:33 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nl = list(map(int,input().split()))\nl2 = []\nss = sum(l)\nfor i in range(n):\n if l[i] == (ss-l[i])/(n-1):\n l2.append(i+1)\nprint(len(l2))\nprint(*l2)\n# Thu May 04 2023 14:44:39 GMT+0300 (Moscow Standard Time)\n", "t = int(input())\r\np = list(map(int, input().split()))\r\nind = []\r\nts = sum(p)\r\nc = 0\r\nfor i in range(t):\r\n if p[i] * (t-1) == ts - p[i]:\r\n ind.append(i+1)\r\n c += 1\r\nprint(c)\r\nif c > 0:\r\n print(\" \".join(map(str,ind)))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = sum(a)\r\nc = 0\r\nk = []\r\nfor i in range(len(a)):\r\n if a[i] == (s - a[i]) / (n-1):\r\n k += [i+1]\r\n c += 1\r\nprint(c)\r\nprint(' '.join(map(str,k))) \n# Thu May 04 2023 21:18:44 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\ns = sum(a)\nb = []\nfor i in range(n):\n if s == a[i] * n:\n b.append(i + 1)\nprint(len(b))\nprint(' '.join([str(i) for i in b]))\n# Thu May 04 2023 16:48:12 GMT+0300 (Moscow Standard Time)\n", "a = int(input())\r\nl = list(map(int, input().rstrip().split(\" \")))\r\ns = sum(l)\r\nc = 0\r\nli = []\r\nfor i in range(a):\r\n if (s - l[i])/(a-1) == l[i]:\r\n li.append(i+1)\r\n c+=1\r\nif not c:\r\n print(0)\r\nelse:\r\n print(c)\r\n print(*li)", "a=int(input())\r\ns=list(map(int,input().split()))\r\nz=sum(s)\r\nd=0\r\nf=[]\r\nfor i in range(a):\r\n if s[i]==(z-s[i])/(a-1):\r\n d+=1\r\n f.append(i+1)\r\nprint(d)\r\nprint(*f)\n# Tue May 02 2023 18:35:22 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nlist_1=list(map(int,input().split()))\r\ni=0\r\nsum=0\r\nwhile i<n:\r\n sum+=list_1[i]\r\n i+=1\r\ni=0\r\ncnt=0\r\nlist_2=[]\r\nwhile i<n:\r\n if list_1[i]==((sum-list_1[i])/(n-1)):\r\n cnt+=1\r\n list_2.append(i+1)\r\n i+=1\r\nprint(cnt) \r\nprint(*list_2) ", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\ns=s/n\r\nif s%1!=0:\r\n\tprint(\"0\")\r\n\texit()\r\nelse:\r\n\tl=[]\r\n\tg=0\r\n\tfor i in range(n):\r\n\t\tif a[i]==s:\r\n\t\t\tg=g+1\r\n\t\t\tl.append(i+1)\r\n\tprint(g)\r\n\tfor i in range(g):\r\n\t\tprint(l[i],end=\" \")\t\t\r\n", "n=int(input())\r\nb=list(map(int, input().split()))\r\nc=sum(b)/n\r\nprint(b.count(c))\r\nfor i in range(n): \r\n if b[i]==c:\r\n print(i+1, end=' ')\n# Sun May 14 2023 22:06:37 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nans=[]\r\ns=sum(a)\r\nfor i in range(n):\r\n if (s-a[i])%(n-1)==0:\r\n if ((s-a[i])//(n-1))==a[i]:ans.append(i+1)\r\nif len(ans)==0:print(0)\r\nelse:\r\n print(len(ans))\r\n print(*ans)", "n=int(input())\ns=list(map(int,input().split()))\ny=sum(s)\nth=0\na=[]\nfor i in range(0,n):\n if (y-s[i])//(n-1)==s[i] and (y-s[i])%(n-1)==0:\n th+=1\n a.append(i+1)\nprint(th)\nif th!=0:\n print(' '.join(map(str,a)))\n# Fri May 05 2023 21:57:01 GMT+0300 (Moscow Standard Time)\n", "def SrMath(Arr):\n s = 0\n for i in range(len(Arr)):\n s += Arr[i]\n f = s / len(Arr)\n return f\n \nn = int(input())\nN = list(map(int, input().split()))\nIndex = []\nHow = 0\nSr = SrMath(N)\n\nfor i in range(n):\n if(Sr == N[i]):\n How += 1\n Index.append(i+1)\n \nprint(How)\nfor i in range(len(Index)):\n print(Index[i], end=\" \")\n# Sat May 06 2023 13:40:15 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\ns = sum(a)\nv = [str(i + 1) for i, ai in enumerate(a) if (n - 1) * ai == s - ai]\nprint(len(v))\nprint(' '.join(v))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nsred = sum(a)/n\r\ns = \"\"\r\nfor i in range(n):\r\n if a[i]==sred:\r\n s += str(i+1) +\" \"\r\nprint(len(s.split()))\r\nprint(s)\n# Wed May 03 2023 21:57:41 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nsm=sum(l)\r\nans=[]\r\nfor i in range(n):\r\n if l[i]==(sm-l[i])/(n-1):\r\n ans.append(i+1)\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\narr = [int(i) for i in input().split()]\ns = sum(arr)\nres = []\nfor i in range(len(arr)):\n if arr[i] == (s - arr[i]) / (len(arr) - 1):\n res.append(str(i + 1))\n\nprint(len(res))\nprint(\" \".join(res))\n# Mon May 08 2023 04:17:48 GMT+0300 (Moscow Standard Time)\n", "import sys\r\nimport math\r\n\r\n\r\n# 9, 1 -> 8, 2 -> 6, 1 -> 5, 1 -> 4, 1\r\ndef main():\r\n # fin_t = lambda r, l, t: (r - l + 1) * t\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n total = sum(a)\r\n result = []\r\n for i in range(n):\r\n if a[i] == (total - a[i]) / (n - 1):\r\n result.append(i + 1)\r\n print(len(result))\r\n for i in result:\r\n print(i, end=\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nA = list(map(int, input().split()))\ns = sum(A)\nB = []\nfor i in range(n):\n\tif (s - A[i]) / (n-1) == A[i]:\n\t\tB.append(i+1)\nprint(len(B))\nprint(*B)\n# Sun May 07 2023 19:53:54 GMT+0300 (Moscow Standard Time)\n", "a = int(input())\nlst = input().split()\nfor i in range(a):\n lst[i] = int(lst[i])\ns = sum(lst)\nl = []\nfor i in range(a):\n if (s - lst[i]) / (a-1) == lst[i]:\n l.append(i+1)\nprint(len(l))\nprint(*l)\n# Sun May 14 2023 15:31:36 GMT+0300 (Moscow Standard Time)\n", "N = int(input())\r\nar = [int(x) for x in input().split()]\r\nans = []\r\ns = sum(ar)\r\nfor i, j in enumerate(ar):\r\n if j * N == s:\r\n ans.append(str(i + 1))\r\n\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n", "# Java has issues with this simple solution!\r\nn=int(input())\r\na=[int(c) for c in input().split()]\r\ntot=sum(a)\r\nb=[i+1 for i,c in enumerate(a) if c*n==tot]\r\nprint(len(b))\r\nprint(*b)\r\n", "import math\r\n#x,y,a,b = map(int, input().strip().split(' '))\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=sum(lst)\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n if lst[i]==(s-lst[i])/(n-1):\r\n c+=1\r\n l.append(i+1)\r\nif c==0:\r\n print(0)\r\nelse:\r\n print(c)\r\n for j in range(len(l)):\r\n print(l[j],end=\" \")\r\n \r\n \r\n ", "n=int(input())\r\nx=input()\r\na=x.split()\r\nsum=0\r\nfor it in a:\r\n sum+=int(it)\r\navg=sum/n\r\ni=0\r\nres=[]\r\ncount=0\r\nwhile i<n:\r\n if avg==int(a[i]):\r\n res.append(i+1)\r\n count+=1\r\n i+=1\r\nif count==0: print(count)\r\nelse:\r\n print(count)\r\n for it in res:\r\n print(it, end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nt = (sum(a))\ntemp = []\nfor i in range(n):\n\tif t == a[i] * n:\n\t\ttemp += [i + 1]\nprint(len(temp))\nprint(' '.join(map(str, temp)))\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nt=0\r\nfor i in a:\r\n t+=i\r\nar=[]\r\n\r\nfor i in range(n):\r\n if (t-a[i])/(n-1)==a[i]:\r\n ar.append(i+1)\r\nprint(len(ar))\r\nif len(ar)!=0:\r\n for i in ar:\r\n print(i, end=' ')\r\n \n# Tue May 09 2023 13:40:52 GMT+0300 (Moscow Standard Time)\n", "import string\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(u) for u in input().split(\" \")]\r\n sum_of_a = sum(a)\r\n divider = n - 1\r\n collector = []\r\n for i in range(len(a)):\r\n if ((sum_of_a - a[i]) / divider) == ((sum_of_a - a[i]) // divider):\r\n x = ((sum_of_a - a[i]) // divider)\r\n if x == a[i]:\r\n collector.append(i + 1)\r\n print(len(collector))\r\n print(\" \".join([str(h) for h in collector]))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "input()\r\nl = list(map(int,input().split()))\r\nx = []\r\ns = sum(l)\r\ny = len(l)-1\r\nfor i,e in enumerate(l,start=1):\r\n if e == (s-e)/y:\r\n x.append(i)\r\nprint(len(x))\r\nprint(*x)", "n = int(input())\r\nl = input().split()\r\nsumm = 0\r\ncount = 0\r\nindexes = []\r\nfor i in range(len(l)):\r\n summ += int(l[i])\r\n l[i] = int(l[i])\r\nfor i in range(len(l)):\r\n if l[i] == (summ - l[i]) / (n - 1):\r\n count += 1\r\n indexes.append(i)\r\nprint(count)\r\ns = ''\r\nfor x in indexes:\r\n s += str(x + 1) + ' '\r\nprint(s[:-1])\r\n\n# Thu May 11 2023 10:10:14 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns,n,c,ans=sum(a),len(a),0,[]\r\nfor i,v in enumerate(a):\r\n if float(v)==(s-v)/(n-1):\r\n c+=1\r\n ans.append(i+1)\r\nprint(c)\r\nprint(*ans)\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\ns = sum(b)\r\nans = []\r\nif a == 1:\r\n exit(0)\r\nfor i in range(0, a):\r\n if b[i] == (s - b[i]) / (a - 1):\r\n ans.append(i + 1)\r\nprint(len(ans))\r\nprint(*ans)\r\n\n# Sun May 07 2023 11:07:48 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\n\ntotal_sum = sum(a)\nindexes = []\n\nfor i in range(n):\n if a[i] == (total_sum - a[i]) / (n - 1):\n indexes.append(i + 1)\n\nprint(len(indexes))\nprint(\" \".join(map(str, indexes)))\n# Tue Jul 04 2023 11:39:57 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=len(b)\r\nd=sum(b)\r\ne=0\r\nf=[]\r\nfor i in range(0,c):\r\n if (d-b[i])/(c-1)==b[i]:\r\n e+=1\r\n f.append(i+1)\r\nprint(e)\r\nprint(*f)\r\n\n# Sun May 14 2023 16:35:13 GMT+0300 (Moscow Standard Time)\n", "# coding=utf-8\r\nn = int(input())\r\nli = list(map(int,input().split()))\r\nave = sum(li)/n\r\nl2 = []\r\nif ave!=int(ave):\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n if li[i] == ave:\r\n l2.append(i+1)\r\n print(len(l2))\r\n print(*l2)\r\n\r\n\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\nb=[]\r\nc=sum(a)\r\nfor i in range(n):\r\n if a[i]==(c-a[i])/(n-1):\r\n b.append(i+1)\r\nprint(len(b))\r\nprint(*b)", "kol = int(input())\r\nchis = list(map(int, input().split()))\r\nc = 1\r\nsumma = sum(chis)\r\nans = []\r\nfor i in range(kol):\r\n if summa / kol == chis[i]:\r\n c += 1\r\n ans += [i + 1]\r\nprint(len(ans))\r\nprint(*ans)\n# Tue Jul 04 2023 12:32:08 GMT+0300 (Moscow Standard Time)\n", "import sys\r\ninput = lambda :sys.stdin.readline().rstrip()\r\n# for _ in range(int(input())):\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nc=0\r\nl1=[]\r\nfor i in range(n):\r\n if((s-l[i])/(n-1)==l[i]):\r\n c+=1\r\n l1.append(i+1)\r\nprint(c)\r\nprint(*l1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\navg=sum(l)/n\r\nl2=[]\r\nfor ind,i in enumerate(l):\r\n if avg==(i*(n-1)+i)/n:\r\n l2.append(ind+1)\r\nprint(len(l2))\r\nprint(*l2)", "n=int(input())\r\nar = list(map(int,input().split()))\r\nsm = sum(ar)\r\n\r\nif sm//n*n != sm:\r\n print(0)\r\n\r\nelse:\r\n vl = sm // n\r\n print(ar.count(vl))\r\n print(*[i+1 for i in range(n) if ar[i]==vl])\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\ns = sum(arr)\r\nret = []\r\nfor i in range(n):\r\n\t#print(s-arr[i], arr[i],n-1)\r\n\tif (s - arr[i])/(n-1) == arr[i]:\r\n\t\tret.append(i+1)\r\nprint(len(ret))\r\nif ret:\r\n\tfor m in ret:\r\n\t\tprint(m,end=' ')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nx = sum(w)\r\nd = []\r\nfor i in range(n):\r\n if (x - w[i])/(n-1) == w[i]:\r\n d.append(i+1)\r\n\r\nprint(len(d))\r\nprint(' '.join(map(str, d)))", "n=int(input());a=list(map(int,input().split()))\r\nq,r=sum(a),[]\r\nr=[str(i+1) for i in range(n) if a[i]*n==q]\r\nprint(len(r),\"\\n\",\" \".join(r))\r\n", "n = int(input())\na = list(map(int, input().split()))\nq = sum(a)\nres = []\nfor i in range(n):\n if (q - a[i]) / (n - 1) == a[i]:\n res.append(i + 1)\nprint(len(res))\nprint(*res)\n# Wed May 03 2023 21:04:05 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nA=list(map(int,input().strip().split()))\r\nsumj=sum(A)\r\nB=[]\r\nC=[]\r\nj=0\r\nfor i in A:\r\n if i==(sumj-i)/(len(A)-1):\r\n C.append(j+1)\r\n j+=1\r\n else:\r\n j+=1\r\n continue\r\nprint(len(C))\r\nfor i in C:\r\n print(i,end=\" \")", "# coding=utf-8\r\nn=int(input())\r\nla=list(map(int,input().split()))\r\nave=sum(la)/n\r\nwz=[]\r\nif(ave!=int(ave)): #如果不能整除，肯定不存在，输出0\r\n print(0)\r\nelse:\r\n s=0\r\n for i in range(0,n):\r\n if la[i]==ave:\r\n wz.append(i+1)\r\n s+=1 #s为计数器 \r\n print(s)\r\n for j in wz:\r\n print(j,end=' ')\r\n \t \t\t \t\t \t \t\t\t \t", "a=int(input())\nq=list(map(int,input().split()))\nb=sum(q)\nl=[]\nfor i in range(a):\n if q[i]==(b-q[i])/(a-1):\n l.append(i+1)\nprint(len(l))\nprint(*l)\n# Tue May 09 2023 13:18:00 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = list(map(int, input().split()))\n\nsum_a = sum(a)\nindices = []\nfor i in range(n):\n if (sum_a - a[i]) == a[i] * (n - 1):\n indices.append(i + 1)\n\nprint(len(indices))\nprint(*indices)\n\n# Wed May 03 2023 22:16:56 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = sum(l)\r\nsl = [s - l[i] for i in range(n)]\r\nans = ''\r\nfor i in range(1, n + 1):\r\n if float(l[i - 1]) == sl[i - 1] / (n - 1):\r\n ans += str(i) + ' '\r\nprint(f\"{len(ans.split())}\\n{ans.strip()}\")\n# Mon May 08 2023 01:32:43 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\r\nb=list(map(int, input().split()))\r\nx=[]\r\ncount=0\r\nsum=0\r\nfor i in range(a):\r\n sum+=b[i]\r\nfor v in range(a):\r\n if b[v]==(sum - b[v])/(len(b)-1):\r\n count+=1\r\n x.append(v+1)\r\nprint(count)\r\nprint(*x)\n# Mon May 01 2023 16:18:50 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nv=list(map(int,input().split(' ')))\r\ns=sum(v)\r\ninds=list()\r\nfor c,it in enumerate(v):\r\n if((s-it)/(n-1)==it):\r\n inds.append(c)\r\nprint(len(inds))\r\n\r\nfor c in inds:\r\n print(c+1,end=' ')\r\n", "import sys\r\nimport math\r\n\r\nn = int(input())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvsum = sum(an)\r\nres = []\r\nc = 0\r\nfor i in range(n):\r\n if((vsum - an[i]) / (n - 1) == an[i]):\r\n res.append(str(i + 1))\r\n c += 1\r\n\r\nprint(c)\r\nprint(\" \".join(res))", "n = int(input())\na = list(map(int, input().split()))\nc = 0\nfor i in range(n):\n c += a[i]\nc /= n \nb = 0 \nfor i in range(n):\n if a[i] == c:\n b += 1 \nprint(b) \nfor i in range(n):\n if a[i] == c:\n print(i + 1, end=\" \")\n# Sat May 13 2023 21:31:07 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\na = [ int(x) for x in input().split()[:n] ]\nsar = sum(a)\n\nif sar % n == 0:\n\tsar = sar // n\n\ttot = a.count(sar)\n\tprint(tot)\n\tif tot > 0:\n\t\tidx = [ i+1 for i in range(n) if a[i] == sar ]\n\t\tprint(*idx)\nelse:\n\tprint(0)\n\n# Sun May 14 2023 21:40:26 GMT+0300 (Moscow Standard Time)\n", "a = int(input())\r\nc = [float(i) for i in input().split()]\r\nd = sum(c)\r\nr = d / a\r\nd = []\r\nm = 0\r\nif r in c:\r\n for i in range(a):\r\n if r == c[i]:\r\n d.append(i+1)\r\n m += 1\r\n print(m)\r\n print(*d)\r\nelse:\r\n print(0)\n# Tue May 02 2023 14:23:54 GMT+0300 (Moscow Standard Time)\n", "import math\nn = int(input())\narr = list(map(int,input().split()))\nvrr=[]\nms = int(sum(arr))\n\nfor i in range(len(arr)):\n ans=((ms-arr[i])/(n-1))\n \n \n if arr[i]==((ms-arr[i])/(n-1)):\n vrr.append(i+1)\n \n \nif len(vrr)>0:\n \n print(len(vrr))\n print(*vrr)\nelse:\n print(0)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nres=[]\r\nfor i in range(n):\r\n if (s-a[i])%(n-1)==0:\r\n if a[i]==((s-a[i])//(n-1)):\r\n res.append(i+1)\r\nif res:\r\n print(len(res))\r\n print(*res)\r\nelse:\r\n print(0)" ]

[ "import sys\ninput = sys.stdin.buffer.readline\ndef ints():\n return map(int, input().split())\n\nn, k=ints()\n\nif k > (n-1)*n//2:\n print(\"Impossible\")\n exit(0)\n\nsum=0\nans=''\nfor i in range(n+1):\n if sum+i>k:\n ans+='('*(i)\n ans+=')'*(i-(k-sum))\n if i!=n:\n ans+='('\n ans+=')'*(k-sum+1)\n ans+='()'*(n-i-1)\n else:\n ans+=')'*(k-sum)\n break\n sum+=i\n\nprint(ans)\n", "n,k = map(int, input().split())\r\n\r\ndef f(a):\r\n return a*(a-1)/2\r\n\r\ndef t(a):\r\n return k>a\r\n\r\nmax = int(n*(n-1)/2)\r\n\r\nif k>max:\r\n print('Impossible')\r\nelif k==0:\r\n print('()'*n)\r\nelse:\r\n sums = list(map(f, range(n+1)))\r\n argmax = sum(map(t, sums))\r\n free_p = n-argmax\r\n nested_p = n-free_p-1\r\n last_p = int(k-sums[argmax-1])\r\n base_output = nested_p*'(' + nested_p*')' + free_p*'()'\r\n print(base_output[:last_p] + '()' + base_output[last_p:])", "n, k = map(int, input().split())\r\n\r\nk_now, level, n_now = 0, 0, 0\r\nans = str()\r\n\r\nif k > n * (n - 1) / 2:\r\n print('Impossible')\r\nelse:\r\n while n_now < 2 * n:\r\n if k_now + level <= k:\r\n ans += '('\r\n k_now += level\r\n level += 1\r\n else:\r\n ans += ')'\r\n level -= 1\r\n n_now += 1\r\n print(ans)", "n, k = map(int, input().split())\r\n\r\nk_now, level, n_now = 0, 0, 0\r\nans = list()\r\n\r\nif k > n * (n - 1) / 2:\r\n print('Impossible')\r\nelse:\r\n while n_now < 2 * n:\r\n if k_now + level <= k:\r\n ans.append('(')\r\n k_now += level\r\n level += 1\r\n else:\r\n ans.append(')')\r\n level -= 1\r\n n_now += 1\r\n print(*ans, sep='')", "from sys import exit\r\nfrom math import sqrt\r\n\r\nn, k = map(int, input().split())\r\n\r\nif n * (n - 1) // 2 < k:\r\n print('Impossible')\r\nelse:\r\n h = int((1 + sqrt(8 * k + 1)) / 2)\r\n c = n\r\n for _ in range(h):\r\n print('(', end='')\r\n c -= h\r\n k -= h * (h - 1) // 2\r\n while h != 0:\r\n m = k // h\r\n for _ in range(m):\r\n print('()', end='')\r\n c -= m\r\n k -= h * m\r\n h -= 1\r\n print(')', end='')\r\n while c > 0:\r\n print('()', end='')\r\n c -= 1\r\n ", "from sys import stdin\r\n\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nn, k = map(int, stdin.readline().split())\r\nsu, ans = sum_n(n - 1), ['(']\r\nif su < k:\r\n print('Impossible')\r\n exit()\r\n\r\ncur, plus = 1, 1\r\nwhile cur <= k:\r\n ans.append('(')\r\n plus += 1\r\n cur += plus\r\n\r\nrem = k - (cur - plus)\r\nplus -= 1\r\n\r\nfor i in range(plus, -1, -1):\r\n ans.append(')')\r\n if i == rem and rem:\r\n ans.extend(['(',')'])\r\n rem = 0\r\n\r\nprint(''.join(ans + ['()'] * (n - len(ans) // 2)))\r\n", "n, k = map(int, input().split())\r\ns = int((1 + 8 * k) ** 0.5) + 1 >> 1\r\nk -= s * s - s >> 1\r\nn -= s\r\nif n < bool(k):\r\n print('Impossible')\r\n exit()\r\nt = '(' * s + ')' * s\r\nif k:\r\n t = t[:k] + '()' + t[k:]\r\n n -= 1\r\nprint(t + '()' * n)", "n,m = map(int, input().split())\r\n\r\nif m > n*(n - 1)//2:\r\n print('Impossible')\r\nelse:\r\n ans = []\r\n cur = 0\r\n acc = 0\r\n for i in range(n):\r\n while cur + acc > m:\r\n ans.append(')')\r\n acc -= 1\r\n ans.append('(')\r\n cur += acc\r\n acc += 1\r\n left_cnt = 0\r\n for i in ans:\r\n if i == '(':\r\n left_cnt += 1\r\n else:\r\n left_cnt -= 1\r\n for i in range(left_cnt):\r\n ans.append(')')\r\n print(''.join(ans))\r\n", "import math\nn, k = map(int, input().split())\nif (n-1) * n // 2 < k:\n print(\"Impossible\")\nelse:\n necessary_n = math.ceil((1 + (math.sqrt(1 + 8*k))) / 2) #Equation: n^2 - n - 2k = 0\n residual_value = (necessary_n-1) * necessary_n // 2 - k\n print(\"()\"*(n-necessary_n) + '('*(necessary_n-1) + ')'*residual_value + '()' + ')'*(necessary_n-1 - residual_value))\n\n\"\"\"\n3\n()()() 0\n(())() 1\n(()()) 2\n((())) 6\n\"\"\"\n \t \t \t\t\t \t \t\t\t\t \t \t\t \t\t \t" ]

[ "s=str(input())\r\nn=len(s)\r\nlstl=[]\r\nlstr=[]\r\nfor i in range(0,n):\r\n if(s[i]=='l'):\r\n lstl.append(i+1)\r\n else:\r\n lstr.append(i+1)\r\n\r\nlstl.reverse()\r\nfor i in lstr:\r\n print(i)\r\nfor i in lstl:\r\n print(i)\r\n", "def main():\n line = input()\n l = [None] * len(line)\n ptr1 = 0\n ptr2 = len(line)-1\n counter = 0\n for c in line:\n counter += 1\n if c == 'l':\n l[ptr2] = counter\n ptr2 -= 1\n else:\n l[ptr1] = counter\n ptr1 += 1\n for n in l:\n print(n)\n\nif __name__ == \"__main__\":\n main()\n \t\t\t \t \t \t\t \t \t \t\t \t\t", "s = input()\nl, r = [], []\nfor i in range(len(s)):\n if s[i] == 'l':\n l.append(i+1)\n else:\n r.append(i+1)\n\nfor n in r:\n print(n)\n\nfor i in range(len(l)-1,-1,-1):\n print(l[i])\n\t\t \t\t\t \t\t\t \t \t \t\t \t\t \t \t", "s = input()\nfor a in range(len(s)):\n if s[a] == 'r':\n print(a +1)\n\nfor a in range(len(s), 0 , -1):\n # print(a)\n if s[a - 1] == 'l':\n print(a)\n \t \t \t \t\t \t \t\t \t \t \t", "s = input()\nn = len(s)\nll = []\nrl = [] \nfor i in range(n):\n\tif(s[i] == 'r'):\n\t\trl.append(i)\n\telse:\n\t\tll.append(i)\nfor i in range(len(rl)):\n\tprint(rl[i]+1)\nn = len(ll)\nfor i in range(len(ll)):\n\tprint(ll[n-1-i]+1)", "s = input()\r\nans = [0] * len(s)\r\nleft = 0\r\nright = len(s) - 1\r\nfor i in range(len(s)):\r\n if s[i] == 'r':\r\n ans[left] = i+1\r\n left += 1\r\n else:\r\n ans[right] = i+1\r\n right -= 1\r\nprint(*list(ans))", "moves = input()\r\n\r\nleft, right = [], []\r\nfor i, c in enumerate(moves):\r\n if c == 'l':\r\n right.append(i+1)\r\n else:\r\n left.append(i+1)\r\n\r\nfor n in left:\r\n print(n)\r\nright.reverse()\r\nfor n in right:\r\n print(n)", "s = input()\r\nl, r = 0, len(s) - 1\r\n\r\na = [None] * len(s)\r\nfor i, c in enumerate(s, 1):\r\n if c == 'l':\r\n a[r] = i\r\n r -= 1\r\n else:\r\n a[l] = i\r\n l += 1\r\n\r\nprint(*a, sep='\\n')\r\n", "n=input()\r\nl=len(n)\r\nans=[0]*l \r\nleft=0 \r\nright=l-1 \r\ni=1 \r\nfor i in range(l):\r\n if n[i]=='l':\r\n ans[right]=i+1\r\n right-=1 \r\n else:\r\n ans[left]=i+1 \r\n left+=1 \r\n \r\nfor i in ans:\r\n print(i)\r\n ", "s = input()\r\nl = [0] * len(s)\r\na = 0\r\nb = len(s) - 1\r\nfor i in range(len(s)):\r\n\tif s[i] == 'l':\r\n\t\tl[b] = str(i + 1)\r\n\t\tb -= 1\r\n\telse:\r\n\t\tl[a] = str(i + 1)\r\n\t\ta += 1\r\nprint('\\n'.join(l))", "from sys import stdin,stdout\r\nimport fractions\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n l,r=0,1\r\n s=input()\r\n n=len(s)\r\n for i in range(n):\r\n if s[i]=='r':print(i+1)\r\n for i in range(n-1,-1,-1):\r\n if s[i]=='l':print(i+1)", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n s=input()\r\n s=s[:-1]\r\n a,b=[],[]\r\n for i in range(len(s)):\r\n if s[i]=='r':\r\n b.append(i)\r\n else:\r\n a.append(i)\r\n a=a[::-1]\r\n for i in b:\r\n print(i+1)\r\n for i in a:\r\n print(i+1)", "# CP 1 PROBLEM A\n\ndef printReverseArr(arr):\n arr.reverse()\n n = len(arr)\n for i in range(n):\n print(arr[i])\n \ndef main():\n try:\n # get input\n s = input('')\n\n # her original interval is [0, 1]\n left = 0\n right = 1\n\n # indices\n indices = []\n\n # index count, starts at 1\n i = 1\n\n # parse each letter\n for char in s:\n if char == 'l':\n indices.append(i)\n elif char == 'r':\n print(i)\n i += 1\n \n # output result\n printReverseArr(indices)\n \n except Exception as e:\n print(e)\n exit()\n \nif __name__ == \"__main__\":\n main()\n\n \t\t\t\t \t\t\t\t\t\t \t \t \t \t \t", "s=input()\r\nn=len(s)\r\nprevl=0 \r\nprevr=1 \r\npos=[]\r\nleft=[]\r\nright=[]\r\npos.append([0,1/2])\r\ncurr=1/2 \r\nfor i in range(0,n):\r\n if s[i]=='l':\r\n left.append(i+1)\r\n else:\r\n right.append(i+1)\r\nans=right+left[::-1]\r\nprint(*ans)", "t = input()\r\na, b = [i for i, d in enumerate(t, 1) if d == 'l'], [i for i, d in enumerate(t, 1) if d == 'r']\r\na.reverse()\r\nprint('\\n'.join(map(str, b)))\r\nprint('\\n'.join(map(str, a)))", "s=input()\r\nr=[]\r\nl=[]\r\nnum=1\r\nfor i in s:\r\n if i=='r':\r\n r.append(num)\r\n elif i=='l':\r\n l.append(num)\r\n num+=1\r\nres=r+l[::-1]\r\nfor i in res:\r\n print(i)", "s = input().strip()\r\nn = len(s)\r\nleft_stones = []\r\nright_stones = []\r\n\r\n# Step 1: Prepare two vectors for left and right stones\r\nfor i in range(n):\r\n if s[i] == 'l':\r\n left_stones.append(i + 1)\r\n else:\r\n right_stones.append(i + 1)\r\n\r\n# Step 2: Print right stones in the default order\r\nfor stone in right_stones:\r\n print(stone)\r\n\r\n# Step 3: Print left stones in reverse order\r\nfor stone in reversed(left_stones):\r\n print(stone)\r\n", "s=input()\r\nl=0\r\nr=len(s)-1\r\nans=[0]*(len(s))\r\nfor i in range(len(s)):\r\n if s[i]==\"l\":\r\n ans[r]=i+1\r\n r-=1\r\n else:\r\n ans[l]=i+1\r\n l+=1\r\nfor i in ans:\r\n print(i)\r\n ", "s = input()\n\na, b = 0, 1\n\nleft = []\nright = []\n\nid = 1\n\nfor c in s:\n\tif c == 'r':\n\t\tleft.append(id)\n\telse:\n\t\tright.append(id)\n\tid += 1\n\nfor i in range(0, len(left)):\n\tprint(left[i])\n\nfor i in range(len(right)-1, -1, -1):\n\tprint(right[i])\n\n", "s=input()\r\n\r\nrights=[]\r\nlefts=[]\r\n\r\nfor i, x in enumerate(s,1):\r\n\r\n if x==\"l\":\r\n lefts.append(i)\r\n else:#x==\"r\":\r\n print(i)\r\n\r\nfor x in reversed(lefts):\r\n print(x)\r\n\r\n\r\n", "def main():\n l = [-1, 0, 6, 0, 6, 0, 1, 0, 3]\n liss = 6\n for i, c in enumerate(input()[:-1], 2):\n l.append(i)\n if c == 'l':\n l.append(l[-3])\n l.append(liss)\n liss += 3\n l[l[-5] + 2] = l[-5] = liss\n else:\n l.append(liss)\n l.append(l[-3])\n liss += 3\n l[l[-4] + 1] = l[-4] = liss\n liss, res = l[2], []\n while l[liss]:\n res.append(l[liss])\n liss = l[liss + 2]\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()", "r,l,i=[],[],1\r\ns = input()\r\nfor c in s:\r\n if c==\"r\":\r\n r.append(i)\r\n else:\r\n l.append(i)\r\n i+=1\r\nr=r+l[::-1]\r\nfor c in r: print(c)\r\n", "s = input()\r\nfor i in range(len(s)):\r\n if s[i] == 'r':\r\n print(i+1)\r\n\r\ni = len(s)-1\r\nwhile i >= 0:\r\n if s[i] == 'l':\r\n print(i+1)\r\n i -= 1", "\r\n\r\nclass Node:\r\n def __init__(self, value):\r\n self.value = value\r\n self.tail = None\r\n self.front = None\r\n\r\n\r\nclass LinkedList:\r\n def __init__(self):\r\n head = Node(None)\r\n self.head = head\r\n self.current_lement = head\r\n\r\n def attach_tail(self, value):\r\n x = Node(value)\r\n y = self.current_lement\r\n z = self.current_lement.tail\r\n self.current_lement.tail = x\r\n self.current_lement = x\r\n self.current_lement.front = y\r\n self.current_lement.tail = z\r\n if not z is None:\r\n z.front = self.current_lement\r\n\r\n def attach_to_front(self, value):\r\n x = Node(value)\r\n y = self.current_lement\r\n z = self.current_lement.front\r\n self.current_lement.front = x\r\n self.current_lement = x\r\n self.current_lement.tail = y\r\n self.current_lement.front = z\r\n z.tail = self.current_lement\r\n\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n currnet_linked_list = LinkedList()\r\n currnet_linked_list.attach_tail(1)\r\n for i in range(len(s) - 1):\r\n if s[i] == \"l\":\r\n currnet_linked_list.attach_to_front(i + 2)\r\n else:\r\n currnet_linked_list.attach_tail(i + 2)\r\n currnet_linked_list.current_lement = currnet_linked_list.head.tail\r\n # print(currnet_linked_list.head.value)\r\n # print(\"v\")\r\n # print(currnet_linked_list.current_lement.tail.value)\r\n # print(\"v\")\r\n for i in range(len(s)):\r\n print(currnet_linked_list.current_lement.value)\r\n currnet_linked_list.current_lement = currnet_linked_list.current_lement.tail\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict, Counter, deque\nfrom math import inf\nfrom functools import lru_cache\nfrom heapq import heappop, heappush\n \nimport sys\n#input=sys.stdin.readline\n\ndef solution(): \n line = input()\n res = deque()\n for i in range(len(line))[::-1]:\n if line[i] == \"l\":\n res.append(i+1)\n else:\n res.appendleft(i+1)\n\n for val in res:\n print(val)\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n \n \nimport sys\nimport threading\nsys.setrecursionlimit(10**6)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "moves = input()\r\n\r\nclass Node:\r\n def __init__(self, val):\r\n self.val = val\r\n self.left = None\r\n self.right = None\r\n \r\nleft, right = Node(0), Node(0)\r\nhead = left\r\n\r\nfor i, c in enumerate(moves):\r\n node = Node(i + 1)\r\n if c == 'l':\r\n right.left = node\r\n node.right = right\r\n right = node\r\n else:\r\n left.right = node\r\n node.left = left\r\n left = node\r\nleft.right = right\r\nright.left = left\r\n\r\nnode = head\r\nwhile node:\r\n if node.val:\r\n print(node.val)\r\n node = node.right", "s=(input())\r\na=[]\r\nb=[]\r\nfor i in range (len(s)):\r\n if (s[i]=='l'):\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\nfor i in b:\r\n print(i)\r\na.sort()\r\na.reverse()\r\nfor i in range (len(a)):\r\n print(a[i])\r\n\r\n\r\n", "def solve(seq):\n l, r = [], []\n\n for i in range(len(seq)):\n if seq[i] == 'l':\n l.append(i+1)\n else:\n r.append(i+1)\n print(*(r + l[::-1]))\nsolve(str(input()))\n\t\t \t\t \t\t \t \t \t \t\t \t\t \t\t", "s = input()\r\na = []\r\nn = len(s)\r\n\r\nfor i in range(n):\r\n if s[i] == 'r':\r\n print(i + 1)\r\n\r\n else:\r\n a.append(i + 1)\r\n\r\na.reverse()\r\nfor i in a :\r\n print(i)\r\n", "s = input()\nn = len(s)\na = []\nb = []\nfor i in range(n):\n if s[i] == 'l':\n a.append(i + 1)\n else:\n b.append(i + 1)\na.reverse()\nfor e in b:\n print(e)\nfor e in a:\n print(e)", "import os\r\nimport sys\r\nimport math\r\nfrom collections import deque, defaultdict\r\nimport bisect\r\nimport heapq\r\n\r\n#sys.setrecursionlimit(1000000)\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef multiple():\r\n a = map(int, input().split())\r\n return a\r\n\r\n\r\ndef array():\r\n a = input().split()\r\n return a\r\n\r\n\r\ndef intarray():\r\n a = list(map(int, input().split()))\r\n return a\r\n\r\n\r\ndef intinput():\r\n n = int(input())\r\n return n\r\n\r\n\r\ndef strinput():\r\n s = input().strip()\r\n return s\r\n\r\n\r\ndef isPrime(n):\r\n val = int(math.sqrt(n)) + 1\r\n for i in range(2, val):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef solution():\r\n # MOD = 998244353\r\n MOD = 1000000007\r\n s = strinput()\r\n a = [1]\r\n b = []\r\n count = 2\r\n for x in range(len(s)-1):\r\n i = s[x]\r\n if i == 'l':\r\n a.append(count)\r\n else:\r\n val = a[-1]\r\n a.pop()\r\n a.append(count)\r\n b.append(val)\r\n count += 1\r\n for i in b:\r\n print(i)\r\n for i in reversed(range(len(a))):\r\n print(a[i])\r\n return\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n # print(\"Case #%s:\" % str(_ + 1), end=' ')\r\n solution()\r\n", "\n\n\ninLine = input()\noutput = [0] * len(inLine)\nl, r = 0, len(output) - 1\n\nfor stoneCount, stone in enumerate(inLine):\n if(stone == \"l\"):\n output[r] = stoneCount + 1\n r -= 1\n else:\n output[l] = stoneCount + 1\n l += 1\n\nfor stoneCount in output:\n print(stoneCount)\n\n\t\t\t \t\t \t\t \t\t \t\t\t\t\t \t \t \t\t\t", "s = input()\r\nn = len(s)\r\nleft, right = 0, 1\r\nstart, end = 1, n\r\npos = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n if s[i] == 'l':\r\n pos[end] = i+1\r\n end -= 1\r\n else:\r\n pos[start] = i+1\r\n start += 1\r\n \r\nfor i in range(1, n+1):\r\n print(pos[i])\r\n", "import sys,os\r\nfrom math import sqrt\r\nfrom collections import defaultdict\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\ns=input()\r\nA=[]\r\nB=[]\r\nfor i in range(len(s)):\r\n if s[i]=='l':\r\n A.append(i+1)\r\n else:\r\n B.append(i+1)\r\nfor i in (B):\r\n print(i)\r\nfor i in reversed(A):\r\n print(i)", "s=input()\nn=len(s)\nrt=[]\nlft=[]\n#observe answer is always right[] and then reversed left[]\n\nfor i in range(n):\n if(s[i]==\"l\"):\n lft.append(i+1)\n else:\n rt.append(i+1)\nlen_r=len(rt)\nlen_l=len(lft)\nj=0\nl=len_l-1\nfor i in range(n):\n if(i<len_r):\n print(rt[j])\n j+=1\n else:\n print(lft[l])\n l-=1\n \n\n", "def main():\r\n string = input()\r\n n = len(string)\r\n\r\n left, right = [], []\r\n for i in range(n):\r\n if string[i] == \"l\":\r\n left.append(i + 1)\r\n else:\r\n right.append(i + 1)\r\n \r\n for element in right:\r\n print(element)\r\n for element in reversed(left):\r\n print(element)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\nresult = [\"\"] * len(s)\nl = 0; r = len(s) - 1\nfor i in range(len(s)):\n if s[i] == 'r':\n result[l] = str(i+1)\n l += 1\n else:\n result[r] = str(i+1)\n r -= 1\nfrom sys import stdout\nstdout.write('\\n'.join(result))", "s = input()\r\nl = len(s)\r\nfor i in range(l):\r\n if s[i] == 'r':\r\n print(i+1)\r\nfor i in range(l-1, -1, -1):\r\n if s[i] == 'l':\r\n print(i+1)", "s = input()\nl = []\nr = []\nfor i, c in enumerate(s):\n if c == 'l':\n l.append(i+1)\n if c == 'r':\n r.append(i+1)\n\nfor i in r:\n print(i)\nfor i in l[::-1]:\n print(i)\n", "def stones(s):\n result = [-1]*len(s)\n start = 0\n end = len(s)-1\n for x in range(len(s)):\n if s[x] == 'r':\n result[start] = x+1\n start += 1\n else:\n result[end] = x+1\n end -= 1\n for y in result:\n print(y)\n\nif __name__ == '__main__':\n s = input()\n stones(s)\n \t \t\t \t \t\t \t\t \t\t\t \t\t\t\t \t\t\t\t", "s = input()\r\na, b = [], []\r\nfor i, j in zip(s, range(1, len(s)+1)):\r\n if i == 'r': a.append(str(j))\r\n else: b.append(str(j))\r\nprint('\\n'.join(a + b[::-1]))", "s=input()\r\na=[]\r\nb=[]\r\nfor i,c in enumerate(s):\r\n if c=='l':\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\nfor x in b:\r\n print(x)\r\nfor i in range(len(a)):\r\n print(a[len(a)-1-i])", "\r\n\r\ndirections = input()\r\n\r\nright_value = []\r\nleft_value = []\r\n\r\nfor i in range(len(directions)):\r\n if directions[i] == \"r\":\r\n right_value.append(i + 1)\r\n else:\r\n left_value.append(i + 1)\r\nleft_value = left_value[ : : -1]\r\nfor i in right_value:\r\n print(i)\r\nfor i in left_value:\r\n print(i) ", "s = input()\r\nl = len(s)\r\narr = [0]*l\r\nleft = 0\r\nright = l-1\r\nfor i in range(l):\r\n if s[i]=='l':\r\n arr[right] = i+1\r\n right -= 1\r\n else:\r\n arr[left] = i+1\r\n left += 1\r\nfor i in arr:\r\n print(i)", "a = []\r\nb = []\r\ns = input()\r\ni = 1\r\n\r\nfor ch in s:\r\n if ch == 'l':\r\n a.append(i)\r\n else:\r\n b.append(i)\r\n\r\n i += 1\r\n\r\nfor i in b:\r\n print(i)\r\n\r\nfor i in reversed(a):\r\n print(i)\r\n", "from collections import deque\r\ns = input()\r\nn = len(s)\r\nd = deque()\r\nfor i in range(n-1,-1,-1):\r\n if s[i] == 'l':\r\n d.append(i+1)\r\n else:\r\n d.appendleft(i+1)\r\nfor i in d:\r\n print(i)\r\n\r\n\r\n", "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 Escape_from_Stones():\r\n string = insr()\r\n stone_right = []\r\n stone_left = []\r\n\r\n for index,movement in enumerate(string):\r\n if movement == 'l':\r\n stone_left.append(index+1)\r\n else:\r\n stone_right.append(index+1)\r\n\r\n for i in stone_right:\r\n print(i)\r\n stone_left.reverse()\r\n for i in stone_left:\r\n print(i)\r\n \r\n return \r\n\r\n\r\nEscape_from_Stones()", "s=input()\r\nll=[]\r\nkk=[]\r\nk=1\r\nfor i in s:\r\n if i==\"l\":\r\n ll.append(k)\r\n else:\r\n kk.append(k)\r\n k+=1\r\nll.reverse()\r\nfor i in kk:\r\n print(i)\r\nfor i in ll:\r\n print(i)", "# https://codeforces.com/problemset/problem/264/A\n\na = input()\nn = len(a)\nfor i in range(n):\n if (a[i] == 'r'):\n print(i + 1)\nfor i in range(n - 1, -1, -1):\n if (a[i] == 'l'):\n print(i + 1)\n", "s = input()\nleft = []\nright = []\n\nfor i in range(len(s)):\n if s[i] == \"r\":\n left.append(i + 1)\n else:\n right.append(i + 1)\n\nfor i in left:\n print(i)\nfor i in reversed(right):\n print(i)", "s=input()\nn=len(s)\nrt=[]\nlft=[]\n#observe answer is always right[] and then reversed left[]\n\nfor i in range(n):\n if(s[i]==\"l\"):\n lft.append(i+1)\n else:\n rt.append(i+1)\nli=rt+lft[::-1]#slicing in reverse [start index:end index: reverese by this many steps]\nfor x in li:\n print(x)\n \n\n", "# Asif Islam - asifislam510\ns = input()\npositions_r = [i + 1 for i, char in enumerate(s) if char == 'r']\npositions_l = [i + 1 for i, char in enumerate(s) if char == 'l'][::-1]\n\nfor i in positions_r:\n print(i)\n\nfor i in positions_l:\n print(i)\n\n\t\t \t \t \t \t \t \t \t\t \t \t \t\t", "from sys import stdin\n\nclass node:\n def __init__(self,n):\n self.prev=None\n self.next = None\n self.key = n\n\n\ndef sin():\n return stdin.readline()\n\n\ns = input()\n\na=[]\nb=[]\n\nfor i in range(1,len(s)+1):\n if s[i-1]==\"l\":\n a.append(i)\n else:\n b.append(i)\n\n\nfor i in b:\n print(i)\nfor i in a[::-1]:\n print(i)\n\n\n\n# from sys import stdin\n# def sin():\n# return stdin.readline()\n#\n#\n# s = input()\n# l=[]\n# x=0\n# y=1\n# for i in range(len(s)):\n# ans=0\n# if s[i]==\"l\":\n# ans=(x+y)/2\n# y=ans\n# else:\n# ans=(x+y)/2\n# x=ans\n# l.append([i+1,ans])\n#\n# l.sort(key=lambda x:x[1])\n#\n# # print(l)\n#\n# for i in l:\n# print(i[0])\n", "s = input()\r\nl=[]\r\nl1=[]\r\nfor i in range(len(s)):\r\n if(s[i] == 'l'):\r\n l.append(i+1)\r\n else:\r\n l1.append(i+1)\r\nfor k in range(len(l1)):\r\n print(l1[k])\r\nfor k in range(len(l) - 1,-1,-1):\r\n print(l[k])", "from collections import deque\r\n\r\ns = input().rstrip()\r\n\r\nret = deque()\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == 'l':\r\n ret.append(i + 1)\r\n else:\r\n ret.appendleft(i + 1)\r\nprint('\\n'.join(map(str, ret)))", "if __name__ == \"__main__\":\n import sys\n import collections\n\n line = sys.stdin.readline()\n leftList = collections.deque()\n rightList = collections.deque()\n for i in range(len(line)):\n if line[i] == 'l':\n leftList.appendleft(i + 1)\n elif line[i] == 'r':\n rightList.append(i + 1)\n\n for c in rightList:\n print(c)\n for c in leftList:\n print(c)\n \t\t\t\t \t\t \t\t\t \t\t\t \t \t \t \t\t\t\t\t", "s = input(\"\")\r\n\r\nfor i in range(len(s)):\r\n \r\n if (s[i] == 'r'):\r\n print(i+1)\r\n \r\nfor j in range(len(s)-1,-1,-1):\r\n if (s[j] == 'l'):\r\n print(j+1)\r\n", "import sys, itertools, math, collections, random\n\ndef ia():\n return [int(i) for i in sys.stdin.readline().strip().split(\" \")]\n\ndef ii():\n return int(sys.stdin.readline().strip())\n\ndef istr():\n return sys.stdin.readline().strip()\n\n###\n\n\ns = istr()\n\nL = []\nR = []\nfor i, c in enumerate(s):\n if c == \"r\":\n R.append(i+1)\n else:\n L.append(i+1)\n\nfor i in R:\n print(i)\nfor i in reversed(L):\n print(i)", "s=input()\r\nclass Node:\r\n def __init__(self,val):\r\n self.val = val\r\n self.nextptr = None\r\n self.prevptr = None\r\n \r\nroot = ref = Node(1)\r\nidx = 1\r\n\r\nfor ch in s:\r\n \r\n idx+=1\r\n if idx>len(s):\r\n break\r\n newnode = Node(idx)\r\n if ch=='l':\r\n #if ref is root\r\n if ref.prevptr is None:\r\n root = newnode\r\n else:\r\n newnode.prevptr = ref.prevptr\r\n ref.prevptr.nextptr = newnode\r\n ref.prevptr = newnode\r\n newnode.nextptr = ref\r\n ref = ref.prevptr\r\n \r\n else:\r\n \r\n if ref.nextptr is not None:\r\n ref.nextptr.prevptr = newnode\r\n newnode.nextptr = ref.nextptr\r\n newnode.prevptr = ref\r\n ref.nextptr = newnode\r\n ref = ref.nextptr\r\n \r\n \r\n \r\n \r\ncurr = root \r\nfor i in range(len(s)):\r\n print(curr.val)\r\n curr = curr.nextptr", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\n\ns = input()\nn = len(s)\nans = [0] * n\nstart = 0\nend = n - 1\n\nfor i in range(n):\n if s[i] == \"l\":\n ans[end] = i + 1\n end -= 1\n else:\n ans[start] = i + 1\n start += 1\n\nprint(\"\\n\".join([str(item) for item in ans]))\n", "s = input()\r\nk=[]\r\nl = []\r\nfor i in range(len(s)):\r\n if s[i]==\"l\":\r\n l.append(i)\r\n else:\r\n k.append(i)\r\nll = k+l[::-1]\r\nfor i in ll:\r\n print(i+1)", "class linked_list:\r\n\t\r\n\tdef __init__(self, val):\r\n\t\tself.val = val\r\n\t\tself.right = None\r\n\t\tself.left = None\r\n\r\n\tdef insert_right(self, node):\r\n\t\tnode.right = self.right\r\n\t\tnode.left = self\r\n\t\tif self.right:\r\n\t\t\tself.right.left = node \r\n\t\tself.right = node\r\n\t\treturn\r\n\r\n\tdef insert_left(self, node):\r\n\t\tnode.left = self.left\r\n\t\tnode.right = self\r\n\t\tif self.left:\r\n\t\t\tself.left.right = node \r\n\t\tself.left = node\r\n\r\n\tdef get_start(self):\r\n\t\tnode = self\r\n\t\twhile node.left:\r\n\t\t\tnode = node.left\r\n\t\treturn node\r\n\r\nif __name__ == '__main__':\r\n\tmoves = input()\r\n\thigh = 1\r\n\tlow = 0\r\n\tposition = dict()\r\n\tcurr_node = linked_list(1)\r\n\r\n\tfor idx,char in enumerate(moves[:-1]):\r\n\t\tnew_node = linked_list(idx+2)\r\n\t\t# print(\"Dd\"+str(idx+2), curr_node.val)\r\n\t\t\r\n\t\tif char == 'l':\r\n\t\t\tcurr_node.insert_left(new_node)\r\n\t\telse:\r\n\t\t\tcurr_node.insert_right(new_node)\r\n\r\n\t\tcurr_node = new_node\r\n\r\n\t\t\r\n\tnode = curr_node.get_start()\r\n\r\n\twhile node:\r\n\t\tprint(node.val)\r\n\t\tnode = node.right", "s=input()\r\na=[]\r\nb=[]\r\nfor i in range(0,len(s)):\r\n if s[i]==\"l\":\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\na=a[::-1]\r\nfor num in b:\r\n print(num)\r\nfor num in a:\r\n print(num)", "s = str(input())\r\nn = len(s)\r\nl1, l2 = list(), list()\r\n\r\nfor i in range(n):\r\n if s[i] == 'l':\r\n l1.append(i+1)\r\n else:\r\n l2.append(i+1)\r\n\r\nfor x in l2:\r\n print(x)\r\nfor i in range(len(l1)-1, -1, -1):\r\n print(l1[i])\r\n", "__autor__ = 'Esfandiar'\ns = input()\nr=list()\nl=list()\nc=1\nfor i in s:\n if i=='l':\n r.append(c)\n else:\n l.append(c)\n c+=1\nfor i in l:print(i)\nfor i in r[::-1]:print(i)\n", "def solve(seq) :\r\n stones = [0]*len(seq)\r\n leftPointer = 0\r\n rightPointer = len(seq)-1\r\n index = 0\r\n \r\n while leftPointer <= rightPointer : \r\n if seq[index] == 'l' :\r\n stones[rightPointer] = index+1\r\n rightPointer -= 1\r\n else :\r\n stones[leftPointer] = index+1\r\n leftPointer += 1\r\n \r\n \r\n index += 1\r\n \r\n \r\n for num in stones :\r\n print (num)\r\n \r\nsolve(list(input()))\r\n \r\n ", "s = input()\r\nl = []\r\nr = []\r\nfor i in range(len(s)):\r\n\tif s[i] == 'l':\r\n\t\tl.append(i+1)\r\n\telse:\r\n\t\tr.append(i+1)\r\nr.extend(l[::-1])\r\nfor i in r:\r\n\tprint(i)", "# JAI SHREE RAM\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\n\r\n# sys.setrecursionlimit(10**6)\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\ndef get_string(): return list(input().strip().split())\r\ndef printxsp(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\n\r\nUGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)\r\n\r\n# sys.stdin=open(\"input.txt\",\"r\");sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\n\r\ns = input()\r\nli1 = []\r\nli2 = []\r\nfor i, v in enumerate(s):\r\n if v == 'l':\r\n li1.append(i+1)\r\n elif v == 'r':\r\n li2.append(i+1)\r\nprint(*li2, sep='\\n')\r\nprint(*li1[::-1], sep='\\n')\r\n\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''", "seq = input()\noutput = [0] * len(seq)\nbeginning = 0\nending = len(seq) - 1\nfor i in range(len(seq)):\n if seq[i] == 'l':\n output[ending] = i + 1\n ending = ending - 1\n else:\n output[beginning] = i + 1\n beginning = beginning + 1\nfor i in range(len(output)):\n print(output[i])\n\t\t \t\t\t \t \t\t \t \t \t\t \t\t \t\t\t\t\t", "from collections import deque\ns = input()\n\nr = []\nl = deque()\n\nfor i in range(len(s)):\n if s[i] == \"r\":\n r.append(str(i+1))\n else:\n l.appendleft(str(i+1))\n\n\nprint(\"\\n\".join(r) + \"\\n\" + \"\\n\".join(l))\n\n", "s = input()\r\nn = len(s)\r\nl = []\r\nr = []\r\n\r\nfor i in range(n):\r\n if s[i] == 'l':\r\n l.append(i + 1)\r\n else:\r\n r.append(i + 1)\r\n\r\n#print(l)\r\n#print(r)\r\nl.reverse()\r\nfor i in r :\r\n print(i)\r\n\r\nfor i in l :\r\n print(i)\r\n", "s = input()\nn = len(s)\nleft = []\nright = []\nfor i in range(n):\n if s[i] == \"l\":\n left.append(i+1)\n else:\n right.append(i+1)\n\nfor x in right+left[::-1]:\n print(x)\n", "a = input()\nn = len(a)\nfor i in range(n):\n\tif (a[i] == 'r'):\n\t\tprint(i + 1)\nfor i in range(n - 1, -1, -1):\n\tif (a[i] == 'l'):\n\t\tprint(i + 1)", "s = input()\r\nans = [0] * len(s)\r\nl = 0\r\nr = len(s) - 1\r\nfor i, c in enumerate(s, start=1):\r\n if c == 'l':\r\n ans[r] = i\r\n r -= 1\r\n else:\r\n ans[l] = i\r\n l += 1\r\nfor c in ans:\r\n print(c)", "str = input()\nans = [0] * len(str)\nptr1, ptr2 = 0, len(str) - 1\n\nfor i, c in enumerate(str):\n if c == 'l':\n ans[ptr2] = (i + 1)\n ptr2 -= 1\n else:\n ans[ptr1] = (i + 1)\n ptr1 += 1\n\nfor c in ans:\n print(c)\n\t \t\t\t \t\t\t \t \t\t \t\t \t\t\t\t", "directions = input()\n\n# l letters l-> r letter r to left\n\nl, r = [], []\n\nfor i in range(len(directions)):\n if directions[i] == 'l':\n l.append(i+1)\n else:\n r.append(i+1)\n \nr = r + l[::-1]\nfor x in r:\n print(x)\n\n \t\t\t \t \t \t \t\t \t \t \t \t", "a = input()\r\nn = len(a)\r\nsr=[]\r\nsl=[]\r\nfor i in range(n):\r\n if a[i]=='r':\r\n sr.append(i+1)\r\n else:\r\n sl.append(i+1)\r\nprint(*(sr+sl[::-1]))", "\r\na = input()\r\nn = len(a)\r\nfor i in range(n):\r\n if (a[i] == 'r'):\r\n print(i + 1)\r\nfor i in range(n - 1, -1, -1):\r\n if (a[i] == 'l'):\r\n print(i + 1)", "s=str(input())\r\nn=len(s)\r\nfor i in range(n):\r\n\tif(s[i]==\"r\"):\r\n\t\tprint(i+1)\r\nfor i in range(n):\r\n\tif s[n-i-1]==\"l\":\r\n\t\tprint(n-i)", "n = input()\r\nlength = len(n)\r\nmin,max,arr1,arr2 = 1,length,[],[]\r\nfor i in range(0,length):\r\n if n[i] == \"l\":\r\n arr2.append(i+1)\r\n else:\r\n arr1.append(i+1)\r\n\r\nprint('\\n'.join(map(str, arr1)))\r\nprint('\\n'.join(map(str, arr2[::-1])))", "s = input()\r\n\r\nl = []\r\nr = []\r\nind = 1\r\nfor ch in s:\r\n if ch=='l':\r\n l.append(ind)\r\n else:\r\n r.append(ind)\r\n ind+=1\r\n\r\nfor n in r:\r\n print(n)\r\n\r\nfor i in range(len(l)-1, -1, -1):\r\n print(l[i])\r\n", "s=input()\r\ns1=[]\r\ns2=[]\r\nfor i in range (len(s)):\r\n if(s[i]=='r'):\r\n s1.append(i+1)\r\n else:\r\n s2.append(i+1)\r\ns3=s1+s2[::-1]\r\nfor i in range (len(s)):\r\n print(s3[i])\r\n\r\n ", "s=input()\r\nfor i in range(len(s)):\r\n\tif s[i]=='r':\r\n\t\tprint(i+1)\r\nfor i in range(len(s)-1,-1,-1):\r\n\tif s[i]=='l':\r\n\t\tprint(i+1)", "s=input()\r\n# r1=s.count('r')\r\n# l1=s.count('l')\r\nl=list(s)\r\n# print(l)\r\nans=[]\r\nfor i in range(len(l)):\r\n if l[i]=='r':\r\n print(i+1)\r\nfor i in range(len(l)-1,-1,-1):\r\n if l[i]=='l':\r\n print(i+1)\r\n", "import re\n\nstring = input()\n\nleft = 0\nright = 1\narrRight = []\narrLeft = []\nfor x in range(len(string)):\n if string[x] == \"l\":\n arrLeft.append(x+1)\n else:\n arrRight.append(x+1)\n \nfor x in arrRight:\n print(x)\n \narrLeft.reverse()\nfor x in arrLeft:\n print(x)\n\t \t \t\t \t\t\t\t\t\t \t \t\t\t", "import sys\r\ns=input()\r\na=[]\r\nb=[]\r\nfor i in range(len(s)):\r\n if(s[i]==\"l\"):\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\nc=b+a[::-1]\r\nfor i in c:\r\n print(i)\r\n", "from collections import deque\r\ns=input()\r\nl=deque()\r\nr=[]\r\nfor i in range(len(s)):\r\n if s[i]=='l':\r\n l.appendleft(i+1)\r\n else:\r\n r.append(i+1)\r\n \r\nfor i in r:\r\n print(i)\r\nfor i in l:\r\n print(i)", "s = input()\nans = [0 for i in range(len(s))]\nlp = 0\nrp = len(s)-1\nfor i in range(len(s)):\n\tif s[i]!='l':\n\t\tans[lp] = i+1\n\t\tlp+=1\n\telse:\n\t\tans[rp] = i+1\n\t\trp -= 1\nfor i in ans:\n\tprint(i)\n", "a = input()\r\nn = len(a)\r\nsr = []\r\nsl = []\r\nfor i in range(n):\r\n if a[i] == 'r':\r\n sr.append(i + 1)\r\n else:\r\n sl.append(i + 1)\r\nprint(*(sr + sl[::-1]))\r\n", "from collections import deque\r\ns=deque(('l'+input())[:-1])\r\nle = []\r\nri = []\r\nn=0\r\nwhile s:\r\n c = 0;ref = s[0]\r\n while s and s[0] == ref: c+=1;s.popleft()\r\n #print(ref,c)\r\n if ref=='l':\r\n for i in range(c-1):\r\n ri.append(n+i+1);\r\n le.append(n+c)\r\n n=n+c\r\n elif ref=='r':\r\n for i in range(c-1):\r\n le.append(n+i+1);\r\n ri.append(n+c)\r\n n=n+c\r\n #print(le,ri)\r\nle.extend(ri[::-1])\r\nprint('\\n'.join([str(i) for i in le]))\r\n", "class LinkNode:\r\n\tdef __init__(self, v):\r\n\t\tself.val = v\r\n\t\tself.prev = None\r\n\t\tself.next = None\r\n\r\ns = input()\r\nhead = LinkNode(1)\r\nptr = head\r\nnodes = []\r\nnodes.append(head)\r\nfor i in range(len(s) - 1):\r\n\tnodes.append(LinkNode(i + 2))\r\n\tif (s[i] == 'l'):\r\n\t\tif (ptr.prev): ptr.prev.next = nodes[-1]\r\n\t\tnodes[-1].prev = ptr.prev\r\n\t\tnodes[-1].next = ptr\r\n\t\tptr.prev = nodes[-1]\r\n\t\tptr = ptr.prev\r\n\telse:\r\n\t\tif (ptr.next): ptr.next.prev = nodes[-1]\r\n\t\tnodes[-1].next = ptr.next\r\n\t\tnodes[-1].prev = ptr\r\n\t\tptr.next = nodes[-1]\r\n\t\tptr = ptr.next\r\nptr = head\r\nwhile (ptr.prev): ptr = ptr.prev\t\r\nwhile (ptr):\t\r\n\tprint(ptr.val)\r\n\tptr = ptr.next\r\n", "s=input()\r\nl,r=[],[]\r\nfor i in range(len(s)):\r\n if s[i]==\"r\":r.append(i+1)\r\n else:l.append(i+1)\r\nl.sort(reverse=1)\r\nprint(*(r+l),sep=\"\\n\")", "# len(stone_sequence) will be equal to len(jump_sequence)\r\njump_sequence = input()\r\nstone_sequence_interval = [0]*len(jump_sequence)\r\nindex_from_right = len(jump_sequence) - 2\r\nindex_from_left = 0\r\n\r\nif jump_sequence[0] == 'l':\r\n stone_sequence_interval[-1] = 1\r\n index_from_right = len(jump_sequence) - 2\r\n index_from_left = 0\r\n\r\nif jump_sequence[0] == 'r':\r\n stone_sequence_interval[0] = 1\r\n index_from_right = len(jump_sequence) - 1\r\n index_from_left = 1\r\n\r\nif len(jump_sequence) > 1:\r\n for ith_jump in range(len(jump_sequence) - 1):\r\n if jump_sequence[ith_jump] == 'l':\r\n if jump_sequence[ith_jump + 1] == 'r':\r\n stone_sequence_interval[index_from_left] = ith_jump + 2\r\n index_from_left += 1\r\n\r\n else:\r\n stone_sequence_interval[index_from_right] = ith_jump + 2\r\n index_from_right -= 1\r\n else:\r\n if jump_sequence[ith_jump + 1] == 'l':\r\n stone_sequence_interval[index_from_right] = ith_jump + 2\r\n index_from_right -= 1\r\n\r\n else:\r\n stone_sequence_interval[index_from_left] = ith_jump + 2\r\n index_from_left += 1\r\n\r\nfor ith_jump_interval in stone_sequence_interval:\r\n print(ith_jump_interval)", "s = input()\nl = 0\nj = len(s) - 1\nfinal = [0]*len(s)\nfor i in range(len(s)):\n if s[i] == 'l':\n final[j] = i+1\n j -= 1\n else:\n final[l] = i+1\n l += 1\n\nfor i in final:\n print(i)", "s=input()\r\nst,en=0,1\r\n# tup=[]\r\nright,left=[],[]\r\nfor x in range(len(s)):\r\n if s[x]=='l':\r\n left.append(x+1)\r\n else:\r\n right.append(x+1)\r\nfor x in right:\r\n print(x)\r\nleft.reverse()\r\nfor y in left:\r\n print(y)", "inp = input()\r\nlength = len(inp)\r\nmin,max,dic1,dic2 = 1,length,[],[]\r\nfor i in range(0,length):\r\n if inp[i] == \"l\":\r\n dic2.append(i+1)\r\n else:\r\n dic1.append(i+1)\r\n\r\nprint('\\n'.join(map(str, dic1)))\r\nprint('\\n'.join(map(str, dic2[::-1])))", "s = input()\r\nA = [0]*len(s)\r\ns1 = 'l'\r\nk = 0\r\nv = 0\r\nfor i in range(len(s)):\r\n if s[i] == s1:\r\n A[len(s)-i-1+v] = i+1\r\n\r\n else:\r\n A[k] = i+1\r\n k += 1\r\n v += 1\r\n\r\nfor i in range(len(A)):\r\n print(A[i])", "moves = input()\r\n\r\nleft_idx = [str(i+1) for i, c in enumerate(moves) if c == 'l']\r\nright_idx = [str(i+1) for i, c in enumerate(moves) if c == 'r']\r\nprint('\\n'.join(right_idx + left_idx[::-1]))\r\n", "stringz = input()\narr = [0] * len(stringz)\nl = 0\nr = len(stringz) - 1\nfor i in range(len(stringz)):\n if stringz[i] == \"l\":\n arr[r] = i + 1\n r -= 1\n else:\n arr[l] = i + 1\n l += 1\n\nfor i in arr:\n print(i)\n \t\t\t\t\t \t\t\t\t\t \t\t\t\t\t\t\t \t \t", "actions = input().strip()\r\nfor i in range(len(actions)):\r\n if actions[i] == \"r\":\r\n print(i + 1)\r\nfor i in range(len(actions) - 1, -1, -1):\r\n if actions[i] == \"l\":\r\n print(i + 1)\r\n", "line = input()\nl = len(line)\n\nres: list = [0] * l\nleft: int = 0\nright: int = l-1\n\nfor i, ch in enumerate(line):\n if ch == 'r':\n res[left] = i + 1\n left += 1\n else:\n res[right] = i + 1\n right -= 1\n\nfor ch in res:\n print(ch)\n\n\t \t\t \t\t\t\t \t \t \t\t\t \t\t \t \t\t", "\r\ndef sp(): return map(int, input().split())\r\ndef sli(): return list(sp())\r\nt=1\r\nfor _ in range(t):\r\n s=input()\r\n n=len(s) ;\r\n sl=[]\r\n sr=[]\r\n for i in range(n):\r\n if s[i]=='l':sl.append(i+1)\r\n else:sr.append(i+1)\r\n print(*(sr + sl[::-1]))\r\n # nw = (struct dll*)malloc(sizeof(struct dll));\r\n ", "s = input()\nx = len(s)\nans = [0] * x\n\nl = 0\nr = x - 1\n\nfor i in range(x):\n if s[i] == 'l':\n ans[r] = i+1\n r -= 1\n else:\n ans[l] = i+1\n l += 1\nfor c in ans:\n print(c)\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\ns = input() \r\nr= list () \r\nl = list() \r\nfor i in range (len(s)):\r\n if (s[i] == 'r'):\r\n r.append(i+1)\r\n\r\nfor i in range (len(s) -1 , -1 , -1 ):\r\n if (s[i] == 'l'):\r\n r.append(i+1)\r\n\r\nprint ( *r , sep=\"\\n\" )\r\n", "s = input()\nleft = []\nright = []\nfor i in range(len(s)):\n if s[i] == \"l\":\n left.append(i+1)\n else:\n right.append(i+1)\nfor i in right:\n print(i)\nleft.reverse()\nfor i in left:\n print(i)\nexit()\n", "from collections import deque\r\ninput = input()\r\n\r\nleft_stones = []\r\nright_stones = deque()\r\n\r\nfor i in range(len(input)):\r\n if input[i] == 'l':\r\n left_stones.append(str(i + 1))\r\n else:\r\n right_stones.append(str(i + 1))\r\n\r\nfor stone in right_stones:\r\n print(stone)\r\n\r\nfor stone in reversed(left_stones):\r\n print(stone)\r\n\r\n\r\n", "a=list(input())\r\nn=len(a)\r\nfor i in range(n):\r\n\tif(a[i]=='r'):\r\n\t\tprint(i+1)\r\nfor i in range(n-1,-1,-1):\r\n\tif(a[i]=='l'):\r\n\t\tprint(i+1)", "s = input()\r\nres = []\r\nfor i in range(len(s)):\r\n if s[i] == 'r':\r\n res.append(str(i+1))\r\nfor i in range(len(s)-1, -1, -1):\r\n if s[i] == 'l':\r\n res.append(str(i+1))\r\nprint('\\n'.join(res)) \r\n", "s = input()\r\nn = len(s)\r\noutput = [0] * n\r\nrposition = 0\r\nlposition = n - 1\r\nfor i in range(n):\r\n if s[i] == 'l':\r\n output[lposition] = i + 1\r\n lposition = lposition - 1\r\n else:\r\n output[rposition] = i + 1\r\n rposition = rposition + 1\r\nprint(\"\\n\".join([str(item) for item in output]))", "import sys\r\ninput = sys.stdin.readline\r\ns = input()\r\nn = len(s) - 1\r\nl = []\r\nfor i in range(n):\r\n if(s[i] == 'l'):\r\n l.append(i + 1)\r\n else:\r\n print(i + 1)\r\nl.reverse() \r\nprint(*l, sep = '\\n')", "s = input()\narr = [i for i in range(1, len(s)+1)]\nleft = []\nright = []\nfor i in range(len(s)):\n if s[i] == \"l\":\n left.append(i+1)\n else:\n right.append(i+1)\nfor i in right:\n print(i)\nleft.reverse()\nfor i in left:\n print(i)\nexit()\n", "s=input()\nl,r=[],[]\nfor x in range(len(s)):\n if s[x]=='r':\n r.append(x+1)\n else:\n l.append(x+1)\nfor el in r:\n print(el)\nfor el in l[::-1]:\n print(el)", "s=input()\r\n\r\n\r\nlefts=[]\r\ni=1\r\nfor x in s:\r\n\r\n if x==\"l\":\r\n lefts.append(i)\r\n else:#x==\"r\":\r\n print(i)\r\n i+=1\r\n\r\nfor x in reversed(lefts):\r\n print(x)\r\n\r\n\r\n", "s = input()\r\nl = []\r\nr = []\r\nfor i in range(len(s)):\r\n if s[i] == 'r':\r\n r.append(i + 1)\r\n else:\r\n l.append(i + 1)\r\nfor i in r:\r\n print(i)\r\nl = l[::-1]\r\nfor i in l:\r\n print(i)", "\r\n\r\ndirections = input()\r\n\r\nright_value = []\r\nleft_value = []\r\n\r\nfor i in range(len(directions)):\r\n if directions[i] == \"r\":\r\n right_value.append(i + 1)\r\n else:\r\n left_value.append(i + 1)\r\nleft_value = left_value[ : : -1]\r\nprint(*right_value, *left_value)", "s=input()\r\nx=[]\r\nfor i in range(len(s)):\r\n if s[i]==\"r\":\r\n print(i+1,)\r\n else:\r\n x.append(i+1)\r\nx=x[::-1]\r\nfor j in range(len(x)):\r\n print(x[j])", "s = input()\nn = len(s)\n\nl = 0\nr = n-1\n\ni = 1\nans = [0] * n\nfor c in s:\n if c == 'l':\n ans[r] = i \n r -= 1\n else:\n ans[l] = i \n l += 1 \n i += 1\n\nfor a in ans:\n print(a)", "s=input()\r\nl,r=[],[]\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]=='l':\r\n l.append(i+1)\r\n else:\r\n r.append(i+1)\r\nl=sorted(l,reverse=True)\r\nr.extend(l)\r\nfor i in r:\r\n print(i)", "s = input()\r\nl = len(s)\r\nleft = 0\r\nright = l-1\r\nans = [0 for i in range(l)]\r\nfor i in range(l):\r\n if s[i] == \"l\":\r\n ans[right] = i+1\r\n right -=1\r\n else:\r\n ans[left] = i+1\r\n left+=1\r\nfor it in ans:\r\n print(it)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nl = []\r\nr = []\r\nfor i in range(len(s)):\r\n if s[i] == 'l':\r\n r += [i+1]\r\n else:\r\n l += [i+1]\r\n\r\nx = l + r[::-1]\r\nfor i in x:\r\n print(i)\r\n", "s = list(input())\r\nn = len(s)\r\nx,y = [],[]\r\n \r\nflag = 0\r\nfor i in range(n):\r\n\tif s[i] == 'r':\r\n\t\tif not flag:\r\n\t\t\ty.append(i+1)\r\n\t\telse:\r\n\t\t\tx.append(i+1)\r\n\telse:\r\n\t\tx.append(i+1)\r\nfor i in y:\r\n\tprint(i)\r\nx.reverse()\r\nfor i in x:\r\n\tprint(i)", "stones = list(input())\nleft = []\nright = []\nfor x in range(len(stones)):\n if stones[x] == \"l\":\n left.append(x+1)\n else:\n right.append(x+1)\nfor rock in right:\n print(rock)\nfor rock in left[::-1]:\n print(rock)\n\t\t\t\t\t \t\t \t \t\t \t\t \t \t\t\t \t\t", "def solve(s):\n n = len(s)\n l = []\n r = []\n idx = 1\n for i in s:\n if( i == 'l'):\n l.append(idx)\n else:\n r.append(idx)\n idx += 1\n print(*r, sep='\\n')\n l.reverse()\n print(*l, sep='\\n')\n\n return\n\ns = input()\nsolve(s)", "s=input()\nleft=[]\nright=[]\nindex=1\ncur=-1\nfor i in s:\n if i == 'l':\n right.append(index)\n else:\n left.append(index)\n index += 1\nres=left+right[::-1]\nfor i in res:\n print(i)\n\n\t \t\t \t \t\t\t\t \t\t \t \t\t \t \t\t \t", "import sys\r\nimport math as mt\r\nimport bisect\r\n#input=sys.stdin.buffer.readline \r\n#t=int(input())\r\nt=1\r\nfor __ in range(t):\r\n #n=int(input())\r\n #n,m=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n s=input()\r\n a=[]\r\n b=[]\r\n for i in range(len(s)):\r\n if s[i]=='l':\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\n for i in range(len(b)):\r\n print(b[i])\r\n for i in range(len(a)-1,-1,-1):\r\n print(a[i])", "def main() : \r\n s= input()\r\n for i in range(len(s)):\r\n if s[i] == 'r' :\r\n print(i+1)\r\n for j in range(len(s)-1,-1,-1):\r\n if s[j] == 'l' :\r\n print(j+1) \r\n\r\nmain()", "s=str(input())\r\nl=list(s)\r\nb=len(l)\r\nr=[]\r\nl1=[]\r\nfor i in range(b):\r\n if l[i]==\"r\":\r\n r.append(i+1)\r\nfor i in range(b):\r\n if l[i]==\"l\":\r\n l1.append(i+1)\r\nl1=l1[::-1]\r\nfor i in r:\r\n print(i)\r\nfor i in l1:\r\n print(i)\r\n", "s = input()\narr = [0] * len(s)\nl, r = 0, len(s)-1\ncount = 1\nfor c in s:\n if c == \"l\":\n arr[r] = count\n r -= 1\n else:\n arr[l] = count\n l += 1\n count += 1\nfor c in arr:\n print(c)\n\t\t \t\t \t\t\t\t \t \t\t\t\t\t\t\t\t \t\t\t\t", "s = input()\nresult = [0] * (len(s))\nleft = 0\nright = len(s) - 1\nfor i in range(len(s)):\n if s[i] == 'l':\n result[right] = i + 1\n right -= 1\n else:\n result[left] = i + 1\n left += 1\nfor i in range(len(s)):\n print(result[i])\n \t \t \t \t \t \t\t\t\t\t \t\t \t\t", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i] == 'r':\r\n print(i+1)\r\nfor j in range(len(s)-1,-1,-1):\r\n if s[j] == 'l':\r\n print(j+1)", "seq = input()\n\ns = []\ne = []\n\nfor i, si in enumerate(seq): \n if si == \"l\": \n e.append(i+1)\n else: \n s.append(i+1)\n\nans = s\nans.extend(e[::-1])\n\nfor i in ans:\n print(i)\n", "from sys import stdin, stdout\r\ns = input().strip()\r\nn = len(s)\r\nleft = 0\r\nright = n-1\r\nvs = [0]*n\r\nfor i in range(n):\r\n\tif(s[i] == 'l'):\r\n\t\tvs[right] = str(i+1)\r\n\t\tright -= 1\r\n\telse:\r\n\t\tvs[left] = str(i+1)\r\n\t\tleft += 1\r\nprint('\\n'.join(vs))\r\n", "s = input()\nl = [0] * len(s)\na = 0\nb = len(s) - 1\nfor i in range(len(s)):\n\tif s[i] == 'l':\n\t\tl[b] = str(i + 1)\n\t\tb -= 1\n\telse:\n\t\tl[a] = str(i + 1)\n\t\ta += 1\nprint('\\n'.join(l))\n", "s=str(input())\r\nleft=[];right=[]\r\nfor t in range(len(s)):\r\n if s[t]=='r':\r\n left.append(t+1)\r\n else:\r\n right.append(t+1)\r\nfor i in range(len(left)):\r\n print(left[i])\r\nfor i in range(len(right)):\r\n print(right[-1-i])\r\n ", "str = input()\r\n\r\nfor a in range(len(str)):\r\n if str[a] == \"r\":\r\n print(a + 1)\r\n\r\nfor a in range(len(str) - 1, -1, -1):\r\n if str[a] == \"l\":\r\n print(a + 1)\r\n", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\nstrs = input()\r\nleftarr = []\r\nrightarr = []\r\n\r\nfor i, j in enumerate(strs):\r\n \r\n if j == \"l\":\r\n leftarr.append(i + 1)\r\n else:\r\n rightarr.append(i + 1)\r\n\r\nfor i in rightarr:\r\n print(i)\r\n \r\nleftarr = leftarr[::-1]\r\nfor i in leftarr:\r\n print(i)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "s=input()\r\nn=len(s)\r\na=1\r\nans=[0]*n\r\nfor i in range(n):\r\n if s[i]=='l':\r\n ans[n-1]=i+1\r\n n-=1\r\n else:\r\n ans[a-1]=i+1\r\n a+=1\r\nfor i in ans:\r\n print(i) ", "s=list(input())\r\nn=len(s)\r\ni=0\r\nj=n-1\r\nans=[0]*n\r\nfor k in range(n):\r\n if s[k]=='l':\r\n ans[j]=k+1 \r\n j-=1 \r\n else:\r\n ans[i]=k+1\r\n i+=1\r\nfor i in range(n):\r\n print(ans[i])", "t = input()\nprint('\\n'.join(map(str, [i for i, d in enumerate(t, 1) if d == 'r'])) + '\\n' + '\\n'.join(\n map(str, reversed([i for i, d in enumerate(t, 1) if d == 'l']))))\n", "l, r = [], []\nfor i, c in enumerate(input()):\n if c == 'l':\n r += [str(i + 1)]\n else:\n l += [str(i + 1)]\nr.reverse()\nprint('\\n'.join(l + r)) \n", "\r\n\r\ns = input()\r\n\r\nl = []\r\nr = []\r\n\r\nab = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'l':\r\n l.append(str(i+1))\r\n else:\r\n r.append(str(i+1))\r\n\r\nprint('\\n'.join(r+l[::-1]))", "import sys\nimport collections\n\ninfile = sys.stdin.buffer\ndef gs() : return infile.readline().rstrip()\ndef gi() : return int(gs())\ndef gss() : return gs().split()\ndef gis() : return [int(x) for x in gss()]\n\nMOD = 10 ** 9 + 7\nINF = 10 ** 12\n\n\n\ndef main(infn=\"\") :\n global infile\n infile = open(infn,\"r\") if infn else open(sys.argv[1],\"r\") if len(sys.argv) > 1 else sys.stdin\n ######################################################################\n a,b = collections.deque([]), collections.deque([])\n for i,t in enumerate(list(input())):\n if t == 'l':\n b.append(i+1)\n else:\n a.append(i+1)\n\n b = list(b)[::-1]\n for e in a:\n print (e)\n for e in b:\n print (e)\n\n ######################################################################\nif __name__ == '__main__' :\n main()", "\r\nfrom 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\ns = list(input())\r\nn = len(s)\r\nx,y = [],[]\r\n\r\nflag = 0\r\nfor i in range(n):\r\n\tif s[i] == 'r':\r\n\t\tif not flag:\r\n\t\t\ty.append(i+1)\r\n\t\telse:\r\n\t\t\tx.append(i+1)\r\n\telse:\r\n\t\tx.append(i+1)\r\nfor i in y:\r\n\tprint(i)\r\nx.reverse()\r\nfor i in x:\r\n\tprint(i)\r\n\r\n", "class Node:\n def __init__(self, val):\n self.val = val\n self.next = None\n self.prev = None\n\n\ndef insert(dir, list_head, ptr):\n\n curr_ptr = Node(ptr.val+1)\n\n if dir == 'l':\n if ptr.prev == None:\n curr_ptr.next = ptr\n ptr.prev = curr_ptr\n return curr_ptr, curr_ptr\n else:\n ptr.prev.next = curr_ptr\n curr_ptr.prev = ptr.prev\n curr_ptr.next = ptr\n ptr.prev = curr_ptr\n return list_head, curr_ptr\n\n else:\n if ptr.next == None:\n ptr.next = curr_ptr\n curr_ptr.prev = ptr\n return list_head, curr_ptr\n else:\n curr_ptr.next = ptr.next\n ptr.next.prev = curr_ptr\n ptr.next = curr_ptr\n curr_ptr.prev = ptr\n return list_head, curr_ptr\n\n\ns = input().strip();\nlist_head = Node(1)\ncurr_ptr = list_head\nfor i in range(len(s)-1):\n list_head, curr_ptr = insert(s[i], list_head, curr_ptr)\n\nwhile(list_head):\n print(list_head.val)\n list_head = list_head.next\n", "directions = input()\n\ndistances = []\nindex = 1\nptrs = {'l': [], 'r': []}\n\nfor direction in directions:\n ptrs[direction].append(index)\n index += 1\n\nfor item in ptrs['r']:\n print(item)\n\nfor item in reversed(ptrs['l']):\n print(item)\n" ]

[ "a = list(map(int, input().split()))\r\n\r\nif a[0] > a[-1] and a[0]/a[1] == a[1]/a[2] and a[1]/a[2] == a[2]/a[3]:\r\n print(int(a[-1]/(a[0]/a[1]) if int(a[-1]/(a[0]/a[1])) == (a[-1]/(a[0]/a[1])) else 42))\r\n\r\nelif a[-1] > a[0] and a[1]/a[0] == a[2]/a[1] and a[2]/a[1] == a[3]/a[2]:\r\n print(int(a[-1]*(a[1]/a[0]) if int(a[-1]*(a[1]/a[0])) == (a[-1]*(a[1]/a[0])) else 42))\r\nelif abs(a[0] - a[1]) == abs(a[1] - a[2]) == abs(a[2] - a[3]):\r\n print(a[-1] - abs(a[0] - a[1]) if a[0] > a[1] else a[-1] + abs(a[0] - a[1]))\r\nelse:\r\n print(42)", "# LUOGU_RID: 93088520\na,b,c,d=map(int,input().split())\r\nr=42\r\nif b-a==c-b==d-c:r=d+b-a\r\nif b/a==c/b==d/c==int(d*c/b)/d:r=int(d*c/b)\r\nprint(r)\r\n", "def is_arithmatic(seq):\r\n return all([seq[i] - seq[i-1] == seq[i-1] - seq[i-2] for i in range(2, len(seq))])\r\n\r\ndef is_geometric(seq):\r\n return all([seq[i] / seq[i-1] == seq[i-1] / seq[i-2] for i in range(2, len(seq))])\r\n\r\n \r\n \r\n\r\n\r\ndef main():\r\n numbers = input()\r\n numbers = numbers.split()\r\n for i in range(0, len(numbers)):\r\n numbers[i] = int(numbers[i])\r\n \r\n if is_arithmatic(numbers):\r\n print(numbers[len(numbers) - 1] + (numbers[len(numbers) - 1] - numbers[len(numbers) - 2]))\r\n \r\n elif is_geometric(numbers):\r\n next_number = numbers[len(numbers) - 1] * ( numbers[len(numbers) - 1] / numbers[len(numbers) - 2])\r\n if next_number == int(next_number):\r\n print(int(next_number))\r\n else:\r\n print(42)\r\n else:\r\n print(42)\r\n \r\n \r\n\r\n#import doctest\r\n#doctest.testmod()\r\nmain() \r\n", "four_numbers_sequence = list(map(int, input().split()))\r\n\r\n# determine if the four numbers sequence is arethmatic or not\r\nif four_numbers_sequence[1] - four_numbers_sequence[0] == four_numbers_sequence[2] - four_numbers_sequence[1] == \\\r\n four_numbers_sequence[3] - four_numbers_sequence[2]:\r\n # print next number in the sequence\r\n print(four_numbers_sequence[3] + four_numbers_sequence[1] - four_numbers_sequence[0])\r\n\r\n# else determine if the four numbers sequence is geometric or not\r\nelif four_numbers_sequence[1] / four_numbers_sequence[0] == four_numbers_sequence[2] / four_numbers_sequence[1] == \\\r\n four_numbers_sequence[3] / four_numbers_sequence[2]:\r\n # print next number in the sequence if it's integer\r\n if four_numbers_sequence[3] * (four_numbers_sequence[1] / four_numbers_sequence[0]) % 1 == 0:\r\n print(int(four_numbers_sequence[3] * (four_numbers_sequence[1] / four_numbers_sequence[0])))\r\n else:\r\n print(42)\r\n\r\nelse:\r\n print(42)", "import sys\r\nn=input().split()\r\na=int(n[0])\r\nb=int(n[1])\r\nc=int(n[2])\r\nd=int(n[3])\r\nif(b-a==c-b==d-c):\r\n print(2*d-c)\r\n sys.exit()\r\nif(b*b==a*c and c*c==b*d):\r\n if(d*d%c==0):\r\n print(d*d//c)\r\n else:\r\n print(42)\r\n sys.exit()\r\nprint(42)", "a, b, c, d = map(int, input().split())\r\n\r\nr = 42\r\n\r\nif b - a == c - b == d - c:\r\n r = d + b -a\r\nif b / a == c / b == d / c and int(d * b / a) == d * b / a:\r\n r = int(d * c / b)\r\n \r\nprint(r)", "n1,n2,n3,n4=map(int,input().split())\r\nif n4-n3==n3-n2==n2-n1:\r\n #a5=a1+(n-1)*d\r\n z=n1 + 4 * (n4 - n3)\r\n if z%1!=0:\r\n print(42)\r\n else:\r\n print(z)\r\nelif abs(n4/n3-n3/n2)<=0.0000001 and abs(n3/n2-n2/n1)<=0.0000001:\r\n z=(n1*(n2/n1)**4)\r\n if abs(round(z)-z)<=0.0000001:\r\n print(int(round(z)))\r\n else:\r\n print(42)\r\nelse:\r\n print(42)\r\n#a5=a*d**4\r\n\r\n", "\r\n\r\na,b,c,d = list(map(int,input().split()))\r\n\r\na1 = b - a\r\na2 = c - b\r\na3 = d - c\r\n\r\ng1 = b / a\r\ng2 = c / b\r\ng3 = d / c\r\n#print(g1 , g2 , g3)\r\n#print(a1 , a2 , a3)\r\n\r\nif a1 == a2 == a3 :\r\n res = d + a1\r\n print(res)\r\n\r\n\r\nelif g1 == g2 == g3 and d * g1 == int(d*g1) :\r\n res = g1 * d\r\n print(int(res))\r\n\r\nelse:\r\n print(42)\r\n\r\n", "import math\r\na,b,c,d = map(int, input().split())\r\nd1 = b - a \r\nr = b / a \r\nif (b-a) == d1 and (c-b) == d1 and (d-c) == d1 :\r\n print(math.ceil(d+d1))\r\nelif (a*c) == (b*b) and (b*d) == (c*c) and (d*d)%c==0 :\r\n print(math.ceil((d*d)/c))\r\nelse:\r\n print(42)", "import sys\r\nfin = sys.stdin\r\n\r\na = list(map(int, fin.readline().split()))\r\n\r\nd = a[1] - a[0]\r\n\r\nif a[2] - a[1] == a[3] - a[2] == d:\r\n print(a[3] + d)\r\nelse:\r\n d = a[1] / a[0]\r\n if a[2] / a[1] == a[3] / a[2] == d and d * a[3] == int(d * a[3]):\r\n print(int(d * a[3]))\r\n else:\r\n print(42)", "s=input().split()\n\nfor i in range(4):\n s[i]=int(s[i])\n\nif(s[1]-s[0]==s[2]-s[1]==s[3]-s[2]):\n d=s[1]-s[0]\n if((s[3]+d)%1==0):\n print(s[3]+d)\n else:\n print(42)\nelif(s[1]/s[0]==s[2]/s[1]==s[3]/s[2]):\n d=s[1]/s[0]\n if(int(s[3]*d)!=s[3]*d):\n print(42)\n else:\n print(int(s[3]*d))\nelse:\n print(42)\n", "\r\nl = list(map(int,input().split()))\r\nm=l[1]-l[0];d=l[1]/l[0]\r\nam=0\r\nad=0\r\n\r\nfor i in range(len(l)-1):\r\n if l[i+1]-l[i]==m:\r\n am+=1\r\nfor i in range(len(l)-1):\r\n if l[i+1]/l[i]==d:\r\n ad+=1 \r\n\r\nif am==3:\r\n j=l[3]+m\r\n print(j)\r\nelif ad==3:\r\n j = l[3]*d\r\n jj=str(j);jj=jj[-2:]\r\n if jj=='.0':\r\n print(int(j)) \r\n else:\r\n print(42)\r\nelse:\r\n print(42)\r\n\r\n\r\n", "a,b,c,d = map(int, input().split())\r\nif d - c == c - b and c - b == b - a:\r\n print(d + d - c)\r\nelif b*d == c*c and a*c == b*b and (d*d)%c == 0:\r\n print(d*d//c)\r\nelse:\r\n print(42)\r\n", "a, b, c, d = map(int, input().split())\r\nr = 42\r\nif b-a == c-b == d-c:\r\n r = d+b-a\r\nif b/a == c/b == d/c == int(d*c / b) / d:\r\n r = int(d*c/b)\r\nprint(r)\r\n", "# LUOGU_RID: 92912646\na, b, c, d = map(float, input().split())\r\naa = 2*d-c\r\nbb = d*d/c\r\nif a - b == b - c == c - d and aa == int(aa):\r\n print(int(aa))\r\nelif a / b == b / c == c / d and bb == int(bb):\r\n print(int(bb))\r\nelse:\r\n print(42)\r\n" ]

[ "a = []\r\nxDistinct = []\r\nyDistinct = []\r\n\r\nfor i in range(0, 8):\r\n [n1, n2] = map(int, input().split())\r\n a.append([n1, n2])\r\n\r\n if(n1 not in xDistinct):\r\n xDistinct.append(n1)\r\n\r\n if(n2 not in yDistinct):\r\n yDistinct.append(n2)\r\n\r\n\r\ncountDistinctX = len(xDistinct)\r\ncountDistinctY = len(yDistinct)\r\n\r\nif(countDistinctX != 3 and countDistinctY != 3):\r\n print(\"ugly\")\r\n exit()\r\n\r\nxDistinct.sort()\r\nyDistinct.sort()\r\na.sort()\r\n\r\nindex = 0\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if i == j == 1:\r\n continue\r\n\r\n if xDistinct[i] != a[index][0] or yDistinct[j] != a[index][1]:\r\n print('ugly')\r\n exit()\r\n\r\n index = index + 1\r\n\r\nprint('respectable')\r\n", "# Codeforces: 334B - Eight Point Sets\r\n\r\nclass point:\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 if (self.x < other.x) or (self.x == other.x and self.y < other.y):\r\n return True\r\n return False\r\n\r\nif __name__ == '__main__':\r\n n = 8\r\n a = []\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(point(x, y))\r\n a.sort()\r\n if (a[0].x == a[1].x == a[2].x) and (a[3].x == a[4].x) and (a[5].x == a[6].x == a[7].x) and (a[0].y == a[3].y == a[5].y) and (a[1].y == a[6].y) and (a[2].y == a[4].y == a[7].y) and (a[0].x < a[3].x < a[5].x) and (a[0].y < a[1].y < a[2].y):\r\n print('respectable')\r\n else:\r\n print('ugly')", "lines = []\r\n\r\nfor i in range(0, 8):\r\n\tlines.append(list(map(int, input().split())))\r\n\r\nlines = sorted(lines)\r\n\r\n\r\ncountA = [lines[0][0]]\r\ncountB = [lines[0][1]]\r\n\r\nfor i in range(1, len(lines)):\r\n\tif lines[i][0] != lines[i-1][0]:\r\n\t\tcountA.append(lines[i][0])\r\n\r\n\tif lines[i][1] not in countB:\r\n\t\tcountB.append(lines[i][1])\r\n\r\nif len(countA) != 3 or len(countB) != 3:\r\n\tprint(\"ugly\")\r\nelse:\r\n\tindex = 0\r\n\tcheck = True\r\n\tfor i in countA:\r\n\t\tfor j in countB:\r\n\t\t\tif i == countA[1] and j == countB[1]:\r\n\t\t\t\tcontinue\r\n\t\t\tif i != lines[index][0] or j != lines[index][1]:\r\n\t\t\t\tcheck = False\r\n\t\t\t\tbreak\r\n\t\t\tindex+=1\r\n\r\n\r\n\tif check:\r\n\t\tprint(\"respectable\")\r\n\telse:\r\n\t\tprint(\"ugly\")\r\n\r\n", "x = []\r\ny = []\r\narr = []\r\nfor i in range(8):\r\n xi, yi = map(int, input().split())\r\n \r\n arr.append((xi, yi))\r\n \r\n if (xi not in x):\r\n x.append(xi)\r\n\r\n if (yi not in y):\r\n y.append(yi)\r\n\r\n \r\nif (len(x) == 3 and len(y) == 3):\r\n x = sorted(x)\r\n y = sorted(y)\r\n \r\n ugly = False\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n if not (i == 1 and j == 1) and (x[i], y[j]) not in arr:\r\n ugly = True\r\n \r\n if (ugly == True):\r\n print('ugly')\r\n else:\r\n print('respectable')\r\n \r\nelse:\r\n print('ugly')\r\n", "a = [] # mang chua cac phan tu x\r\nb = [] # mang chua cac phan tu y\r\nc = [] # mang 8 phan tu, moi phan tu la 2 diem x,y tuong ung 1 dong du lieu dau vao\r\n\r\nfor i in range (8):\r\n x,y = map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\n c.append([x,y])\r\nunique_c = [c[0]] # mang chua cac phan tu unique cua c\r\nset_a = list(set(a))\r\nset_b = list(set(b))\r\nset_a.sort()\r\nset_b.sort()\r\n# print (set_a)\r\n# print (set_b)\r\nresult = 'respectable'\r\n# vong for ben duoi tao unique value cho mang c:\r\nfor i in range(1,len(c)):\r\n if c[i] not in unique_c:\r\n unique_c.append(c[i])\r\n# neu cac phan tu cua c trung nhau, tra ket qua 'ugly' \r\nif len(unique_c)!=len(c):\r\n result = 'ugly'\r\nelif ((len(set_a)!=3) or (len(set_b)!=3)):\r\n result = 'ugly'\r\nelif [set_a[1], set_b[1]] in c:\r\n# print ([set_a[1], set_b[1]])\r\n result = 'ugly'\r\nprint (result)", "x = []\r\ny = []\r\nall = []\r\nfor i in range(8):\r\n\txx, yy = map(int, input().split())\r\n\tx.append(xx)\r\n\ty.append(yy)\r\n\tall.append((xx, yy))\r\nsx = set(x)\r\nsy = set(y)\r\nif len(sx) % 3 != 0 or len(sy) % 3 != 0:\r\n\tprint('ugly')\r\nelse:\r\n\tsx = sorted(list(sx))\r\n\tsy = sorted(list(sy))\r\n\t# print(sx)\r\n\t# print(sy)\r\n\tfor i in range(3):\r\n\t\tfor j in range(3):\r\n\t\t\tif i == 1 and j == 1:\r\n\t\t\t\tcontinue\r\n\t\t\tif not (sx[i], sy[j]) in all:\r\n\t\t\t\tprint('ugly')\r\n\t\t\t\texit()\r\n\tprint('respectable')", "(a, b), (c, d), (e, f), (g, h), (i, j), (k, l), (m, n), (o, p) = sorted(\n tuple(map(int, input().split())) for _ in range(8))\nprint((\"ugly\", \"respectable\")[a == c == e < g == i < k == m == o and\n b == h == l < d == n < f == j == p])", "x=set()\r\ny=set()\r\ninclude=[]\r\nfor i in range(8):\r\n a,b=map(int,input().split())\r\n include.append((a,b))\r\n x.add(a)\r\n y.add(b)\r\nflag=1\r\nif len(x)!=3 or len(y)!=3:\r\n flag=0\r\nelse:\r\n notinclude=[]\r\n x=sorted(x)\r\n y=sorted(y)\r\n for i in x:\r\n for j in y:\r\n if (i,j) not in include:\r\n notinclude.append((i,j))\r\n if len(notinclude)>1:\r\n flag=0\r\n elif len(notinclude)==1 and notinclude[0]!=(x[1],y[1]): \r\n flag=0\r\nif flag==1:\r\n print(\"respectable\")\r\nelse:\r\n print(\"ugly\")", "x=[None]*10\r\ny=[None]*10\r\nt=[]\r\nxc=[]\r\nyc=[]\r\nf=False\r\nfor i in range(8):\r\n x[i],y[i]=map(int,input().split())\r\n if (x[i],y[i])in t: f=True\r\n t.append((x[i],y[i]))\r\n if not(x[i] in xc): xc.append(x[i])\r\n if y[i] not in yc:yc.append(y[i])\r\n \r\n\r\n\r\nif (len(xc)!=3)or(len(yc)!=3)or f: print('ugly')\r\nelse:\r\n yc.sort()\r\n xc.sort()\r\n if (xc[1],yc[1])in t:print('ugly')\r\n else: print('respectable')\r\n", "t = [tuple(map(int, input().split())) for i in range(8)]\r\nt.sort()\r\ns = t[0][0] < t[3][0] < t[5][0] and t[0][1] < t[1][1] < t[2][1] and t[0][0] == t[1][0] == t[2][0] and t[3][0] == t[4][0] and t[5][0] == t[6][0] == t[7][0] and t[0][1] == t[3][1] == t[5][1] and t[1][1] == t[6][1] and t[2][1] == t[4][1] == t[7][1]\r\nprint(['ugly','respectable'][s]) \r\n ", "class coor:\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 if (self.x < other.x):\r\n return True\r\n elif (self.x > other.x):\r\n return False\r\n else:\r\n if (self.y < other.y):\r\n return True\r\n else:\r\n return False\r\na = []\r\nfirst = set()\r\nsecond = set()\r\nfor i in range(0,8):\r\n x,y=(map(int,input().split())) \r\n first.add(x)\r\n second.add(y)\r\n a.append(coor(x,y))\r\n\r\n#print(a[0][0])\r\n#print(len(a))\r\na.sort()\r\nok = False \r\nif(a[0].x == a[1].x and a[0].x == a[2].x ):\r\n if(a[0].y != a[1].y and a[1].y != a[2].y):\r\n if(a[3].x == a[4].x and a[3].y != a[1].y and a[4].y != a[1].y):\r\n if(a[5].x == a[6].x and a[6].x == a[7].x):\r\n if(a[5].y != a[6].y and a[6].y != a[7].y):\r\n ok = 1;\r\n\r\nif(ok==True and len(first)== 3 and len(second)==3):\r\n print(\"respectable\")\r\nelse: print(\"ugly\")\r\n", "a = []\r\ndef f(n):\r\n return n[0]\r\ndef ff(n):\r\n return n[1]\r\nfor i in range(8):\r\n x,y = map(int, input().split())\r\n if [x,y] in a:\r\n print(\"ugly\")\r\n exit()\r\n a.append([x,y])\r\na.sort(key=f)\r\nk = 0\r\nif a[0][0]==a[1][0] and a[1][0]==a[2][0]:\r\n k+=1\r\n if a[2][0]!=a[3][0]:\r\n if a[3][0]==a[4][0]:\r\n k+=1\r\n if a[5][0]!=a[4][0]:\r\n if a[5][0]!=a[0][0]:\r\n if a[5][0]==a[6][0] and a[6][0] == a[7][0]:\r\n k+=1\r\nif k != 3:\r\n print(\"ugly\")\r\n exit()\r\na.sort(key=ff)\r\nif a[0][1]==a[1][1] and a[1][1]==a[2][1]:\r\n k+=1\r\n if a[2][1]!=a[3][1]:\r\n if a[3][1]==a[4][1]:\r\n k+=1\r\n if a[5][1]!=a[4][1]:\r\n if a[5][1]!=a[0][1]:\r\n if a[5][1]==a[6][1] and a[6][1] == a[7][1]:\r\n k+=1\r\nif k == 6:\r\n print(\"respectable\")\r\nelse:\r\n print(\"ugly\")", "class Coordinate:\r\n\tdef __init__(self, x, y): \r\n\t\tself.x = x\r\n\t\tself.y = y\r\n\tdef __lt__(self, other):\r\n\t\tif self.x < other.x:\r\n\t\t\treturn True\r\n\t\tif self.x == other.x and self.y < other.y:\r\n\t\t\treturn True\r\n\t\treturn False\r\na = []\r\nfor i in range(8):\r\n\tx, y = map(int, input().split(' '))\r\n\ta.append((Coordinate) (x, y))\r\n\r\na.sort()\r\nif a[0].x == a[1].x == a[2].x and a[3].x == a[4].x and a[5].x == a[6].x == a[7].x and a[0].y == a[3].y == a[5].y and a[1].y == a[6].y and a[2].y == a[4].y == a[7].y and a[0].x < a[3].x < a[5].x and a[0].y < a[1].y < a[2].y:\r\n\tprint(\"respectable\")\r\nelse:\r\n\tprint(\"ugly\")", "inp_arr = [tuple(map(int, input().split())) for i in range(8)]\r\nx_set = set()\r\ny_set = set()\r\nfor x, y in inp_arr:\r\n x_set.add(x)\r\n y_set.add(y)\r\n\r\nif len(x_set) == len(y_set) == 3:\r\n ugly = False\r\n x_sort, y_sort = sorted(x_set), sorted(y_set)\r\n for x in x_sort:\r\n for y in y_sort:\r\n if (x, y) != (x_sort[1], y_sort[1]) and (x, y) not in inp_arr:\r\n ugly = True\r\nelse:\r\n ugly = True\r\nprint(\"ugly\" if ugly else \"respectable\")", "X=[]\nY=[]\nPoints=[]\nk=False\nfor i in range(8):\n x,y=map(int,input().split())\n X.append(x)\n Y.append(y)\n if([x,y] in Points):\n k=True\n Points.append([x,y])\nX.sort()\nY.sort()\n\nif(len(set(X))!=3 or len(set(Y))!=3 or k):\n print(\"ugly\")\n\nelif(X.count(X[0])!=3 or X.count(X[3])!=2 or X.count(X[5])!=3):\n print(\"ugly\")\n\nelif(Y.count(Y[0])!=3 or Y.count(Y[3])!=2 or Y.count(Y[5])!=3):\n print(\"ugly\")\n\nelif([X[3],Y[3]] in Points):\n print(\"ugly\")\n\nelse:\n print(\"respectable\")\n", "from collections import Counter\r\n\r\narr = []\r\nfor i in range(0, 8):\r\n arr.append(list(map(int, input().split(\" \"))))\r\nfreX = Counter([x[0] for x in arr])\r\nfreY = Counter([x[1] for x in arr])\r\nif len(freX) != 3 or len(freY) != 3:\r\n print(\"ugly\")\r\n exit()\r\n\r\nperfectArray=[]\r\nfor x in freX:\r\n for y in freY:\r\n perfectArray.append([x,y])\r\n\r\nfor item in arr:\r\n if (item in perfectArray):\r\n perfectArray.remove(item)\r\n\r\nif(len(perfectArray)>1):\r\n print(\"ugly\")\r\n exit()\r\n\r\nmaxX=max([x[0] for x in arr])\r\nminX=min([x[0] for x in arr])\r\nmaxY=max([y[1] for y in arr])\r\nminY=min([y[1] for y in arr])\r\nsuvivor=perfectArray[0]\r\nif suvivor[0] in range(minX+1, maxX) and suvivor[1] in range(minY+1,maxY):\r\n print(\"respectable\")\r\nelse:\r\n print(\"ugly\")", "class point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n def __lt__(self, other):\r\n return self.x < other.x or (self.x == other.x and self.y < other.y)\r\n\r\nif __name__ == \"__main__\":\r\n p = []\r\n for i in range(8):\r\n x, y = map(int, input().split())\r\n p.append(point(x, y))\r\n p.sort()\r\n if p[0].x == p[1].x and p[1].x == p[2].x and p[2].x != p[3].x and p[3].x == p[4].x and p[4].x != p[5].x and p[5].x == p[6].x and p[6].x == p[7].x and p[0].y == p[3].y and p[3].y == p[5].y and p[5].y != p[1].y and p[1].y == p[6].y and p[6].y != p[2].y and p[2].y == p[4].y and p[4].y == p[7].y:\r\n print(\"respectable\")\r\n else:\r\n print(\"ugly\")", "\ndef check():\n l = []\n for i in range(8):\n x, y = map(int, input().split())\n l += [[x, y]]\n\n xSet = set()\n ySet = set()\n for x, y in l:\n xSet.add(x)\n ySet.add(y)\n\n if len(xSet) != 3 or len(ySet) != 3:\n return False\n\n xList = sorted(list(xSet))\n yList = sorted(list(ySet))\n\n z = []\n for x in xList:\n for y in yList:\n if x == xList[1] and y == yList[1]:\n pass\n else:\n z += [[x, y]]\n\n z.sort()\n l.sort()\n return z == l\n\n\nif check():\n print(\"respectable\")\nelse:\n print(\"ugly\")\n", "import operator\r\n\r\nmylist=[]\r\nfor i in range(0,8):\r\n mylist.append(list(map(int,input().split())))\r\n\r\nmylist.sort(key=lambda sublist: sublist[1])\r\nmylist.sort(key=lambda sublist: sublist[0])\r\n\r\n\r\nif mylist[0][0]==mylist[1][0]==mylist[2][0] and mylist[3][0]==mylist[4][0] and mylist[5][0]==mylist[6][0]==mylist[7][0] and mylist[0][1]==mylist[3][1]==mylist[5][1] and mylist[2][1]==mylist[4][1]==mylist[7][1] and mylist[1][1]==mylist[6][1] and mylist[0][0]<mylist[3][0]<mylist[5][0] and (mylist[0][1]<mylist[1][1]<mylist[2][1] or mylist[0][1]>mylist[1][1]>mylist[2][1]):\r\n print('respectable')\r\nelse:\r\n print('ugly')", "x_set = set()\r\ny_set = set()\r\npoints = []\r\nfor i in range(8):\r\n x,y = [int(k) for k in input().split()]\r\n x_set.add(x)\r\n y_set.add(y)\r\n points.append((x,y))\r\ncnt = 0\r\nif len(x_set) != 3 or len(y_set) != 3:\r\n print('ugly')\r\nelse:\r\n x_set = sorted(x_set)\r\n y_set = sorted(y_set)\r\n for i in range(3):\r\n for j in range(3):\r\n for k in range(8):\r\n if points[k][0] == x_set[i] and points[k][1] == y_set[j]:\r\n if i == 1 and j == 1:\r\n break\r\n cnt += 1\r\n break\r\n if cnt == 8:\r\n print('respectable')\r\n else:\r\n print('ugly')\r\n \r\n", "import sys\r\nimport math\r\nsys.setrecursionlimit(100000)\r\n\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n# sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\n\r\nclass Pair:\r\n def __init__(self, x, y):\r\n self.first = x\r\n self.second = y\r\n\r\n def __lt__(self, other):\r\n return self.first < other.first or (self.first == other.first and self.second < other.second)\r\n\r\n def __eq__(self, other):\r\n return self.first == other.first and self.second == other.second\r\n\r\n\r\nlst, a, b = [], [], []\r\nfor i in range(8):\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\n if Pair(x, y) not in lst:\r\n lst.append(Pair(x, y))\r\n\r\na.sort()\r\nb.sort()\r\nlst.sort()\r\n\r\n\r\ndef solve():\r\n if len(a) == 3 and len(b) == 3 and len(lst) == 8:\r\n if Pair(a[1], b[1]) not in lst:\r\n return True\r\n return False\r\n return False\r\n\r\n\r\nif solve():\r\n print(\"respectable\")\r\nelse:\r\n print(\"ugly\")\r\n", "#!/usr/bin/python3\n\nn = 8\np = []\nxs = []\nys = []\nfor i in range(n):\n x, y = map(int, input().split())\n p.append((x, y))\n xs.append(x)\n ys.append(y)\n\nxs = list(sorted(list(set(xs))))\nys = list(sorted(list(set(ys))))\n\np.sort()\n\nif len(xs) != 3 or len(ys) != 3:\n print(\"ugly\")\nelif p == [(xs[0], ys[0]), (xs[0], ys[1]), (xs[0], ys[2]),\n (xs[1], ys[0]), (xs[1], ys[2]),\n (xs[2], ys[0]), (xs[2], ys[1]), (xs[2], ys[2])]:\n print(\"respectable\")\nelse:\n print(\"ugly\")\n", "from collections import defaultdict\r\nmaps = defaultdict(int)\r\nmaps1 = defaultdict(int)\r\narr = []\r\ndistinct_count = distinct_count1 = 0\r\nfor i in range(8):\r\n temp = list(map(int, input().split()))\r\n if temp[0] not in maps:\r\n distinct_count += 1\r\n if temp[1] not in maps1:\r\n distinct_count1 += 1\r\n maps[temp[0]] = maps1[temp[1]] = 1\r\n arr.append(temp)\r\nif distinct_count != 3 or distinct_count1 != 3:\r\n print('ugly')\r\n exit()\r\nk = sorted(maps.keys())\r\nk1 = sorted(maps1.keys())\r\nfor i in range(8):\r\n if arr[i] == [k[1], k1[1]]:\r\n print('ugly')\r\n exit()\r\nfor i in range(7):\r\n for j in range(i+1,8):\r\n if arr[j] == arr[i]:\r\n print('ugly')\r\n exit()\r\nprint('respectable')", "l = []\r\nfor i in range(8):\r\n x, y = [int(x) for x in input().split()]\r\n l.append( (x,y) )\r\n\r\nl.sort()\r\nlx = []\r\nlx.append( l[0][0] )\r\nlx.append( l[3][0] )\r\nlx.append( l[6][0] )\r\nly = []\r\nly.append( l[0][1] )\r\nly.append( l[1][1] )\r\nly.append( l[2][1] )\r\n\r\neps = [(x, y) for x in lx for y in ly]\r\neps.pop( 4 )\r\n\r\nif( l==eps and lx[0]!=lx[1] and lx[0]!=lx[2] and lx[1]!=lx[2]\r\n\tand ly[0]!=ly[1] and ly[0]!=ly[2] and ly[1]!=ly[2]):\r\n print(\"respectable\")\r\nelse:\r\n print(\"ugly\")\r\n", "def f(p):\r\n if len(set(p)) < 8:\r\n return False\r\n x, y = sorted({pi[0] for pi in p}), sorted({pi[1] for pi in p})\r\n return len(x) == 3 and len(y) == 3 and (x[1], y[1]) not in p\r\nprint('respectable' if f([tuple(map(int, input().split())) for i in range(8)]) else 'ugly')", "def components(lst, a, b):\r\n if len(a) != 3 or len(b) != 3:\r\n return 'ugly'\r\n for x in range(3):\r\n for y in range(3):\r\n if x == y == 1:\r\n continue\r\n if [a[x], b[y]] not in lst:\r\n return 'ugly'\r\n return \"respectable\"\r\n\r\n\r\narr = [[int(c) for c in input().split()] for i in range(8)]\r\nlst1 = sorted(set([p[0] for p in arr]))\r\nlst2 = sorted(set([p[1] for p in arr]))\r\nprint(components(arr, lst1, lst2))\r\n", "x = []\r\ny = []\r\np = []\r\nfor i in range(8):\r\n a, b = [int(x) for x in input().split()]\r\n x.append(a)\r\n y.append(b)\r\n l = [a, b]\r\n p.append(l)\r\nsx = list(set(x))\r\nsy = list(set(y))\r\njud = 0\r\nif len(sx) != 3 or len(sy) != 3:\r\n print('ugly')\r\n jud = 1\r\nif jud == 0:\r\n sx.sort()\r\n sy.sort()\r\n pp = []\r\n for i in range(3):\r\n for j in range(3):\r\n li = [sx[i], sy[j]]\r\n pp.append(li)\r\n pp.remove([sx[1], sy[1]])\r\n p.sort()\r\n pp.sort()\r\n if p == pp:\r\n print('respectable')\r\n else:\r\n print('ugly')\r\n", "import sys\r\n\r\nfin = sys.stdin\r\n\r\npoints = []\r\nfor i in range(8):\r\n x, y = map(int, fin.readline().split())\r\n points += [(x, y)]\r\n\r\ndef CheckPoints(p):\r\n if not p[0][0] == p[1][0] == p[2][0]:\r\n return False\r\n x1 = p[0][0]\r\n if not p[3][0] == p[4][0]:\r\n return False\r\n x2 = p[3][0]\r\n if not p[5][0] == p[6][0] == p[7][0]:\r\n return False\r\n x3 = p[5][0]\r\n if not p[0][1] == p[3][1] == p[5][1]:\r\n return False\r\n y1 = p[0][1]\r\n if not p[1][1] == p[6][1]:\r\n return False\r\n y2 = p[1][1]\r\n if not p[2][1] == p[4][1] == p[7][1]:\r\n return False\r\n y3 = p[2][1]\r\n return x1 < x2 < x3 and y1 < y2 < y3\r\n\r\nfrom itertools import *\r\n\r\nfor p in permutations(points):\r\n if CheckPoints(p):\r\n print(\"respectable\")\r\n break\r\nelse:\r\n print(\"ugly\")\r\n", "def main():\n (x0, y0), (x1, y1), (x2, y2), (x3, y3), (x5, y5), (x6, y6), (x7, y7), (x8, y8) = sorted(\n [tuple(map(int, input().split())) for _ in range(8)])\n print((\"ugly\", \"respectable\")[x0 == x1 == x2 < x3 == x5 < x6 == x7 == x8 and\n y0 == y3 == y6 < y1 == y7 < y2 == y5 == y8])\n\n\nif __name__ == '__main__':\n main()\n", "l = [[int(c) for c in input().split()] for i in range(8)]\r\nxs = sorted(set([p[0] for p in l]))\r\nys = sorted(set([p[1] for p in l]))\r\nif len(xs) != 3 or len(ys) != 3:\r\n print(\"ugly\")\r\nelse:\r\n done = False\r\n for x in range(3):\r\n for y in range(3):\r\n if x == y == 1: continue\r\n if [xs[x],ys[y]] not in l:\r\n print(\"ugly\")\r\n done = True\r\n break\r\n if done: break\r\n if not done:\r\n print(\"respectable\")", "class Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n def __lt__(self, other):\r\n return (self.x < other.x) or (self.x == other.x and self.y <= other.y)\r\np = []\r\nfor i in range(8):\r\n a, b = map(int, input().split())\r\n p.append(Point(a, b))\r\n\r\np.sort()\r\n\r\nugly = False\r\nfor i in range(1, 3):\r\n if p[i].x != p[i - 1].x or p[i + 5].x != p[i + 4].x or p[i].y != p[i + 5].y or p[i].y == p[i - 1].y or p[i + 5].y == p[i + 4].y:\r\n ugly = True\r\nif p[3].x != p[4].x or p[3].y == p[4].y or p[0].y != p[0].y or p[0].y != p[3].y or p[7].y != p[4].y:\r\n\t\tugly = True\r\n\r\nif ugly:\r\n print(\"ugly\")\r\nelse:\r\n print(\"respectable\")\r\n\r\n", "a = []\r\nb = []\r\nc = []\r\n\r\nclass Point:\r\n def __init__(self,x,y):\r\n self.x = x\r\n self.y = y\r\n\r\nfor i in range(8):\r\n x,y = map(int,input().split())\r\n c.append(Point(x,y))\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\nc.sort(key = lambda c:(c.x,c.y))\r\nfor i in range(1,8):\r\n if c[i].x == c[i-1].x and c[i].y == c[i-1].y:\r\n print(\"ugly\")\r\n exit()\r\na.sort()\r\nb.sort()\r\nif len(a) != 3 or len(b) != 3:\r\n print(\"ugly\")\r\n exit()\r\nfor i in range(8):\r\n if c[i].x == a[1] and c[i].y == b[1]:\r\n print(\"ugly\")\r\n exit()\r\nprint(\"respectable\")", "def are_points_distinct(points):\r\n if len(points) != 8:\r\n return False\r\n\r\n for i in range(len(points)):\r\n for j in range(i + 1, len(points)):\r\n if points[i] == points[j]:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef can_use_points_set(array_x, array_y, points):\r\n points_distinct = are_points_distinct(points)\r\n\r\n count_occurrences_x = count_occurrences(array_x)\r\n count_occurrences_y = count_occurrences(array_y)\r\n\r\n if (points_distinct):\r\n if (len(count_occurrences_x) != 3 or len(count_occurrences_y) != 3):\r\n print('ugly')\r\n else:\r\n if (count_occurrences_x[0][1] == 3\r\n and count_occurrences_y[0][1] == 3\r\n and count_occurrences_x[1][1] == 2\r\n and count_occurrences_y[1][1] == 2\r\n and count_occurrences_x[2][1] == 3\r\n and count_occurrences_y[2][1] == 3):\r\n\r\n print('respectable')\r\n else:\r\n print('ugly')\r\n else:\r\n print('ugly')\r\n\r\n\r\ndef count_occurrences(arr):\r\n arr.sort()\r\n counts = {}\r\n for value in arr:\r\n if value in counts:\r\n counts[value] += 1\r\n else:\r\n counts[value] = 1\r\n return [[value, count] for value, count in counts.items()]\r\n\r\n\r\ndef read():\r\n array_x = []\r\n array_y = []\r\n points = []\r\n\r\n for i in range(8):\r\n x, y = list(map(int, input().split()))\r\n points.append([x, y])\r\n array_x.append(x)\r\n array_y.append(y)\r\n return array_x, array_y, points\r\n\r\n\r\narray_x, array_y, points = read()\r\n\r\ncan_use_points_set(array_x, array_y, points)\r\n", "a = [0] * 8\r\nb = [0] * 8\r\nc = [0] * 8\r\nd = [0] * 8\r\nflag = 0\r\nfor i in range(8):\r\n x, y = map(int, input().split())\r\n a[i] = x\r\n b[i] = y\r\n c[i] = x\r\n d[i] = y\r\nn = 8\r\na.sort(reverse = False)\r\nb.sort(reverse = False)\r\n\r\nx1 = a[0]\r\nx2 = a[3]\r\nx3 = a[7]\r\ny1 = b[0]\r\ny2 = b[3]\r\ny3 = b[7]\r\n\r\nflag = 0\r\nif x1 == x2 or x1 == x3 or x2 == x3 or y1 == y2 or y1 == y3 or y2 == y3:\r\n flag = -1\r\n\r\nfor i in range(n):\r\n if c[i] == x2 and d[i] == y2:\r\n flag = -1\r\n break\r\n for j in range(i + 1, n - 1):\r\n if c[i] == c[j] and d[i] == d[j]:\r\n flag = -1\r\n break\r\n\r\nif not (a[0] == a[1] == a[2] and a[3] == a[4] and a[5] == a[6] == a[7]):\r\n flag = -1\r\nif not (b[0] == b[1] == b[2] and b[3] == b[4] and b[5] == b[6] == b[7]):\r\n flag = -1\r\n\r\nif flag == 0:\r\n print('respectable')\r\nelse:\r\n print('ugly')", "arr = [[int(c) for c in input().split()] for i in range(8)]\r\nxs = sorted(set([p[0] for p in arr]))\r\nys = sorted(set([p[1] for p in arr]))\r\nif len(xs) != 3 or len(ys) != 3:\r\n print(\"ugly\")\r\n exit()\r\nfor x in range(3):\r\n for y in range(3):\r\n if x == y == 1: \r\n continue\r\n if [xs[x], ys[y]] not in arr:\r\n print(\"ugly\")\r\n exit()\r\nprint(\"respectable\")\r\n", "def check(x):\n iks = []\n ygrek = []\n for i in x:\n if i[0] not in iks:\n iks.append(i[0])\n if i[1] not in ygrek:\n ygrek.append(i[1])\n if len(iks) != 3 or len(ygrek) != 3:\n return False\n iks.sort()\n ygrek.sort()\n for i in range(8):\n if x[i] == (iks[1],ygrek[1]):\n return False\n if len(set(x)) == 8:\n return True\n return False\n\n\nx = []\nfor i in range(8):\n s = input().split(\" \")\n x.append((int(s[0]),int(s[1])))\n\nif check(x):\n print(\"respectable\")\nelse:\n print(\"ugly\")\n" ]

[ "ss = input()\r\nst = \"\"\r\nfor j in range(len(ss)):\r\n c = ss[j]\r\n if 'A' <= c <= 'Z':\r\n c = chr(ord(c) + ord('a') - ord('A'))\r\n if c == 'o':\r\n c = '0'\r\n if c == 'l' or c == 'i':\r\n c = '1'\r\n st += c\r\ns = st\r\nn = int(input())\r\nfor i in range(n):\r\n ss = input()\r\n st = \"\"\r\n for j in range(len(ss)):\r\n c = ss[j]\r\n if 'A' <= c <= 'Z':\r\n c = chr(ord(c) + ord('a') - ord('A'))\r\n if c == 'o':\r\n c = '0'\r\n if c == 'l' or c == 'i':\r\n c = '1'\r\n st += c\r\n if s == st:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n", "s=input()\r\ns=s.upper()\r\ns=s.replace('O','0')\r\ns=s.replace('L','1')\r\ns=s.replace('I','1')\r\nf=1\r\nfor i in range(int(input())):\r\n\ts1=input()\r\n\ts1=s1.upper()\r\n\ts1=s1.replace('O','0')\r\n\ts1=s1.replace('L','1')\r\n\ts1=s1.replace('I','1')\r\n\tif(s==s1):\r\n\t\tf=0\r\nif(f):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "from collections import Counter\r\ndef corr(s):\r\n z=[]\r\n for i in s:\r\n z.append(d[i])\r\n return z\r\ndef comp(s0,s1):\r\n if len(s0)==len(s1):\r\n for i in range(len(s)):\r\n if not s1[i] in s0[i]:\r\n return False\r\n return True\r\n else:\r\n return False\r\ns=input()\r\nn=int(input())\r\nd={}\r\nfor i in range(ord('a'),ord('z')+1):\r\n d[chr(i)]=[chr(i-ord('a')+ord('A')),chr(i)]\r\nfor i in range(ord('A'),ord('Z')+1):\r\n d[chr(i)]=[chr(i+ord('a')-ord('A')),chr(i)]\r\nfor i in range(10):\r\n d[str(i)]=[str(i)]\r\nd['L'].append('1')\r\nd['l'].append('1')\r\nd['I'].append('1')\r\nd['i'].append('1')\r\nd['O'].append('0')\r\nd['o'].append('0')\r\n\r\nd['1'].append('L')\r\nd['1'].append('l')\r\nd['1'].append('I')\r\nd['1'].append('i')\r\nd['0'].append('O')\r\nd['0'].append('o')\r\n\r\nd['l'].append('I')\r\nd['l'].append('i')\r\nd['L'].append('I')\r\nd['L'].append('i')\r\n\r\nd['I'].append('L')\r\nd['I'].append('l')\r\nd['i'].append('L')\r\nd['i'].append('l')\r\n\r\nd['_']=['_']\r\ns=corr(s)\r\nfor i in range(n):\r\n if comp(s,input()):\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n\r\n\r\n", "def f(s):\r\n return s.lower().replace('i', '1').replace('0', 'o').replace('l', '1')\r\n\r\ns=f(input())\r\nn=int(input())\r\na=[f(input()) for i in range(n)]\r\nif s in a: print(\"No\")\r\nelse: print(\"Yes\")", "import sys\r\na = input()\r\nn = int(input())\r\ns = ''\r\nfor i in a:\r\n if (i == 'O') or (i == 'o'):\r\n s = s + '0'\r\n else:\r\n if (i == 'l') or (i == 'I') or (i == 'L') or (i == 'i'):\r\n s = s + '1'\r\n else:\r\n s = s + i.lower()\r\nfor j in range(n):\r\n a = input()\r\n str = ''\r\n for i in a:\r\n if (i == 'O') or (i == 'o'):\r\n str = str + '0'\r\n else:\r\n if (i == 'l') or (i == 'I') or (i == 'L') or (i == 'i'):\r\n str = str + '1'\r\n else:\r\n str = str + i.lower()\r\n if s == str:\r\n print('No')\r\n sys.exit()\r\nprint('Yes')\r\n", "my_dict = {'o' : '0', 'l' : '1', 'i' : '1'}\r\npas = input().lower()\r\nnew_pas = ''\r\nfor x in pas:\r\n if x in my_dict:\r\n new_pas += my_dict[x]\r\n else:\r\n new_pas += x\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n pas_now = input().lower()\r\n new_pas_now = ''\r\n for x in pas_now:\r\n if x in my_dict:\r\n new_pas_now += my_dict[x]\r\n else:\r\n new_pas_now += x\r\n if new_pas == new_pas_now:\r\n cnt += 1\r\nif cnt > 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "d = {'o' : '0', 'i' : '1', 'l' : '1'}\r\ndef g(c):\r\n if c in d:\r\n return d[c]\r\n return c\r\n\r\ndef f(s):\r\n r = list(map(g, s))\r\n return ''.join(r)\r\n \r\n\r\ns = f(input().lower())\r\nn = int(input())\r\nstrs = set()\r\nfor i in range(n):\r\n strs.add(f(input().lower()))\r\n\r\n#strs = sorted(strs)\r\nif s not in strs:\r\n print('Yes')\r\nelse:\r\n print('No')", "def makeUnique(s):\n\treturn s.lower().replace('i', '1').replace('o', '0').replace('l', '1')\n\nlogin = makeUnique(input())\nfor i in range(int(input())):\n\tif makeUnique(input()) == login:\n\t\tprint('No')\n\t\texit()\nprint('Yes')", "def read():\r\n return list(map(int,input().split()))\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n s=s[:i]+'o'+s[i+1:]\r\n elif s[i]=='1' or s[i]=='i' or s[i]=='I':\r\n s=s[:i]+'l'+s[i+1:]\r\na=[]\r\nn=int(input())\r\nfor i in range(n):\r\n c=input()\r\n for i in range(len(c)):\r\n if c[i]=='0':\r\n c=c[:i]+'o'+c[i+1:]\r\n elif c[i]=='1' or c[i]=='i' or c[i]=='I':\r\n c=c[:i]+'l'+c[i+1:]\r\n if c.capitalize()==s.capitalize():\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n\r\n \r\n \r\n", "def transform(s):\r\n \r\n s = s.replace('0', 'O')\r\n s = s.lower()\r\n s = s.replace('l', 'i')\r\n s = s.replace('1', 'i')\r\n \r\n return s\r\n\r\n\r\ns = input()\r\nn = int(input())\r\na = [input() for i in range(n)]\r\n\r\ns = transform(s)\r\nkey = 0\r\n\r\nfor element in a:\r\n if transform(element) == s:\r\n key = 1\r\n break\r\nif key:\r\n print('No')\r\nelse:\r\n print('Yes')", "s = input().lower()\r\nn = int(input())\r\nl = len(s)\r\neq1 = ['0', 'o']\r\neq2 = [\"1\", \"l\", 'i']\r\nequal = 0\r\nfor i in range(n):\r\n\tcur = input().lower()\r\n\tlc = len(cur)\r\n\tif l!=lc: continue\r\n\tequal = 1\r\n\tfor j in range(l):\r\n\t\tif (s[j]==cur[j]): \r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif (s[j] in eq1) and (cur[j] in eq1):continue\r\n\t\t\tif (s[j] in eq2) and (cur[j] in eq2):continue\r\n\t\tequal = 0\r\n\t\tbreak\r\n\r\n\tif equal:\r\n\t\tbreak\r\nif equal:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')", "def transform(log):\r\n return log.replace('O', '0').replace('o', '0').replace('l', '1').replace('I', '1').\\\r\n replace('L', '1').replace('i', '1').lower()\r\n\r\n\r\nlogin = transform(input())\r\nn = int(input())\r\nlogins = []\r\ncheck = False\r\nfor i in range(n):\r\n if login == transform(input()):\r\n print('No')\r\n check = True\r\nif not check:\r\n print('Yes')\r\n", "def normalize(login):\n new_login = ''\n for x in login:\n if x == '0':\n new_login += 'o'\n elif x in ['l', 'L', 'I', 'i']:\n new_login += '1'\n else:\n new_login += x.lower()\n return new_login\n\n\nanswer = 'Yes'\n\nuser_login = normalize(input())\nlogins_amount = int(input())\n\nfor i in range(logins_amount):\n login = normalize(input())\n if len(login) != len(user_login):\n continue\n if login == user_login:\n answer = 'No'\n\nprint(answer)\n", "new_login = input()\r\ncount_login_db = int(input())\r\nis_can = True\r\ncheck_o = [\"0\", \"o\", \"O\"]\r\ncheck_i = [\"1\", \"i\", \"I\", \"L\", \"l\"]\r\n\r\n\r\ndef check_letter(letter_db, letter_new):\r\n isO = letter_db in check_o and letter_new in check_o\r\n isI = letter_db in check_i and letter_new in check_i\r\n isUpper = letter_db.upper() == letter_new.upper()\r\n return isO or isI or isUpper\r\n\r\n\r\nfor i in range(count_login_db):\r\n check_login = input()\r\n if len(check_login) != len(new_login): continue\r\n if not is_can: break\r\n for letter_db, letter_new in zip(check_login, new_login):\r\n if check_letter(letter_db, letter_new):\r\n is_can = False\r\n continue\r\n else:\r\n is_can = True\r\n break\r\n\r\nif is_can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "start = input().lower().replace(\"o\", \"0\").replace(\"l\", \"1\").replace(\"i\", \"1\")\r\nrez = True\r\nfor i in range(int(input())):\r\n temp = input().lower().replace(\"o\", \"0\").replace(\"l\", \"1\").replace(\"i\", \"1\")\r\n if temp == start:\r\n rez = False\r\nprint(\"Yes\" if rez else \"No\")", "def check(s, t):\r\n if len(s) != len(t):\r\n return False\r\n s = s.lower()\r\n t = t.lower()\r\n for i in range(len(s)):\r\n if s[i] == t[i]:\r\n continue\r\n elif (s[i] == \"0\" and t[i] == \"o\") or (t[i] == \"0\" and s[i] == \"o\"):\r\n continue\r\n elif (s[i] == \"1\" and (t[i] == \"i\" or t[i] == \"l\")) or (t[i] == \"1\" and (s[i] == \"i\" or s[i] == \"l\")):\r\n continue\r\n elif (s[i] == \"i\" and (t[i] == \"1\" or t[i] == \"l\")) or (t[i] == \"i\" and (s[i] == \"1\" or s[i] == \"l\")):\r\n continue\r\n elif (s[i] == \"l\" and (t[i] == \"1\" or t[i] == \"i\")) or (t[i] == \"l\" and (s[i] == \"1\" or s[i] == \"i\")):\r\n continue\r\n else:\r\n return False\r\n return True\r\n\r\ns = input()\r\nn = int(input())\r\nans = False\r\nfor i in range(n):\r\n t = input()\r\n ans |= check(s, t)\r\nif ans:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "s=str(input())\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n aa=[]\r\n aaa=input()\r\n aaa=aaa.lower()\r\n for iii in range(len(aaa)):\r\n aa.append(aaa[iii])\r\n a.append(aa)\r\n del aa\r\nfor i in range(n):\r\n for l in range(len(a[i])):\r\n if a[i][l]=='0':\r\n a[i][l]='o'\r\n if a[i][l]=='l' or a[i][l]=='i':\r\n a[i][l]='1'\r\ns=s.lower()\r\nss=[]\r\nfor i in range(len(s)):\r\n ss.append(s[i])\r\nfor i in range(len(s)):\r\n if ss[i]=='0':\r\n ss[i]='o'\r\n if ss[i]=='l' or ss[i]=='i':\r\n ss[i]='1'\r\naa=a.count(ss)\r\nif aa>0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n\r\n", "alpha = 'qwertyupasdfghjkzxcvbnmQWERTYUPASDFGHJKZXCVBNM'\r\nalikes = []\r\nfor i in range(len(alpha)):\r\n alikes.append(set(alpha[i]))\r\n alikes[-1].add(alpha[(i + 23)%46])\r\nalikes.append(set(['0', 'o', 'O']))\r\nalikes.append(set(['l', 'L', 'i', 'I', '1']))\r\nfor i in range(2, 10):\r\n alikes.append(set(str(i)))\r\nalikes.append(set('_'))\r\n\r\na = input()\r\ncheck = False\r\nfor i in range(int(input())):\r\n b = input()\r\n if len(a) != len(b) or check:\r\n continue\r\n for j in range(len(a)):\r\n newCheck = False\r\n for k in alikes:\r\n \r\n if a[j] in k:\r\n if b[j] not in k:\r\n newCheck = True\r\n break\r\n if newCheck:\r\n break\r\n check = (j == len(a) - 1)\r\nprint('No' if check else 'Yes')\r\n", "s = input()\r\nn = int(input())\r\narray = [str(input()) for c in range(n)]\r\nfor c in range(len(array)):\r\n b = 0\r\n for b in range(len(array[c])):\r\n if array[c][b] == \"0\":\r\n array[c] = array[c][:b] + \"o\" + array[c][b + 1:]\r\n elif array[c][b] == \"l\" or array[c][b] == \"L\" or array[c][b] == \"i\" or array[c][b] == \"I\":\r\n array[c] = array[c][:b] + \"1\" + array[c][b + 1:]\r\n elif array[c][b].isupper():\r\n array[c] = array[c][:b] + chr(ord(array[c][b]) + 32) + array[c][b + 1:]\r\nfor b in range(len(s)):\r\n if s[b] == \"0\":\r\n s = s[:b] + \"o\" + s[b + 1:]\r\n elif s[b] == \"l\" or s[b] == \"L\" or s[b] == \"i\" or s[b] == \"I\":\r\n s = s[:b] + \"1\" + s[b + 1:]\r\n elif s[b].isupper():\r\n s = s[:b] + chr(ord(s[b]) + 32) + s[b + 1:]\r\nif s in array:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n\r\n\r\n\r\n", "def getinput():\n return [int(x) for x in input().strip().split()]\n\n\nnewlogin = input()\n# print(newlogin)\nnewlogin=newlogin.lower()\nnewlogin=newlogin.replace(\"o\", \"0\")\nnewlogin=newlogin.replace(\"l\", \"1\")\nnewlogin=newlogin.replace(\"i\", \"1\")\nn = int(input())\n# print(n)\nexist=[]\n\nfor x in range(n):\n curr=input()\n # print(curr)\n curr=curr.lower()\n # s=len(curr)\n curr=curr.replace('o', '0')\n curr=curr.replace('l', '1')\n curr=curr.replace('i', '1')\n exist.append(curr)\n# print(exist)\nif newlogin in exist: print(\"No\")\nelse: print(\"Yes\")", "s = input()\r\nn = int(input())\r\n\r\nt = [['1', 'l', 'i'], ['o', '0']]\r\n\r\ng = True\r\n\r\nfor i in range(n):\r\n nick = input()\r\n\r\n if len(s) != len(nick):\r\n continue\r\n \r\n f = True\r\n\r\n for i in range(len(s)):\r\n if s[i].lower() == nick[i].lower():\r\n continue\r\n if s[i].lower() in t[0] and nick[i].lower() in t[0]:\r\n continue\r\n if s[i].lower() in t[1] and nick[i].lower() in t[1]:\r\n continue\r\n f = False\r\n break\r\n\r\n if f:\r\n g = False\r\n break\r\n\r\nif g:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "l = input()\r\nnew_login1 = l.upper().replace('O', '0').replace('l', '1').replace('I', '1')\r\nnew_login2 = l.replace('O', '0').replace('l', '1').replace('I', '1').lower()\r\nnew_login3 = l.lower().replace('O', '0').replace('l', '1').replace('I', '1')\r\nlogins = []\r\nn = int(input())\r\nfor i in range(n):\r\n last = input()\r\n logins.append(last.upper().replace('O', '0').replace('l', '1').replace('I', '1'))\r\n logins.append(last.replace('O', '0').replace('l', '1').replace('I', '1').lower())\r\n logins.append(last.lower().replace('O', '0').replace('l', '1').replace('I', '1'))\r\nprint('No' if new_login1 in logins or new_login2 in logins or new_login3 in logins else 'Yes')\r\n", "# python3\n\nmapper = {\n 'i': '1',\n 'l': '1',\n 'o': '0',\n}\n\n\ndef normalize(login):\n return \"\".join(mapper.get(ch, ch) for ch in login.lower())\n\n\ndef main():\n login = normalize(input())\n n = int(input())\n while n:\n n -= 1\n if login == normalize(input()):\n print(\"No\")\n break\n else:\n print(\"Yes\")\n\n\nmain()\n", "s = input() # новый логин\r\nstr_copy = list(s)\r\ns_copy = \"\"\r\n\r\nfor i in range(len(s)):\r\n\tif (str_copy[i] == \"O\" or str_copy[i] == \"o\"):\r\n\t\tstr_copy[i] = \"0\"\r\n\tif (str_copy[i] == \"l\" or str_copy[i] == \"I\" or str_copy[i] == \"L\" or str_copy[i] == \"i\"):\r\n\t\tstr_copy[i] = \"1\"\r\n\ts_copy += str_copy[i]\r\n\r\nn = int(input()) # количество сущ логинов\r\nfl = True\r\n\r\nfor i in range(n):\r\n\tst = input()\r\n\tif fl:\r\n\t\tstr_copy = list(st)\r\n\t\tst_copy = \"\"\r\n\t\tif len(st) == len(s):\r\n\t\t\tfor i in range(len(s)):\r\n\t\t\t\tif (str_copy[i] == \"O\" or str_copy[i] ==\"o\"):\r\n\t\t\t\t\tstr_copy[i] = \"0\"\r\n\t\t\t\tif (str_copy[i] == \"l\" or str_copy[i] == \"I\" or str_copy[i] == \"L\" or str_copy[i] == \"i\"):\r\n\t\t\t\t\tstr_copy[i] = \"1\"\r\n\t\t\t\tst_copy += str_copy[i]\r\n\t\t\t\t\r\n\t\tif st_copy.lower() == s_copy.lower():\r\n\t\t\tfl = False\r\n\r\nif (fl):\r\n\tprint(\"Yes\")\r\nelse:\r\n\t print(\"No\")\r\n\t\t\t\t\r\n", "def trans(log):\n '''\n 1. Заменяет букву O на цифру 0\n 2. l -> 1\n 3. 1 -> I\n 4. Преобразование к верх. регистру\n '''\n \n log = list(log)\n for i in range(len(log)):\n if log[i] == '0':\n log[i] = 'O'\n \n if log[i] in ('l', 'L'):\n log[i] = '1'\n \n if log[i] == '1':\n log[i] = 'I'\n \n log = list(map(lambda x: x.upper(), log))\n \n return ''.join(log)\n\nlogin = input()\nlogin = trans(login)\n\nN = int(input())\n\nlogins = set()\n\nfor i in range(N):\n logins.add(trans(input()))\n\n#print(login)\n#print(logins)\n\nif login in logins:\n print('No')\nelse:\n print('Yes')\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 *\r\nfrom itertools import accumulate\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\ns = ip()\r\ns = s.lower()\r\ns = s.replace(\"0\", \"o\")\r\ns = s.replace(\"i\", \"1\")\r\ns = s.replace(\"l\", \"1\")\r\nn = ii()\r\narr = defaultdict(lambda: 0)\r\n\r\nfor _ in range(n):\r\n x = ip().lower()\r\n x = x.replace(\"0\", \"o\")\r\n x = x.replace(\"i\", \"1\")\r\n x = x.replace(\"l\", \"1\")\r\n arr[x] = 1\r\n\r\n# print(s)\r\n# print(list(arr.keys()))\r\nprint(\"Yes\" if not arr[s] else \"No\")\r\n", "string=input()\r\nstring=string.lower()\r\nstring=string.replace('o','0')\r\nstring=string.replace('l','1')\r\nstring=string.replace('i','1')\r\nN=int(input())\r\npas=1\r\nfor i in range(N):\r\n if pas==1:\r\n s=input().lower()\r\n s=s.replace('o','0')\r\n s=s.replace('l','1')\r\n s=s.replace('i','1')\r\n if string==s:\r\n pas=0\r\nif pas==1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "s = input()\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n t = input()\r\n if len(s) != len(t):\r\n continue\r\n for j in range(len(t)):\r\n if t[j].lower() == s[j].lower():\r\n continue\r\n if t[j] in '0Oo' and s[j] in '0Oo':\r\n continue\r\n if s[j] in '1lILi' and t[j] in '1lILi':\r\n continue\r\n # print(s[j], t[j], s, t, i)\r\n break\r\n else:\r\n print('No')\r\n exit(0)\r\nprint('Yes')", "def t(s):\r\n s=s.replace(\"o\",\"0\").replace(\"l\",\"1\").replace(\"i\",\"1\")\r\n return s\r\ns=t(input().lower())\r\nfor i in range(int(input())):\r\n q=t(input().lower())\r\n if q==s:exit(print(\"NO\"))\r\nprint(\"YES\")", "s = input().lower().replace('0', 'o').replace('1', 'l').replace('i', \"l\")\r\n\r\na = []\r\n\r\nfor i in range(int(input())):\r\n a.append(input().lower().replace('0', 'o').replace('1', 'l').replace('i', \"l\"))\r\n\r\ntry:\r\n a.index(s)\r\n print('NO')\r\nexcept:\r\n print('YES')", "\n\n\ns=input()\nn=int(input())\nlogins=[]\nfor i in range(n):\n a=input()\n if len(a)==len(s):\n logins.append(a)\ndel a\n#registr one bukv\n#O na 0\n#1 - l - I\n\nmn1=set('1iIlL')\nmn2=set('0oO')\nfor current_log in logins:\n for sym in range(len(current_log)):\n if s[sym]==current_log[sym]:\n continue\n elif s[sym].lower()==current_log[sym] or s[sym].upper()==current_log[sym]:\n continue\n elif s[sym] in mn2 and current_log[sym] in mn2:\n continue\n elif s[sym] in mn1 and current_log[sym] in mn1:\n continue\n else:\n break\n else:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "def check(ch1, ch2):\r\n return check1(ch1, ch2) or check2(ch1, ch2) or check3(ch1, ch2) or check4(ch1, ch2)\r\n\r\n\r\ndef check1(ch1, ch2):\r\n return ch1 == ch2.lower() or ch2 == ch1.lower()\r\n\r\n\r\ndef check2(ch1, ch2):\r\n return (ch1 == '0' and (ch2 == 'o' or ch2 == 'O')) or (ch2 == '0' and (ch1 == 'o' or ch1 == 'O'))\r\n\r\n\r\ndef check3(ch1, ch2):\r\n return (ch1.lower() == 'i' and (ch2.lower() == 'l' or ch2 == '1')) or (\r\n ch2.lower() == 'i' and (ch1.lower() == 'l' or ch1 == '1'))\r\n\r\n\r\ndef check4(ch1, ch2):\r\n return (ch1.lower() == 'l' and (ch2.lower() == 'i' or ch2 == '1')) or (\r\n ch2.lower() == 'l' and (ch1.lower() == 'i' or ch1 == '1'))\r\n\r\n\r\ns = input()\r\nl = len(s)\r\nn = int(input())\r\nf = False\r\nfor i in range(n):\r\n s1 = input()\r\n dif = 0\r\n pd = 0\r\n if len(s1) == l:\r\n for j in range(l):\r\n if s[j] != s1[j]:\r\n dif += 1\r\n if check(s[j], s1[j]):\r\n pd += 1\r\n if dif == pd:\r\n f = True\r\nif f:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "s = input().lower().replace(\"o\",\"0\").replace(\"i\", \"1\").replace(\"l\", \"1\")\r\n\r\ncnt = int(input())\r\n\r\nis_correct = \"Yes\"\r\n\r\nfor i in range(cnt):\r\n t = input().lower().replace(\"o\",\"0\").replace(\"i\", \"1\").replace(\"l\", \"1\")\r\n if t == s: is_correct = \"No\"\r\n\r\nprint(is_correct)\r\n", "def xxx(string: str):\r\n ss = string\r\n ss = ss.lower()\r\n ss = ss.replace(\"i\", \"1\")\r\n ss = ss.replace(\"l\", \"1\")\r\n ss = ss.replace(\"o\", \"0\")\r\n return ss\r\n\r\n\r\ns = input()\r\ns = xxx(s)\r\nx = len(s)\r\nn = int(input())\r\nres = True\r\n\r\nfor i in range(n):\r\n ss = input()\r\n if len(ss) == x:\r\n if xxx(ss) == s:\r\n res = False\r\n break\r\n\r\nif res:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def login(log1, log2):\r\n if log1.lower() == log2.lower():\r\n return False\r\n \r\n log2 = log2.replace('o', '0').replace('O', '0').replace('i', '1').replace('I', '1').replace('l', '1').replace('L', '1')\r\n log1 = log1.replace('o', '0').replace('O', '0').replace('i', '1').replace('I', '1').replace('l', '1').replace('L', '1')\r\n\r\n return not log1 == log2\r\n\r\nlog = input()\r\nn = int(input())\r\ntmp = 0\r\n\r\nfor l in range(n):\r\n if login(log, input()):\r\n tmp += 1\r\n\r\nprint('Yes') if tmp == n else print('No')", "# Variables BLOCK\r\n\r\nlogins = []\r\nlogin = input()\r\nn = int(input())\r\nErrorMessage = \"No\"\r\nSuccessMessage = \"Yes\"\r\n\r\n# END Variables BLOCK\r\ndef init(login):\r\n\tdelete_chars = ['1', 'i', 'l', 'o', '0']\r\n\r\n\tdel_chars_i = ['1', 'i', 'l']\r\n\tdel_chars_o = ['o', '0']\r\n\r\n\tres = login\r\n\tfor i in delete_chars:\r\n\t\twhile res.count(i) > 0:\r\n\t\t\tif i in del_chars_o:\r\n\t\t\t\tres = res.replace(i, 'Ꮗ')\r\n\t\t\telif i in del_chars_i:\r\n\t\t\t\tres = res.replace(i, 'Ꮘ')\r\n\treturn res\r\n\r\ndef start():\r\n\tres = []\r\n\r\n\tfor i in logins:\r\n\t\tres.append(init(i.lower()))\r\n\treturn res\r\n\r\ndef validate1(login):\r\n\tlogin = login.lower()\r\n\tlogins = start()\r\n\tif init(login) in logins:\r\n\t\treturn False\r\n\treturn True\r\nfor i in range(n):\r\n\tlogin_ = input()\r\n\r\n\tif not len(login_) != len(login):\r\n\t\tlogins.append(login_.lower())\r\n\r\nif login.lower() in logins:\r\n\tprint(ErrorMessage)\r\nelse:\r\n\tresult = validate1(login)\r\n\tif result == True:\r\n\t\tprint(SuccessMessage)\r\n\telse:\r\n\t\tprint(ErrorMessage)\r\n", "login=input().lower()\r\nmas=[login]\r\nm_logins=[str(i) for i in login]\r\ns=m_logins.copy()\r\nms=m_logins.copy()\r\ncon=0\r\n\r\ndef mas_len(st):\r\n w=''\r\n for i in st:\r\n w+=i\r\n return w \r\nfor i in range(len(login)):\r\n if login[i]=='o':\r\n s[i]='0'\r\n ms[i]='0'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='0':\r\n s[i]='o'\r\n ms[i]='o'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='1':\r\n s[i]='l'\r\n ms[i]='l'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='l':\r\n s[i]='1'\r\n ms[i]='1'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='1':\r\n s[i]='i'\r\n ms[i]='i'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='i':\r\n s[i]='1'\r\n ms[i]='1'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='i':\r\n s[i]='l'\r\n ms[i]='l'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n if login[i]=='l':\r\n s[i]='i'\r\n ms[i]='i'\r\n b=mas_len(ms)\r\n a=mas_len(s)\r\n mas.append(a)\r\n mas.append(b)\r\n s=m_logins.copy()\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n log=str(input()).lower()\r\n for j in range(len(mas)):\r\n if mas[j]==log:\r\n con+=1\r\n break\r\nif con>=1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n \r\n", "s = input()\r\nn = int(input())\r\no0 = ['o','0','O']\r\nl1 = ['1','l','L','i','I']\r\nno= 0\r\nk = 0\r\nfor i in range(n):\r\n l = input()\r\n if len(s) == len(l):\r\n for i in range(len(l)):\r\n if s[i].upper() == l[i].upper() or (s[i] in o0 and l[i] in o0) or (s[i] in l1 and l[i] in l1):\r\n k+=1\r\n if k == len(s):\r\n no+=1\r\n k = 0\r\nif no == 0:\r\n print('Yes')\r\nelse:\r\n print('No')", "def low_rep(string):\n return string.lower().replace('o', '0').replace('l', '1').replace('i', '1')\n\n\nlogin = low_rep(input())\nn = int(input())\nflag = False\nfor i in range(n):\n tmp = low_rep(input())\n if (tmp == login):\n flag = True\nif flag:\n print(\"No\")\nelse:\n print(\"Yes\")", "new_login = input()\r\ncount_logins = int(input())\r\nlogins = [input() for i in range(count_logins)]\r\n\r\ndef cheсk():\r\n return 'No' if any(formatting(new_login) == formatting(login) for login in logins) else 'Yes'\r\n\r\ndef formatting(string):\r\n string = string.lower()\r\n string = string.replace('o','0')\r\n string = string.replace('i','1')\r\n string = string.replace('l','1')\r\n return string\r\n \r\nprint(cheсk())", "def rep(data):\r\n data = data.replace(\"0\", \"@@@\")\r\n data = data.replace(\"o\", \"@@@\")\r\n data = data.replace(\"1\", \"!!!\")\r\n data = data.replace(\"l\", \"!!!\")\r\n data = data.replace(\"i\", \"!!!\")\r\n return data\r\n\r\n\r\nlogin_usr = rep(input().lower())\r\ncount_log = int(input())\r\ndata_log = list(map(rep, [input().lower() for i in range(count_log)]))\r\nfor data in data_log:\r\n if data == login_usr:\r\n count_log = 0\r\n break\r\n else:\r\n count_log = 1\r\nif count_log:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "def modify(char):\r\n char = char.lower()\r\n if char in '0O': return 'o'\r\n if char in '1li': return '1'\r\n return char\r\n\r\n\r\ndef modify_word(word):\r\n return ''.join([modify(x) for x in word])\r\n\r\n\r\ndef can_reg(already_exists, login):\r\n already_exists = [modify_word(x) for x in already_exists]\r\n return modify_word(login) not in already_exists\r\n\r\n\r\ndef test():\r\n assert can_reg(['2_wat', 'wat_1'], '1_wat') == True\r\n assert can_reg(['00', 'ooA', 'oOo'], '000') == False\r\n assert can_reg(['__i_', '_1_', 'I'], '_i_') == False\r\n assert can_reg(['2a0', 'La1', '1a0'], 'La0') == False\r\n assert can_reg(['aBc'], 'abc') == False\r\n assert can_reg(['LIL0', '0Ril'], '0Lil')\r\n assert can_reg([], '1') == True\r\n assert can_reg(['1', 'l'], 'i') == False\r\n assert can_reg(['1', 'l'], '0') == True\r\n\r\n\r\ndef run():\r\n login = input()\r\n n = int(input())\r\n already_exists = [input() for _ in range(n)]\r\n print(\"Yes\") if can_reg(already_exists, login) else print(\"No\")\r\n\r\n\r\nif __name__ == '__main__':\r\n # test()\r\n run()\r\n", "def normalize(s):\r\n\treturn s.lower().replace('o', '0').replace('l', '1').replace('i', '1')\r\n\r\ns = normalize(input())\r\nn = int(input())\r\nans = True\r\nfor _ in range(n):\r\n\ts2 = normalize(input())\r\n\tif s2 == s:\r\n\t\tans = False\r\n\t\tbreak\r\nif ans:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\r\n", "s = input().lower()\n\neq = [{'o', '0'}, {'1', 'l', 'i'}]\n\nn = int(input())\n\nfor _ in range(n):\n\ts2 = input().lower()\n\tif len(s) != len(s2): continue\n\tdiff = False\n\tfor i in range(len(s)):\n\t\tif s[i] == s2[i]:\n\t\t\tcontinue\n\t\tif s[i] in eq[0] and s2[i] in eq[0]:\n\t\t\tcontinue\n\t\tif s[i] in eq[1] and s2[i] in eq[1]:\n\t\t\tcontinue\n\t\tdiff = True\n\t\tbreak\n\tif not diff:\n\t\tprint('No')\n\t\texit()\n\nprint('Yes')", "def change(s):\r\n s = s.upper()\r\n s = s.replace('I','1')\r\n s = s.replace('L','1')\r\n s = s.replace('O','0')\r\n return s\r\n\r\nlogin = change(input())\r\n\r\ng = True\r\nn = int(input())\r\nfor i in range(n):\r\n x = change(input())\r\n if x == login: g = False\r\n\r\nif g:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "def transform(s):\r\n return s.upper().replace('O', '0').replace('I', '1').replace('L', '1')\r\n \r\nlogin = transform(input())\r\nreserved = [transform(input()) for i in range(int(input()))]\r\nprint (\"No\" if login in reserved else \"Yes\")", "def r(s):\r\n ss = s.lower()\r\n ss = ss.replace('i', '1')\r\n ss = ss.replace('l', '1')\r\n ss = ss.replace('o', '0')\r\n return ss\r\n\r\nlogin = r(input())\r\n\r\nn = int(input())\r\n\r\nAllowed = True\r\n\r\nfor i in range(n):\r\n s = r(input())\r\n if login == s:\r\n Allowed = False\r\n\r\nif Allowed:\r\n print('Yes')\r\nelse:\r\n print('No')", "s=str(input())\r\nn=int(input())\r\nfound = False\r\nfor i in range(n):\r\n a = str(input())\r\n if len(a) == len(s):\r\n similar = True\r\n for j in range(len(a)):\r\n ac = a[j].capitalize()\r\n sc = s[j].capitalize()\r\n if ac != sc:\r\n if ac in ('0', 'O') and sc in ('0', 'O') or ac in ('1', 'I', 'L') and sc in ('1', 'I', 'L'):\r\n similar = True\r\n else:\r\n similar = False\r\n break\r\n if similar:\r\n found = True\r\nif found:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "def check(s, t):\r\n cnt = 0\r\n a1 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n a2 = 'abcdefghijklmnopqrstuvwxyz'\r\n if len(s) != len(t):\r\n return False\r\n for i in range(len(s)):\r\n s1 = set(s[i])\r\n t1 = set(t[i])\r\n for elem in s1.copy():\r\n if elem in a1:\r\n s1.add(a2[a1.index(elem)])\r\n elif elem in a2:\r\n s1.add(a1[a2.index(elem)])\r\n for elem in t1.copy():\r\n if elem in a1:\r\n t1.add(a2[a1.index(elem)])\r\n elif elem in a2:\r\n t1.add(a1[a2.index(elem)])\r\n if \"O\" in s1:\r\n s1.add(\"0\")\r\n if \"0\" in s1:\r\n s1.add(\"O\")\r\n if \"O\" in t1:\r\n t1.add(\"0\")\r\n if \"0\" in t1:\r\n t1.add(\"O\")\r\n for elem in s1.copy():\r\n if elem in a1:\r\n s1.add(a2[a1.index(elem)])\r\n elif elem in a2:\r\n s1.add(a1[a2.index(elem)])\r\n for elem in t1.copy():\r\n if elem in a1:\r\n t1.add(a2[a1.index(elem)])\r\n elif elem in a2:\r\n t1.add(a1[a2.index(elem)])\r\n for e in \"1li\":\r\n if e in s1:\r\n s1.add('1')\r\n s1.add('l')\r\n s1.add('i')\r\n if e in t1:\r\n t1.add('1')\r\n t1.add('l')\r\n t1.add('i')\r\n for elem in s1.copy():\r\n if elem in a1:\r\n s1.add(a2[a1.index(elem)])\r\n elif elem in a2:\r\n s1.add(a1[a2.index(elem)])\r\n for elem in t1.copy():\r\n if elem in a1:\r\n t1.add(a2[a1.index(elem)])\r\n elif elem in a2:\r\n t1.add(a1[a2.index(elem)])\r\n if len(s1 & t1):\r\n cnt += 1\r\n return cnt == len(s)\r\n\r\ns = input()\r\nf = False\r\nfor i in range(int(input())):\r\n f |= check(s, input())\r\nif f:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "def decode(string):\r\n\treturn string.lower().replace(\"0\",\"o\").replace(\"1\",\"l\").replace(\"\",\"l\").replace(\"I\",\"l\").replace(\"i\",\"l\")\r\n\r\nori = decode(str(input()))\r\nn = int(input())\r\nfor _ in range(n):\r\n\tc = decode(str(input()))\r\n\tif c == ori:\r\n\t\tprint(\"No\")\r\n\t\texit()\r\nprint(\"Yes\")", "original = input()\nnum = int(input())\n\n\ndef check(s1, s2):\n s1 = s1.lower()\n s2 = s2.lower()\n\n if s1 == s2:\n return True\n\n s1 = s1.replace('o', '0')\n s2 = s2.replace('o', '0')\n\n if s1 == s2:\n return True\n\n s1 = s1.replace('i', '1').replace('l', '1')\n s2 = s2.replace('i', '1').replace('l', '1')\n\n if s1 == s2:\n return True\n\n return False\n\n\nfor _ in range(num):\n s = input()\n if check(s, original):\n print('No')\n break\nelse:\n print('Yes')\n", "from sys import stdin, stdout\r\nfrom random import randrange\r\n\r\n\r\ndef check(first, second):\r\n first = first.lower()\r\n second = second.lower()\r\n \r\n first = first.replace('0', 'o')\r\n second = second.replace('0', 'o')\r\n \r\n first = first.replace('1', 'l')\r\n second = second.replace('1', 'l')\r\n \r\n first = first.replace('i', 'l')\r\n second = second.replace('i', 'l') \r\n \r\n return first == second\r\n \r\n\r\n\r\ns = stdin.readline().strip()\r\nn = int(stdin.readline())\r\nlabel = 0\r\n\r\nfor i in range(n):\r\n f = stdin.readline().strip()\r\n \r\n if check(f, s):\r\n label = 1\r\n\r\n\r\nif label:\r\n stdout.write('No')\r\nelse:\r\n stdout.write('Yes')", "def f(c):\r\n for i in range(len(c)):\r\n if c[i] == '0' or c[i] == 'o':\r\n c[i] = 'O'\r\n if c[i] == 'l' or c[i] == 'I' or c[i] == 'i' or c[i] == 'L':\r\n c[i] = '1'\r\n if ord(c[i]) > 64 and ord(c[i]) < 91 and c[i] != 'O':\r\n v = ord(c[i])+(ord('a')-ord('A'))\r\n c[i] = chr(v)\r\n return c\r\nk = input()\r\nk = list(k)\r\nk = f(k)\r\nn = int(input())\r\nfor i in range(n):\r\n string = input()\r\n string = list(string)\r\n string = f(string)\r\n if k == string:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "s=input()\r\nb=False\r\ns=s.lower()\r\ns = s.replace('0', 'o')\r\ns = s.replace('l', '1')\r\ns = s.replace('i', '1')\r\nn=int(input())\r\nfor i in range(n):\r\n o=input().lower()\r\n o = o.replace('0', 'o')\r\n o = o.replace('l', '1')\r\n o = o.replace('i', '1')\r\n if s==o:\r\n b=True\r\n break\r\nif b:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "s = input().upper().replace('O', '0').replace('1', 'I').replace('L', 'I')\r\nn = int(input())\r\nfor _ in range(n):\r\n if input().upper().replace('O', '0').replace('1', 'I').replace('L', 'I') == s:\r\n print('No')\r\n exit()\r\nprint('Yes')", "def modify(s):\n s = s.upper()\n change = {'O': '0', 'I': '1', 'L': '1'}\n res = [change[c] if c in change else c for c in s]\n return str(res).lower()\n\nt = modify(input())\nn = int(input())\nused = set([modify(input()) for _ in range(n)])\nprint('Yes') if t not in used else print('No')\n ", "s = input()\r\nn = int(input())\r\n\r\nd = dict()\r\nd[\"i\"] = [\"l\", \"L\", \"1\", \"i\", \"I\"]\r\nd[\"I\"] = [\"l\", \"L\", \"1\", \"i\", \"I\"]\r\nd[\"1\"] = [\"l\", \"L\", \"1\", \"i\", \"I\"]\r\nd[\"l\"] = [\"l\", \"L\", \"1\", \"i\", \"I\"]\r\nd[\"L\"] = [\"l\", \"L\", \"1\", \"i\", \"I\"]\r\nd[\"o\"] = [\"o\", \"O\", \"0\"]\r\nd[\"O\"] = [\"o\", \"O\", \"0\"]\r\nd[\"0\"] = [\"o\", \"O\", \"0\"]\r\nt = 0\r\nfor i in range(n):\r\n a = input()\r\n p = 0\r\n if len(s) == len(a):\r\n for j in range(len(s)):\r\n count = 0\r\n if s[j] == a[j]:\r\n count = 1\r\n elif ord(s[j]) - ord(\"a\") == ord(a[j]) - ord(\"A\"):\r\n count = 1\r\n elif ord(s[j]) - ord(\"A\") == ord(a[j]) - ord(\"a\"):\r\n count = 1\r\n elif s[j] in d:\r\n if a[j] in d[s[j]]:\r\n count = 1\r\n if count == 1:\r\n p += 1\r\n if p == len(s):\r\n t = 1\r\nif t == 1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "def same(s, t):\r\n TMP_1 = {'o', '0'} \r\n TMP_2 = {'1', 'l', 'i'}\r\n \r\n if len(s) != len(t):\r\n return False\r\n \r\n for sl, tl in zip(s.lower(), t.lower()):\r\n if sl == tl:\r\n continue\r\n elif sl in TMP_1 and tl in TMP_1:\r\n continue\r\n elif sl in TMP_2 and tl in TMP_2:\r\n continue\r\n else:\r\n return False\r\n \r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n new_login = input().strip()\r\n n = int(input())\r\n result = \"Yes\"\r\n \r\n for _ in range(n):\r\n old_login = input().strip()\r\n if same(new_login, old_login):\r\n result = \"No\"\r\n break\r\n \r\n print(result)\r\n", "def main():\r\n login = input()\r\n login = login.lower()\r\n login = login.replace('o', '0')\r\n login = login.replace('l', '1')\r\n login = login.replace('i', '1')\r\n n = int(input())\r\n for i in range(n):\r\n s = input()\r\n s = s.lower()\r\n s = s.replace('o', '0')\r\n s = s.replace('l', '1')\r\n s = s.replace('i', '1')\r\n if login == s:\r\n print('No')\r\n break\r\n else:\r\n print('Yes')\r\n\r\nmain()\r\n", "def tr(s):\r\n return s.lower().replace('o', '0').replace('l', '1').replace('i', '1')\r\n\r\ns = tr(input())\r\nn = int(input())\r\nss = set(tr(input()) for _ in range(n))\r\nprint('Yes' if s not in ss else 'No')", "def norm(s):\r\n return s.lower().translate(str.maketrans('oil', '011'))\r\n\r\nnew_name = norm(input().strip())\r\nn = int(input())\r\ndb = set(norm(input().strip()) for _ in range(n))\r\n\r\nprint('no' if new_name in db else 'yes')\r\n", "def new(s):\n s = s.lower()\n for i in range(len(s)):\n if s[i] == 'o':\n s = s[:i] + '0' + (s[i+1:] if i != len(s)-1 else '')\n elif s[i] == 'i' or s[i] == 'l':\n s = s[:i] + '1' + (s[i+1:] if i != len(s)-1 else '')\n return s\n\n\nif __name__ == '__main__':\n _s = new(input())\n n = int(input())\n flag = True\n for i in range(n):\n p = new(input())\n flag = p != _s\n if not flag:\n break\n if flag:\n print('Yes')\n else:\n print('No')", "log=str(input())\r\nlog1=''\r\nfor i in range(0,len(log)):\r\n if (log[i]=='O')or (log[i]=='o'):\r\n log1+='0'\r\n elif (log[i]=='l') or (log[i]=='I') or (log[i]=='L') or (log[i]=='i'):\r\n log1+='1'\r\n else:\r\n log1+=log[i]\r\nlog1=log1.lower()\r\nn=int(input())\r\nk=0\r\nfor x in range(0,n):\r\n logt=''\r\n log=str(input())\r\n for i in range(0,len(log)):\r\n if (log[i]=='O') or (log[i]=='o'):\r\n logt+='0'\r\n elif (log[i]=='l') or (log[i]=='I') or (log[i]=='L') or (log[i]=='i'):\r\n logt+='1'\r\n else:\r\n logt+=log[i]\r\n logt=logt.lower()\r\n if logt==log1:\r\n k=1\r\n break\r\nif k==1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "s = list(input())\nn = int(input())\nls = []\nfor i in range(n):\n ls.append(list(input()))\ndef change(elem):\n if elem in {'1', 'i', 'I', 'l', 'L'}:\n elem = '['\n elif elem in {'0', 'o', 'O'}:\n elem = ']'\n else:\n elem = elem.upper()\n return elem\ndef check(one, two):\n leng = len(one)\n if leng != len(two):\n return False\n else:\n for i in range(leng):\n one[i] = change(one[i])\n two[i] = change(two[i])\n if one[i] != two[i]:\n return False\n return True\nflag = True\nfor i in range(n):\n if check(s, ls[i]):\n print('No')\n flag = False\n break\nif flag:\n print('Yes')", "def check(a, b):\r\n\tif len(a) != len(b):\r\n\t\treturn 0\r\n\tif a == b:\r\n\t\treturn 1\r\n\telse:\r\n\t\tfor i in range(len(a)):\r\n\t\t\tif a[i] != b[i] and not(a[i] in s1 and b[i] in s1 or a[i] in s2 and b[i] in s2):\r\n\t\t\t\treturn 0\r\n\t\treturn 1\r\n\t\t\t\t\t\r\nf = input().lower()\r\nn = int(input())\r\ns1 = set(['o', '0'])\r\ns2 = set(['1', 'l', 'i'])\r\ng = []\r\nfor i in range(n):\r\n\tg.append(input().lower())\r\nfor i in range(n):\r\n\tif check(f, g[i]):\r\n\t\tprint('No')\r\n\t\tbreak\r\nelse:\r\n\tprint('Yes')", "def reduction(c, depth = 0):\r\n\tif (c.isalpha()) and (c.isupper()):\r\n\t\tc = chr(ord('a') + ord(c) - ord('A'))\r\n\tif c == '0': c = 'o'\r\n\tif c in ['l', 'I', '1']: c = 'I'\r\n\treturn c if depth == 3 else reduction(c, depth + 1)\r\n\r\ndef check(s, t):\r\n\tn = len(s)\r\n\tif n != len(t):\r\n\t\treturn False\r\n\tfor i in range(n):\r\n\t\tif reduction(s[i]) != reduction(t[i]):\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ns = input()\r\nn = int(input())\r\nfor _ in range(n):\r\n\tt = input()\r\n\tif check(s, t):\r\n\t\tprint('No')\r\n\t\traise SystemExit\r\nprint('Yes')", "REPLACES = [\"0O\", \"O0\", \"1L\", \"L1\", \"1I\", \"I1\", \"IL\", \"LI\"]\n\nlogin = input().upper()\nfor i in range(int(input())):\n reserved = input().upper()\n if len(reserved) == len(login):\n for a, b in zip(login, reserved):\n if a != b and a + b not in REPLACES:\n break\n else:\n print(\"No\")\n break\nelse:\n print(\"Yes\")\n", "new_login=input()\r\nnew_login=new_login.upper()\r\nn=int(input())\r\nold_login=[]\r\n\r\nmn1={'1','I','L'}\r\nmn2={'0','O'}\r\n\r\nfor i in range(n):\r\n\told_login.append(input())\r\n\r\nindex=0\r\nfor i in range(n):\r\n\tif len(new_login)==len(old_login[i]):\r\n\t\told_login[i]=old_login[i].upper()\r\n\t\tindex2=1\r\n\t\tfor j in range(len(new_login)):\r\n\t\t\tif not((old_login[i][j]==new_login[j]) or ((old_login[i][j] in mn1) and (new_login[j] in mn1)) or ((old_login[i][j] in mn2) and (new_login[j] in mn2))):\r\n\t\t\t\tindex2=0;\r\n\t\t\t\tbreak\r\n\t\tif index2==1:\r\n\t\t\tindex=1\r\n\t\t\t\r\nif index==0:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t", "def main(input):\n read = lambda t: tuple(map(t, input().split()))\n rn = lambda: read(int)\n \n def norm(s):\n return s.upper().replace('O', '0').replace('L', '1').replace('I', '1')\n \n x = norm(input())\n l = [norm(input()) for i in range(rn()[0])]\n #print(l)\n #print(x)\n epta = x in l\n if epta:\n print(\"NO\")\n else:\n print(\"YES\")\n \nmain(input)\n", "def isBad(c1, c2):\r\n if c1 in ['o', '0'] and c2 in ['0', 'o']:\r\n return True\r\n\r\n if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:\r\n return True\r\n\r\n if c1 == c2.lower() or c2 == c1.lower():\r\n return True\r\n\r\n return False\r\n\r\n\r\ndef isSim(s1, s2):\r\n if len(s1) != len(s2):\r\n return False\r\n\r\n cnt = 0\r\n bad = 0\r\n\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n cnt += 1\r\n if isBad(s1[i].lower(), s2[i].lower()):\r\n bad += 1\r\n\r\n return cnt == bad\r\n\r\n\r\nlogin = input()\r\nn = int(input())\r\nfor i in range(n):\r\n l = input()\r\n if isSim(l, login):\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")", "def convert(x):\r\n return x.lower().replace('l','1').replace('i','1').replace('0','o')\r\n\r\nnewlogin = convert(input())\r\nisAvailabe = True\r\nfor i in range(int(input())):\r\n login = convert(input())\r\n if(newlogin == login):\r\n isAvailabe = False\r\nprint('Yes' if isAvailabe else 'No')", "newLogin = input()\r\nn = int(input())\r\nans = True\r\nfor i in range(n):\r\n oldLogin = input()\r\n if len(newLogin) != len(oldLogin):\r\n continue\r\n count = 0\r\n for j in range(len(newLogin)):\r\n if newLogin[j] in '0oO':\r\n if oldLogin[j] not in '0oO':\r\n break\r\n elif newLogin[j] in '1lLIi':\r\n if oldLogin[j] not in '1lLIi':\r\n break\r\n elif oldLogin[j].lower() != newLogin[j] and oldLogin[j].upper() != newLogin[j]:\r\n break\r\n count += 1\r\n if count == len(newLogin):\r\n ans = False\r\nif ans:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n ", "s,n=input(),int(input())\r\ns=s.replace('O','0')\r\ns=s.replace('o','0')\r\nfor _ in range(n):\r\n stp=''\r\n a=input()\r\n if len(a)==len(s):\r\n for i in range(len(a)):\r\n if a[i] in '1lILi' and s[i] in '1lILi':\r\n stp+=a[i]\r\n else:\r\n stp+=s[i]\r\n a=a.replace('O','0')\r\n a=a.replace('o','0')\r\n stp=stp.lower()\r\n a=a.lower()\r\n if a==stp:\r\n print('No')\r\n break\r\nelse: print('Yes')", "s=input()\r\nr=set()\r\ndef change(s,r):\r\n k = \"\"\r\n for i in s:\r\n if i==\"O\"or i==\"0\"or i==\"o\":\r\n k+=\"*\"\r\n elif i==\"1\"or i==\"L\" or i==\"l\" or i==\"I\" or i==\"i\":\r\n k+=\"?\"\r\n else:\r\n k+=i\r\n k=k.lower()\r\n if k in r:\r\n print(\"No\")\r\n exit()\r\n else:\r\n r.add(k)\r\nchange(s,r)\r\nfor _ in range(int(input())):\r\n s=input()\r\n change(s,r)\r\nprint(\"Yes\")", "login = input()\r\nn = int(input())\r\n\r\n\r\ndef is_similar(l, l2):\r\n g1 = 'O0o'\r\n g2 = 'lI1Li'\r\n if len(l) != len(l2):\r\n return False\r\n for i in range(len(l)):\r\n if l[i].lower() != l2[i].lower() and (not (l[i] in g1 and l2[i] in g1)) and (not (l[i] in g2 and l2[i] in g2)):\r\n return False\r\n return True\r\n\r\n\r\nflag = True\r\nfor _ in range(n):\r\n login2 = input()\r\n if is_similar(login, login2):\r\n flag = False\r\n break\r\nprint('Yes' if flag else 'No')\r\n", "def format(s):\n log = [i for i in s.lower()]\n for i in range(len(log)):\n if log[i] == 'i' or log[i] == 'l':\n log[i] = '1'\n if log[i] == 'o':\n log[i] = '0'\n return log\nlog = format(input())\n\nn = int(input())\nr = 0\nfor i in range(n):\n if format(input()) == log:\n r = 1\nif r:\n print(\"No\")\nelse:\n print(\"Yes\")", "def login(data=None):\r\n # For unittests\r\n if data is None:\r\n gen_data = input\r\n else:\r\n data_iter = iter(data.split('\\n'))\r\n gen_data = data_iter.__next__\r\n\r\n # Getting input\r\n wanted_login = gen_data()\r\n n = int(gen_data())\r\n similar = []\r\n for _ in range(n):\r\n similar.append(gen_data())\r\n\r\n # Check for similarities\r\n for s in similar:\r\n if check(wanted_login, s):\r\n return 'No'\r\n return 'Yes'\r\n\r\n\r\ndef check(wanted, current):\r\n \"\"\"Вернуть True если они похожи\"\"\"\r\n if len(wanted) != len(current):\r\n return False\r\n for i in range(len(wanted)):\r\n w_letter, c_letter = wanted[i], current[i]\r\n if not check_letter(w_letter, c_letter):\r\n return False\r\n return True\r\n\r\n\r\ndef check_letter(w: str, c: str):\r\n \"Вернуть True если w и c это похожие либо одинаковые символы\"\r\n if w == c:\r\n return True\r\n if w.isalpha() and c.isalpha() and w.upper() == c.upper():\r\n return True\r\n for i in identical:\r\n if w in i and c in i:\r\n return True\r\n\r\n\r\nidentical = (('0', 'O', 'o'), ('1', 'I', 'l', 'i', 'L'))\r\nif __name__ == '__main__':\r\n print(login())", "s = input().lower().replace(\"o\",\"0\").replace(\"l\", \"1\").replace(\"i\",\"1\")\r\nn=int(input())\r\nfor i in range(n):\r\n t = input().lower().replace(\"o\",\"0\").replace(\"l\", \"1\").replace(\"i\",\"1\")\r\n if t==s:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "def transformStr(s):\r\n return s.upper().replace(\"L\", \"1\").replace(\"I\", '1').replace(\"O\", '0')\r\n\r\nbase = transformStr(input())\r\nfor _ in range(int(input())):\r\n if transformStr(input()) == base:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")\r\n", "t = input()\r\ndef make_str(s):\r\n\tnew_s = s\r\n\tnew_s = new_s.lower()\r\n\tnew_s = new_s.replace('0','O')\r\n\tnew_s = new_s.replace('1','l')\r\n\tnew_s = new_s.replace('l', 'I')\r\n\tnew_s = new_s.replace('1','I')\r\n\tnew_s = new_s.lower()\r\n\treturn new_s\r\nt = make_str(t)\r\n#print(\"T: \", t)\r\nn = int(input())\r\nfor i in range(n):\r\n\tee = make_str(input())\r\n\t#print(ee)\r\n\tif (t == ee):\r\n\t\tprint(\"No\")\r\n\t\texit()\r\nprint(\"Yes\")", "def reform(str):\r\n\treturn str.lower().replace('0', 'o').replace('1', 'l').replace('i', 'l')\r\n\r\nlogin = reform(input())\r\ncount = int(input())\r\n\r\nfor i in range(count):\r\n\tif login == reform(input()):\r\n\t\tprint('No')\r\n\t\texit()\r\n\r\nprint('Yes')\r\n", "new_login = input().lower()\r\n\r\n\r\nnew_login = new_login.replace('o', '0')\r\nnew_login = new_login.replace('i', '1')\r\nnew_login = new_login.replace('l', '1')\r\n\r\n\r\nn = int(input())\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(input().lower())\r\n a[i] = a[i].replace('o', '0')\r\n a[i] = a[i].replace('i', '1')\r\n a[i] = a[i].replace('l', '1')\r\n \r\nresult = 0\r\n\r\nfor ai in a:\r\n if new_login == ai:\r\n result += 1\r\n \r\n \r\nif result > 0:\r\n ans = 'No'\r\nelse:\r\n ans = 'Yes'\r\n\r\nprint(ans)", "import re\n\nlogin = input()\nloginn = int(input())\nlogins = set()\n\nfor i in range(loginn):\n logins.add(re.sub(\"1|l\", \"i\", input().lower().replace(\"0\", \"o\")))\n\nif re.sub(\"1|l\", \"i\", login.lower().replace(\"0\", \"o\")) in logins:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "W1 = {'O', '0', 'o'}\r\nW2 = {'I', '1', 'l', 'L', 'i'}\r\ndef analysis(login):\r\n\tout = ''\r\n\tfor s in login:\r\n\t\tif s in W1:\r\n\t\t\tout += '0'\r\n\t\telif s in W2:\r\n\t\t\tout += '1'\r\n\t\telif s.isupper():\r\n\t\t\tout += s.lower()\r\n\t\telse:\r\n\t\t\tout += s\r\n\treturn out\r\n\r\n# f = open('A_input.txt', 'rt')\r\n\r\n# user = analysis(f.readline()[:-1])\r\n# n = int(f.readline())\r\nuser = analysis(input())\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n\t# login = analysis(f.readline().replace('\\n', ''))\r\n\tlogin = analysis(input())\r\n\tif user == login:\r\n\t\tprint('No')\r\n\t\tbreak\r\nelse:\r\n\tprint('Yes')\r\n\r\n# f.close()\r\n# input()", "def simplify(name):\r\n return name.lower().replace('0', 'o').replace('1', 'i').replace('l', 'i')\r\n\r\n\r\ns = simplify(input())\r\nans = 'Yes'\r\nfor i in range(int(input())):\r\n if simplify(input()) == s:\r\n ans = 'No'\r\nprint(ans)\r\n", "def change(s):\r\n s = s.lower()\r\n s = s.replace('o', '0')\r\n s = s.replace('l', '1')\r\n s = s.replace('i', '1')\r\n return s\r\n\r\nlog = change(input())\r\n\r\nnum = int(input())\r\nlogins = []\r\nfor i in range(0, num):\r\n logins.append(change(input()))\r\n\r\nif log in logins:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "def new_login_check():\r\n\r\n new_login = input()\r\n n = input()\r\n counter = 0\r\n while counter < int(n):\r\n inp = input()\r\n new_login = new_login + \" \" + inp\r\n counter += 1\r\n\r\n logins = new_login.split(\" \")\r\n\r\n logins_format = \"\"\r\n for element in logins:\r\n for i in element:\r\n if i == \"O\" or i == \"o\":\r\n i = \"0\"\r\n elif i == \"I\" or i == \"L\" or i == \"l\" or i == \"i\":\r\n i = \"1\"\r\n logins_format = logins_format + i\r\n logins_format = logins_format + \" \"\r\n\r\n new_logins = logins_format[:len(logins_format) - 1].split(\" \")\r\n\r\n counter = 1\r\n\r\n output = \"\"\r\n while counter <= int(n):\r\n if new_logins[0].lower() == new_logins[counter].lower():\r\n output = \"No\"\r\n break\r\n\r\n else:\r\n output = \"Yes\"\r\n counter += 1\r\n\r\n return output\r\n\r\ntest = new_login_check()\r\nprint(test)", "import re\r\ndef norm(s):\r\n s = s.lower()\r\n s = re.sub(\"i\",\"1\",re.sub(\"0\",\"o\",re.sub(\"l\",\"1\",s)))\r\n return s\r\n\r\n\r\ns = norm(input())\r\nfor i in range(int(input())):\r\n if norm(input())==s:\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\")", "s = input();\r\ndef normalize(s):\r\n s1 = \"\";\r\n for q in range(len(s)):\r\n if s[q] == \"0\" or s[q] == \"o\":\r\n s1 = s1 + \"O\";\r\n elif s[q] == \"l\" or s[q] == \"I\" or s[q] == \"i\" or s[q] == \"L\":\r\n s1 = s1 + \"1\";\r\n elif s[q].islower():\r\n s1 = s1 + chr((ord(s[q]) - 32));\r\n else:\r\n s1 = s1 + s[q];\r\n #print(s[q], s[q].isupper())\r\n return s1;\r\ns = normalize(s);\r\nn = int(input());\r\nf = 0;\r\nfor q in range(n):\r\n s2 = input();\r\n s2 = normalize(s2);\r\n #print(s2, s);\r\n if s2 == s:\r\n f = 1;\r\nif f:\r\n print(\"No\");\r\nelse:\r\n print(\"Yes\");", "import math\r\n\r\nfor tt in range(1):\r\n\r\n s = input().upper()\r\n n = int(input())\r\n a = [input().upper() for i in range(n)]\r\n\r\n ans = 'Yes'\r\n\r\n for i in range(n):\r\n if len(s) == len(a[i]):\r\n c = 0\r\n for j in range(len(a[i])):\r\n if (s[j] == a[i][j]) or (s[j] in {'0', 'O'} and a[i][j] in {'0', 'O'}) or (s[j] in {'1', 'L', 'I'} and a[i][j] in {'1', 'L', 'I'}):\r\n c+=1\r\n if c ==len(a[i]):\r\n ans='No'\r\n print(ans)\r\n", "import re, sys\r\n\r\n\r\ndef run():\r\n global pattern, logins\r\n for log in logins:\r\n if len(login) != len(log):\r\n continue\r\n if re.match(pattern, log):\r\n return \"No\"\r\n return \"Yes\"\r\n\r\npattern = r\"\"\r\nlogin = input().upper()\r\ncount = int(input())\r\nlogins = []\r\ni = [\"I\", \"L\", \"1\"]\r\n\r\nfor a in range(count):\r\n logins.append(input().upper())\r\n\r\nfor char in login:\r\n if char == '0' or char == 'O':\r\n char = \"[0O]\"\r\n else:\r\n if char in i:\r\n char = \"[IL1]\"\r\n pattern += char\r\n\r\nprint(run())", "s = input()\r\nn = int(input())\r\nflag = 1\r\ns = s.lower()\r\nfor i in range(n):\r\n z = []\r\n t = input()\r\n tlen = len(t)\r\n t = t.lower()\r\n for j in range(tlen):\r\n z.append(t[j])\r\n if tlen == len(s):\r\n if s==t:\r\n flag = 0\r\n if s.replace('0','o') == t.replace('0','o') or s.replace('o','0') == t.replace('o','0'):\r\n flag = 0\r\n if s.replace('1','l') == t.replace('1','l') or s.replace('l','1') == t.replace('l','1') or s.replace('1','i') == t.replace('1','i') or s.replace('i','1') == t.replace('i','1') or s.replace('i','l') == t.replace('i','l') or s.replace('l','i') == t.replace('l','i'):\r\n flag = 0\r\nif flag == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "def get(s, t):\r\n if len(s) != len(t):\r\n return False\r\n s = s.upper()\r\n t = t.upper()\r\n S1 = {'O', '0'}\r\n S2 = {'1', 'I', 'L'}\r\n for i in range(len(s)):\r\n if not (s[i].lower() == t[i].lower() or s[i] in S1 and t[i] in S1 or s[i] in S2 and t[i] in S2):\r\n return False\r\n return True\r\n\r\n\r\ns = input()\r\nn = int(input())\r\nres = 'Yes'\r\nfor i in range(n):\r\n if get(s, input()):\r\n res = 'No'\r\n break\r\nprint(res)\r\n\r\n", "def change_str(s):\r\n s = s.strip()\r\n s = s.lower()\r\n s = s.replace('o', '0')\r\n s = s.replace('l', '1')\r\n s = s.replace('i', '1')\r\n return s\r\n\r\ndef get_ans(s, count):\r\n for _ in range(count):\r\n t = change_str(input())\r\n if t == s:\r\n return \"No\"\r\n\r\n return \"Yes\"\r\n\r\ns = change_str(input())\r\ncount = int(input())\r\nprint(get_ans(s, count))\r\n\r\n\r\n", "def split(s):\r\n return [ch for ch in s]\r\n\r\n\r\ndef prepareLogin(s):\r\n for i in range(len(s)):\r\n ch = s[i]\r\n if ch == '0':\r\n s[i] = 'o'\r\n if ch == '1' or ch == 'i':\r\n s[i] = 'l'\r\n return s\r\n\r\n\r\nnewLogin = prepareLogin(split(input().lower()))\r\nn = int(input())\r\nisValid = True\r\nfor i in range(n):\r\n login = prepareLogin(split(input().lower()))\r\n if login == newLogin:\r\n isValid = False\r\n break\r\nif isValid:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def replace_letters(x):\r\n x = x.replace('0', 'O')\r\n x = x.replace('I', '1')\r\n x = x.replace('l', '1')\r\n x = x.replace('i', '1')\r\n x = x.replace('L', '1')\r\n return x\r\ns=input()\r\nn= int(input())\r\na=True\r\nfor i in range(n):\r\n t = input()\r\n if len(s) != len(t):\r\n continue\r\n t = replace_letters(t)\r\n s = replace_letters(s)\r\n if s.upper() == t.upper():\r\n a = False\r\n print('No')\r\n break\r\nif a:\r\n print('Yes')", "d = {'O': ['0'], '0': ['O'], '1': ['L', 'I'], 'L': ['1', 'I'], 'I': ['1', 'L']}\r\n\r\ns = input().upper()\r\nf = False\r\nfor _ in range(int(input())):\r\n m = input().upper()\r\n if len(m) == len(s):\r\n for i in range(len(s)):\r\n if (s[i] == m[i]) or (m[i] in d and s[i] in d[m[i]]):\r\n f = True\r\n else:\r\n f = False\r\n break\r\n if f:\r\n break\r\nif not f:\r\n print('Yes')\r\nelse:\r\n print('No')", "dic={\"l\":0,\"L\":0,\"1\":0,\"i\":0,\"I\":0,\"0\":1,\"o\":1,\"O\":1,\"a\":2,\"A\":2,\"b\":3,\"B\":3,\"c\":4,\"C\":4,\"d\":5,\"D\":5,\"e\":6,\"E\":6,\"f\":7,\"F\":7,\"g\":8,\"G\":8,\"h\":9,\"H\":9,\"j\":10,\"J\":10,\"k\":11,\"K\":11,\"m\":12,\"M\":12,\"n\":13,\"N\":13,\"p\":14,\"P\":14,\"q\":15,\"Q\":15,\"r\":16,\"R\":16,\"s\":17,\"S\":17,\"t\":18,\"T\":18,\"u\":19,\"U\":19,\"v\":20,\"V\":20,\"w\":21,\"W\":21,\"x\":22,\"X\":22,\"y\":23,\"Y\":23,\"z\":24,\"Z\":24,\"_\":\"_\",\"2\":112,\"3\":113,\"4\":114,\"5\":115,\"6\":116,\"7\":117,\"8\":118,\"9\":119}\r\nns=input()\r\na=[]\r\nfor i in range(int(input())):\r\n a.append(input())\r\nfor i in range(len(ns)):\r\n j=0\r\n n=len(a)\r\n while j<n:\r\n if len(ns)==len(a[j]) and dic[a[j][i]]==dic[ns[i]]:\r\n j+=1\r\n else:\r\n a.pop(j)\r\n n-=1\r\nif len(a)>0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "import sys\n\n\nequiv = {\n 'o': 1, 'O': 1, '0': 1,\n '1': 2, 'l': 2, 'L': 2, 'i': 2, 'I': 2\n}\n\n\ndef compare(c1, c2):\n if ord(c1) > ord(c2):\n c1, c2 = c2, c1\n\n e1, e2 = equiv.get(c1, 0), equiv.get(c2, 0)\n if e1 and e2 and e1 == e2:\n return True\n\n if 'A' <= c1 <= 'Z' and chr(ord(c1) - ord('A') + ord('a')) == c2:\n return True\n \n return c1 == c2\n\n\ndef cmps(s1, s2):\n if len(s1) != len(s2):\n return False\n\n for c1, c2 in zip(s1, s2):\n if not compare(c1, c2):\n return False\n\n return True\n\n\ns = input()\nn = int(input())\n\nfor _ in range(n):\n s_i = input()\n if cmps(s_i, s):\n print(\"No\")\n sys.exit(0)\n\nprint(\"Yes\")\n", "# python3\n# utf-8\n\ndef prettify(s):\n s = s.lower()\n s = s.replace('0', 'o')\n s = s.replace('1', 'l')\n s = s.replace('i', 'l')\n return s\n\ndef solve():\n login = prettify(input())\n n = int(input())\n users = set((prettify(input()) for i in range(n)))\n if login in users:\n print('No')\n else:\n print('Yes')\n\n\nt = 1 \n# t = int(input())\nfor _ in range(t):\n solve()\n", "a=input().lower()\r\nc='o0'\r\nd='i1l'\r\nprint('YNeos'[any(len(a)==len(x) and all(u==v or (u in c and v in c) or (u in d and v in d) for u,v in zip(a,x))for x in [input().lower() for _ in ' '*int(input())])::2])", "s = input()\r\nn = int(input())\r\nfflag = 0\r\nfor _ in range(n):\r\n s1 = input()\r\n if len(s) != len(s1):\r\n continue\r\n flag = 1\r\n for i in range(len(s)):\r\n if s[i] == s1[i] or s[i] == s1[i].swapcase():\r\n continue\r\n elif s[i] == '1' and (s1[i] == 'l' or s1[i] == 'I' or s1[i] == 'L' or s1[i] == 'i'):\r\n continue\r\n elif (s[i] == 'l' or s[i] == 'L') and (s1[i] == '1' or s1[i] == 'I' or s1[i] == 'i'):\r\n continue\r\n elif (s[i] == 'I' or s[i] == 'i') and (s1[i] == '1' or s1[i] == 'L' or s1[i] == 'l'):\r\n continue\r\n elif ((s[i] == 'O' or s[i] == 'o') and s1[i] == '0') or (s[i] == '0' and (s1[i] == 'O' or s1[i] == 'o')):\r\n continue\r\n else:\r\n flag = 0\r\n break\r\n if flag == 1:\r\n fflag = 1\r\n print(\"No\")\r\n break\r\nif fflag == 0:\r\n print(\"Yes\")", "def f(s):\n ans = ''\n for i in s:\n if i == 'l' or i == 'L' or i == 'i' or i == 'I':\n ans += '1'\n elif 'a' <= i <= 'z':\n ans += i.upper()\n elif i == '0':\n ans += 'O'\n else:\n ans += i\n return ans\n\n\ns = input()\ns = f(s)\nn = int(input())\na = []\nfor i in range(n):\n ss = input()\n a.append(f(ss))\nif s in a:\n print('No')\nelse:\n print('Yes')\n#print(a)", "cor = 'YES'\r\nnewlog=str(input())\r\nnewlog=newlog.lower()\r\nnum=int(input())\r\nmas = []\r\nfor i in range(num):\r\n mas.append(str(input()))\r\n if len(mas[i]) != len(newlog):\r\n continue\r\n a = mas[i].lower()\r\n if a == newlog:\r\n cor = 'NO'\r\n else:\r\n for j in range(len(newlog)):\r\n if a[j] == '0':\r\n a = a[:j] + 'o' + a[j+1:]\r\n if newlog[j] == '0':\r\n newlog = newlog[:j] + 'o' + newlog[j+1:]\r\n if a[j] == '1' or a[j] == 'i':\r\n a = a[:j] + 'l' + a[j+1:]\r\n if newlog[j] == '1' or newlog[j] == 'i':\r\n newlog = newlog[:j] + 'l' + newlog[j+1:] \r\n if a == newlog:\r\n cor = 'NO'\r\nprint (cor) \r\n \r\n", "def f(s):\r\n s=s.lower()\r\n for i in range(len(s)):\r\n if s[i]=='i' or s[i]=='l':\r\n s=s[:i]+'1'+s[i+1:]\r\n if s[i]=='o':\r\n s=s[:i]+'0'+s[i+1:]\r\n return s\r\n \r\ns=input()\r\ns=f(s)\r\nflag=True\r\nn=int(input())\r\nfor i in range(n):\r\n t=input()\r\n t=f(t)\r\n if s==t:\r\n flag=False\r\nif flag:\r\n print('Yes')\r\nelse:\r\n print('No')", "z=input().lower().replace(\"o\",\"0\").replace(\"i\",\"1\").replace(\"l\",\"1\")\r\nfor i in \" \"*int(input()):\r\n if z==input().lower().replace(\"o\",\"0\").replace(\"i\",\"1\").replace(\"l\",\"1\"):print(\"No\");break\r\nelse:print(\"Yes\")", "s = input()\r\nn = int(input())\r\na = []\r\nflag = True\r\nfor i in range(n):\r\n x = input()\r\n if len(s) == len(x):\r\n k = 0\r\n for j in range(len(s)):\r\n if s[j].lower() == x[j].lower():\r\n k += 1\r\n elif (s[j] == '0' or s[j] == 'o' or s[j] == 'O') and (x[j] == '0' or x[j] == 'o' or x[j] == 'O'):\r\n k += 1\r\n elif (s[j] == '1' or s[j] == 'l' or s[j] == 'L' or s[j] == 'i' or s[j] == 'I') and (x[j] == '1' or x[j] == 'l' or x[j] == 'L' or x[j] == 'i' or x[j] == 'I'):\r\n k += 1\r\n else:\r\n k = 0\r\n break\r\n if k == len(s):\r\n print(\"No\")\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"Yes\")\r\n\r\n\r\n", "s=input()\r\ndef f(a):\r\n a=a.lower()\r\n a=a.replace('o','0')\r\n a=a.replace('i','1')\r\n a=a.replace('l','1')\r\n return a\r\ns=f(s)\r\nq=int(input())\r\nb=True\r\nfor i in range(0,q):\r\n d=input()\r\n if s==f(d):\r\n b=False\r\nprint('Yes' if b else 'No')", "def normalize_login(login):\r\n return login \\\r\n .lower() \\\r\n .replace(\"o\", \"0\") \\\r\n .replace(\"i\", \"1\") \\\r\n .replace(\"l\", \"1\")\r\n\r\n\r\nnew_login = normalize_login(input())\r\nn = int(input())\r\nlogins = []\r\nfor i in range(0, n):\r\n login = normalize_login(input())\r\n logins.append(login)\r\n\r\nprint(\"No\" if new_login in logins else \"Yes\")\r\n", "user = input()\r\nuser = user.upper()\r\nuser = user.replace(\"O\", \"0\")\r\nuser = user.replace(\"L\", \"1\")\r\nuser = user.replace(\"I\", \"1\")\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nf = True\r\n#print(user)\r\nfor login in a:\r\n login = login.upper()\r\n login = login.replace(\"O\", \"0\")\r\n login = login.replace(\"L\", \"1\")\r\n login = login.replace(\"I\", \"1\")\r\n# print(login)\r\n if user == login:\r\n f = False\r\nif f:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "string = str(input(\"\"))\r\nstring = string.lower()\r\nstring = string.replace(\"0\",\"o\")\r\nstring = string.replace(\"i\",\"1\")\r\nstring = string.replace(\"l\",\"1\")\r\nlogin_array = []\r\ni = int(input())\r\nfor i in range(0,i):\r\n dump = input(\"\")\r\n dump = dump.lower()\r\n dump = dump.replace(\"0\",\"o\")\r\n dump = dump.replace(\"i\",\"1\")\r\n dump = dump.replace(\"l\",\"1\")\r\n login_array.append(dump)\r\nverify_key=0\r\nfor i in login_array:\r\n if i == string:\r\n verify_key += 1\r\nif (verify_key == 0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def change(login:str):\r\n return login.lower().replace('o', '0')\\\r\n .replace('i', '1').replace('l', '1')\r\n\r\n\r\nlogin = change(input())\r\nn = int(input())\r\nlogins = [change(input()) for i in range(n)]\r\nif login in logins:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "def make_hash(string):\n return string.lower().replace('o', '0').replace('l', '1').replace('i', '1')\n \ns = make_hash(input())\nn = int(input())\ne = []\ngood = True\nfor _ in range(n):\n t = input()\n if make_hash(t) == s:\n good = False\nprint(\"Yes\" if good else \"No\")\n", "def bukva(s):\r\n if (s>='A' and s<='Z') or (s>='a' and s<='z'):\r\n return True\r\n return False\r\ndef registr(s,s1):\r\n if bukva(s) and bukva(s1) and (abs(ord(s) - ord(s1)) == 32):\r\n return True\r\n return False\r\ndef null(s,s1):\r\n if (s==\"0\" or s==\"O\" or s==\"o\") and (s1==\"0\" or s1==\"o\" or s1=='O'):\r\n return True\r\n return False\r\ndef sim_i(s,s1):\r\n if ((s=='i') or (s==\"I\") or (s==\"l\") or (s=='L') or (s == \"1\")) and (s1=='i' or s1==\"I\" or s1==\"l\" or s1=='L' or s1 == \"1\"):\r\n return True\r\n return False\r\ns = input()\r\nn = int(input())\r\npodhodit = True\r\nfor i in range(n):\r\n s1 = input()\r\n if len(s)==len(s1) and (podhodit):\r\n podhodit_strok = False\r\n for j in range(len(s1)):\r\n if (s[j]!=s1[j]) :\r\n if registr(s[j],s1[j]):pass\r\n elif null(s[j],s1[j]):pass\r\n elif sim_i(s[j],s1[j]):pass\r\n else: podhodit_strok=True\r\n if not(podhodit_strok):\r\n podhodit = False\r\nif podhodit:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "want_login = input().lower()\r\nwant_login = want_login.replace('0', 'o').replace('l', '1').replace('i', '1')\r\nt = int(input())\r\nh = []\r\nfor i in range(t):\r\n log = input().lower()\r\n log = log.replace('0', 'o').replace('l', '1').replace('i', '1')\r\n h.append(log)\r\nif want_login in h:\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n", "q1 = set(['0', 'O'])\r\nq2 = set(['1', 'L', 'I'])\r\n\r\n\r\ndef qw(_s):\r\n _s = _s.upper()\r\n s = ''\r\n for e in _s:\r\n if e in q1:\r\n s += '0'\r\n elif e in q2:\r\n s += '1'\r\n else:\r\n s += e \r\n return s\r\n\r\n\r\n_s = input()\r\nn = int(input())\r\ns = qw(_s)\r\nbb = True\r\nfor i in range(n):\r\n _t = input()\r\n t = qw(_t)\r\n if s == t:\r\n bb = False\r\n break\r\nprint('Yes' if bb else 'No')", "#!/usr/bin/env python3\nimport sys\n\nans = 'Yes'\nlines = sys.stdin.readlines()\n\nfor i, line in enumerate(lines):\n # line = sys.stdin.readline()\n # print(i, len(line))\n line = line.lower()\n line = line.replace('o', '0')\n line = line.replace('i', '1').replace('l', '1')\n line = line.strip()\n # print(line)\n if i == 0:\n for ch in line:\n if ch not in 'abcdefghijklmnopqrstuvwxyz0123456789_':\n ans = 'No'\n # print('No')\n break\n login = line\n if i == 1:\n n = int(line)\n if i > 1:\n if login == line:\n ans = 'No'\n break\n\nprint(ans)\n", "import sys\r\nlogin = str(sys.stdin.readline())[:-1]\r\nlogin = login.lower().replace('0','o').replace('l','1').replace('i','1')\r\nn = int(sys.stdin.readline())\r\nans = 'Yes'\r\nfor i in range(n):\r\n login2 = str(sys.stdin.readline())[:-1]\r\n if login2.lower().replace('0','o').replace('l','1').replace('i','1')==login:\r\n ans = 'No'\r\n break\r\nprint(ans)\r\n", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\ndef check(x,y,d):\n if x == y: return True\n a = ord(x)\n b = ord(y)\n if min(a,b) >= 65 and abs(a-b) == 32: return True\n if d[a] == d[b]: return True\n return False\n\ndef fraud(a,b,d):\n if len(a) != len(b): return False\n for i in range(len(a)):\n if not check(a[i],b[i],d): return False\n return True\n\na = input()\nans = \"Yes\"\nd = list()\nfor u in range(200):\n d.append(u)\nd[48] = 989\nd[79] = 989\nd[111] = 989\nd[49] = 12345678\nd[76] = 12345678\nd[108] = 12345678\nd[73] = 12345678\nd[105] = 12345678\n\nfor i in range(readint()):\n if fraud(a,input(),d):\n ans = \"No\"\n break\nprint(ans)\n\n\t \t \t\t\t\t\t \t \t \t \t\t\t \t\t\t \t\t", "s = list(input())\r\nn = int(input())\r\n\r\nlst = []\r\nfor i in range(n):\r\n lst.append(list(input()))\r\n \r\ndef change(elem):\r\n if elem in {'1', 'i', 'I', 'l', 'L'}:\r\n elem = '['\r\n elif elem in {'0', 'o', 'O'}:\r\n elem = ']'\r\n else:\r\n elem = elem.upper()\r\n return elem\r\n\r\ndef check(one, two):\r\n if len(one) != len(two):\r\n return False\r\n for i in range(len(one)):\r\n one[i] = change(one[i])\r\n two[i] = change(two[i])\r\n if one[i] != two[i]:\r\n return False\r\n return True\r\n \r\nflag = True\r\nfor i in range(n):\r\n if check(s, lst[i]):\r\n flag = False\r\n break\r\n \r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "new_login = {input().lower().replace(\"l\", \"1\").replace(\"i\", \"1\").replace(\"o\", \"0\")}\r\nn = int(input())\r\nlogins = {input().lower().replace(\"l\", \"1\").replace(\"i\", \"1\").replace(\"o\", \"0\") for _ in range(n)}\r\nif new_login & logins:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "def normalize(s):\n return s.lower().replace('0', 'o').replace('1', 'i').replace('l', 'i')\n\ndef main():\n login = normalize(input())\n n = int(input())\n accept = True\n for _ in range(n):\n other_login = normalize(input())\n if login == other_login:\n accept = False\n print('Yes' if accept else 'No')\n\nif __name__ == '__main__':\n main()\n", "def standart(s):\r\n a = \"\"\r\n for i in s:\r\n if i == 'O' or i == 'o':\r\n a += '0'\r\n elif i == '1' or i == 'l' or i == 'I' or i == 'i' or i == 'L' :\r\n a += '1'\r\n elif i.isalpha():\r\n a += i.lower()\r\n else:\r\n a += i\r\n return a\r\n\r\na = standart(input())\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n if a == standart(s):\r\n print('No')\r\n exit(0)\r\nprint('Yes')", "from sys import stdin\nimport re\n\ndef chs(s,l):\n\ts = s.upper().replace('O','0')\n\treturn l.sub('1',s.rstrip('\\n'))\n\ndef main():\n\tl = re.compile(r'[LI]')\n\ts = chs(next(stdin),l)\n\tnext(stdin)\n\tfor line in stdin:\n\t\tif s == chs(line,l):\n\t\t\tprint('No')\n\t\t\tbreak\n\telse:\n\t\tprint('Yes')\n\nmain()\n", "a = input()\r\na = a.lower()\r\na = a.replace('i', '1')\r\na = a.replace('l', '1')\r\na = a.replace('o', '0')\r\nlogins = []\r\nfor _ in range(int(input())):\r\n b = input()\r\n b = b.lower()\r\n b = b.replace('i', '1')\r\n b = b.replace('l', '1')\r\n b = b.replace('o', '0')\r\n logins.append(b)\r\nprint([\"Yes\", \"No\"][a in logins])\r\n", "# ввод данных\r\ns = input()\r\nn = int(input())\r\nlogins = []\r\nwhile n > 0:\r\n logins.append(input())\r\n n -= 1\r\n\r\n\r\n# решение задачи\r\ns = s.lower()\r\nlogins = [login.lower() for login in logins]\r\n\r\nresult = 'Yes'\r\nfor login in logins:\r\n c1 = s.replace('o', '0') == login.replace('o', '0')\r\n c2 = s.replace('1', 'l') == login.replace('1', 'l')\r\n c3 = s.replace('i', 'l') == login.replace('i', 'l')\r\n c4 = s.replace('i', '1') == login.replace('i', '1')\r\n if any([c1, c2, c3, c4]):\r\n result = 'No'\r\n break\r\n\r\nprint(result)", "a = input()\r\nn = int(input())\r\nb = [[] for i in range(n)]\r\nd = []\r\nfor i in range(n):\r\n c = input()\r\n for j in range(len(c)):\r\n b[i].append(set())\r\n f = ord(c[j])\r\n f2 = c[j]\r\n if f >= 65 and f <= 90:\r\n b[i][j].add(f)\r\n f += 32\r\n b[i][j].add(f)\r\n elif f >= 97 and f <= 122:\r\n b[i][j].add(f)\r\n b[i][j].add(f - 32)\r\n if f == 105:\r\n b[i][j].add(49)\r\n b[i][j].add(108)\r\n b[i][j].add(76)\r\n if f == 108:\r\n b[i][j].add(49)\r\n b[i][j].add(105)\r\n b[i][j].add(73)\r\n if f >= 48 and f <= 58:\r\n b[i][j].add(f)\r\n if f == 49:\r\n b[i][j].add(105)\r\n b[i][j].add(73)\r\n b[i][j].add(108)\r\n b[i][j].add(76)\r\n if f == 48:\r\n b[i][j].add(111)\r\n b[i][j].add(79)\r\n if f == 95:\r\n b[i][j].add(95)\r\n if f == 111:\r\n b[i][j].add(48)\r\n\r\nk = 0\r\nfor i in range(n):\r\n d = 0\r\n for j in range(len(a)):\r\n if j < len(b[i]):\r\n if ord(a[j]) not in b[i][j]:\r\n d = 1\r\n if len(a) != len(b[i]):\r\n d = 1\r\n if d == 0:\r\n k = 1\r\n\r\nif k == 0:\r\n print('Yes')\r\nelse:\r\n print('No')", "def normalize(s):\r\n chs = {\r\n 'o': '0',\r\n 'i': '1',\r\n 'l': '1'\r\n }\r\n return ''.join(chs.get(ch, ch) for ch in s.lower())\r\n\r\n\r\ndef main():\r\n s1 = normalize(input())\r\n n = int(input())\r\n for i in range(n):\r\n s2 = input()\r\n if normalize(s2) == s1:\r\n return 'No'\r\n return 'Yes'\r\n\r\n\r\nprint(main())\r\n", "def f(c):\r\n\tc = c.lower()\r\n\tif (c == \"o\"):\r\n\t\treturn \"0\"\r\n\tif (c in \"il\"):\r\n\t\treturn \"1\"\r\n\treturn c\r\n\r\ndef lo(s):\r\n\treturn \"\".join([f(c) for c in s])\r\n\r\ndef main():\r\n\tlogin = lo(input())\r\n\tn = int(input())\r\n\tarr = [lo(input()) for i in range(n)]\r\n\tif login not in arr:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")\r\n\r\nmain()", "s = input().lower()\nl = len(s)\n\nn = int(input())\n\ndef similarChar(a, b):\n zero = ('0', 'o')\n one = ('1', 'l', 'i')\n return a == b or (a in zero and b in zero) or (a in one and b in one)\n\nfor _ in range(n):\n t = input().lower()\n\n if len(t) != l:\n continue\n\n for i in range(l):\n if not similarChar(s[i], t[i]):\n break \n else:\n print(\"No\")\n break\nelse:\n print(\"Yes\")\n", "from math import *\nfrom random import *\nfrom copy import *\nimport os, sys\n\ns = input()\nn = int(input())\nsim = {'o' : '0', '1' : 'l', 'l' : 'i', 'i' : '1'}\n\nfor i in range(n):\n now = input()\n\n if len(now) == len(s):\n eq = True\n\n for c1, c2 in zip(s, now):\n c1, c2 = c1.lower(), c2.lower()\n\n if c1 != c2 and (c1 not in sim or sim[c1] != c2) and (c2 not in sim or sim[c2] != c1):\n eq = False\n break\n\n if eq:\n print('No\\n')\n exit()\nprint('Yes')\n", "login = input().lower().replace('o','0').replace('1','l').replace('i','l')\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input().lower().replace('o','0').replace('1','l').replace('i','l'))\r\n\r\nif login in set(a):\r\n print('No')\r\nelse:\r\n print('Yes')", "def simliar(goal,s):\r\n return goal.lower().replace(\"0\",\"o\").replace(\"o\",\"0\").replace(\"1\",\"l\").replace(\"l\",\"1\").replace(\"i\",\"1\") == s.lower().replace(\"0\",\"o\").replace(\"o\",\"0\").replace(\"1\",\"l\").replace(\"l\",\"1\").replace(\"i\",\"1\")\r\ngoal = input()\r\nfor _ in range(int(input())):\r\n if simliar(goal,input()):\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "new_login = input()\r\nn = int(input())\r\n\r\ndef transform(login):\r\n return login.lower().replace('o', '0').replace('i', '1').replace('l', '1')\r\n\r\ntransformed = transform(new_login)\r\n\r\nfor i in range(n):\r\n login = input()\r\n if transform(login) == transformed:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "login = input()\r\nn = int(input())\r\nlistLogin = [\"\"]*n\r\nfor i in range(n):\r\n listLogin[i] = input()\r\nfor i in range(n):\r\n for j in range(len(login)):\r\n word = listLogin[i]\r\n if len(login) != len(word):\r\n break\r\n elif login[j] in {\"O\", \"0\", \"o\"} and word[j] in {\"O\", \"0\", \"o\"}:\r\n continue\r\n elif login[j] in {\"1\", \"l\", \"I\", \"i\", \"L\"} and word[j] in {\"1\", \"l\", \"I\", \"i\", \"L\"}:\r\n continue\r\n elif login[j].upper() == word[j].upper():\r\n continue\r\n else:\r\n break\r\n else:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "def normalize(st):\r\n\tst = list(st)\r\n\tn = len(st)\r\n\tfor i in range(n):\r\n\t\tif st[i] in ['i', 'I', 'l', 'L']:\r\n\t\t\tst[i] = '1'\r\n\t\telif st[i] in ['o', 'O']:\r\n\t\t\tst[i] = '0'\r\n\t\telif 'A' <= st[i] and st[i] <= 'Z':\r\n\t\t\tst[i] = st[i].lower()\r\n\treturn ''.join(st)\r\n\t\t\r\n\r\ndef solve(s, logins):\r\n\ts = normalize(s)\r\n\tlogins = [normalize(x) for x in logins]\r\n\treturn s not in logins\r\n\r\ndef main():\r\n\ts = input().strip()\r\n\tn = int(input())\r\n\tlogins = [input().strip() for _ in range(n)]\r\n\tif solve(s,logins):\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "def normalize(login: str):\r\n return login.lower().replace('0', 'o').replace('i', 'l').replace('1', 'l')\r\n\r\nwanted = normalize(input())\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n if normalize(input()) == wanted:\r\n print('No')\r\n exit(0)\r\n\r\nprint('Yes')", "def to_low(c):\r\n if \"A\" <= c <= \"Z\":\r\n return chr(ord(c) + ord(\"a\") - ord(\"A\"))\r\n return c\r\n\r\ndef f(s):\r\n a = list(s)\r\n m = len(a)\r\n for i in range(m):\r\n a[i] = to_low(a[i])\r\n for i in range(m):\r\n if a[i] in \"li\":\r\n a[i] = \"1\"\r\n if a[i] in \"o\":\r\n a[i] = \"0\"\r\n return \"\".join(a)\r\n\r\ns = f(input())\r\nn = int(input())\r\na = [f(input()) for i in range(n)]\r\nans = \"No\" if s in a else \"Yes\"\r\nprint(ans)", "def is_similar(one, two):\n one = one.lower()\n two = two.lower()\n one = one.replace('o', '0')\n one = one.replace('i', '1')\n one = one.replace('l', '1')\n two = two.replace('o', '0')\n two = two.replace('i', '1')\n two = two.replace('l', '1')\n return one == two\n\n\nhave_similar = False\nnewlogin = input()\ncounter = int(input())\nfor i in range(0, counter):\n login = input()\n if is_similar(newlogin, login):\n have_similar = True\n break\nif have_similar:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "def great_replace(str):\r\n return str.replace('o', '0').replace('l', '1').replace('i', '1')\r\n\r\ndef check(l1, l2):\r\n l1 = great_replace(l1)\r\n l2 = great_replace(l2)\r\n return l1 == l2\r\n\r\nlogin_to_check = input().lower()\r\nn = int(input())\r\n\r\nres = False\r\nfor i in range(0, n):\r\n curr_login = input().lower()\r\n if check(login_to_check, curr_login):\r\n res = True\r\nprint(\"Yes\") if res is False else print(\"No\")\r\n ", "def change(s):\r\n res = \"\"\r\n for i in range(len(s)):\r\n if s[i] == 'O' or s[i] == 'o':\r\n res += '0'\r\n continue\r\n if s[i] == 'l' or s[i] == 'L' or s[i] == 'i' or s[i] == 'I':\r\n res += '1'\r\n continue\r\n if s[i].isalpha() and s[i].isupper():\r\n res += s[i].lower()\r\n continue\r\n res += s[i]\r\n return res\r\n\r\n\r\na = change(input())\r\nn = int(input())\r\nfor i in range(n):\r\n b = change(input())\r\n if a == b:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n", "def izm(string):\r\n string = string.upper()\r\n string = string.replace('0', 'O')\r\n string = string.replace('1', 'I')\r\n string = string.replace('L', 'I')\r\n return(string)\r\n\r\nnew = (izm(input()))\r\nkol = int(input())\r\nnames = []\r\nfor i in range(kol):\r\n name = (izm(input()))\r\n names.append(name)\r\nif new in names:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "login = input()\r\n\r\nn = int(input())\r\n\r\nlogin_list = [input() for _ in range(n)]\r\n\r\ncanRegister = True\r\n\r\ntmp_login = login[:]\r\n\r\ntmp_login = tmp_login.lower().replace(\"o\", \"0\")\r\ntmp_login = tmp_login.replace(\"i\", \"1\")\r\ntmp_login = tmp_login.replace(\"l\", \"1\")\r\n\r\nfor current_login in login_list:\r\n current_login = current_login.lower().replace(\"o\", \"0\")\r\n current_login = current_login.replace(\"i\", \"1\")\r\n current_login = current_login.replace(\"l\", \"1\")\r\n\r\n if current_login == tmp_login:\r\n canRegister = False\r\n\r\nif canRegister:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def normalize(login):\r\n login = login.lower()\r\n login = login.replace('0', 'o').replace('1', 'l').replace('i', 'l')\r\n return login\r\n\r\n\r\ndef read_login():\r\n login = input()\r\n return normalize(login)\r\n\r\n\r\nnew_login = read_login()\r\nn = int(input())\r\nfor _ in range(n):\r\n login = read_login()\r\n if login == new_login:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\n", "#!/usr/bin/env python3\n\n\ndef are_same(a, b):\n a = a.lower()\n b = b.lower()\n if a == b:\n return True\n if a in {'o', '0'}:\n return b in {'o', '0'}\n if a in {'1', 'l', 'i'}:\n return b in {'1', 'l', 'i'}\n\n\ndef main():\n s = input()\n n = int(input())\n for _ in range(n):\n s1 = input()\n\n if len(s1) == len(s) and all(are_same(x1, x2) for x1, x2 in zip(s, s1)):\n print('No')\n return\n print('Yes')\n\n\nif __name__ == '__main__':\n main()\n", "def convert(string):\r\n s=[x for x in string]\r\n for i in range(len(string)):\r\n if s[i] == 'i' or s[i] == '1':\r\n s[i] = 'l'\r\n if s[i] == 'o':\r\n s[i] = '0'\r\n return ('').join(s)\r\n\r\ns=convert(input().lower())\r\nf=1\r\nn=int(input())\r\nfor i in range(n):\r\n temp=convert(input().lower())\r\n if temp==s:\r\n f=0\r\n break\r\nif f==1:\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")", "def tr(s):\r\n d = {'l':'1', 'i': '1', 'o': '0'}\r\n s = s.lower()\r\n s = ''.join([d[l] if l in d else l for l in s ])\r\n return s\r\n\r\ns = input()\r\ns = tr(s)\r\nans = 'Yes'\r\nn = int(input())\r\nfor i in range(n):\r\n ns = input()\r\n ns = tr(ns)\r\n if ns == s:\r\n ans = 'No'\r\nprint(ans)", "initial = input()\r\ncan_print = True\r\n\r\ndef normalize(input):\r\n result = input.lower()\r\n result = result.replace(\"i\", \"1\")\r\n result = result.replace(\"l\", \"1\")\r\n result = result.replace(\"o\", \"0\")\r\n return result\r\n\r\nnorm = normalize(initial)\r\n\r\nnumber_of_lines = input()\r\nfor i in range(0,int(number_of_lines)):\r\n newLine = input()\r\n if (normalize(newLine)==norm):\r\n can_print = False\r\n\r\nif can_print:\r\n print('Yes')\r\nelse:\r\n print('No')", "def redacting(s):\n s = s.lower()\n s = s.replace('o','0')\\\n .replace('1','l')\\\n .replace('i','l')\n return s\ns = input()\nn = int(input())\nb=0\ns = redacting(s)\nfor i in range(n):\n k = input()\n k = redacting(k)\n if s==k:\n b=1;\n break;\n\nif b==1:\n print(\"No\")\nelse:\n print(\"Yes\")", "def f(s,t):\r\n s=s.lower()\r\n t=t.lower()\r\n if len(s)!=len(t):\r\n return True\r\n for i in range(len(s)):\r\n if s[i]!=t[i]:\r\n w=[s[i],t[i]]\r\n w.sort()\r\n if w!=sorted(['o','0']) and w!=sorted(['i','l']) and w!=sorted(['i','1']) and w!=sorted(['l','1']):\r\n return True\r\n return False\r\ns=input()\r\nn=int(input())\r\nq=True\r\nfor i in range(n):\r\n t=input()\r\n q=q and f(s,t)\r\nif q:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "s=input()\r\nn=int(input())\r\nt=[]\r\na=['0','O','o']\r\nb=['1','i','l','L','I']\r\nflag='Yes'\r\nk=0\r\nfor i in range(n):\r\n t.append(input())\r\n if len(s)== len(t[i]) and flag!='No':\r\n for j in range(len(s)):\r\n if s[j] in a:\r\n if t[i][j] not in a and t[i][j].swapcase()!=s[j]:\r\n break\r\n elif s[j] in b:\r\n if t[i][j] not in b and t[i][j].swapcase()!=s[j]:\r\n break\r\n elif s[j]!=t[i][j] and s[j]!=t[i][j].swapcase():\r\n break\r\n k+=1\r\n if k == len(s):\r\n flag='No'\r\n else:\r\n k=0\r\nprint(flag)\r\n\r\n\r\n\r\n\r\n", "import sys\r\ns = input()\r\nn = int(input())\r\na = [input() for i in range(n)]\r\nbf = ''\r\ns = s.lower()\r\nfor i in range(len(a)):\r\n if len(a[i]) == len(s):\r\n a[i] = a[i].lower()\r\n for j in range(len(a[i])):\r\n if a[i][j] == s[j]:\r\n bf+=s[j]\r\n if a[i][j] == 'o' and s[j] == '0':\r\n bf+= '0'\r\n elif a[i][j] == '0' and s[j] == 'o':\r\n bf+= 'o'\r\n if a[i][j] == '1' and s[j] == 'l':\r\n bf+= 'l'\r\n elif a[i][j] == '1' and s[j] == 'I':\r\n bf+= 'I'\r\n elif a[i][j] == '1' and s[j] == 'i':\r\n bf+= 'i'\r\n elif a[i][j] == 'l' and s[j] == '1':\r\n bf+= '1'\r\n elif a[i][j] == 'l' and s[j] == 'I':\r\n bf+= 'I' \r\n elif a[i][j] == 'l' and s[j] == 'i':\r\n bf+= 'i'\r\n elif a[i][j] == 'I' and s[j] == '1':\r\n bf+= '1'\r\n elif a[i][j] == 'I' and s[j] == 'l':\r\n bf+= 'l'\r\n elif a[i][j] == 'i' and s[j] == '1':\r\n bf+= '1'\r\n elif a[i][j] == 'i' and s[j] == 'l':\r\n bf+= 'l'\r\n if bf == s:\r\n print('No')\r\n sys.exit(0)\r\n bf = ''\r\nprint('Yes')\r\n", "name=input().upper().replace(\"O\",\"0\").replace(\"1\",\"L\").replace(\"I\",\"L\")\nnum=int(input())\nexist=[]\nfor i in range(num):\n ans=input().upper().replace(\"O\",\"0\").replace(\"1\",\"L\").replace(\"I\",\"L\")\n exist+=[ans]\nif name in exist:\n print(\"No\")\nelse:\n print(\"Yes\")\n\n \t \t\t \t \t \t \t \t\t", "s=input()\r\nn=int(input())\r\na=[\"o\",\"O\",\"0\"]\r\nb=[\"I\",\"l\",\"1\",\"i\",\"L\"]\r\nflak=0\r\nfor i in range(n):\r\n h=input()\r\n e=ord(\"A\")-ord(\"a\")\r\n if len(h)==len(s):\r\n for i in range(len(s)):\r\n if s[i] in a and h[i] in a:\r\n continue\r\n elif s[i] in b and h[i] in b:\r\n continue\r\n elif s[i]==h[i]:\r\n continue\r\n elif ord(s[i])+e==ord(h[i]) or ord(h[i])+e==ord(s[i]):\r\n continue\r\n else:\r\n break\r\n else:\r\n print(\"No\")\r\n flak=1\r\nif flak==0:\r\n print(\"Yes\")", "def f(s):\r\n return s.lower().replace('1', 'l').replace('0', 'o').replace('i', 'l')\r\n\r\ns = f(input())\r\nn = int(input())\r\n\r\nl = {f(input()) for _ in range(n)}\r\n\r\nprint('No' if s in l else 'Yes')\r\n", "def change(a: str):\r\n a = a.upper()\r\n a = a.replace(\"O\", \"0\")\r\n a = a.replace(\"L\", \"1\")\r\n a = a.replace(\"I\", '1')\r\n\r\n return a\r\n\r\n#везде будет 0\r\n \r\n\r\na = change(input())\r\n\r\nflag = True\r\n\r\nfor _ in range(int(input())):\r\n b = change(input())\r\n\r\n if a == b:\r\n flag = False\r\n\r\nprint(\"Yes\" if flag else \"No\")", "def match(d, s1, s2):\r\n if len(s1) == len(s2):\r\n for i in range(len(s1)):\r\n if d[s1[i]] != d[s2[i]]:\r\n return False\r\n return True\r\n return False\r\n\r\nfrom string import ascii_lowercase as al\r\nfrom string import ascii_uppercase as au\r\nfrom string import digits as dg\r\nd = dict()\r\nd.update(zip(al, al))\r\nd.update(zip(au, al))\r\nd.update(zip(dg, dg))\r\nd.update(zip('_oOiIlL', '_001111'))\r\nr = True\r\ns = input()\r\nfor i in range(int(input())):\r\n p = input()\r\n if r:\r\n r = not match(d, s, p)\r\nprint('Yes' if r else 'No')\r\n", "def norm(s):\r\n d = ord('A') - ord('a')\r\n s1 = ''\r\n for i in range(len(s)):\r\n if ord('a') <= ord(s[i]) <= ord('z'):\r\n s1 += chr(ord(s[i]) + d)\r\n else:\r\n s1 += s[i]\r\n s = s1\r\n s = s.replace('O', '0')\r\n s = s.replace('L', '1')\r\n s = s.replace('I', '1')\r\n return s\r\n\r\ns = norm(input())\r\nn = int(input())\r\nok = True\r\nfor i in range(n):\r\n s1 = input()\r\n if norm(s1) == s:\r\n ok = False\r\n break\r\nif ok:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "loginIn = [i for i in input()]\r\nn = int(input())\r\nb = False\r\nfor i in range(n):\r\n login = [j for j in input()]\r\n if login.__len__() != loginIn.__len__():\r\n continue\r\n for j in range(loginIn.__len__()):\r\n if loginIn[j] == '0':\r\n loginIn[j] = 'O'\r\n if loginIn[j] == 'I' or loginIn[j] == 'l' or loginIn[j] == 'L' or loginIn[j] == 'i':\r\n loginIn[j] = '1'\r\n if login[j] == '0':\r\n login[j] = 'O'\r\n if login[j] == 'I' or login[j] == 'l' or login[j] == 'L' or login[j] == 'i':\r\n login[j] = '1'\r\n if ''.join(login).upper() == ''.join(loginIn).upper():\r\n print(\"No\")\r\n b = True\r\n break\r\nif not b:\r\n print(\"Yes\")", "new_log = input()\r\nnew_log = new_log.lower().replace('o', '0').replace('l', '1').replace('i', '1')\r\nn = int(input())\r\nans = False\r\nfor _ in range(n):\r\n log = input()\r\n if not ans:\r\n log = log.lower().replace('o', '0').replace('l', '1').replace('i', '1')\r\n if log == new_log:\r\n ans = True\r\nif ans:\r\n print('No')\r\nelse:\r\n print('Yes')", "table = str.maketrans({'A': 'a', 'B': 'b', 'C': 'c', 'D': 'd', 'E': 'e', 'F': 'f', 'G': 'g', 'H': 'h', 'J': 'j', 'K': 'k', 'M': 'm', 'N': 'n', 'O': 'o', 'P': 'p', 'Q': 'q', 'R': 'r', 'S': 's', 'T': 't', 'U': 'u', 'V': 'v', 'W': 'w', 'X': 'x', 'Y': 'y', 'Z': 'z', \"0\": \"o\", \"L\": \"1\", \"l\": \"1\", \"I\": \"1\", \"i\": \"1\"})\r\nprint(\"No\" if {input().translate(table)} & {input().translate(table) for _ in range(int(input()))} else \"Yes\")", "gl=input()\r\nvidO = ['o','0']\r\nvid1 = ['1','i','l']\r\ndli=len(gl)\r\nkol=int(input())\r\nvselog=[]\r\nres=1\r\nkek=0\r\nfor i in range(kol):\r\n dob=input()\r\n if len(dob) == dli:\r\n vselog.append(dob)\r\nfor i in vselog:\r\n kek=0\r\n for j in range(dli):\r\n provA=gl[j].lower()\r\n provB=i[j].lower()\r\n if (provA==provB) or ((provA in vidO) and (provB in vidO)) or ((provA in vid1) and (provB in vid1)): \r\n kek+=1\r\n continue\r\n else: continue\r\n if kek==dli:\r\n print('No')\r\n res=0\r\n break\r\n elif res ==0:break\r\nif res==1:\r\n print('Yes')\r\n \r\n \r\n\r\n \r\n \r\n", "def f():\r\n return input().lower().replace('0','o').replace('1','l').replace('i','l')\r\n\r\na = f()\r\nn = int(input())\r\nok = True\r\nfor i in range(n):\r\n if f() == a:\r\n ok = False\r\nif ok:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def reorg(r):\r\n r = r.replace(\"O\",\"0\")\r\n r = r.replace(\"l\",\"1\")\r\n r = r.replace(\"I\",\"1\")\r\n r = r.replace(\"o\",\"0\")\r\n r = r.replace(\"L\",\"1\")\r\n r = r.replace(\"i\",\"1\") \r\n r = r.lower()\r\n return r\r\n\r\ns = input()\r\nn = int(input())\r\nv = True\r\nfor i in range(n):\r\n s1 = input()\r\n if reorg(s) == reorg(s1):\r\n v = False\r\n break\r\nif v:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "import re\r\n\r\n\r\ndef minify(s):\r\n s = s.lower()\r\n s = re.sub(r\"o\", \"0\", s)\r\n s = re.sub(r\"[l|i]\", \"1\", s)\r\n return s\r\n\r\n\r\ndef main():\r\n login = minify(input())\r\n n = int(input())\r\n logins = list(map(minify, [input().strip() for x in range(n)]))\r\n print(\"No\" if login in logins else \"Yes\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = list(input().lower())\r\nfor i in range(len(s)):\r\n if s[i] in ['i', 'l']:\r\n s[i] = '1'\r\n if s[i] in ['o']:\r\n s[i] = '0'\r\nn = int(input())\r\nfor j in range(n):\r\n t = list(input().lower())\r\n for i in range(len(t)):\r\n if t[i] in ['i', 'l']:\r\n t[i] = '1'\r\n if t[i] in ['o']:\r\n t[i] = '0'\r\n if s == t:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\n\r\n \r\n", "need = input()\r\nn = int(input())\r\nlst = []\r\nfor i in range(n):\r\n lst.append(input())\r\n \r\nneed = need.lower()\r\nneed = need.replace('o', '0')\r\nneed = need.replace('l', '1')\r\nneed = need.replace('i', '1') \r\nfor i in range(n):\r\n lst[i] = lst[i].lower()\r\n lst[i] = lst[i].replace('o', '0')\r\n lst[i] = lst[i].replace('l', '1')\r\n lst[i] = lst[i].replace('i', '1')\r\n \r\nans = False \r\nfor elem in lst:\r\n ans |= (need == elem)\r\nif not ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s1 = input()\r\nabc = 'qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM'\r\nfor y in range(0, 26):\r\n s1 = s1.replace(abc[y], abc[y + 26])\r\ns1 = s1.replace(\"O\", \"0\")\r\ns1 = s1.replace(\"L\", \"1\")\r\ns1 = s1.replace(\"I\", \"1\")\r\nn=int(input())\r\nd=[]\r\nd.append(s1)\r\n\r\n\r\nfor i in range(0,n): \r\n s=input()\r\n for y in range(0,26):\r\n s = s.replace(abc[y],abc[y+26])\r\n s = s.replace(\"O\", \"0\")\r\n s = s.replace(\"L\",\"1\")\r\n s = s.replace(\"I\",\"1\")\r\n if not s in d: \r\n d.append(s)\r\nif len(d) != n + 1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "def normalize(s):\r\n res = []\r\n for c in s.lower():\r\n if c == 'i' or c == 'l':\r\n res.append('1')\r\n elif c == 'o':\r\n res.append('0')\r\n else:\r\n res.append(c)\r\n return ''.join(res)\r\n\r\n\r\ns = normalize(input().strip())\r\nn = int(input())\r\nfor i in range(n):\r\n s2 = normalize(input().strip())\r\n if s == s2:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')\r\n", "l=input()\r\nf=lambda x: x.lower().replace('0','o').replace('1','l').replace('i','l')\r\nprint(['Yes','No'][f(l)in map(f,[input()for r in range(int(input()))])])", "def checkEquals( a , b):\r\n if a == b :\r\n return True\r\n if a == b.upper() or b == a.upper():\r\n return True\r\n if (a == '0' or a == 'O' or a == 'o') and (b == '0' or b == 'O' or b == 'o') :\r\n return True\r\n if (a == '1' or a == 'i' or a == 'I' or a == 'l' or a == 'L') and (b == '1' or b == 'i' or b == 'I' or b == 'l' or b == 'L'):\r\n return True\r\n return False\r\n\r\ndef cheakName( name1 , name2):\r\n if len(name1) != len(name2) : return False\r\n for i in range(len(name1)):\r\n if not checkEquals(name1[i] , name2[i]):\r\n return False\r\n return True\r\n\r\nnewName = input()\r\nN = int(input())\r\nmass = []\r\nfor i in range(N):\r\n mass.append(input())\r\n\r\nflag = False\r\nfor name in mass :\r\n if cheakName(newName , name) : flag = True\r\nif flag : print('No')\r\nelse: print('Yes')", "def unify_login(login):\n login = login.lower()\n login = login.replace('0', 'o')\n login = login.replace('l', '1')\n login = login.replace('i', '1')\n return login\n\n\ns = unify_login(input())\nn = int(input())\n\nlogins = set()\n\nfor i in range(n):\n logins.add(unify_login(input()))\n\nif s in logins:\n print('No')\nelse:\n print('Yes')\n", "def liker(data):\r\n\tdata = data.upper()\r\n\tdata = data.replace('O', \"0\")\r\n\tdata = data.replace(\"L\", \"I\")\r\n\tdata = data.replace(\"I\", \"1\")\r\n\treturn data\r\n\r\nlogin = liker(input())\r\nnumOfLogins = int(input())\r\nloginsArray = [liker(input()) for x in range(numOfLogins)]\r\nif login in loginsArray:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "def tq(q):\n for i in range(len(q)):\n if q[i]==\"l\" or q[i]==\"i\":\n q[i]='1'\n elif q[i]==\"o\":\n q[i]='0'\n p=[]\n for i in q:\n p+=[i]\n return p\ns=input()\ns=s.lower()\ns=list(s)\ns=tq(s)\nn=int(input())\nwhile n>0:\n s1=input()\n s1=s1.lower()\n s1=list(s1)\n s1=tq(s1)\n if s==s1:\n print(\"No\")\n exit()\n n-=1\nprint(\"Yes\")\n", "new_login = input()\r\n\r\ndef is_similar(login1, login2):\r\n return login1.replace('O', '0').replace('o', '0').replace('l', '1').replace('L', '1').replace('I', '1').replace('i', '1').lower()==login2.replace('O', '0').replace('o', '0').replace('l', '1').replace('L', '1').replace('I', '1').replace('i', '1').lower()\r\n\r\nfor i in range(int(input())):\r\n if is_similar(input(), new_login):\r\n print(\"No\")\r\n quit()\r\n\r\nprint(\"Yes\")", "log = input()\r\nlog = log.lower()\r\nlog = log.replace('0', 'o')\r\nlog = log.replace('i','1' )\r\nlog = log.replace('l','1' )\r\na = int(input())\r\nlogs = set()\r\nfor i in range(a):\r\n s = input()\r\n s = s.lower()\r\n s = s.replace('0', 'o')\r\n s = s.replace('i','1' )\r\n s = s.replace('l','1' )\r\n logs.add(s)\r\nif log in logs: print('No')\r\nelse: print('Yes')\r\n", "def check_login(new_login, old_login):\r\n \r\n pack_0 = [\"O\", \"0\"]\r\n pack_1 = [\"I\", \"l\", \"1\"]\r\n \r\n if len(new_login) != len(old_login):\r\n return True\r\n \r\n for i in range(len(new_login)):\r\n if old_login[i] == \"i\" or old_login[i] == \"o\":\r\n old_login[i] = old_login[i].capitalize()\r\n \r\n if old_login[i] == \"L\":\r\n old_login[i] = \"l\"\r\n \r\n if new_login[i] == \"i\" or new_login[i] == \"o\":\r\n new_login[i] = new_login[i].capitalize()\r\n \r\n if new_login[i] == \"L\":\r\n new_login[i] = \"l\"\r\n \r\n if new_login[i].lower() == old_login[i].lower():\r\n continue\r\n \r\n if new_login[i] in pack_0 and old_login[i] in pack_0:\r\n continue\r\n \r\n if new_login[i] in pack_1 and old_login[i] in pack_1:\r\n continue\r\n \r\n return True\r\n \r\n return False\r\n\r\nlogin = list(input())\r\nn = int(input())\r\nexist_logins = []\r\nfor i in range(n):\r\n exist_logins.append(list(input()))\r\n\r\nans = \"Yes\"\r\nfor exist_login in exist_logins:\r\n if check_login(login, exist_login):\r\n continue\r\n else:\r\n ans = \"No\"\r\n break\r\nprint(ans)", "def transf(s):\n return s.lower().replace('o', '0').replace('l', '1').replace('i', '1')\n\ndef check():\n s = input()\n n = int(input())\n for i in range(n):\n l = input()\n if len(s) != len(l):\n continue\n if transf(s) == transf(l):\n return 'No'\n return 'Yes'\n\nprint(check())\n", "true = list(input())\r\nn = int(input())\r\nlst=[]\r\nfor i in range(n):\r\n z=list(input())\r\n lst.append(z)\r\n for j in range(len(z)):\r\n if 96<ord(z[j])<123:\r\n z[j]=chr(ord(z[j])-32)\r\n if z[j]==\"0\":\r\n z[j]=\"O\"\r\n if z[j]=='1' or z[j]==\"L\" or z[j]==\"l\" or z[j]==\"I\" or z[j]=='i':\r\n z[j]=\"L\"\r\n \r\n\r\n\r\nfor i in range(len(true)):\r\n if 96<ord(true[i])<123:\r\n true[i]=chr(ord(true[i])-32)\r\n if true[i]==\"0\":\r\n true[i]=\"O\"\r\n if true[i]=='1' or true[i]==\"L\" or true[i]==\"l\" or true[i]==\"I\" or true[i]==\"i\":\r\n true[i]=\"L\"\r\ns=0\r\nfor i in lst:\r\n if ''.join(i)==''.join(true):\r\n s+=1\r\nif s==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "new_login = input().upper().replace(\"O\", \"0\").replace(\"L\", \"1\").replace(\"I\", \"1\")\r\nlogins_count = int(input())\r\nfor i in range(logins_count):\r\n if new_login == input().upper().replace(\"O\", \"0\").replace(\"L\", \"1\").replace(\"I\", \"1\"):\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n", "s = input().lower()\r\nn = int(input())\r\nlogins = []\r\nfor i in range(0, n):\r\n logins.append(input().lower())\r\n\r\nnorm_logins = []\r\nnorm_login = \"\"\r\n\r\nfor letter in s:\r\n if letter == '0':\r\n norm_login += 'o'\r\n elif letter == 'l' or letter == 'i':\r\n norm_login += '1'\r\n else:\r\n norm_login += letter\r\n\r\nfor login in logins:\r\n word = \"\"\r\n for letter in login:\r\n if letter == '0':\r\n word += 'o'\r\n elif letter == 'l' or letter =='i':\r\n word += '1'\r\n else:\r\n word += letter\r\n norm_logins.append(word)\r\n\r\nfor login in norm_logins:\r\n flag = False\r\n if norm_login == login:\r\n print(\"No\")\r\n flag = True\r\n break\r\nif not flag:\r\n print(\"Yes\")\r\n\r\n", "newname = input()\r\nc = input()\r\nloginarr = list()\r\ndef checksimilarity(str1,str2):\r\n str1_1 =str1.replace(\"O\",\"|\").replace(\"0\",\"|\").replace(\"o\",\"|\").replace(\"1\",\"$\").replace(\"i\",\"$\").replace(\"I\",\"$\").replace(\"l\",\"$\").replace(\"L\",\"$\").lower()\r\n str2_1 =str2.replace(\"O\",\"|\").replace(\"0\",\"|\").replace(\"o\",\"|\").replace(\"1\",\"$\").replace(\"i\",\"$\").replace(\"I\",\"$\").replace(\"l\",\"$\").replace(\"L\",\"$\").lower()\r\n return 1 if str1_1 == str2_1 else 0\r\n \r\nfor i in range(int(c)):\r\n loginarr.append(checksimilarity(newname, input()))\r\nprint (\"No\" if(sum(loginarr) >0) else \"Yes\")", "def remake(s):\r\n s = s.lower()\r\n res = ''\r\n for i in s:\r\n if i == 'o':\r\n res += '0'\r\n elif i in ['l', 'i']:\r\n res += '1'\r\n else:\r\n res += i\r\n return res\r\n\r\nlogin = remake(input())\r\nn = int(input())\r\na = True\r\nfor i in range(n):\r\n xlog = input()\r\n if len(login) == len(xlog):\r\n if login == remake(xlog):\r\n a = False\r\n break\r\nif a:\r\n print('Yes')\r\nelse:\r\n print('No')", "def stand(log):\r\n \r\n log = log.lower()\r\n log = log.replace(\"0\",\"o\")\r\n log = log.replace(\"l\",\"1\") \r\n log = log.replace(\"i\",\"1\") \r\n return log\r\n \r\n\r\nlogin = input()\r\nkol = int(input())\r\nlogins = []\r\nfor i in range(kol):\r\n p = input()\r\n logins.append(p)\r\n\r\nlogin = stand(login)\r\n\r\nfor i in range(kol):\r\n logins[i] = stand(logins[i])\r\n \r\nfor i in range(kol):\r\n if(logins[i]==login):\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "import sys\nimport math\nfrom collections import defaultdict\n\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\ndef solve(test):\n\tlog = input().lower()\n\tl = len(log)\n\tn = int(input())\n\tfor i in range(n):\n\t\ts = input().lower()\n\t\tif len(s) == l:\n\t\t\tflag = 0\n\t\t\tfor i in range(l):\n\t\t\t\tif s[i] == log[i]:\n\t\t\t\t\tcontinue\n\t\t\t\telif s[i] in ('0', 'o') and log[i] in ('0', 'o'):\n\t\t\t\t\tcontinue\n\t\t\t\telif s[i] in ('l', 'i', '1') and log[i] in ('l', 'i', '1'):\n\t\t\t\t\tcontinue\n\t\t\t\telse:\n\t\t\t\t\tflag = 1\n\t\t\t\t\tbreak\n\n\t\t\tif flag:\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\tprint('No')\n\t\t\t\treturn\n\n\tprint('Yes')\n\n\n\nif __name__ == \"__main__\":\n\ttest_cases = 1\n\tfor t in range(1, test_cases + 1):\n\t\tsolve(t)\n\n\t \t \t \t \t\t \t\t\t\t\t \t\t \t\t\t\t", "s = input()\r\nn = int(input())\r\nf = True\r\n\r\ndef is_sim(s1, s2):\r\n if len(s1) != len(s2):\r\n return False\r\n for i in range(len(s1)):\r\n if (s1[i].lower() == s2[i].lower()) or s1[i] + s2[i] in ['O0', '0O', 'o0', '0o'] or (s1[i] in ['1', 'l', 'I', 'i', 'L'] and s2[i] in ['1', 'l', 'I', 'i', 'L']):\r\n pass\r\n else:\r\n return False\r\n return True\r\n \r\nfor i in range(n):\r\n t = input()\r\n if is_sim(s, t):\r\n f = False\r\nprint('Yes' if f else 'No')", "login = input()\r\nn = int(input())\r\n\r\ndef check(log1, log2):\r\n if len(log1) != len(log2):\r\n return False\r\n a1 = ['i', 'I', '1', 'l', 'L']\r\n a2 = ['o', '0', 'O']\r\n for i in range(len(log1)):\r\n #print(\"----------\", i, \"----------\")\r\n #print(log1[i], log2[i], log1[i].lower(), log2[i].lower())\r\n \r\n bool_log1_in_a1 = (log1[i] in a1)\r\n bool_log1_not_in_a1 = (not bool_log1_in_a1)\r\n bool_log2_in_a1 = (log2[i] in a1)\r\n bool_log2_not_in_a1 = (not bool_log2_in_a1)\r\n\r\n bool_log1_in_a2 = (log1[i] in a2)\r\n bool_log1_not_in_a2 = (not bool_log1_in_a2)\r\n bool_log2_in_a2 = (log2[i] in a2)\r\n bool_log2_not_in_a2 = (not bool_log2_in_a2)\r\n \r\n if (bool_log1_in_a1 and bool_log2_not_in_a1) or (bool_log1_not_in_a1 and bool_log2_in_a1):\r\n #print(\"IN 1st if\")\r\n return False\r\n elif (bool_log1_in_a2 and bool_log2_not_in_a2) or (bool_log1_not_in_a2 and bool_log2_in_a2):\r\n #print(\"IN 2nd if\")\r\n return False\r\n elif log1[i].lower() != log2[i].lower() and bool_log1_not_in_a1 and bool_log1_not_in_a2 and bool_log2_not_in_a1 and bool_log2_not_in_a2:\r\n #print(\"IN 3d if\")\r\n return False\r\n #print(\"--------------------\")\r\n \r\n return True\r\n\r\nflag = False\r\nfor i in range(n):\r\n login_2 = input()\r\n if check(login, login_2):\r\n flag = True\r\n #print(\"-------\", flag)\r\n\r\nif flag:\r\n print (\"No\") # Не может зарегистрировать пользователя\r\nelse:\r\n print (\"Yes\") # Может зарегистрировать пользователя\r\n", "\r\ndef main():\r\n s = input()\r\n n = int(input())\r\n b = ['I', '1', 'l', 'L', 'i']\r\n c = ['0', 'o', 'O']\r\n for i in range(n):\r\n d = input()\r\n if len(d) != len(s):\r\n continue\r\n for j in range(len(s)):\r\n if d[j].lower() == s[j].lower():\r\n continue\r\n if d[j] in b and s[j] in b:\r\n continue\r\n if d[j] in c and s[j] in c:\r\n continue\r\n break\r\n else:\r\n print('No')\r\n return\r\n\r\n print('Yes')\r\n\r\n\r\nmain()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "nick=input()\r\nnick=nick.upper()\r\nnick=nick.replace('1', 'I')\r\nnick=nick.replace('L', 'I')\r\nnick=nick.replace('0', 'O')\r\ns=len(nick)\r\nfl=True\r\nn=int(input())\r\nfor i in range(n):\r\n prev=input()\r\n prev=prev.upper()\r\n prev=prev.replace('1','I')\r\n prev=prev.replace('L','I')\r\n prev=prev.replace('0','O')\r\n if (prev==nick):\r\n fl=False\r\nif (fl==False):\r\n print('No')\r\nelse:\r\n print(\"Yes\")", "# https://algoprog.ru/material/pc928pA\r\n\r\ndef hashing(string):\r\n return string.lower().replace('o', '0').replace('l', '1').replace('i', '1')\r\n\r\n\r\nlogin = hashing(input())\r\nN = int(input())\r\nfor i in range(N):\r\n data = hashing(input())\r\n if data == login:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "def simplify_str(s):\n sa = list(s.upper())\n for i in range(len(sa)):\n if sa[i] == 'I' or sa[i] == 'L':\n sa[i] = '1'\n elif sa[i] == 'O':\n sa[i] = '0'\n\n return ''.join(sa)\n\ndef solve_task():\n t = simplify_str(input())\n n = int(input())\n\n for i in range(n):\n if t == simplify_str(input()):\n print('NO')\n return\n\n print('YES')\n\nsolve_task()\n\n", "import fileinput\n\ndef getname(name):\n name = name.upper()\n new_name = \"\"\n for char in list(name):\n if char == '0':\n char = 'O'\n elif char == '1':\n char = 'I'\n elif char == 'L':\n char = 'I'\n new_name += char\n return new_name\n\nreader = fileinput.input()\nnew_user = reader.readline()\nnew_user = getname(new_user)\nlines = reader.readline()\nlis = list()\nfor number in range(int(lines)):\n if getname(reader.readline()) == new_user:\n print('No')\n exit()\nprint('Yes')\n", "def convert(s):\r\n s = s.lower()\r\n s = s.replace(\"0\", \"o\")\r\n s = s.replace(\"1\", \"l\")\r\n s = s.replace(\"i\", \"l\")\r\n return s\r\ns = input()\r\ns = convert(s)\r\nn = int(input())\r\nfor i in range(n):\r\n s1 = convert(input())\r\n if s == s1:\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\")" ]

[ "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\nimport heapq\r\nn,m,k=map(int,sys.stdin.readline().split())\r\nmod=10**9+7\r\nans=pow(2,(n-1)*(m-1),mod)\r\nif m%2!=0 and n%2==0 and k==-1:\r\n ans=0\r\nif m%2==0 and n%2!=0 and k==-1:\r\n ans=0\r\nprint(ans)\r\n", "n,m,k=map(int,input().split())\r\nmod=10**9+7\r\nif n%2!=m%2 and k==-1:\r\n print(0)\r\nelse:\r\n print(pow(2,(n-1)*(m-1),mod))", "mod = 1e9 + 7\r\n\r\nn, m, k = map(int, input().split())\r\nif (n + m) % 2 == 1 and k == -1:\r\n print(0)\r\n exit()\r\na = (n - 1) * (m - 1)\r\nprint(pow(2, a, int(mod)))\r\n", "p = 10**9+7\r\n\r\ndef power(x, y, p):\r\n b = bin(y)[2:]\r\n start = x % p\r\n answer = 1\r\n for i in range(len(b)):\r\n if b[len(b)-1-i]=='1':\r\n answer = (start*answer) % p\r\n start = (start*start) % p\r\n return answer\r\n\r\ndef process(n, m, k):\r\n #product of all the elements = k**n = k**m\r\n if k==-1 and n % 2 != m % 2:\r\n return 0\r\n return power(2, (n-1)*(m-1), p)\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nprint(process(n, m, k))\r\n", "a,b,c=map(int,input().split())\r\nif a% 2 != b % 2 and c == -1:print(0)\r\nelse:print(pow(2,(a*b-(a+b-1)),1000000007))", "a,b,c=map(int,input().split())\r\nprint(pow(2,(b-1)*(a-1),1000000007) if c==1 or (a%2==b%2) else 0)", "n,m,k=map(int,input().split())\r\nprint(0 if((n+m)&1 and k<0) else pow(2,(n-1)*(m-1),int(1e9+7)))\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\nmod = pow(10, 9) + 7\r\nif k == -1 and (n - m) % 2:\r\n ans = 0\r\nelse:\r\n l = (n - 1) % (mod - 1) * (((m - 1) % (mod - 1))) % (mod - 1)\r\n ans = pow(2, l, mod)\r\nprint(ans)", "n, m, k = map(int, input().split())\r\nmod = 10**9 + 7\r\nif (k == -1) and (1 & (n ^ m)):\r\n print(0)\r\nelse:\r\n print(pow(2, (n - 1) * (m - 1) % (mod - 1), mod))", "n, m, k = map(int, input().split())\r\nif n % 2 != m % 2 and k == -1: print(0), exit(0)\r\nprint(pow(2, (n - 1) * (m - 1), 1000000007))", "n, m, k = map(int, input().split())\r\nif k == -1 and n % 2 != m % 2:\r\n\tprint(0)\r\nelse:\r\n\tprint(pow(2, (n - 1) * (m - 1), 10 ** 9 + 7))", "a,b,c=map(int,input().split(\" \"))\r\nif a%2!=b%2 and c==-1:\r\n print(0)\r\nelse:\r\n mod=int(1e9+7)\r\n print(pow(2,(a-1)*(b-1),mod))\r\n", "# python ftw\r\nn, m, k = map(int, input().split())\r\nif n % 2 != m % 2 and k == -1:\r\n print(0)\r\nelse:\r\n print(pow(2, (n - 1) * (m - 1), (int)(1e9 + 7)))", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=map(int,input().split())\r\nmod=10**9+7\r\nif k==-1 and n%2!=m%2:\r\n print(0)\r\nelse:\r\n print(pow(2,(n-1)*(m-1),mod))", "MOD = 1000000007\r\nN, M, K = map(int, input().split())\r\n\r\nif K == -1 and N%2 != M%2:\r\n print('0')\r\n exit(0)\r\n\r\nPOW = (N*M)-(N+M-1)\r\n\r\nprint(pow(int(2), int(POW), int(MOD)))\r\n", "n, m, k = input().split()\r\nn, m, k = int(n), int(m), int(k)\r\nif(k==-1 and n%2!=m%2): \r\n print(0)\r\nelse: \r\n print(pow(2, (m-1)*(n-1), 10**9+7))", "n, m, k = map(int, input().split())\r\nMOD = 1000000007\r\np = (n-1)*(m-1)\r\nif k < 0 and n%2 != m%2:\r\n\tr = 0\r\nelse:\r\n\tr = pow(2, p, MOD)\r\nprint(r)", "M=10**9+7\r\nn,m,k=[int(e) for e in input().split()]\r\nif n%2!=m%2 and k==-1:\r\n print(0)\r\nelse:\r\n print(pow(2,(n-1)*(m-1),M))" ]

[ "n = int(input())\r\nl = list(map(int,input().split()))\r\nsum = 0\r\nimport math\r\ndef check(n,i):\r\n for j in range(int(math.log2(n)),-1,-1):\r\n k = pow(2,j)+ i\r\n if k <= n-1:\r\n # print(j)\r\n # print(\"go\")\r\n return k\r\none = check(n,0) \r\nl[one]= l[0]+ l[one]\r\nprint(l[0])\r\nfor i in range(1,n-1):\r\n temp = check(n,i)\r\n l[temp]= l[i]+ l[temp]\r\n l[i] = l[i-1] +l[i]\r\n print(l[i])\r\n ", "def find(a):\r\n n=0\r\n while pow(2,n)<=a:\r\n n+=1\r\n return pow(2,n-1)\r\n\r\n\r\n \r\n \r\n\r\nm = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\nans=0\r\nn=0\r\nc=0\r\n\r\nfor i in range(m):\r\n ans+=l[i]\r\n if c<m-1:\r\n c+=1\r\n print(ans)\r\n n=int(find(m-(i+1)))\r\n l[i+n]+=l[i]\r\n \r\n \r\n\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\ninput = sys.stdin.readline\r\nfrom math import log2\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n-1):\r\n d = i + 2**int(log2(n-i-1))\r\n if d <= n-1:\r\n w[d] += w[i]\r\n c += w[i]\r\n print(c)", "def tp2(n):\r\n l = len(bin(n)) - 3\r\n l = \"1\" + \"0\" * l\r\n l = int(l, 2)\r\n if l == n: l //= 2\r\n return l\r\n\r\nN = int(input())\r\nL = list(map(int,input().split()))\r\nlast = 0\r\nfor i in range(N - 1):\r\n t2 = tp2(N - i)\r\n last += L[i]\r\n L[i + t2] += L[i]\r\n print(last)\r\n ", "from math import log2\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ns = 0\r\n\r\nfor k in range(n-1):\r\n t = int(log2(n-k-1))\r\n s += a[k]\r\n a[k + 2**t] += a[k]\r\n print(s)\r\n", "import math\n\ndef nearestTwoPow(x):\n res = 0\n\n while x!= 1:\n res+=1\n x = x//2\n \n return int(math.pow(2, res))\n\nn = int(input())\n\narr = list(map(int, input().split()))\n\nprev = 0\n\nfor i in range(n-1):\n\n res = prev+ arr[i]\n print(res)\n\n prev = res\n\n distFromLast = n-i-1\n\n nearestDump = i+ nearestTwoPow(distFromLast)\n\n arr[nearestDump]+= arr[i]", "from math import log,floor\nn = int(input())\na = list(map(int,input().split()))\nfor k in range(1,n):\n\tmoves=0\n\tb = a[:]\n\tfor i in range(1,k+1):\n\t\tx = log(n-i,2)\n\t\tj=floor(x)\n\t\twhile j>=0:\n\t\t\ty = i+(2**j)\n\t\t\tif y<=n:\n\t\t\t\tmoves += b[i-1]\n\t\t\t\tb[y-1] += b[i-1]\n\t\t\t\tb[i-1] = 0\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tj -= 1\n\tprint(moves)\n\t\t\t\t\n\t\t\t\t\n\t\t", "def main():\n from math import floor, log2\n n = int(input())\n numbers = [0] + [int(_) for _ in input().split()]\n moves = [0] * (n + 1)\n\n for i in range(1, n):\n t = floor(log2(n - i))\n j = i + 2 ** t\n moves[i] = numbers[i]\n numbers[j] += numbers[i]\n numbers[i] = 0\n\n for i in range(2, n):\n moves[i] += moves[i - 1]\n\n print('\\n'.join([str(moves[i]) for i in range(1, n)]))\n\n\nif __name__ == '__main__':\n main()\n", "cnt = lambda s, i: s.count(i)\r\nii = lambda: int(input())\r\nsi = lambda : input()\r\nf = lambda : map(int,input().split())\r\nil = lambda : list(map(int,input().split()))\r\nimport math\r\nn=ii()\r\nl=il()\r\ns=0\r\nfor i in range(n-1):\r\n x=math.floor(math.log(n-1-i,2))\r\n l[i+2**x]+=l[i]\r\n s+=l[i]\r\n print(s)\r\n", "from math import log2\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nif n!=1:\r\n c=0\r\n for i in range(n-1):\r\n c+=a[i]\r\n idx=i+2**(int(log2(n-1-i)))\r\n a[idx]+=a[i]\r\n print(c)", "n = int(input()) # no of numbers given\na = list(map(int, input().split())) #elements of the array\nres = 0\nfor i in range(n - 1): # the for loop for printing every numbers one by one\n t = 1\n while i + 2 * t < n: # trying to find the maximum value of t that can be used\n t *= 2\n \"\"\"\n Main logic is that, whatever operation we do, the current number would decrease, but the located at t distance would increase.\n So its good to have the number increases, the last index possible. This would help to reduce the operations on the other numbers\n which lies before the last number. The number of steps taken to reduce the current number is a[i]...also, a[i+t] has been increased by +1 a[i] times.\n \"\"\"\n res += a[i]\n a[i + t] += a[i]\n a[i] = 0\n print(res)", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nr=int(math.log2(n-1))+1\r\nans=0\r\nfor i in range(n-1):\r\n ans+=l[i]\r\n print(ans)\r\n for j in range(r-1,-1,-1):\r\n k=2**j\r\n if(i+k<n):\r\n l[i+k]+=l[i]\r\n break", "def high(k):\r\n n=1\r\n while(k>1):\r\n k=k//2\r\n n*=2\r\n else:\r\n return n\r\n \r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nc=[0]*(n-1)\r\nc[0]=A[0]\r\nA[0+high(n-1)]+=A[0]\r\nA[0]=0\r\nfor k in range(2,n):\r\n for i in range(k):\r\n if A[i]==0 and i!=k-1:\r\n continue\r\n else:\r\n c[k-1]=c[k-2]+A[i]\r\n A[i+high(n-1-i)]+=A[i]\r\n A[i]=0\r\nfor i in range(n-1):\r\n print(c[i])\r\n ", "case=int(input())\r\na = list(map(int, input().rstrip().split()))\r\nfinal=0\r\nfor i in range(0,case-1):\r\n t=0\r\n while i+2**(t + 1)<case:\r\n t+=1\r\n a[i+2**(t)]+=a[i]\r\n final+=a[i]\r\n a[i]=0\r\n print(final)\r\n", "import math\r\n\r\n\r\ndef calc_max_pow(i, n):\r\n return int(math.log(n - i, 2) // 1)\r\n\r\n\r\nn = int(input())\r\nsequence = input().split(' ')\r\nfor i in range(n):\r\n sequence[i] = int(sequence[i])\r\n\r\nmoves_before = 0\r\n\r\nfor i in range(n - 1):\r\n moves_before += sequence[i]\r\n print(moves_before)\r\n max_pow_to_move = calc_max_pow(i + 1, n)\r\n move_to = pow(2, max_pow_to_move) + i\r\n sequence[move_to] += sequence[i]\r\n", "def calc_max_power_of_two(x):\r\n t = 1\r\n while (2 ** t <= x):\r\n t += 1\r\n return 2 ** (t - 1)\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n counter_collector = []\r\n for i in range(len(a) - 1):\r\n x = i + 1\r\n dif = len(a) - x\r\n m = calc_max_power_of_two(dif)\r\n counter += a[i]\r\n a[i + m] += a[i]\r\n print(counter)\r\n\r\n\r\n\r\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", "n = int(input())\r\na = list(map(int,input().split()))\r\nrs = 0\r\nfor i in range(1,n):\r\n if a[i - 1]!=0:\r\n rs+=a[i - 1]\r\n print(rs)\r\n t = 0\r\n while(i+2**t <= n): t+=1\r\n t-=1\r\n a[int(i + 2**t) - 1] += a[i - 1]\r\n else:\r\n print(rs)\r\n\r\n", "from math import *\r\n\r\nt = int(input())\r\n\r\narray = []\r\n\r\ni = t\r\narray = list(map(int,input().split()))\r\nans = 0\r\nfor x in range(0,i-1):\r\n ans += array[x]\r\n diff = i - x -1\r\n power = int(log(diff,2))\r\n array[x+(2**power)]+=array[x]\r\n print(ans)", "import math as m \r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n\tp=m.floor(m.log(n-i-1,2))\r\n\ta[i+2**p]+=a[i]\r\n\tc+=a[i]\r\n\tprint(c)", "\r\n\r\ndef findP2(n):\r\n l = len(bin(n)) - 3\r\n l = \"1\" + \"0\" * l\r\n l = int(l, 2)\r\n if l == n: l //= 2\r\n return l\r\n\r\n\r\n\r\n\r\nN = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nlast = 0\r\nfor i in range(N - 1):\r\n tp2 = findP2(N - i)\r\n last += L[i]\r\n L[tp2 + i] += L[i]\r\n L[i] = 0\r\n print(last)\r\n \r\n", "import math\nn=int(input())\na=[int(x) for x in input().split()]\nsteps=0\nfor i in range(1, n):\n t=(int)(math.log2(n-i))\n steps+=a[i-1]\n a[i+(2**t)-1]+=a[i-1]\n a[i-1]=0\n print(steps)", "n=int(input())\r\na=list(map(int, input().split(\" \")))\r\ndef check(n):\r\n while n>1:\r\n n/=2\r\n if n==1:\r\n return True\r\n else:\r\n return False\r\ns=0\r\nfor j in range(n-1):\r\n s+=a[j]\r\n for i in range(n-1, -1, -1):\r\n if check(i-j):\r\n print(s)\r\n a[i]+=a[j]\r\n break\r\n\r\n", "# Required Modules\r\nfrom collections import deque\r\nfrom itertools import combinations\r\n\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\ndef string_input():\r\n return input()\r\ndef int_input():\r\n return int(input())\r\n\r\n# Predefined Function \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\ndef find_factor(x):\r\n factor = []\r\n while True:\r\n factor.append(x//2)\r\n if x==1 or x==2:\r\n break\r\n return factor\r\n\r\ndef create_pairs(arr):\r\n return list(combinations(arr, 2))\r\n\r\n\r\n\r\ndef solve():\r\n n = int_input()\r\n arr = list_input()\r\n res = 0\r\n for i in range(n-1):\r\n res+=arr[i]\r\n print(res)\r\n x = 1\r\n while (i+x*2<n):\r\n x*=2\r\n arr[i+x]+=arr[i]\r\nsolve()", "n = int(input())\r\naa = [int(x) for x in input().split()]\r\na = [0]+aa\r\nans = 0\r\nfor i in range(1,n):\r\n t = 1\r\n while i+t <= n:\r\n t*=2\r\n t /= 2\r\n tt = int(t)\r\n #print(tt)\r\n a[i+tt] += a[i]\r\n ans += a[i]\r\n print(ans)", "import math\nn = int(input())\n\nargs = input().split(\" \")\n\nseq = []\nfor x in args:\n seq.append(int(x))\n\nmove_numbers = 0\nfor i in range(n - 1):\n move_numbers = move_numbers + seq[i]\n t = int(math.log2(n - 1 - i))\n seq[i + 2 ** t] = seq[i + 2 ** t] + seq[i]\n seq[i] = 0\n\n print(move_numbers)", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\ncount = 0\r\nfor i in range(n-1):\r\n\tt = 0\r\n\twhile i+2**(t+1)<n:\r\n\t\tt+=1\r\n\ta[i+2**t]+= a[i]\r\n\tcount += a[i]\r\n\ta[i] = 0\r\n\tprint(count)", "import math\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nx, c = 0, math.log(2)\r\n\r\nfor i in range(n - 1):\r\n\tt = math.log(n - 1 - i) / c\r\n\t\r\n\tl[i + (2 ** int(t))] += l[i]\r\n\tx += l[i]\r\n\t\t\t\r\n\tl[i] = 0\t\t\r\n\tprint(x)", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n-1):\r\n j = i + 2**int(math.log(n-1-i, 2))\r\n c += a[i]\r\n a[j] += a[i]\r\n a[i] = 0\r\n print(c)\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(1,n):\r\n s += a[i-1]\r\n print(s)\r\n if a[i-1]==0:\r\n continue\r\n ind = i+(2**int(math.log(n-i,2)))-1\r\n a[ind]+=a[i-1]\r\n a[i-1] = 0\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nans=0\r\nfor i in range(n-1):\r\n t=0\r\n while i+2**(t+1)<n: t+=1\r\n a[i+2**t]+=a[i]\r\n ans+=a[i]\r\n a[i]=0\r\n print(ans)\r\n", "import math as mt\nn=int(input())\na=list(map(int,input().split()))\nc=0\nfor i in range(n-1):\n\tp=mt.floor(mt.log(n-i-1,2))\n\ta[i+2**p]+=a[i]\n\tc+=a[i]\n\tprint(c)", "import sys\r\nimport 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\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nprev = 0\r\nfor i in range(n-1):\r\n t = int( math.log( n-i-1 , 2 ) )\r\n prev = prev + lst[i]\r\n lst[2**t + i] += lst[i]\r\n print(prev)\r\n", "n = int(input())\r\nnums = list(map(int, input().split(' ')))\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n ans = ans + nums[i-1]\r\n t = 20\r\n while i+2**t > n: t -= 1\r\n nums[(i-1)+2**t] += nums[i-1]\r\n nums[i-1] = 0\r\n print(ans)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\n\r\ndef getmax(s, e):\r\n b = 1\r\n while s + b < e:\r\n b *= 2\r\n return s + b // 2\r\n\r\nm = int(input())\r\nn = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(m - 1):\r\n res += n[i]\r\n print(res)\r\n k = getmax(i, m)\r\n # print(i, k)\r\n n[k] += n[i]\r\n\r\n\r\n", "n = int(input())\r\na = [int(t) for t in input().split()]\r\n\r\nc = 0\r\nfor i in range(n - 1):\r\n if a[i] > 0:\r\n c += a[i]\r\n print(c)\r\n j = 0\r\n while 2 ** j + i < n:\r\n j += 1\r\n\r\n a[2 ** (j - 1) + i] += a[i]\r\n a[i] = 0\r\n else:\r\n print(c)", "__author__ = 'Esfandiar'\nfrom math import log2\nn = int(input())\na = list(map(int,input().split()))\nres = 0\nfor i in range(n-1):\n res+=a[i]\n print(res)\n y=n-(i+1)\n a[i+(2**(int(log2(y))))]+=a[i]\n\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ncnt = 0\r\nfor i in range(n-1):\r\n\tt = 0;\r\n\twhile (i+(1<<t)) < n:\r\n\t\tt+=1\r\n\t\r\n\tj = i + (1<<(t-1))\r\n\ta[j] += a[i]\r\n\tcnt += a[i]\r\n\tprint(cnt)\r\n\r\n", "from math import log2\r\n\r\nc = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n - 1):\r\n c += a[i]\r\n j = 2 ** int(log2(n - i-1)) + i\r\n a[j] += a[i]\r\n print(c)\r\n", "\r\nfrom math import log2\r\nimport sys\r\nInput = sys.stdin.readline\r\ntmp = 0\r\nN = int(Input())\r\na = list(map(int, Input().split()))\r\nfor i in range(N - 1):\r\n tmp += a[i]\r\n j = 2 ** int(log2(N - i - 1)) + i\r\n a[j] += a[i]\r\n print(tmp)\r\n", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nsum=0\r\nfor i in range(n-1):\r\n t=1\r\n while i+2*t<n:\r\n t*=2\r\n sum+=x[i]\r\n x[i+t]+=x[i]\r\n x[i]=0\r\n print(sum)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum=0\r\nfor i in range(n-1):\r\n t=0\r\n while (2 ** (t + 1) + i)<n:\r\n t=t+1\r\n a[i+2**t]+=a[i]\r\n sum=sum+a[i]\r\n a[i]=0\r\n print(sum)", "n = int(input())\na = list(map(int, input().split()))\nans = []\ncur = 0\nfor i in range(n - 1):\n if a[i] == 0:\n ans.append(cur)\n else:\n t = 0\n while i + 2 ** t < n:\n t += 1\n t -= 1\n cur += a[i]\n a[i + 2 ** t] += a[i]\n ans.append(cur)\nfor x in ans:\n print(x)", "n = int(input())\r\n\r\ndaf2 = []\r\n\r\nfor i in range(n):\r\n x = bin(i)[2:]\r\n daf2.append(x.count('1'))\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nfor i in range(n-1):\r\n total = 0\r\n lim_bawah = i+1\r\n lim_atas = n\r\n for j in range(0, i+1):\r\n total += min(daf2[i+1-j:n-j]) * daf[j]\r\n print(total)\r\n", "from math import *\r\n\r\nn = int(input())\r\na = [0] + list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n):\r\n ans += a[i]\r\n print(ans)\r\n if a[i] == 0:\r\n continue\r\n moveTo = i + 2**floor(log(n-i,2))\r\n a[moveTo] += a[i] ", "from math import log2, floor\n\nn, a = int(input()), [int(i) for i in input().split()]\nres = 0\nfor k in range(n - 1):\n p = floor(log2(n - 1 - k))\n res += a[k]\n a[k + 2 ** p] += a[k]\n print(res)\n", "n=int(input())\r\na=[*map(int,input().split())]\r\n# a.insert(0,0)\r\ns=0\r\nfrom math import log,floor\r\nfor i in range(n-1):\r\n p = 2**floor(log(n-1-i,2))\r\n # print(p)\r\n a[i+p] += a[i]\r\n s+=a[i]\r\n print(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jul 17 03:19:34 2020\r\n\r\n@author: thiva\r\n\"\"\"\r\n\r\n\r\nn = int(input())\r\nA = [int(s) for s in input().split(' ')]\r\n\r\npowers = [1]\r\nval = 1\r\nfor i in range(16):\r\n val = val*2\r\n powers.append(val)\r\n\r\ni = 0\r\nflag = 1\r\nwhile(flag == 1):\r\n if(n - powers[i] <= 0):\r\n flag = 0\r\n else:\r\n i += 1\r\n\r\nmax_power = powers[i - 1]\r\nmax_power_index = i-1\r\nans = []\r\nprev_moves = 0\r\n\r\nfor j in range(n-1):\r\n if(j + max_power <= n-1):\r\n print(A[j] + prev_moves)\r\n prev_moves += A[j]\r\n A[j + max_power] += A[j]\r\n else:\r\n max_power_index -= 1\r\n max_power = powers[max_power_index]\r\n print(A[j] + prev_moves)\r\n prev_moves += A[j]\r\n A[j + max_power] += A[j]", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nc=0\r\nfor i in range(1,n):\r\n\tp=(math.floor(math.log2(n-i)))\r\n\tl.append(p)\r\n\tc=c+a[i-1]\r\n\ta[i+2**p-1]=a[i+2**p-1]+a[i-1]\r\n\tprint(c)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nx = 0\r\n\r\nfor k in range(n-1):\r\n if A[k]:\r\n t = 0\r\n while k + 2**(t+1) < n:\r\n t += 1\r\n A[k+2**t] += A[k]\r\n x += A[k]\r\n print(x)", "import sys\r\nn = int(sys.stdin.readline().strip())\r\na = list(map(int, sys.stdin.readline().strip().split()))\r\nans = 0\r\n\r\nfor i in range (0, n-1):\r\n e = 0\r\n while i + 2**(e+1) < n:\r\n e = e + 1\r\n ans = ans + a[i]\r\n a[i + 2**e] = a[i + 2**e] + a[i]\r\n a[i] = 0\r\n print(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n-1):\r\n t = 0\r\n while(i+(2**(t+1))<n):\r\n t+=1\r\n a[i+(2**t)] += a[i]\r\n count += a[i]\r\n a[i] = 0\r\n print(count)\r\n \r\n \r\n", "import sys\r\nfrom math import floor\r\nfrom math import log\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ndict = {}\r\nfor i in range(n):\r\n dict[i] = arr[i]\r\ncount = 0\r\nfor i in range(n-1):\r\n dest = 2**floor(log(n-i-1,2))+i\r\n dict[dest] = dict[dest] + dict[i]\r\n count += dict[i]\r\n print(count)", "import math\r\ntot = int(input())\r\narr = list(map(int,input().split(\" \")))\r\np = tot - 1\r\np = int(math.log(p)/math.log(2))\r\nk = range(1,2**p + 1)\r\nct = 1\r\nprev = 0\r\nfor i in range(tot -1):\r\n print(prev + arr[i])\r\n prev = arr[i] + prev\r\n if(arr[i]!=0):\r\n p = int(math.log(tot - 1 - i)/math.log(2))\r\n arr[i + 2 ** p] += arr[i]\r\n\r\n# print(tp)\r\n# for i in range(1,tot):\r\n# print(tp)\r\n\r\n# for i in k:\r\n# print(sum(arr[:i]))\r\n# for i in range(2**p + 1,tot):\r\n# print(sum(arr[:i]) + sum(arr[:ct]))\r\n# ct += 1", "from math import inf,sqrt,floor,ceil\r\nfrom collections import Counter,defaultdict,deque\r\nfrom heapq import heappush as hpush,heappop as hpop,heapify as h\r\nfrom operator import itemgetter\r\nfrom itertools import product\r\nfrom bisect import bisect_left,bisect_right\r\n\r\n\r\n#for _ in range(int(input())):\r\nn=int(input())\r\na=list(map(int,input().split( )))\r\n\r\nans=0\r\nfor i in range(n-1):\r\n start=1\r\n while i+start*2<n:\r\n start*=2\r\n a[i+start]+=a[i]\r\n ans+=a[i]\r\n print(ans)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nimport math\r\nfor i in range(0,len(l)-1):\r\n while l[i] != 0:\r\n l[i] = l[i] - 1\r\n t = int((math.log(n-i-1,2)))\r\n l[i +2**t] = l[i +2**t] +1\r\n c = c + 1\r\n print(c)", "import math\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(n - 1):\r\n p = i + 2 ** math.floor(math.log2(n-(i+1)))\r\n count += l[i]\r\n l[p] += l[i]\r\n print(count)", "from math import log2, floor\n\nn, a = int(input()), [int(i) for i in input().split()]\nres = [0] * (n - 1)\nfor k in range(n - 1):\n if k > 0:\n res[k] += res[k - 1]\n res[k] += a[k]\n p = floor(log2(n - 1 - k))\n a[k + 2 ** p] += a[k]\nprint(*res, sep=\"\\n\")\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nz=[]\r\nsteps=0\r\nfor i in range(x-1):\r\n if y[i]>0:\r\n k=0\r\n while 2**k+i+1<=x:\r\n k+=1\r\n if 2**k+i+1>x:\r\n y[2**(k-1)+i]+=y[i]\r\n steps+=y[i]\r\n y[i]=0\r\n z.append(steps)\r\nprint(*z,sep='\\n')\r\n\r\n\r\n \r\n\r\n", "import math\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nfor k in range(n - 1):\r\n cnt = 0\r\n for i in range(k + 1):\r\n tmp = i\r\n while 2**(int(math.log2(n - 1 - tmp))) + tmp <= k:\r\n cnt += data[i]\r\n tmp = 2 ** (int(math.log2(n - 1 - tmp))) + tmp\r\n cnt += data[i]\r\n print(cnt)\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\nimport math as mt\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n\tp=mt.floor(mt.log(n-i-1,2))\r\n\ta[i+2**p]+=a[i]\r\n\tc+=a[i]\r\n\tprint(c)", "\r\nimport math\r\n\r\nn = int(input())\r\n\r\na = [int(s) for s in input().split(' ')]\r\n\r\ndef calculate(mylist):\r\n number_of_steps = []\r\n length = len(mylist)\r\n\r\n def getLastIndex(i,n):\r\n t = int(math.log(n - i,2))\r\n return i + 2 ** t\r\n\r\n for i in range(1,n):\r\n if(i == 1):\r\n number_of_steps.append(mylist[0])\r\n mylist[getLastIndex(1,length) - 1] += mylist[0]\r\n else:\r\n number_of_steps.append(number_of_steps[-1] + mylist[i-1])\r\n mylist[getLastIndex(i,length) - 1] += mylist[i-1]\r\n\r\n for i in number_of_steps:\r\n print(i)\r\n\r\ncalculate(a)", "from math import log2\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmoves = 0\r\n\r\nfor i in range(n - 1):\r\n\r\n if arr[i] != 0:\r\n arr[i + 2 ** int(log2(n-i-1))] += arr[i]\r\n moves += arr[i]\r\n arr[i] = 0\r\n print(moves)\r\n", "from math import log\r\n\r\nn = int(input())\r\nmas = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n - 1):\r\n value = mas[i]\r\n if value > 0:\r\n cnt += value\r\n if log(n - i - 1, 2) != int(log(n - i - 1, 2)):\r\n mas[i + 2 ** int(log(n - i - 1, 2))] += value\r\n\r\n print(cnt)", "from math import log2\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n - 1):\r\n t = int(log2(n - i - 1))\r\n j = (2 ** t) + i\r\n s += a[i]\r\n print(s)\r\n a[j] += a[i]\r\n", "import math\r\n\r\ndef num(i,n):\r\n\t\r\n\treturn math.floor(math.log2(n-i))\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nls = []\r\ntemp = 0\r\n\r\nfor i in range(n-1):\r\n\tif a[i] !=0:\r\n\t\ta[i+2**num(i,n-1)] += a[i]\r\n\t\ttemp += a[i]\r\n\t\ta[i] = 0\r\n\r\n\tls.append(temp)\t\r\n\r\nfor i in ls:\r\n\tprint(i)", "n = int(input())\narr = [int(x) for x in input().split()]\nnum_moves = 0\nfor i in range(n-1):\n\tindex_to_shift = 0\n\tfor pow2 in range(16, -1, -1):\n\t\tif(i + 2**pow2 < n):\n\t\t\tindex_to_shift = i + 2**pow2\n\t\t\tbreak\n\tarr[index_to_shift] += arr[i]\n\tnum_moves += arr[i]\n\tarr[i] = 0\n\tprint(num_moves)\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\ncount=0\r\n\r\nfor i in range(n-1):\r\n t=0\r\n while i+2**(t+1)<n:\r\n t+=1\r\n L[i+2**t]+=L[i]\r\n count+=L[i]\r\n L[i]=0\r\n print(count)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_uppercase\r\n\r\npower_of_two = lambda number: int(log2(number))\r\n\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\nnew_arr = arr[::]\r\nfor i, n in enumerate(arr[:-1], start=1):\r\n t = power_of_two(num-i)\r\n ind = i + 2**t -1\r\n new_arr[ind] += new_arr[i-1]\r\n\r\npresum = list(accumulate(new_arr))\r\npresum.pop()\r\nfor i in presum:\r\n print(i)\r\n\r\n\r\n", "from math import log\r\nn=int(input())\r\ns=list(map(int,input().split( )))\r\np=[]\r\nfor i in range(0,n-1):\r\n m=(log(n-1-i,2))//1\r\n p.append(i+2**m)\r\nfor k in range(1,n):\r\n g=0\r\n f=s[:]\r\n for i in range(0,k):\r\n g+=f[i]\r\n f[int(p[i])]+=f[i]\r\n print(g)\r\n \r\n", "from math import log\r\n\r\nN, SUM, X = int(input()), 0, list(map(int, input().split()))\r\nfor i in range(N - 1):\r\n Index = i + (2 ** (int(log(N - (i + 1), 2))))\r\n X[Index], SUM = X[Index] + X[i], SUM + X[i]\r\n print(SUM)\r\n\r\n# UB_CodeForces\r\n# Advice: Just remember this \" Your the most important person in the world \"\r\n# Location: Under the sunshine\r\n# Caption: After an hour I understand the problem and after half an hour I found this solution!!!!\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\ns=0\r\nfor i in range(n-1):\r\n p=1\r\n while i+(p<<1)<n:p<<=1\r\n a[i+p]+=a[i]\r\n print(s+a[i])\r\n s+=a[i]", "import math\r\nn = int(input())\r\n\r\nseq = list(map(int,input().split(' ')))\r\nc = 0\r\n\r\nfor k in range(n-1):\r\n t = math.floor(math.log2(n-k-1))\r\n seq[k+2**t] += seq[k]\r\n c += seq[k]\r\n print(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n-1):\r\n if a[i] != 0:\r\n for j in range(17,-1,-1):\r\n if i+2**j < n:\r\n a[i+2**j] += a[i]\r\n ans += a[i]\r\n a[i] = 0\r\n print(ans)", "n = int(input())\r\nif n:\r\n a = list(map(int, input().split()))\r\nb = []\r\nz = 0\r\nfor k in range(1, n):\r\n for i in range(k):\r\n st = n - i - 1\r\n if st >= 2:\r\n if st >= 4:\r\n if st >= 8:\r\n if st >= 16:\r\n if st >= 32:\r\n if st >= 64:\r\n if st >= 128:\r\n if st >= 256:\r\n if st >= 512:\r\n if st >= 1024:\r\n if st >= 2048:\r\n if st >= 4096:\r\n if st >= 8192:\r\n st = 13\r\n else:\r\n st = 12\r\n else:\r\n st = 11\r\n else:\r\n st = 10\r\n else:\r\n st = 9\r\n else:\r\n st = 8\r\n else:\r\n st = 7\r\n else:\r\n st = 6\r\n else:\r\n st = 5\r\n else:\r\n st = 4\r\n else:\r\n st = 3\r\n else:\r\n st = 2\r\n else:\r\n st = 1\r\n else:\r\n st = 0\r\n a[i + 2 ** st] += a[i]\r\n z += a[i]\r\n a[i] = 0\r\n b.append(z)\r\nprint(*b, sep='\\n')", "n = int(input())\r\narr = list(map(int,input().split()))\r\nres = 0\r\nfor i in range(n-1):\r\n res+=arr[i]\r\n print(res)\r\n x = 1\r\n while (i+x*2<n):\r\n x*=2\r\n arr[i+x]+=arr[i]", "from math import log2\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [a[i] for i in range(n)]\r\ns = 0\r\nd = {}\r\nfor i in range(n - 1):\r\n t = int(log2(n - i - 1))\r\n d.update({i: (2 ** t) + i})\r\n s += a[i]\r\n print(s)\r\n a[d[i]] += a[i]\r\n" ]

[ "n,a=int(input()),[]\r\nfor i in range(n):\r\n x = list(map(int, input().split(\" \")))\r\n if 1 not in x and 3 not in x:\r\n a.append(i+1)\r\nprint(len(a))\r\nprint(*sorted(a))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = []\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if not 1 in a and not 3 in a:\r\n ans.append(i + 1)\r\nm = len(ans)\r\nprint(m)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\ncollisions = []\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n collisions.append(row)\r\n\r\ngood_cars = set(range(n)) # initially all cars are good\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if collisions[i][j] == 1:\r\n good_cars.discard(i) # i-th car turned over, so it's not good\r\n elif collisions[i][j] == 2:\r\n good_cars.discard(j) # j-th car turned over, so it's not good\r\n elif collisions[i][j] == 3:\r\n good_cars.discard(i) # both cars turned over, so neither is good\r\n good_cars.discard(j)\r\n\r\ngood_cars = sorted(list(good_cars))\r\nprint(len(good_cars))\r\nprint(' '.join(str(car+1) for car in good_cars))\r\n", "n=int(input())\r\nm=[w+1 for w in range(n)]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(n):\r\n if l[j]==3:\r\n try:\r\n m.remove(i+1)\r\n except:\r\n pass\r\n try:\r\n m.remove(j+1)\r\n except:\r\n pass\r\n if l[j]==1:\r\n try:\r\n m.remove(i+1)\r\n except:\r\n pass\r\n if l[j]==2:\r\n try:\r\n m.remove(j+1)\r\n except:\r\n pass\r\nm.sort()\r\nprint(len(m))\r\nif not len(m)==0:\r\n print(*m)\r\n \r\n \r\n", "n = int(input())\r\nres = []\r\nnot_good = set()\r\nfor i in range(n):\r\n res.append(list(map(int,input().split())))\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if res[i][j] == 1:\r\n not_good.add(i+1)\r\n elif res[i][j] == 2:\r\n not_good.add(j+1)\r\n elif res[i][j] == 3:\r\n not_good.add(i+1)\r\n not_good.add(j+1)\r\n\r\nif len(not_good) >= n:\r\n print(0)\r\nelse:\r\n print(n - len(not_good))\r\n print(*[c for c in range(1,n+1) if c not in not_good])", "n = int(input())\nres = []\nfor i in range(n):\n if all(int(i) not in [1, 3] for i in input().split()):\n res.append(i + 1)\nprint(len(res))\nif res:\n print(*res)\n", "from collections import defaultdict\r\nd=defaultdict(lambda:0)\r\n\r\nn=int(input())\r\nx=[]\r\nfor i in range(n):\r\n x.append(list(map(int,input().split())))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]==1:\r\n d[i]+=1\r\n if x[i][j]==2:\r\n d[j]+=1\r\n if x[i][j]==3:\r\n d[i]+=1\r\n d[j]+=1\r\n\r\nans=[]\r\nfor i in range(n):\r\n if d[i]==0:\r\n ans.append(str(i+1))\r\nprint(len(ans))\r\nprint(' '.join(ans))", "# https://codeforces.com/problemset/problem/545/A\r\n\r\nn = int(input())\r\nA = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nbonnes_voitures = []\r\nfor i in range(n):\r\n A[i][i] = 0 # Simplification\r\n if all(map(lambda x: x % 2 == 0, A[i])):\r\n bonnes_voitures.append(i + 1)\r\n\r\nprint(len(bonnes_voitures))\r\nprint(' '.join(map(str, bonnes_voitures)))\r\n", "n = (int)(input())\r\na = [(list)(map(int , input().split())) for _ in range(n)]\r\nans = []\r\nfor _ in range(n) :\r\n val = 1\r\n for __ in range(n) :\r\n if a[_][__] == 1 or a[_][__] == 3 :\r\n val = 0\r\n if val > 0 : ans.append(_ + 1)\r\n\r\nprint(len(ans))\r\nfor _ in ans : print(_ , end = \" \")", "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 ind = []\r\n for i in range(n):\r\n r = IA()\r\n t = False\r\n for n in r:\r\n if n in [1,3]:\r\n t = True\r\n break\r\n if not t:\r\n ind.append(i+1)\r\n print(len(ind))\r\n print(*ind)\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\n\r\ncheck = [True for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if data[i][j] == 1:\r\n check[i] = False\r\n elif data[i][j] == 2:\r\n check[j] = False\r\n elif data[i][j] == 3:\r\n check[i] = False\r\n check[j] = False\r\n\r\ntmp = [i + 1 for i in range(n) if check[i]]\r\nprint(len(tmp))\r\nif tmp:\r\n print(*tmp)", "n = int(input())\r\ni = 0\r\ndata = []\r\nwhile i < n:\r\n\tdata.append([int(x) for x in input().split()])\r\n\ti += 1\r\ni = 0\r\nbad_cars = set()\r\nwhile i < n:\r\n\tj = 0\r\n\twhile j < n:\r\n\t\tif data[i][j] == 1:\r\n\t\t\tbad_cars.add(i + 1)\r\n\t\telif data[i][j] == 2:\r\n\t\t\tbad_cars.add(j + 1)\r\n\t\telif data[i][j] == 3:\r\n\t\t\tbad_cars.add(i + 1)\r\n\t\t\tbad_cars.add(j + 1)\r\n\t\tj += 1\r\n\r\n\ti += 1\r\ngood_cars = []\r\ni = 1\r\nwhile i < n + 1:\r\n\tif i not in bad_cars:\r\n\t\tgood_cars.append(str(i))\r\n\ti += 1\r\nprint(n - len(bad_cars))\r\nif n - len(bad_cars) != 0:\r\n\tprint(' '.join(good_cars))", "n = int(input())\r\n\r\narr = []\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n arr.append(row)\r\n\r\nmp = {}\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if arr[i][j] == 1:\r\n mp[i] = True\r\n continue\r\n if arr[i][j] == 2:\r\n mp[j] = True\r\n continue\r\n if arr[i][j] == 3:\r\n mp[i] = mp[j] = True\r\n\r\narrb = []\r\nfor i in range(n):\r\n if i not in mp:\r\n arrb.append(i+1)\r\n\r\nk = len(arrb)\r\nprint(k)\r\nprint(*arrb)\r\n", "n = int(input()) \r\nmatrix = [0] * n \r\ncounter =0 \r\nlistof_cars = \"\"\r\nfor i in range(n) : \r\n row = list(map(int, input().split())) \r\n if 1 not in row and 3 not in row : \r\n counter += 1 \r\n listof_cars += str(i+1) +\" \"\r\nprint(counter) \r\nprint(listof_cars) \r\n", "n = int(input()); l=[]\r\nfor i in range(n):\r\n\tk = list(map(int,input().split()))\r\n\tif 1 not in k and 3 not in k:l.append(i+1)\r\nprint(len(l));print(*l)", "n = int(input())\r\na = []\r\nc = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n flag = 1\r\n for j in range(n):\r\n if a[i][j] == 1 or a[i][j] == 3:\r\n flag = 0\r\n if flag:\r\n c.append(i + 1)\r\nif len(c) == 0:\r\n print(0)\r\nelse:\r\n print(len(c))\r\n for i in range(len(c)):\r\n print(c[i], end = \" \")\r\n ", "n = int(input())\r\nln = 0\r\nar = []\r\nfor i in range(n):\r\n *a, = map(int, input().split())\r\n if a.count(0) + a.count(2) == n - 1:\r\n ar.append(i + 1)\r\n ln += 1\r\nprint(ln)\r\nprint(*ar)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 23 16:09:09 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\nm = []\r\n\r\nind = []\r\nfor i in range(n):\r\n m.append(list(map(int,input().split())))\r\n\r\nfor i in m:\r\n if 1 not in i and 3 not in i:\r\n ind.append(m.index(i)+1)\r\nfor j in range(n):\r\n x = 0\r\n for i in range(n):\r\n if m[i][j]==2 or m[i][j]==3:\r\n x+=1\r\n if x==0:\r\n if j+1 not in ind:\r\n ind.remove(j+1)\r\nprint(len(ind))\r\nind = sorted(ind)\r\nfor i in ind:\r\n print(i,end=' ')\r\n \r\n \r\n\r\n \r\n " ]

[ "n = int(input().strip())\n\ndef C(n, r):\n c = 1\n for i in range(r):\n c = c * (n-i)\n for i in range(r):\n c = c // (i+1)\n return c\n\ndef calc(n, r):\n if n < 0: return 0\n return C(n+r-1, r-1)\n\nans = 0\n\n# case 1: d = 0\nfor i in range(5):\n ans += calc(n-i, 2)\n\nfor i in range(4):\n ans += calc(n-i, 2)\n\nfor i in range(5):\n for j in range(4):\n ans -= calc(n-i-j, 1)\n\n# case 2: d > 0\n# a < 5, b < 8\nfor i in range(5):\n for j in range(8):\n ans += calc(n-i-j-1, 2)\n\nprint (ans)\n", "\r\n# add 0,4,9,49\r\n# this is a stupid solution\r\n\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\n# do a stupid approach\r\ndp=[0]*150\r\ns=set([0])\r\nfor i in range(150):\r\n dp[i]=len(s)\r\n s2=set(s)\r\n for j in s:\r\n s2.add(j+4)\r\n s2.add(j+9)\r\n s2.add(j+49)\r\n s=s2\r\n\r\nif 0:\r\n for i in range(100):\r\n if dp[i+49]-dp[i]!=2401:\r\n print(i)\r\n\r\nif n<150: print(dp[n])\r\nelse:\r\n stuff=(n//49)\r\n while n-stuff*49+49<150: stuff-=1\r\n print(dp[n-stuff*49]+2401*stuff)", "from sys import setrecursionlimit\r\nsetrecursionlimit((10**9))\r\nn = int(input())\r\ns = set()\r\narr = [1,5,10,50]\r\ndef comb(num, digit):\r\n global n\r\n if digit == n:\r\n s.add(num)\r\n else:\r\n for i in range(4):\r\n comb(num+arr[i], digit+1)\r\n\r\nif n <= 12:\r\n comb(0, 0)\r\n print(len(s))\r\nelse:\r\n print(49*n-247)", "def answer(n):\n # brute-force\n sums = set()\n for d1 in range(n + 1):\n for d5 in range(n + 1 - d1):\n for d10 in range(n + 1 - d1 - d5):\n d50 = n - d1 - d5 - d10\n sums.add(d1 * 1 + d5 * 5 + d10 * 10 + d50 * 50)\n return len(sums)\n\nanswers = [answer(x) for x in range(31)]\n\nn = int(input())\nif n < len(answers):\n answer = answers[n]\nelse:\n # function is linear in the end\n growth = answers[30] - answers[29]\n answer = answers[29] + (n - 29) * growth\n\nprint(answer)", "import sys\r\n\r\nn = int(input())\r\n\r\nres = 0\r\nfor V in range (1, min (n, 8) + 1):\r\n for X in range (min (n - V, 4) + 1):\r\n res += n + 1 - V - X\r\n\r\nfor X in range (min (n, 8) + 1):\r\n res += n + 1 - X\r\n\r\nprint (res)", "#!/usr/bin/env python3\n\nn = int(input().strip())\n\nR1 = [4, 9, 49]\n# number of distinct number >=T represented using no more than k ROMES-1\ndef get_after_slow(k, T=0):\n\tdp = [(k + 1) for _ in range(49*k + 1)]\n\tdp[0] = 0\n\tfor i in range(1, 49*k + 1):\n\t\tfor R in R1:\n\t\t\tif i >= R:\n\t\t\t\tdp[i] = min(dp[i], dp[i - R] + 1)\n\treturn len(dp) - T - dp[T:].count(k + 1)\n\n\ndef get_fast(k):\n\tif k <= 20:\n\t\treturn get_after_slow(k)\n\telse:\n\t\treturn (k - 19)*49 - 12 + get_after_slow(20, 49)\n\nprint (get_fast(n))\n", "n=int(input())\r\nif n<=13:\r\n s=set()\r\n for i1 in range(n+1):\r\n for i5 in range(n-i1+1):\r\n for i10 in range(n-i1-i5+1):\r\n i50=n-i1-i5-i10\r\n s.add(i1+5*i5+10*i10+50*i50)\r\n print(len(s))\r\nelse:\r\n s=set()\r\n for i1 in range(12+1):\r\n for i5 in range(12-i1+1):\r\n for i10 in range(12-i1-i5+1):\r\n i50=12-i1-i5-i10\r\n s.add(i1+5*i5+10*i10+50*i50)\r\n y1=len(s)\r\n s=set()\r\n for i1 in range(13+1):\r\n for i5 in range(13-i1+1):\r\n for i10 in range(13-i1-i5+1):\r\n i50=13-i1-i5-i10\r\n s.add(i1+5*i5+10*i10+50*i50)\r\n y2=len(s)\r\n dy=y2-y1\r\n print(y2+dy*(n-13))", "n = int(input())\r\na = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\r\nif n < len(a):\r\n print(a[n])\r\nelse:\r\n print(a[11] + 49 * (n - 11))", "ans = [1, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341, 390, 439]\n\nn = int(input())\n\nif (n < 12):\n print(ans[n])\nelse:\n print(292 + (n - 11) * 49)\n", "a=[0,4,10,20,35,56,83,116,155,198,244]\nb=292\nn=int(input())\nif n<=10:\n\tprint(a[n])\nelse:\n\tprint(b+(n-11)*49)", "#\n# _____ _____ _____ \n# /\\ \\ /\\ \\ /\\ \\ \n# /::\\____\\ /::\\ \\ /::\\____\\ \n# /:::/ / /::::\\ \\ /:::/ / \n# /:::/ / /::::::\\ \\ /:::/ / \n# /:::/ / /:::/\\:::\\ \\ /:::/ / \n# /:::/____/ /:::/__\\:::\\ \\ /:::/____/ \n# /::::\\ \\ \\:::\\ \\:::\\ \\ /::::\\ \\ \n# /::::::\\ \\ _____ ___\\:::\\ \\:::\\ \\ /::::::\\ \\ _____ \n# /:::/\\:::\\ \\ /\\ \\ /\\ \\:::\\ \\:::\\ \\ /:::/\\:::\\ \\ /\\ \\ \n# /:::/ \\:::\\ /::\\____\\/::\\ \\:::\\ \\:::\\____\\/:::/ \\:::\\ /::\\____\\\n# \\::/ \\:::\\ /:::/ /\\:::\\ \\:::\\ \\::/ /\\::/ \\:::\\ /:::/ /\n# \\/____/ \\:::\\/:::/ / \\:::\\ \\:::\\ \\/____/ \\/____/ \\:::\\/:::/ / \n# \\::::::/ / \\:::\\ \\:::\\ \\ \\::::::/ / \n# \\::::/ / \\:::\\ \\:::\\____\\ \\::::/ / \n# /:::/ / \\:::\\ /:::/ / /:::/ / \n# /:::/ / \\:::\\/:::/ / /:::/ / \n# /:::/ / \\::::::/ / /:::/ / \n# /:::/ / \\::::/ / /:::/ / \n# \\::/ / \\::/ / \\::/ / \n# \\/____/ \\/____/ \\/____/ \n#\na = [0,4,10,20,35,56,83,116,155,198,244,292]\nn = int(input())\nif n <= 11:\n print(a[n])\nelse:\n print(n*49-247)\n", "def solve(n):\n s = set()\n for i in range(0, n + 1):\n for v in range(0, n - i + 1):\n for x in range(0, n - i - v + 1):\n l = n - i - v - x\n s.add(i + v * 5 + x * 10 + l * 50)\n return len(s)\n\n\nn = int(input())\nif n < 11:\n print(solve(n))\nelse:\n print(49 * n - 247)\n", "n = int(input())\n\nans = 0\nminv = [int(1e9)] * 200000\n\nminv[0] = 0\nfor i in range(49):\n for j in range(49):\n minv[(4*i+9*j) % 49] = min(minv[(4*i+9*j) % 49], i+j)\n\nfor i in range(49):\n if n >= minv[i]:\n ans += n-minv[i]+1\n\nprint(ans)", "a=[0,4,10,20,35,56,83,116,155,198,244]\r\nn=int(input())\r\nif n<=10: print(a[n])\r\nelse: print(292+(n-11)*49)", "n = int(input())\r\nl = [int(1e20) for i in range(49)]\r\nr = [int(-1e20) for i in range(49)]\r\nans = 0\r\nfor i in range(49):\r\n for j in range(49):\r\n t = ( i*10+j*5+(n-i-j) )%49\r\n l[t] = min(l[t], i*10+j*5+(n-i-j) )\r\n r[t] = max(r[t], i*10+j*5+(n-i-j)*50 )\r\nfor i in range(49):\r\n ans += (max(r[i]-l[i],-49) // 49) + 1\r\nprint(ans)", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\nn = int(input())\r\nif n < 12:\r\n print([1, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292][n])\r\nelse:\r\n print(n*50-n-247)\r\n", "a = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\r\nn = int(input())\r\nif n<11:\r\n print(a[n])\r\nelse:\r\n print((n - 11) * 49 + 292)", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nif n > 11:\r\n print(292 + 49 * (n - 11))\r\nelse:\r\n d = defaultdict(list)\r\n for L in range(n + 1):\r\n for X in range(n + 1 - L):\r\n for V in range(n + 1 - X - L):\r\n I = n - X - V - L\r\n s = L * 50 + X * 10 + V * 5 + I\r\n d[s].append((L, X, V, I))\r\n print(len(d))", "n = int(input())\r\n\r\nrec = [0,4,10,20,35,56,83,116,155,198,244,292,341]\r\n\r\nans = 0\r\n\r\nif n <= 12 : ans = rec[n]\r\nelse : ans = (n - 12) * 49 + rec[12]\r\n\r\nprint(ans)\r\n", "a = [4,10,20,35,56,83,116,155,198,244,292]\r\ndigits = input()\r\ndef result(digits):\r\n if int(digits) <= 11:\r\n return a[int(digits) - 1]\r\n return a[10] + (int(digits) - 11) * 49\r\nprint(result(digits))", "a=[0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\nn=int(input())\nif n<11:\n print(a[n])\nelse:\n print((n - 11) * 49 + 292)", "def ceildiv(a, b):\n return -(-a // b)\n\n\ndef test_ceildiv():\n assert ceildiv(6, 3) == 2\n assert ceildiv(7, 3) == 3\n assert ceildiv(5, 3) == 2\n\n\ndef brute_force(n, m):\n \"\"\"Count numbers in range [0; m] equal to 4a + 9b + 49c\n\n ...for some non-negative a, b and c such that (a + b + c) <= n\n \"\"\"\n numbers = set()\n\n max_c = min(n, m // 49)\n for c in range(max_c + 1):\n _49c = 49 * c\n max_b = min(n - c, (m - _49c) // 9, 48)\n for b in range(max_b + 1):\n _9b_49c = 9 * b + _49c\n max_a = min(n - b - c, (m - _9b_49c) // 4, 8)\n for a in range(max_a + 1):\n numbers.add(4 * a + _9b_49c)\n\n assert 0 in numbers\n for x in (4, 9, 49):\n if m // x <= n:\n assert m - (m % 49) in numbers\n return len(numbers)\n\n\ndef brute_force_range(n, l, u):\n \"\"\"Count numbers in range [l; u] equal to 4a + 9b + 49c\n\n ...for some non-negative a, b and c such that (a + b + c) <= n\n \"\"\"\n numbers = set()\n\n min_c = max(0, ceildiv(l - 9 * n, 40))\n max_c = min(n, u // 49)\n for c in range(min_c, max_c + 1):\n _49c = 49 * c\n min_b = max(0, ceildiv(l - 4 * n - 45 * c, 5))\n max_b = min(n - c, (u - _49c) // 9, 48)\n for b in range(min_b, max_b + 1):\n _9b_49c = 9 * b + _49c\n min_a = max(0, ceildiv(l - _9b_49c, 4))\n max_a = min(n - b - c, (u - _9b_49c) // 4, 8)\n for a in range(min_a, max_a + 1):\n numbers.add(4 * a + _9b_49c)\n\n if numbers:\n assert min(numbers) >= l\n assert max(numbers) <= u\n return len(numbers)\n\n\ndef test_brute_force_range():\n for (u, l) in ((60, 80), (104, 599), (200, 777)):\n for n in (10, 13, 15, 17, 20):\n assert brute_force_range(n, u, l) == brute_force(n, l) - brute_force(n, u - 1)\n\n\ndef solid_interval(n):\n assert n >= 18\n return 27, (49 * n - 807) + 1\n\n\ndef test_solid_interval():\n for n in 18, 19, 100, 200, 300, 1000, 5000:\n begin, end = solid_interval(n)\n assert brute_force_range(n, begin, end - 1) == end - begin\n\n\ndef main():\n n = int(input())\n\n if n < 18:\n result = brute_force(n, 49 * n) # naïve solution\n else:\n begin, end = solid_interval(n)\n assert begin < end < 49 * n\n result = sum((\n brute_force_range(n, 0, begin - 1),\n end - begin, # == brute_force_range(n, begin, end - 1)\n brute_force_range(n, end, 49 * n)\n ))\n\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)*y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,p,e=None):\r\n self.p=p\r\n self.e=e\r\n if self.e==None:\r\n self.mod=self.p\r\n else:\r\n self.mod=self.p**self.e\r\n\r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n if self.e==None:\r\n for i in range(1,N+1):\r\n self.factorial.append(self.factorial[-1]*i%self.mod)\r\n else:\r\n self.cnt=[0]*(N+1)\r\n for i in range(1,N+1):\r\n self.cnt[i]=self.cnt[i-1]\r\n ii=i\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.cnt[i]+=1\r\n self.factorial.append(self.factorial[-1]*ii%self.mod)\r\n self.factorial_inve=[None]*(N+1)\r\n self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n ii=i+1\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod\r\n\r\n def Fact(self,N):\r\n if N<0:\r\n return 0\r\n retu=self.factorial[N]\r\n if self.e!=None and self.cnt[N]:\r\n retu*=pow(self.p,self.cnt[N],self.mod)%self.mod\r\n retu%=self.mod\r\n return retu\r\n\r\n def Fact_Inve(self,N):\r\n if self.e!=None and self.cnt[N]:\r\n return None\r\n return self.factorial_inve[N]\r\n\r\n def Comb(self,N,K,divisible_count=False):\r\n if K<0 or K>N:\r\n return 0\r\n retu=self.factorial[N]*self.factorial_inve[K]%self.mod*self.factorial_inve[N-K]%self.mod\r\n if self.e!=None:\r\n cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K]\r\n if divisible_count:\r\n return retu,cnt\r\n else:\r\n retu*=pow(self.p,cnt,self.mod)\r\n retu%=self.mod\r\n return retu\r\n\r\ndef Primitive_Root(p):\r\n if p==2:\r\n return 1\r\n if p==167772161:\r\n return 3\r\n if p==469762049:\r\n return 3\r\n if p==754974721:\r\n return 11\r\n if p==998244353:\r\n return 3\r\n if p==10**9+7:\r\n return 5\r\n divisors=[2]\r\n pp=(p-1)//2\r\n while pp%2==0:\r\n pp//=2\r\n for d in range(3,pp+1,2):\r\n if d**2>pp:\r\n break\r\n if pp%d==0:\r\n divisors.append(d)\r\n while pp%d==0:\r\n pp//=d\r\n if pp>1:\r\n divisors.append(pp)\r\n primitive_root=2\r\n while True:\r\n for d in divisors:\r\n if pow(primitive_root,(p-1)//d,p)==1:\r\n break\r\n else:\r\n return primitive_root\r\n primitive_root+=1\r\n\r\nclass Polynomial:\r\n def __init__(self,polynomial,max_degree=-1,eps=0,mod=0):\r\n self.max_degree=max_degree\r\n if self.max_degree!=-1 and len(polynomial)>self.max_degree+1:\r\n self.polynomial=polynomial[:self.max_degree+1]\r\n else:\r\n self.polynomial=polynomial\r\n self.mod=mod\r\n self.eps=eps\r\n\r\n def __eq__(self,other):\r\n if type(other)!=Polynomial:\r\n return False\r\n if len(self.polynomial)!=len(other.polynomial):\r\n return False\r\n for i in range(len(self.polynomial)):\r\n if self.eps<abs(self.polynomial[i]-other.polynomial[i]):\r\n return False\r\n return True\r\n\r\n def __ne__(self,other):\r\n if type(other)!=Polynomial:\r\n return True\r\n if len(self.polynomial)!=len(other.polynomial):\r\n return True\r\n for i in range(len(self.polynomial)):\r\n if self.eps<abs(self.polynomial[i]-other.polynomial[i]):\r\n return True\r\n return False\r\n\r\n def __add__(self,other):\r\n if type(other)==Polynomial:\r\n summ=[0]*max(len(self.polynomial),len(other.polynomial))\r\n for i in range(len(self.polynomial)):\r\n summ[i]+=self.polynomial[i]\r\n for i in range(len(other.polynomial)):\r\n summ[i]+=other.polynomial[i]\r\n if self.mod:\r\n for i in range(len(summ)):\r\n summ[i]%=self.mod\r\n else:\r\n summ=[x for x in self.polynomial] if self.polynomial else [0]\r\n summ[0]+=other\r\n if self.mod:\r\n summ[0]%=self.mod\r\n while summ and abs(summ[-1])<=self.eps:\r\n summ.pop()\r\n summ=Polynomial(summ,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return summ\r\n\r\n def __sub__(self,other):\r\n if type(other)==Polynomial:\r\n diff=[0]*max(len(self.polynomial),len(other.polynomial))\r\n for i in range(len(self.polynomial)):\r\n diff[i]+=self.polynomial[i]\r\n for i in range(len(other.polynomial)):\r\n diff[i]-=other.polynomial[i]\r\n if self.mod:\r\n for i in range(len(diff)):\r\n diff[i]%=self.mod\r\n else:\r\n diff=[x for x in self.polynomial] if self.polynomial else [0]\r\n diff[0]-=other\r\n if self.mod:\r\n diff[0]%=self.mod\r\n while diff and abs(diff[-1])<=self.eps:\r\n diff.pop()\r\n diff=Polynomial(diff,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return diff\r\n\r\n def __mul__(self,other):\r\n if type(other)==Polynomial:\r\n if self.max_degree==-1:\r\n prod=[0]*(len(self.polynomial)+len(other.polynomial)-1)\r\n for i in range(len(self.polynomial)):\r\n for j in range(len(other.polynomial)):\r\n prod[i+j]+=self.polynomial[i]*other.polynomial[j]\r\n else:\r\n prod=[0]*min(len(self.polynomial)+len(other.polynomial)-1,self.max_degree+1)\r\n for i in range(len(self.polynomial)):\r\n for j in range(min(len(other.polynomial),self.max_degree+1-i)):\r\n prod[i+j]+=self.polynomial[i]*other.polynomial[j]\r\n if self.mod:\r\n for i in range(len(prod)):\r\n prod[i]%=self.mod\r\n else:\r\n if self.mod:\r\n prod=[x*other%self.mod for x in self.polynomial]\r\n else:\r\n prod=[x*other for x in self.polynomial]\r\n while prod and abs(prod[-1])<=self.eps:\r\n prod.pop()\r\n prod=Polynomial(prod,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return prod\r\n\r\n def __matmul__(self,other):\r\n assert type(other)==Polynomial\r\n if self.mod:\r\n prod=NTT(self.polynomial,other.polynomial)\r\n else:\r\n prod=FFT(self.polynomial,other.polynomial)\r\n if self.max_degree!=-1 and len(prod)>self.max_degree+1:\r\n prod=prod[:self.max_degree+1]\r\n while prod and abs(prod[-1])<=self.eps:\r\n prod.pop()\r\n prod=Polynomial(prod,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return prod\r\n\r\n def __truediv__(self,other):\r\n if type(other)==Polynomial:\r\n assert other.polynomial\r\n for n in range(len(other.polynomial)):\r\n if self.eps<abs(other.polynomial[n]):\r\n break\r\n assert len(self.polynomial)>n\r\n for i in range(n):\r\n assert abs(self.polynomial[i])<=self.eps\r\n self_polynomial=self.polynomial[n:]\r\n other_polynomial=other.polynomial[n:]\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other_polynomial[0],-1)\r\n else:\r\n inve=1/other_polynomial[0]\r\n quot=[]\r\n for i in range(len(self_polynomial)-len(other_polynomial)+1):\r\n if self.mod:\r\n quot.append(self_polynomial[i]*inve%self.mod)\r\n else:\r\n quot.append(self_polynomial[i]*inve)\r\n for j in range(len(other_polynomial)):\r\n self_polynomial[i+j]-=other_polynomial[j]*quot[-1]\r\n if self.mod:\r\n self_polynomial[i+j]%=self.mod\r\n for i in range(max(0,len(self_polynomial)-len(other_polynomial)+1),len(self_polynomial)):\r\n if self.eps<abs(self_polynomial[i]):\r\n assert self.max_degree!=-1\r\n self_polynomial=self_polynomial[-len(other_polynomial)+1:]+[0]*(len(other_polynomial)-1-len(self_polynomial))\r\n while len(quot)<=self.max_degree:\r\n self_polynomial.append(0)\r\n if self.mod:\r\n quot.append(self_polynomial[0]*inve%self.mod)\r\n self_polynomial=[(self_polynomial[i]-other_polynomial[i]*quot[-1])%self.mod for i in range(1,len(self_polynomial))]\r\n else:\r\n quot.append(self_polynomial[0]*inve)\r\n self_polynomial=[(self_polynomial[i]-other_polynomial[i]*quot[-1]) for i in range(1,len(self_polynomial))]\r\n break\r\n quot=Polynomial(quot,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n else:\r\n assert self.eps<abs(other)\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other,-1)\r\n quot=Polynomial([x*inve%self.mod for x in self.polynomial],max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Polynomial([x/other for x in self.polynomial],max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return quot\r\n\r\n def __rtruediv__(self,other):\r\n assert self.polynomial and self.eps<self.polynomial[0]\r\n assert self.max_degree!=-1\r\n if self.mod:\r\n quot=[MOD(self.mod).Pow(self.polynomial[0],-1)]\r\n if self.mod==998244353:\r\n prim_root=3\r\n prim_root_inve=332748118\r\n else:\r\n prim_root=Primitive_Root(self.mod)\r\n prim_root_inve=MOD(self.mod).Pow(prim_root,-1)\r\n def DFT(polynomial,n,inverse=False):\r\n polynomial=polynomial+[0]*((1<<n)-len(polynomial))\r\n if inverse:\r\n for bit in range(1,n+1):\r\n a=1<<bit-1\r\n x=pow(prim_root,mod-1>>bit,mod)\r\n U=[1]\r\n for _ in range(a):\r\n U.append(U[-1]*x%mod)\r\n for i in range(1<<n-bit):\r\n for j in range(a):\r\n s=i*2*a+j\r\n t=s+a\r\n polynomial[s],polynomial[t]=(polynomial[s]+polynomial[t]*U[j])%mod,(polynomial[s]-polynomial[t]*U[j])%mod\r\n x=pow((mod+1)//2,n,mod)\r\n for i in range(1<<n):\r\n polynomial[i]*=x\r\n polynomial[i]%=mod\r\n else:\r\n for bit in range(n,0,-1):\r\n a=1<<bit-1\r\n x=pow(prim_root_inve,mod-1>>bit,mod)\r\n U=[1]\r\n for _ in range(a):\r\n U.append(U[-1]*x%mod)\r\n for i in range(1<<n-bit):\r\n for j in range(a):\r\n s=i*2*a+j\r\n t=s+a\r\n polynomial[s],polynomial[t]=(polynomial[s]+polynomial[t])%mod,U[j]*(polynomial[s]-polynomial[t])%mod\r\n return polynomial\r\n else:\r\n quot=[1/self.polynomial[0]]\r\n def DFT(polynomial,n,inverse=False):\r\n N=len(polynomial)\r\n if inverse:\r\n primitive_root=[math.cos(-i*2*math.pi/(1<<n))+math.sin(-i*2*math.pi/(1<<n))*1j for i in range(1<<n)]\r\n else:\r\n primitive_root=[math.cos(i*2*math.pi/(1<<n))+math.sin(i*2*math.pi/(1<<n))*1j for i in range(1<<n)]\r\n polynomial=polynomial+[0]*((1<<n)-N)\r\n if inverse:\r\n for bit in range(1,n+1):\r\n a=1<<bit-1\r\n for i in range(1<<n-bit):\r\n for j in range(a):\r\n s=i*2*a+j\r\n t=s+a\r\n polynomial[s],polynomial[t]=polynomial[s]+polynomial[t]*primitive_root[j<<n-bit],polynomial[s]-polynomial[t]*primitive_root[j<<n-bit]\r\n for i in range(1<<n):\r\n polynomial[i]=round((polynomial[i]/(1<<n)).real)\r\n else:\r\n for bit in range(n,0,-1):\r\n a=1<<bit-1\r\n for i in range(1<<n-bit):\r\n for j in range(a):\r\n s=i*2*a+j\r\n t=s+a\r\n polynomial[s],polynomial[t]=polynomial[s]+polynomial[t],primitive_root[j<<n-bit]*(polynomial[s]-polynomial[t])\r\n\r\n return polynomial\r\n for n in range(self.max_degree.bit_length()):\r\n prev=quot\r\n if self.mod:\r\n polynomial=[x*y*y%self.mod for x,y in zip(DFT(self.polynomial[:1<<n+1],n+2),DFT(prev,n+2))]\r\n quot=DFT(polynomial,n+2,inverse=True)[:1<<n+1]\r\n else:\r\n polynomial=[x*y*y for x,y in zip(DFT(self.polynomial[:1<<n+1],n+2),DFT(prev,n+2))]\r\n quot=DFT(polynomial,n+2,inverse=True)[:1<<n+1]\r\n for i in range(1<<n):\r\n quot[i]=2*prev[i]-quot[i]\r\n if self.mod:\r\n quot[i]%=self.mod\r\n for i in range(1<<n,1<<n+1):\r\n quot[i]=-quot[i]\r\n if self.mod:\r\n quot[i]%=self.mod\r\n quot=quot[:self.max_degree+1]\r\n for i in range(len(quot)):\r\n quot[i]*=other\r\n if self.mod:\r\n quot[i]%=self.mod\r\n return quot\r\n\r\n def __floordiv__(self,other):\r\n assert type(other)==Polynomial\r\n quot=[0]*(len(self.polynomial)-len(other.polynomial)+1)\r\n rema=[x for x in self.polynomial]\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other.polynomial[-1],-1)\r\n for i in range(len(self.polynomial)-len(other.polynomial),-1,-1):\r\n quot[i]=rema[i+len(other.polynomial)-1]*inve%self.mod\r\n for j in range(len(other.polynomial)):\r\n rema[i+j]-=quot[i]*other.polynomial[j]\r\n rema[i+j]%=self.mod\r\n else:\r\n inve=1/other.polynomial[-1]\r\n for i in range(len(self.polynomial)-len(other.polynomial),-1,-1):\r\n quot[i]=rema[i+len(other.polynomial)-1]*inve\r\n for j in range(len(other.polynomial)):\r\n rema[i+j]-=quot[i]*other.polynomial[j]\r\n quot=Polynomial(quot,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return quot\r\n\r\n def __mod__(self,other):\r\n assert type(other)==Polynomial\r\n quot=[0]*(len(self.polynomial)-len(other.polynomial)+1)\r\n rema=[x for x in self.polynomial]\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other.polynomial[-1],-1)\r\n for i in range(len(self.polynomial)-len(other.polynomial),-1,-1):\r\n quot[i]=rema[i+len(other.polynomial)-1]*inve%self.mod\r\n for j in range(len(other.polynomial)):\r\n rema[i+j]-=quot[i]*other.polynomial[j]\r\n rema[i+j]%=self.mod\r\n else:\r\n inve=1/other.polynomial[-1]\r\n for i in range(len(self.polynomial)-len(other.polynomial),-1,-1):\r\n quot[i]=rema[i+len(other.polynomial)-1]*inve\r\n for j in range(len(other.polynomial)):\r\n rema[i+j]-=quot[i]*other.polynomial[j]\r\n while rema and abs(rema[-1])<=self.eps:\r\n rema.pop()\r\n rema=Polynomial(rema,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return rema\r\n\r\n def __divmod__(self,other):\r\n assert type(other)==Polynomial\r\n quot=[0]*(len(self.polynomial)-len(other.polynomial)+1)\r\n rema=[x for x in self.polynomial]\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other.polynomial[-1],-1)\r\n for i in range(len(self.polynomial)-len(other.polynomial),-1,-1):\r\n quot[i]=rema[i+len(other.polynomial)-1]*inve%self.mod\r\n for j in range(len(other.polynomial)):\r\n rema[i+j]-=quot[i]*other.polynomial[j]\r\n rema[i+j]%=self.mod\r\n else:\r\n inve=1/other.polynomial[-1]\r\n for i in range(len(self.polynomial)-len(other.polynomial),-1,-1):\r\n quot[i]=rema[i+len(other.polynomial)-1]*inve\r\n for j in range(len(other.polynomial)):\r\n rema[i+j]-=quot[i]*other.polynomial[j]\r\n while rema and abs(rema[-1])<=self.eps:\r\n rema.pop()\r\n quot=Polynomial(quot,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n rema=Polynomial(rema,max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return quot,rema\r\n\r\n def __neg__(self):\r\n if self.mod:\r\n nega=Polynomial([(-x)%self.mod for x in self.polynomial],max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n else:\r\n nega=Polynomial([-x for x in self.polynomial],max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return nega\r\n\r\n def __pos__(self):\r\n posi=Polynomial([x for x in self.polynomial],max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n return posi\r\n\r\n def __bool__(self):\r\n return self.polynomial\r\n\r\n def __getitem__(self,n):\r\n if type(n)==int:\r\n if n<=len(self.polynomial)-1:\r\n return self.polynomial[n]\r\n else:\r\n return 0\r\n else:\r\n return Polynomial(polynomial=self.polynomial[n],max_degree=self.max_degree,eps=self.eps,mod=self.mod)\r\n \r\n def __setitem__(self,n,a):\r\n if self.mod:\r\n a%=self.mod\r\n if self.max_degree==-1 or n<=self.max_degree:\r\n if n<=len(self.polynomial)-1:\r\n self.polynomial[n]=a\r\n elif self.eps<abs(a):\r\n self.polynomial+=[0]*(n-len(self.polynomial))+[a]\r\n\r\n def __iter__(self):\r\n for x in self.polynomial:\r\n yield x\r\n\r\n def __call__(self,x):\r\n retu=0\r\n pow_x=1\r\n for i in range(len(self.polynomial)):\r\n retu+=pow_x*self.polynomial[i]\r\n pow_x*=x\r\n if self.mod:\r\n retu%=self.mod\r\n pow_x%=self.mod\r\n return retu\r\n\r\n def __str__(self):\r\n return \"[\"+\", \".join(map(str,self.polynomial))+\"]\"\r\n\r\n def Degree(self):\r\n return len(self.polynomial)-1\r\n\r\ndef NTT(polynomial0,polynomial1):\r\n if mod==998244353:\r\n prim_root=3\r\n prim_root_inve=332748118\r\n else:\r\n prim_root=Primitive_Root(mod)\r\n prim_root_inve=MOD(mod).Pow(prim_root,-1)\r\n def DFT(polynomial,n,inverse=False):\r\n if inverse:\r\n for bit in range(1,n+1):\r\n a=1<<bit-1\r\n x=pow(prim_root,mod-1>>bit,mod)\r\n U=[1]\r\n for _ in range(a):\r\n U.append(U[-1]*x%mod)\r\n for i in range(1<<n-bit):\r\n for j in range(a):\r\n s=i*2*a+j\r\n t=s+a\r\n polynomial[s],polynomial[t]=(polynomial[s]+polynomial[t]*U[j])%mod,(polynomial[s]-polynomial[t]*U[j])%mod\r\n x=pow((mod+1)//2,n,mod)\r\n for i in range(1<<n):\r\n polynomial[i]*=x\r\n polynomial[i]%=mod\r\n else:\r\n for bit in range(n,0,-1):\r\n a=1<<bit-1\r\n x=pow(prim_root_inve,mod-1>>bit,mod)\r\n U=[1]\r\n for _ in range(a):\r\n U.append(U[-1]*x%mod)\r\n for i in range(1<<n-bit):\r\n for j in range(a):\r\n s=i*2*a+j\r\n t=s+a\r\n polynomial[s],polynomial[t]=(polynomial[s]+polynomial[t])%mod,U[j]*(polynomial[s]-polynomial[t])%mod\r\n\r\n l=len(polynomial0)+len(polynomial1)-1\r\n n=(len(polynomial0)+len(polynomial1)-2).bit_length()\r\n polynomial0=polynomial0+[0]*((1<<n)-len(polynomial0))\r\n polynomial1=polynomial1+[0]*((1<<n)-len(polynomial1))\r\n DFT(polynomial0,n)\r\n DFT(polynomial1,n)\r\n ntt=[x*y%mod for x,y in zip(polynomial0,polynomial1)]\r\n DFT(ntt,n,inverse=True)\r\n ntt=ntt[:l]\r\n return ntt\r\n\r\ndef Bostan_Mori(poly_nume,poly_deno,N,mod=0,fft=False,ntt=False):\r\n if type(poly_nume)==Polynomial:\r\n poly_nume=poly_nume.polynomial\r\n if type(poly_deno)==Polynomial:\r\n poly_deno=poly_deno.polynomial\r\n if ntt:\r\n convolve=NTT\r\n elif fft:\r\n convolve=FFT\r\n else:\r\n def convolve(poly_nume,poly_deno):\r\n conv=[0]*(len(poly_nume)+len(poly_deno)-1)\r\n for i in range(len(poly_nume)):\r\n for j in range(len(poly_deno)):\r\n conv[i+j]+=poly_nume[i]*poly_deno[j]\r\n if mod:\r\n for i in range(len(conv)):\r\n conv[i]%=mod\r\n return conv\r\n while N:\r\n poly_deno_=[-x if i%2 else x for i,x in enumerate(poly_deno)]\r\n if N%2:\r\n poly_nume=convolve(poly_nume,poly_deno_)[1::2]\r\n else:\r\n poly_nume=convolve(poly_nume,poly_deno_)[::2]\r\n poly_deno=convolve(poly_deno,poly_deno_)[::2]\r\n if fft and mod:\r\n for i in range(len(poly_nume)):\r\n poly_nume[i]%=mod\r\n for i in range(len(poly_deno)):\r\n poly_deno[i]%=mod\r\n N//=2\r\n return poly_nume[0]\r\n\r\nclass Matrix:\r\n def __init__(self,H=0,W=0,matrix=False,eps=0,mod=0,identity=0):\r\n if identity:\r\n if H:\r\n self.H=H\r\n self.W=H\r\n else:\r\n self.H=W\r\n self.W=W\r\n self.matrix=[[0]*self.W for i in range(self.H)]\r\n for i in range(self.H):\r\n self.matrix[i][i]=identity\r\n elif matrix:\r\n self.matrix=matrix\r\n self.H=len(self.matrix)\r\n self.W=len(self.matrix[0]) if self.matrix else 0\r\n else:\r\n self.H=H\r\n self.W=W\r\n self.matrix=[[0]*self.W for i in range(self.H)]\r\n self.mod=mod\r\n self.eps=eps\r\n\r\n def __eq__(self,other):\r\n if type(other)!=Matrix:\r\n return False\r\n if self.H!=other.H:\r\n return False\r\n if self.mod:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.matrix[i][j]%self.mod!=other.matrix[i][j]%self.mod:\r\n return False\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.eps<abs(self.matrix[i][j]-other.matrix[i][j]):\r\n return False\r\n return True\r\n\r\n def __ne__(self,other):\r\n if type(other)!=Matrix:\r\n return True\r\n if self.H!=other.H:\r\n return True\r\n if self.mod:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.matrix[i][j]%self.mod!=other.matrix[i][j]%self.mod:\r\n return True\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.eps<abs(self.matrix[i][j]-other.matrix[i][j]):\r\n return True\r\n return False\r\n\r\n def __add__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n summ=Matrix(matrix=[[(self.matrix[i][j]+other.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n summ=Matrix(matrix=[[self.matrix[i][j]+other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n summ=Matrix(matrix=[[(self.matrix[i][j]+other)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n summ=Matrix(matrix=[[self.matrix[i][j]+other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return summ\r\n\r\n def __sub__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n diff=Matrix(matrix=[[(self.matrix[i][j]-other.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n diff=Matrix(matrix=[[self.matrix[i][j]-other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n diff=Matrix(matrix=[[(self.matrix[i][j]-other)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n diff=Matrix(matrix=[[self.matrix[i][j]-other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return diff\r\n\r\n def __mul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n prod=Matrix(matrix=[[(self.matrix[i][j]*other.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(matrix=[[self.matrix[i][j]*other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n prod=Matrix(matrix=[[(self.matrix[i][j]*other)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(matrix=[[self.matrix[i][j]*other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return prod\r\n\r\n def __matmul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.W==other.H\r\n prod=Matrix(H=self.H,W=other.W,eps=self.eps,mod=self.mod)\r\n for i in range(self.H):\r\n for j in range(other.W):\r\n for k in range(self.W):\r\n prod.matrix[i][j]+=self.matrix[i][k]*other.matrix[k][j]\r\n if self.mod:\r\n prod.matrix[i][j]%=self.mod\r\n elif type(other)==int:\r\n assert self.H==self.W\r\n if other==0:\r\n prod=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n elif other==1:\r\n prod=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n doub=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n while other>=2:\r\n if other&1:\r\n prod@=doub\r\n doub@=doub\r\n other>>=1\r\n prod@=doub\r\n return prod\r\n\r\n def __truediv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n quot=Matrix(matrix=[[(self.matrix[i][j]*MOD(self.mod).Pow(other.matrix[i][j],-1))%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Matrix(matrix=[[self.matrix[i][j]/other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other,-1)\r\n quot=Matrix(matrix=[[(self.matrix[i][j]*inve)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Matrix(matrix=[[self.matrix[i][j]/other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return quot\r\n\r\n def __floordiv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n quot=Matrix(matrix=[[self.matrix[i][j]//other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Matrix(matrix=[[self.matrix[i][j]//other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return quot\r\n\r\n def __mod__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n rema=Matrix(matrix=[[self.matrix[i][j]%other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n rema=Matrix(matrix=[[self.matrix[i][j]%other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return rema\r\n\r\n def __pow__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other.matrix[i][j],self.mod) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other.matrix[i][j]) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other,self.mod) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return powe\r\n\r\n def __lshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n lshi=Matrix(matrix=[[self.matrix[i][j]<<other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n lshi=Matrix(matrix=[[self.matrix[i][j]<<other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return lshi\r\n\r\n def __rshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n rshi=Matrix(matrix=[[self.matrix[i][j]>>other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n rshi=Matrix(matrix=[[self.matrix[i][j]>>other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return rshi\r\n\r\n def __and__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n conj=Matrix(matrix=[[self.matrix[i][j]&other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n conj=Matrix(matrix=[[self.matrix[i][j]&other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return conj\r\n\r\n def __or__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n disj=Matrix(matrix=[[self.matrix[i][j]|other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n disj=Matrix(matrix=[[self.matrix[i][j]|other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return disj\r\n\r\n def __xor__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n excl=Matrix(matrix=[[self.matrix[i][j]^other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n excl=Matrix(matrix=[[self.matrix[i][j]^other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return excl\r\n\r\n def __iadd__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]+=other.matrix[i][j]\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]+=other\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n return self\r\n\r\n def __isub__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]-=other.matrix[i][j]\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]-=other\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n return self\r\n\r\n def __imul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]*=other.matrix[i][j]\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]*=other\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n return self\r\n\r\n def __imatmul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.W==other.H\r\n prod=Matrix(H=self.H,W=other.W,eps=self.eps,mod=self.mod)\r\n for i in range(self.H):\r\n for j in range(other.W):\r\n for k in range(self.W):\r\n prod.matrix[i][j]+=self.matrix[i][k]*other.matrix[k][j]\r\n if self.mod:\r\n prod.matrix[i][j]%=self.mod\r\n elif type(other)==int:\r\n assert self.H==self.W\r\n if other==0:\r\n return Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n elif other==1:\r\n prod=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n doub=self\r\n while other>=2:\r\n if other&1:\r\n prod@=doub\r\n doub@=doub\r\n other>>=1\r\n prod@=doub\r\n return prod\r\n\r\n def __itruediv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=self.matrix[i][j]*MOD(self.mod).Pow(other.matrix[i][j],-1)%self.mod\r\n else:\r\n self.matrix[i][j]/=other.matrix[i][j]\r\n else:\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other,-1)\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=self.matrix[i][j]*inve%self.mod\r\n else:\r\n self.matrix[i][j]/=other\r\n return self\r\n\r\n def __ifloordiv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]//=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]//=other\r\n return self\r\n\r\n def __imod__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]%=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]%=other\r\n return self\r\n\r\n def __ipow__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other.matrix[i][j],self.mod)\r\n else:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other.matrix[i][j])\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other,self.mod)\r\n else:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other)\r\n return self\r\n\r\n def __ilshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]<<=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]<<=other\r\n return self\r\n\r\n def __irshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]>>=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]>>=other\r\n return self\r\n\r\n def __iand__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]&=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]&=other\r\n return self\r\n\r\n def __ior__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]|=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]|=other\r\n return self\r\n\r\n def __ixor__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]^=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]^=other\r\n return self\r\n\r\n def __neg__(self):\r\n if self.mod:\r\n nega=Matrix(matrix=[[(-self.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n nega=Matrix(matrix=[[-self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return nega\r\n\r\n def __pos__(self):\r\n posi=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return posi\r\n\r\n def __invert__(self):\r\n inve=Matrix(matrix=[[~self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return inve\r\n\r\n def __abs__(self):\r\n abso=Matrix(matrix=[[abs(self.matrix[i][j]) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return abso\r\n\r\n def __getitem__(self,i):\r\n if type(i)==int:\r\n return self.matrix[i]\r\n elif type(i)==tuple:\r\n i,j=i\r\n if type(i)==int:\r\n i=slice(i,i+1)\r\n if type(j)==int:\r\n j=slice(j,j+1)\r\n return Matrix(matrix=[lst[j] for lst in self.matrix[i]],eps=self.eps,mod=self.mod)\r\n\r\n def __contains__(self,x):\r\n for i in range(self.H):\r\n if x in self.matrix[i]:\r\n return True\r\n return False\r\n\r\n def __str__(self):\r\n digit=[max(len(str(self.matrix[i][j])) for i in range(self.H)) for j in range(self.W)]\r\n return \"\\n\".join([(\" [\" if i else \"[[\")+\", \".join([str(self.matrix[i][j]).rjust(digit[j],\" \") for j in range(self.W)])+\"]\" for i in range(self.H)])+\"]\"\r\n\r\n def __bool__(self):\r\n return True\r\n\r\n def Transpose(self):\r\n return Matrix(matrix=[[self.matrix[i][j] for i in range(self.H)] for j in range(self.W)])\r\n\r\n def Trace(self):\r\n assert self.H==self.W\r\n trace=sum(self.matrix[i][i] for i in range(self.H))\r\n if self.mod:\r\n trace%=self.mod\r\n return trace\r\n\r\n def Elem_Raw_Operate_1(self,i0,i1):\r\n self.matrix[i0],self.matrix[i1]=self.matrix[i1],self.matrix[i0]\r\n\r\n def Elem_Raw_Operate_2(self,i,c):\r\n if self.mod:\r\n self.matrix[i]=[self.matrix[i][j]*c%self.mod for j in range(self.W)]\r\n else:\r\n self.matrix[i]=[self.matrix[i][j]*c for j in range(self.W)]\r\n\r\n def Elem_Raw_Operate_3(self,i0,i1,c):\r\n if self.mod:\r\n self.matrix[i0]=[(self.matrix[i0][j]+c*self.matrix[i1][j])%self.mod for j in range(self.W)]\r\n else:\r\n self.matrix[i0]=[self.matrix[i0][j]+c*self.matrix[i1][j] for j in range(self.W)]\r\n\r\n def Elimination(self,determinant=False,inverse_matrix=False,linear_equation=False,rank=False,upper_triangular=False):\r\n h=0\r\n ut=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n if determinant or inverse_matrix:\r\n assert self.H==self.W\r\n det=1\r\n if inverse_matrix:\r\n assert self.H==self.W\r\n im=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n if linear_equation:\r\n assert self.H==linear_equation.H\r\n le=Matrix(matrix=[[linear_equation.matrix[i][j] for j in range(linear_equation.W)] for i in range(linear_equation.H)],eps=self.eps,mod=self.mod)\r\n for j in range(ut.W):\r\n for i in range(h,ut.H):\r\n if abs(ut.matrix[i][j])>ut.eps:\r\n if determinant or inverse_matrix:\r\n det*=ut.matrix[i][j]\r\n if self.mod:\r\n det%=self.mod\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(ut.matrix[i][j],-1)\r\n else:\r\n inve=1/ut.matrix[i][j]\r\n\r\n ut.Elem_Raw_Operate_1(i,h)\r\n if determinant and i!=h and self.mod:\r\n det=(-det)%self.mod\r\n if inverse_matrix:\r\n im.Elem_Raw_Operate_1(i,h)\r\n if linear_equation:\r\n le.Elem_Raw_Operate_1(i,h)\r\n\r\n ut.Elem_Raw_Operate_2(h,inve)\r\n if inverse_matrix:\r\n im.Elem_Raw_Operate_2(h,inve)\r\n if linear_equation:\r\n le.Elem_Raw_Operate_2(h,inve)\r\n\r\n for ii in range(ut.H):\r\n if ii==h:\r\n continue\r\n x=-ut.matrix[ii][j]\r\n ut.Elem_Raw_Operate_3(ii,h,x)\r\n if inverse_matrix:\r\n im.Elem_Raw_Operate_3(ii,h,x)\r\n if linear_equation:\r\n le.Elem_Raw_Operate_3(ii,h,x)\r\n h+=1\r\n break\r\n else:\r\n det=0\r\n if any(le[i][0] for i in range(h,self.H)):\r\n le=None\r\n tpl=()\r\n if determinant:\r\n tpl+=(det,)\r\n if inverse_matrix:\r\n if det==0:\r\n im=None\r\n tpl+=(im,)\r\n if linear_equation:\r\n tpl+=(le,)\r\n if rank:\r\n tpl+=(h,)\r\n if upper_triangular:\r\n tpl+=(ut,)\r\n if len(tpl)==1:\r\n tpl=tpl[0]\r\n return tpl\r\n\r\n\r\nclass Lagrange_Interpolation:\r\n def __init__(self,X=False,Y=False,x0=None,xd=None,mod=0):\r\n self.degree=len(Y)-1\r\n self.mod=mod\r\n assert self.mod==0 or self.degree<self.mod\r\n if x0!=None and xd!=None:\r\n assert xd>0\r\n if self.mod:\r\n self.X=[(x0+i*xd)%self.mod for i in range(self.degree+1)]\r\n fact_inve=1\r\n for i in range(1,self.degree+1):\r\n fact_inve*=i*xd\r\n fact_inve%=self.mod\r\n fact_inve=MOD(self.mod).Pow(fact_inve,-1)\r\n self.coefficient=[y for y in Y]\r\n for i in range(self.degree-1,-1,-2):\r\n self.coefficient[i]*=-1\r\n for i in range(self.degree,-1,-1):\r\n self.coefficient[i]*=fact_inve\r\n self.coefficient[i]%=self.mod\r\n self.coefficient[self.degree-i]*=fact_inve\r\n self.coefficient[self.degree-i]%=self.mod\r\n fact_inve*=i*xd\r\n fact_inve%=self.mod\r\n else:\r\n self.X=[x0+i*xd for i in range(self.degree+1)]\r\n self.coefficient=[y for y in Y]\r\n for i in range(self.degree-1,-1,-2):\r\n self.coefficient[i]*=-1\r\n fact=1\r\n for i in range(1,self.degree+2):\r\n self.coefficient[i-1]/=fact\r\n self.coefficient[self.degree-i+1]/=fact\r\n fact*=i*xd\r\n\r\n else:\r\n self.X=X\r\n assert len(self.X)==self.degree+1\r\n self.coefficient=[1]*(self.degree+1)\r\n for i in range(self.degree+1):\r\n for j in range(self.degree+1):\r\n if i==j:\r\n continue\r\n self.coefficient[i]*=X[i]-X[j]\r\n if self.mod:\r\n self.coefficient[i]%=self.mod\r\n if self.mod:\r\n for i in range(self.degree+1):\r\n self.coefficient[i]=MOD(self.mod).Pow(self.coefficient[i],-1)*Y[i]%self.mod\r\n else:\r\n for i in range(self.degree+1):\r\n self.coefficient[i]=Y[i]/self.coefficient[i]\r\n \r\n def __call__(self,N):\r\n if self.mod:\r\n N%=self.mod\r\n XX=[N-x for x in self.X]\r\n XX_left=[1]*(self.degree+2)\r\n for i in range(1,self.degree+2):\r\n XX_left[i]=XX_left[i-1]*XX[i-1]\r\n if self.mod:\r\n XX_left[i]%=self.mod\r\n XX_right=[1]*(self.degree+2)\r\n for i in range(self.degree,-1,-1):\r\n XX_right[i]=XX_right[i+1]*XX[i]\r\n if self.mod:\r\n XX_right[i]%=self.mod\r\n if self.mod:\r\n return sum(XX_left[i]*XX_right[i+1]*self.coefficient[i] for i in range(self.degree+1))%self.mod\r\n else:\r\n return sum(XX_left[i]*XX_right[i+1]*self.coefficient[i] for i in range(self.degree+1))\r\n\r\nimport math\r\nN=int(readline())\r\ndef naive(N):\r\n se=set()\r\n for b in range(min(N+1,9)):\r\n for c in range(min(N-b+1,9)):\r\n for a in range(N-b-c+1):\r\n d=N-a-b-c\r\n se.add(a+b*5+c*10+d*50)\r\n return len(se)\r\n\r\nperiod=4*9*49\r\nn=N%period\r\nX,Y=[],[]\r\ncnt=5\r\nmod=(1<<61)-1\r\nfor x in range(n,n+period*cnt,period):\r\n y=naive(x)\r\n X.append(x)\r\n Y.append(y)\r\nLI=Lagrange_Interpolation(X,Y,mod=mod)\r\nans=LI(N)\r\nprint(ans)", "n = int(input())\r\n\r\nans = 0\r\n\r\ni= 0 \r\nwhile i <= 8 and i <= n:\r\n j = 0\r\n while j <= (8 if i == 0 else 4 ) and j + i <= n:\r\n ans += n - i - j + 1\r\n j = j + 1\r\n i = i + 1\r\n \r\nprint(ans)", "n, mem = int(input()), [0] * 40\r\na, b, c = 0, 0, 0\r\nwhile a <= 12:\r\n mem[a + b + c] += 1\r\n c += 1\r\n if c == 9:\r\n b, c = b + 1, 0\r\n if b == 5 and c == 4:\r\n a, b, c = a + 1, 0, 0\r\n\r\nfor i in range(1, 13):\r\n mem[i] += mem[i - 1]\r\n\r\nprint(49 * max(0, n - 12) + mem[min(n, 12)])\r\n", "import itertools\n\nSTC = [\n\t[0,4,0,5],\n\t[1,0,8,0],\n\t[1,0,0,5]]\ndef ch(N, K):\n ans = 1\n for k in range(K): ans *= (N-k)\n for k in range(K): ans //= (k+1)\n return ans\n\nN = int(input())\nans = ch(N+3, 3)\nsgn = -1\nfor s in range(1, len(STC)+1):\n for cb in itertools.combinations(STC, s):\n aq = [0,0,0,0]\n for c in cb:\n for i in range(4):\n aq[i] = max(aq[i], c[i])\n tot = sum(aq)\n if N >= tot:\n #print(aq,cb)\n ans += sgn * ch(N-tot+3, 3);\n sgn *= -1\nprint(ans)\n", "n = int(input())\r\nbest = 0\r\nfor k in range(1, 13):\r\n dp = [[False] * (50 * k + 1) for _ in range(k + 1)]\r\n dp[0][0] = True\r\n for i in range(k):\r\n for s in range(50 * k + 1):\r\n if dp[i][s]:\r\n if s + 1 <= 50 * k:\r\n dp[i + 1][s + 1] = True\r\n if s + 5 <= 50 * k:\r\n dp[i + 1][s + 5] = True\r\n if s + 10 <= 50 * k:\r\n dp[i + 1][s + 10] = True\r\n if s + 50 <= 50 * k:\r\n dp[i + 1][s + 50] = True\r\n\r\n cnt = dp[k].count(True)\r\n if k == n:\r\n print(cnt)\r\n exit()\r\n current = 0\r\n best = 0\r\n for i in range(1, 50 * k + 2):\r\n if i < 50 * k + 1 and dp[k][i] == 1:\r\n current += 1\r\n else:\r\n best = max(best, current)\r\n current = 0\r\nbest += (n - 12) * 49\r\nprint(248 + best)\r\n", "def process(n):\r\n d = {}\r\n for b in range(100):\r\n for c in range(100):\r\n x = 4*b+9*c\r\n x2 = x % 49\r\n if x2 not in d:\r\n d[x2] = [float('inf'), float('inf')]\r\n d[x2] = min(d[x2], [x, b+c])\r\n #minimum number to get x2 % 49\r\n \r\n answer = 0\r\n #so (x-n) % 49==i\r\n for i in range(49):\r\n #49X+i\r\n #such that\r\n # X>= (d[i]-i)//49\r\n #49X+i <= 49n\r\n #X+d[i][1] <= n\r\n \r\n l = (d[i][0]-i)//49\r\n r = l+n-d[i][1]\r\n # assert l % 49==i\r\n # assert r % 49==i\r\n # if r >= 49*(n-d[i][1]+1):\r\n # r-=49\r\n # print(i, l, r, r-l+1, d[i], L2[i][0], L2[i][-1])\r\n answer+=max(0, r-l+1)\r\n \r\n \r\n return answer\r\n\r\nn = int(input())\r\nprint(process(n))", "a = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\nn = int(input())\nif n < len(a):\n print (a[n])\nelse:\n print (a[11] + 49*(n-11))\n", "lst, m = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244], 292\r\nn = int(input())\r\nif n <= 10:\r\n print(lst[n])\r\nelse:\r\n print(m + (n - 11) * 49)\r\n", "from itertools import combinations_with_replacement as cwr\n\ndef compute_lt12(n):\n chars = 'IVXL'\n nums = [1, 5, 10, 50]\n num_map = {c: n for c, n in zip(chars, nums)}\n sum_set = set()\n for comb in cwr(chars, n):\n sum_set.add(sum(num_map[c] for c in comb))\n \n return len(sum_set)\n \n \ndef main():\n n = int(input())\n \n if n < 12:\n print(compute_lt12(n))\n else:\n print(292 + 49 * (n - 11))\n \n \n \nif __name__ == '__main__':\n main()\n", "def c(n):\n \n ans = 0\n if n > 15:\n ans += (49 * (n - 15))\n n = 15\n l = set()\n for i in range(max(n+1,441)):\n for j in range(max(n-i+1,196)):\n for k in range(n-i-j+1):\n l.add(i*4+j*9+k*49)\n return ans + len(l)\nn = int(input())\nprint(c(n))\n", "a=[0,4,10,20,35,56,83,116,155,198,244]\nn=int(input())\nif n<=10:\n\tprint(a[n])\nelse:\n\tprint(49*n-247)\n \t \t\t\t \t \t \t \t\t\t\t \t\t\t \t \t\t", "import sys\n\nresults = [4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\n\nfor s in sys.stdin:\n n = int(s)\n if n < 11:\n print(results[n - 1])\n else:\n print(49 * n - 247)\n", "def foo(n):\n\treturn (n+3)*(n+2)*(n+1)//6;\nn=int(input());\nans=foo(n);\nif n>=6:ans-=foo(n-6);\nif n>=9:ans-=foo(n-9)*2;\nif n>=10:ans+=foo(n-10);\nif n>=14:ans+=foo(n-14);\nprint(ans);\n", "n = int(input())\r\nN = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341]\r\n\r\nif n < 13:\r\n print(N[n])\r\nelse:\r\n print(N[12] + 49 * (n - 12))\r\n", "n = int(input())\na = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\nprint(max(49 * n - 247, a[n % 12]))\n", "n = int(input())\r\nans = 0\r\nkol = 0\r\nma = 0\r\nif(n > 20):\r\n # ans = (n - 10) * 50 - (n - 10) - 10 * 50 + 1\r\n ma = (n - 10) * 50\r\n mi = (n - 10) + 10 * 50\r\n ans = ma - mi + 1\r\n kol = n - 20\r\n n = 20\r\na = set()\r\nfor i in range(n + 1): #1\r\n for j in range(n - i + 1): #5\r\n for u in range(n - i - j + 1): #10\r\n z = n - i - j - u\r\n ch = i + j * 5 + u * 10 + z * 50 + kol * 50\r\n if(ch not in a and ch > ma):\r\n ans += 1\r\n a.add(ch)\r\nif(ma != 0):\r\n for i in range(n + 1): #1\r\n for j in range(n - i + 1): #5\r\n for u in range(n - i - j + 1): #10\r\n z = n - i - j - u\r\n ch = i + j * 5 + u * 10 + z * 50 + kol \r\n if(ch not in a and ch < mi):\r\n ans += 1\r\n a.add(ch) \r\nprint(ans)\r\n \r\n \r\n", "a=[0,4,10,20,35,56,83,116,155,198,244]\r\nn=int(input())\r\nif n<=10:\r\n\tprint(a[n])\r\nelse:\r\n\tprint(49*n-247)", "def mi():\r\n\treturn map(int, input().split())\r\nn = list(mi())[0]\r\na = [4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341]\r\nif n>=13:\r\n\tprint((n-11)*49+a[10])\r\nelse:\r\n\tprint (a[n-1])", "import operator as op\nfrom functools import reduce\n\n\ndef ncr(n, r):\n r = min(r, n-r)\n numer = reduce(op.mul, range(n, n-r, -1), 1)\n denom = reduce(op.mul, range(1, r+1), 1)\n return numer//denom\n\n\nN = int(input())\nans = 0\nfor b in range(9):\n for c in range(9):\n if b+c > N or (b >= 5 and c >= 1):\n continue\n ans += ncr(N-b-c+1, 1)\n\n\nprint(ans)\n", "n=int(input())\r\nans=[1,4,10,20,35,56,83,116,155,198,244,292,341]\r\nif n<=12:\r\n print(ans[n])\r\nelse:\r\n print(49*n-247)", "n = int(input())\r\n\r\nif n > 20:\r\n print(733+(n-20)*49)\r\nelse:\r\n s = set()\r\n for i in range(n+1):\r\n for v in range(n-i+1):\r\n for x in range(n-i-v+1):\r\n l = n-i-v-x\r\n s.add(i+5*v+10*x+50*l)\r\n print(len(s))\r\n", "a = [4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\r\ndigits = input()\r\n\r\n\r\ndef result(digits):\r\n if int(digits) <= 11:\r\n return a[int(digits) - 1]\r\n return a[10] + (int(digits) - 11) * 49\r\n\r\n\r\nprint(result(digits))\r\n", "n = int(input())\n\nans = 0\nfor i in range(9):\n for j in range(49):\n \n def check(y, x):\n for i in range(49):\n for j in range(9):\n if i == x and j == y:\n continue\n t = (x - i) * 9 + (y - j) * 4 \n if t >= 0 and t % 49 == 0:\n return False \n return True\n \n if n - i - j >= 0 and check(i, j):\n ans += n - i - j + 1\nprint(ans)\n\n'''\nli = []\nfor i in range(n + 1):\n for j in range(n - i + 1):\n for k in range(n - i - j + 1):\n l = n - i - j - k\n if not ((i * 50 + j * 10 + k * 5 + l) in li):\n li.append(i * 50 + j * 10 + k * 5 + l)\nprint(len(li))\n'''\n", "\r\ndef check(n, b, c):\r\n for tb in range(0, 9):\r\n for tc in range(0, min(n - tb + 1, 9)):\r\n s1 = 9 * b + 4 * c\r\n s2 = 9 * tb + 4 * tc\r\n if s1 > s2 and (s1 - s2) % 49 == 0:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n ans = 0\r\n for b in range(0, min(n + 1, 9)):\r\n for c in range(0, min(n - b + 1, 9)):\r\n if check(n, b, c):\r\n ans += (n - b - c + 1)\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n exit(main())\r\n", "a=[0,4,10,20,35,56,83,116,155,198,244,292]\r\nn=int(input())\r\nif n<=11 : print(a[n])\r\nelse : print(n*49-247)\r\n", "n = int(input())\r\nif n < 20:\r\n q = []\r\n i = 0\r\n while i <= n:\r\n j = 0\r\n while j <= n-i:\r\n k = 0\r\n while k <= n-i-j:\r\n t = n - i - j - k\r\n q.append(i*1+j*5+k*10+t*50)\r\n k = k + 1\r\n j = j + 1\r\n i = i + 1\r\n print(len(set(q)))\r\nelse:\r\n an = int((n+1)*(n+2)*(n+3)//6)\r\n st = int(856)\r\n diff = int(182)\r\n t = int(21)\r\n cnt = int(t + n - 20 - t + 1)\r\n su = int((diff + diff + t*(cnt-1)) * cnt // 2 + ((n-20)*(n-20+1)*(n-20+2)//6))\r\n st = (st + su)\r\n print((an - st))", "n = int(input())\r\na=[0,4,10,20,35,56,83,116,155,198,244,292]\r\nif (n < 12):\r\n\tprint(a[n])\r\nelse:\r\n\tprint(292+(n-11)*49)\t", "n = int(input())\r\na = [0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\r\nif n <= 11:\r\n print(a[n])\r\nelse:\r\n print(a[-1] + (n - 11) * 49)\r\n", "n = int(input())\nadd = [1,5,10,50]\nsumMap = {}\ndef dfs(k, s):\n if k == 0:\n t = 0\n for x in s:\n t += x\n if not t in sumMap:\n sumMap[t] = 1\n return\n for x in add:\n if len(s) > 0 and x >= s[-1]:\n dfs(k - 1, s + [x])\n elif len(s) == 0:\n dfs(k - 1, s + [x])\n\nif n < 12:\n dfs(n, [])\n print(len(sumMap))\nelse:\n dfs(12, [])\n base = len(sumMap)\n print(base + (n - 12) * 49)\n\n", "\r\ndef f(n):\r\n if n < 0:\r\n return 0\r\n val = ( (n+3) * (n+2) * (n+1) ) // 6\r\n return val\r\n\r\ndef g(n):\r\n return f(n) - f(n-6) - 2*f(n-9) + f(n-10) + f(n-14)\r\n\r\nn = int(input())\r\nprint(g(n))\r\n", "def f(n):\r\n\treturn (n+3)*(n+2)*(n+1)//6;\r\nn=int(input());\r\nans=f(n);\r\nif n>=6:ans-=f(n-6);\r\nif n>=9:ans-=f(n-9)*2;\r\nif n>=10:ans+=f(n-10);\r\nif n>=14:ans+=f(n-14);\r\nprint(ans);", "non_representable = {\n 1: 46,\n 2: 89,\n 3: 128,\n 4: 162,\n 5: 190,\n 6: 212,\n 7: 228,\n 8: 238,\n 9: 244,\n 10: 247,\n}\nn = int(input())\nprint(49 * n + 1 - non_representable.get(n, 248))\n", "from collections import defaultdict\n\n\nclass DisjointRangeUnion:\n def __init__(self):\n self.ranges = list()\n\n def add(self, begin, end):\n new_ranges = list()\n for (b, e) in self.ranges:\n if begin <= e and b <= end:\n begin = min(b, begin)\n end = max(e, end)\n else:\n new_ranges.append((b, e))\n new_ranges.append((begin, end))\n self.ranges = new_ranges\n\n def count(self):\n return sum(e - b for (b, e) in self.ranges)\n\n def __repr__(self):\n return repr(self.ranges)\n\n\ndef test_dru():\n dru = DisjointRangeUnion()\n dru.add(0, 5)\n assert dru.count() == 5, dru\n dru.add(3, 8)\n assert dru.count() == 8, dru\n dru.add(20, 23)\n assert dru.count() == 8 + 3, dru\n dru.add(8, 20)\n assert dru.count() == 23, dru\n\n\ndef main():\n n = int(input())\n remainders = defaultdict(DisjointRangeUnion)\n for a in range(min(9, n + 1)):\n for b in range(min(49, n - a + 1)):\n value = 4*a + 9*b\n begin, rem = divmod(value, 49)\n end = begin + (n - a - b)\n remainders[rem].add(begin, end + 1)\n print(sum(ranges.count() for ranges in remainders.values()))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nN = 30\r\nS = [set() for i in range(N)]\r\n\r\nfor i in range(N):\r\n for v in range(N):\r\n for x in range(N):\r\n for l in range(N):\r\n cnt = i + v + x + l\r\n if cnt < N:\r\n val = i + 5 * v + 10 * x + 50 * l\r\n S[cnt].add(val)\r\nif n < 30:\r\n print(len(S[n]))\r\n exit(0)\r\n\r\n# 3 equations\r\n# 9x = 8v + l (if x >= 9, there is another)\r\n# 9v = 5i + 4x (if v >= 9, there is another)\r\n# v + 5x = 5i + l (if v >= 1 and x >= 5, there is another)\r\n# count only if x < 9 and v < 9 and (v < 1 or x < 5)\r\nans = 0\r\nfor x in range(5): # [0, 4]\r\n for v in range(1, 9): # [1, 8] \r\n ans += n - x - v + 1 \r\nfor x in range(9): # [0, 8] and v == 0\r\n ans += n - x + 1\r\nprint(ans)", "x=[0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]\r\nn=int(input())\r\nprint(x[n] if n<=11 else 292+(n-11)*49)", "N=int(input())\r\nfrom collections import deque\r\nq=deque()\r\nINF=10**20\r\ndist = [INF]*49\r\ndist[0]=0\r\nq.append(0)\r\nwhile q:\r\n x = q.popleft()\r\n for d in [4,9]:\r\n y = (x+d)%49\r\n if dist[y]==INF:\r\n dist[y] = dist[x]+1\r\n q.append(y)\r\nans=0\r\nfor i in range(49):\r\n ans += max(0,N-dist[i]+1)\r\nprint(ans)", "a=[0,4,10,20,35,56,83,116,155,198,244]\r\nb=292\r\nn=int(input())\r\nif n<=10:\r\n\tprint(a[n])\r\nelse:\r\n\tprint(b+(n-11)*49)", "\r\nn = int(input())\r\nans = 0\r\nfor v in range(0, 9):\r\n for x in range(0, 49):\r\n if n < v+x: continue\r\n wrong = 0\r\n for vv in range(0, 9):\r\n for xx in range(0, 49):\r\n if n < vv+xx or (vv == v and x == xx): continue\r\n if (v*4+x*9)%49 == (vv*4+xx*9)%49 and (v*4+x*9 > vv*4+xx*9 or (v*4+x*9 == vv*4+xx*9 and v > vv)):\r\n #print (v, x, (v*4+x*9)%49, \"vs.\", vv, xx, (vv*4+xx*9)%49)\r\n wrong = 1\r\n if (wrong == 0):\r\n #print(v, x)\r\n ans += (n-v-x)+1\r\nprint(ans)\r\n\r\n\"\"\"\r\n4\r\n10\r\n20\r\n35\r\n56\r\n83\r\n116\r\n155\r\n198\r\n244\r\n292\r\n341\r\n390\r\n439\r\n\"\"\"\r\n", "n = int(input())\r\n\r\nans = 0\r\nminv = [int(1e9)] * 200000\r\n\r\nminv[0] = 0\r\nfor i in range(49):\r\n for j in range(49):\r\n minv[(4*i+9*j) % 49] = min(minv[(4*i+9*j) % 49], i+j)\r\n\r\nfor i in range(49):\r\n if n >= minv[i]:\r\n ans += n-minv[i]+1\r\n\r\nprint(ans)" ]

[ "a = input()\nb = input()\nn = len(a)\nans = 0\nl = 2\ni = 0\nif a[0] == \"X\":\n l -= 1\nif b[0] == \"X\":\n l -= 1\nwhile i < n - 1:\n count = 0\n if a[i + 1] == \"0\":\n count += 1\n if b[i + 1] == \"0\":\n count += 1\n if l + count >= 3:\n ans += 1\n if l + count == 3:\n l = 0\n else:\n l = 1\n else:\n l = count\n i += 1\nprint(ans)", "from math import *\r\n\r\na=[]\r\ns=input()\r\nn=len(s)\r\na.append(s)\r\ns=input()\r\na.append(s)\r\n\r\n\r\ncur=0\r\nemp=0\r\nans=0\r\nfor i in range(n):\r\n\tcur=0\r\n\tif a[0][i]=='0':\r\n\t\tcur+=1\r\n\tif a[1][i]=='0':\r\n\t\tcur+=1\r\n\temp+=cur\r\n\tif emp>=3:\r\n\t\temp-=3\r\n\t\tans+=1\r\n\telse:\r\n\t\temp=cur\r\n\r\nprint(ans)", "l, r = [{'0': 1, 'X': 0}[c] for cc in zip(input(), input()) for c in cc], 0\r\nfor i in range(0, len(l) - 3, 2):\r\n s = 7 - sum(l[i:i + 4])\r\n if s < 5:\r\n r += 1\r\n l[i:i + s] = [0] * s\r\nprint(r)", "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 mat = []\r\n for i in range(2):\r\n L = list(input()[:-1])\r\n mat.append(L)\r\n ans = 0\r\n n = len(mat[0])\r\n for j in range(n):\r\n # 枚举列\r\n if mat[0][j] == \"0\" and mat[1][j] == \"0\":\r\n flag = False\r\n if j > 0:\r\n if mat[0][j - 1] == \"0\":\r\n mat[0][j - 1] = \"X\"\r\n flag = True\r\n elif mat[1][j - 1] == \"0\":\r\n mat[1][j - 1] = \"X\"\r\n flag = True\r\n if flag is False:\r\n if j < n - 1:\r\n if mat[0][j + 1] == \"0\":\r\n mat[0][j + 1] = \"X\"\r\n flag = True\r\n elif mat[1][j + 1] == \"0\":\r\n mat[1][j + 1] = \"X\"\r\n flag = True\r\n if flag is True:\r\n ans += 1\r\n mat[0][j] = \"X\"\r\n mat[1][j] = \"X\"\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# In this template you are not required to write code in main\r\n\r\n # Remember you were also a novice when you started,\r\n # hence never be rude to anyone who wants to learn something\r\n # Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts\r\n # Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure.\r\n\r\nimport sys\r\n# inf = float(\"inf\")\r\n\r\n# abc='abcdefghijklmnopqrstuvwxyz'\r\n# abd={'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\n# vow=['a','e','i','o','u']\r\n# dx,dy=[-1,1,0,0],[0,0,1,-1]\r\n# sys.setrecursionlimit(10000000)\r\n\r\n\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\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\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nstring1=input()\r\nstring2=input()\r\nn=len(string1)\r\nprev=0;ans=0\r\nfor i in range(n):\r\n curr=(string1[i]=='0')+(string2[i]=='0')\r\n if prev==0:\r\n prev=curr\r\n elif prev==1:\r\n if curr==2:\r\n ans+=1\r\n prev=0\r\n else:\r\n prev=curr\r\n elif prev==2:\r\n if curr==0:\r\n prev=curr\r\n elif curr==1:\r\n ans+=1\r\n prev=0\r\n elif curr==2:\r\n ans+=1\r\n prev=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=input()\r\nb=input()\r\np=ans=0\r\nfor i,x in enumerate(a):\r\n c=(b[i]=='0')+(x=='0')\r\n if p==2:\r\n if c>0: p=c-1;ans+=1\r\n else: p=0\r\n elif p==1:\r\n if c==2: p=0;ans+=1\r\n else: p=c\r\n else: p=c\r\nprint(ans)", "# Problem: D. Bishwock\r\n# Contest: Codeforces - Codeforces Round 491 (Div. 2)\r\n# URL: https://codeforces.com/contest/991/problem/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\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 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# print = 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\nRANDOM = random.randrange(2 ** 62)\r\nMOD = 10 ** 9 + 7\r\n# MOD = 998244353\r\nPROBLEM = \"\"\"https://codeforces.com/contest/991/problem/D\r\n\r\n输入一个 2 行 n(≤100) 列的棋盘。\r\n用数字 0 表示空格子，大写字母 X 表示一开始就被占据的格子。\r\n\r\n你有无数个 L 形状的积木，可以旋转，也就是如下 4 种形状：\r\nXX XX 0X X0\r\nX0 0X XX XX\r\n\r\n积木只能放在空格子上（占据 3 个空格子），不能放在被占据的格子上。积木之间不能重叠。\r\n问：最多可以往棋盘上放多少个积木？\r\n输入\r\n00\r\n00\r\n输出 1\r\n\r\n输入\r\n00X00X0XXX0\r\n0XXX0X00X00\r\n输出 4\r\n\r\n输入\r\n0X0X0\r\n0X0X0\r\n输出 0\r\n\r\n输入 \r\n0XXX0\r\n00000\r\n输出 2\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n a, = RS()\r\n b, = RS()\r\n a = 'X' + a\r\n b = 'X' + b\r\n n = len(a)\r\n f = [[-inf] * 4 for _ in range(n)]\r\n f[0][3] = 0\r\n for i in range(1,n):\r\n mask = (a[i] == 'X') | ((b[i] == 'X') << 1)\r\n if not mask & 1:\r\n f[i][mask | 1] = f[i - 1][0] + 1\r\n if not mask & 2:\r\n f[i][mask | 2] = f[i - 1][0] + 1\r\n f[i][mask] = max(f[i - 1])\r\n if mask == 0:\r\n f[i][3] = max(f[i - 1][:-1]) + 1\r\n print(max(f[-1]))\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", "if __name__ == '__main__':\r\n grid = []\r\n for i in range(2):\r\n row = str(input())\r\n grid.append(row)\r\n n = len(grid[0])\r\n dp = [[0] * 4 for _ in range(n + 1)]\r\n for i in range(1, n):\r\n for j in range(4):\r\n dp[i + 1][j] = dp[i][j]\r\n # Case 1\r\n if grid[0][i - 1] == grid[1][i - 1] == grid[0][i] == \"0\":\r\n dp[i + 1][0] = max(dp[i - 1]) + 1\r\n # Case 2\r\n if grid[0][i - 1] == grid[0][i] == grid[1][i] == \"0\":\r\n dp[i + 1][1] = max(max(dp[i - 1]), dp[i][3]) + 1\r\n # Case 3\r\n if grid[1][i - 1] == grid[0][i] == grid[1][i] == \"0\":\r\n dp[i + 1][2] = max(max(dp[i - 1]), dp[i][0]) + 1\r\n # Case 4\r\n if grid[0][i - 1] == grid[1][i - 1] == grid[1][i] == \"0\":\r\n dp[i + 1][3] = max(dp[i - 1]) + 1\r\n print(max(dp[n]))", "s1 = list(input())\r\ns2 = list(input())\r\ni = 0\r\nans = 0\r\nwhile(i<len(s1)-1):\r\n if s1[i] == '0' and s1[i+1] == '0' and s2[i] == '0':\r\n s1[i] = 'X'; s1[i+1] = 'X'; s2[i] = 'X'; \r\n ans += 1\r\n elif s1[i] == '0' and s1[i+1] == '0' and s2[i+1] == '0':\r\n s1[i] = 'X'; s1[i+1] = 'X'; s2[i+1] = 'X'; \r\n ans += 1\r\n elif s1[i] == '0' and s2[i] == '0' and s2[i+1] == '0':\r\n s1[i] = 'X'; s2[i+1] = 'X'; s2[i+1] = 'X'; \r\n ans += 1\r\n elif s1[i+1] == '0' and s2[i] == '0' and s2[i+1] == '0':\r\n s1[i+1] = 'X'; s2[i] = 'X'; s2[i+1] = 'X'; \r\n ans += 1\r\n i+=1\r\nprint(ans)", "\r\n\r\nlist1 = list(input())\r\nlist2 = list(input())\r\nn = len(list1)\r\ncount=0\r\nfor i in range(n):\r\n if list1[i]=='0':\r\n if i>0 and list1[i-1]=='0' and list2[i-1]=='0':\r\n count+=1\r\n list1[i]='X'\r\n list2[i-1]='x'\r\n list1[i-1]='x'\r\n elif i>0 and list2[i]=='0' and list2[i-1]=='0':\r\n count+=1\r\n list1[i]='x'\r\n list2[i]='x'\r\n list2[i-1]='x'\r\n elif i>0 and list2[i]=='0' and list1[i-1]=='0':\r\n count+=1\r\n list1[i]='x'\r\n list2[i]='x'\r\n list1[i-1]='x'\r\n elif i<n-1 and list1[i]=='0' and list2[i]=='0' and list2[i+1]=='0':\r\n count+=1\r\n list1[i]='x'\r\n list2[i]='x'\r\n list2[i+1]='x'\r\n i+=1\r\n\r\nprint(count)", "A = [0 if x=='0' else 1 for x in input()]\r\nB = [0 if x=='0' else 1 for x in input()]\r\nres = 0\r\np0,p1=1,1\r\nfor a,b in zip(A,B):\r\n if a+b+p0+p1<=1:\r\n p0,p1 = 1,p0+p1+a+b\r\n res += 1\r\n else:\r\n p0,p1 = a,b\r\nprint(res)", "a = input()\r\nb = input()\r\n\r\nv2, oa, ob, o2 = 0,0,0,0\r\nif a[0] == b[0] == '0':\r\n v2, oa, ob, o2 = 0,-1,-1,-1\r\nelif a[0] == '0':\r\n v2, oa, ob, o2 = -1,-1,0,-1\r\nelif b[0] == '0':\r\n v2, oa, ob, o2 = -1,0,-1,-1\r\nelse:\r\n v2, oa, ob, o2 = -1,-1,-1,0\r\n\r\nfor i in range(1, len(a)):\r\n nv2 = max(v2, oa, ob, o2)\r\n if a[i] == 'X' or b[i] == 'X':\r\n nv2 = -1\r\n\r\n no2 = -1\r\n if a[i] == '0' == b[i]:\r\n no2 = max(v2, oa, ob) + 1\r\n elif a[i] == '0' or b[i] == '0':\r\n if v2 > -1:\r\n no2 = v2 + 1\r\n else:\r\n no2 = max(v2, oa, ob, o2)\r\n\r\n noa = -1\r\n if a[i] == b[i] == '0':\r\n if v2 > -1:\r\n noa = v2 + 1\r\n elif a[i] == '0':\r\n noa = -1\r\n elif b[i] == '0':\r\n noa = max(v2, oa, ob, o2)\r\n \r\n nob = -1\r\n if a[i] == b[i] == '0':\r\n if v2 > -1:\r\n nob = v2 + 1\r\n elif b[i] == '0':\r\n nob = -1\r\n elif a[i] == '0':\r\n nob = max(v2, oa, ob, o2)\r\n v2, oa, ob, o2 = nv2, noa, nob, no2\r\n\r\nprint(max(v2, oa, ob, o2, 0))\r\n\r\n\r\n \r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nw = input()[:-1]\r\nn = len(s)\r\nc = 0\r\ni = 0\r\nwhile i < n:\r\n if s[i] == w[i] == 'X':\r\n i += 1\r\n elif (s[i] == 'X' and w[i] == '0') or (s[i] == '0' and w[i] == 'X'):\r\n if i == n-1:\r\n break\r\n else:\r\n if s[i+1] == 'X' or w[i+1] == 'X':\r\n i += 1\r\n else:\r\n c += 1\r\n i += 2\r\n else:\r\n if i == n-1:\r\n break\r\n else:\r\n if s[i+1] == w[i+1] == 'X':\r\n i += 2\r\n elif s[i+1] == 'X' or w[i+1] == 'X':\r\n c += 1\r\n i += 2\r\n else:\r\n if i == n-2:\r\n c += 1\r\n break\r\n else:\r\n if s[i+2] == 'X' or w[i+2] == 'X':\r\n c += 1\r\n i += 2\r\n else:\r\n c += 2\r\n i += 3\r\n\r\nprint(c)\r\n", "s = \"X\" + input()\nt = \"X\" + input()\nans = 0\nn = len(s)\nleft = 0\nfor i in range(1, n):\n count = 0\n if s[i] == \"0\":\n count += 1\n if t[i] == \"0\":\n count += 1\n if count + left >= 3:\n ans += 1\n left = (count + left) - 3\n else:\n left = count\nprint(ans)", "#!/bin/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n str1 = input()\r\n str2 = input()\r\n \r\n arr1 = [0] * len(str1)\r\n arr2 = [0] * len(str2)\r\n \r\n count = 1\r\n \r\n for i in range(len(arr1)):\r\n if str1[i] == \"0\":\r\n arr1[i] = count\r\n if str2[i] == \"0\":\r\n arr2[i] = count\r\n \r\n if i > 0:\r\n if arr1[i - 1] == count and arr2[i - 1] == count:\r\n if arr1[i] == count and arr2[i] == count:\r\n arr1[i] += 1\r\n count += 1\r\n elif arr1[i] == count or arr2[i] == count:\r\n count += 1\r\n \r\n elif arr1[i - 1] == count or arr2[i - 1] == count:\r\n if arr1[i] == count and arr2[i] == count:\r\n count += 1\r\n \r\n print(count - 1)", "s=[*input()]+[\"*\"]\r\ns1=[*input()]+[\"*\"]\r\nk=0\r\nfor i in range(len(s)-1):\r\n if s[i]==\"0\":\r\n if s1[i]==\"0\":\r\n if s[i+1]==\"0\":\r\n k+=1\r\n s[i]=1\r\n s1[i]=1\r\n s[i+1]=1\r\n elif s1[i+1]==\"0\":\r\n k+=1\r\n s[i]=1\r\n s1[i]=1\r\n s1[i+1]=1\r\n else: \r\n if s[i+1]==\"0\":\r\n if s1[i+1]==\"0\":\r\n k+=1\r\n s[i]=1\r\n s1[i+1]=1\r\n s[i+1]=1\r\n elif s1[i]==\"0\":\r\n if s1[i+1]==\"0\":\r\n if s[i+1]==\"0\":\r\n k+=1\r\n s1[i]=1\r\n s1[i+1]=1\r\n s[i+1]=1\r\nprint(k)", "A = input()\r\nB = input()\r\nres = 0\r\np0,p1=1,1\r\nfor a,b in zip(A,B):\r\n a = a=='X'\r\n b = b=='X'\r\n if a+b+p0+p1<=1:\r\n p0,p1 = 1,p0+p1+a+b\r\n res += 1\r\n else:\r\n p0,p1 = a,b\r\nprint(res)", "try:\n while True:\n str1 = input()\n str1 = \"X\" + str1 + \"X\"\n str2 = input()\n str2 = \"X\" + str2 + \"X\"\n cnt = [[str1[i], str2[i]].count('0') for i in range(len(str1))]\n ans = 0\n for i in range(len(str1) -2):\n if cnt[i] + cnt[i+1] > 2:\n cnt[i+1] = cnt[i] + cnt[i+1] - 3\n ans += 1\n print(ans)\n\nexcept Exception as e:\n pass\n \t \t\t\t\t\t\t \t \t \t \t \t \t \t\t", "s=[]\r\ncounter=0\r\n\r\ndef checar():\r\n\tglobal s\r\n\tglobal counter\r\n\tfor x in range(len(s[0])):\r\n\t\tif(s[0][x]=='0'):\r\n\t\t\tif(s[1][x]=='0'):\r\n\t\t\t\tif(x>0 and s[1][x-1]=='0'):\r\n\t\t\t\t\ts[0][x]='X'\r\n\t\t\t\t\ts[1][x]='X'\r\n\t\t\t\t\ts[1][x-1]='X'\r\n\t\t\t\t\tcounter+=1\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif(x<len(s[0])-1 and s[1][x+1]=='0'):\r\n\t\t\t\t\ts[0][x]='X'\r\n\t\t\t\t\ts[1][x]='X'\r\n\t\t\t\t\ts[1][x+1]='X'\r\n\t\t\t\t\tcounter+=1\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif(x<len(s[0])-1 and s[0][x+1]=='0'):\r\n\t\t\t\t\ts[0][x]='X'\r\n\t\t\t\t\ts[1][x]='X'\r\n\t\t\t\t\ts[0][x+1]='X'\r\n\t\t\t\t\tcounter+=1\r\n\t\t\t\t\tcontinue\r\n\t\t\telif(x<len(s[0])-1 and s[0][x+1]=='0' and s[1][x+1]=='0'):\r\n\t\t\t\ts[0][x]='X'\r\n\t\t\t\ts[0][x+1]='X'\r\n\t\t\t\ts[1][x+1]='X'\r\n\t\t\t\tcounter+=1\r\n\t\t\t\tcontinue\r\n\r\ns.append(list(input()))\r\ns.append(list(input()))\r\n# print(s)\r\nchecar()\r\n# print(s)\r\nprint(counter)", "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\nfigures=[\r\n ((0,0),(0,1),(1,0)),\r\n ((0,0),(0,1),(1,1)),\r\n ((0,1),(1,0),(1,1)),\r\n ((0,0),(1,0),(1,1)),\r\n]\r\n\r\nboard=[]\r\nfor _ in range(2):\r\n s=rl()\r\n board.append(list(s))\r\n\r\nn=len(board[0])\r\n\r\nans=0\r\nfor j in range(n-1):\r\n for fig in figures:\r\n ok=1\r\n for fi,fj in fig:\r\n if board[fi][j+fj]=='X':\r\n ok=0\r\n break\r\n if not ok:\r\n continue\r\n ans+=1\r\n for fi,fj in fig:\r\n board[fi][j+fj]='X'\r\n\r\nprint(ans)\r\n", "\r\ndef check1(i):\r\n if i >= n-1: return 0 \r\n if a[1][i] == 'X' or a[0][i] == 'X' or a[0][i+1] == 'X': return 0 \r\n a[0][i] = a[1][i] = a[0][i+1] = 'X'\r\n return 1\r\n\r\ndef check2(i):\r\n if i <= 0: return 0 \r\n if a[1][i] == 'X' or a[0][i] == 'X' or a[0][i-1] == \"X\": return 0 \r\n a[0][i] = a[1][i] = a[0][i-1] = 'X'\r\n return 1\r\n\r\ndef check3(i):\r\n if i >= n-1: return 0 \r\n if a[0][i] == 'X' or a[1][i] == 'X': return 0 \r\n if a[1][i+1] == 'X': return 0\r\n a[0][i] = a[1][i] = a[1][i+1] = 'X'\r\n return 1\r\n\r\ndef check4(i):\r\n if i <= 0: return 0 \r\n if a[0][i] == 'X' or a[1][i] == 'X': return 0 \r\n if a[1][i-1] == 'X': return 0\r\n a[0][i] = a[1][i] = a[1][i-1] = 'X'\r\n return 1\r\n\r\nif __name__ == \"__main__\":\r\n a = []\r\n for i in range(2):\r\n a.append(list(input()))\r\n \r\n n = len(a[0])\r\n res = 0\r\n for i in range(n):\r\n res += check2(i)\r\n res += check4(i)\r\n res += check1(i)\r\n res += check3(i)\r\n \r\n print(res)", "lis=[]\r\nn=0\r\nfor i in range(2):\r\n s = list(input())\r\n n = len(s)\r\n lis.append(s)\r\nans=0 \r\nfor i in range(1,n):\r\n if lis[0][i-1]=='0' and lis[1][i-1]=='0' and lis[1][i]=='0':\r\n lis[0][i-1]='X';lis[1][i-1]='X';lis[1][i]='X';\r\n ans+=1\r\n elif lis[0][i-1]=='0' and lis[0][i]=='0' and lis[1][i]=='0':\r\n ans+=1\r\n lis[0][i-1]='X';lis[0][i]='X';lis[1][i]='X';\r\n elif lis[0][i-1]=='0' and lis[0][i]=='0' and lis[1][i-1]=='0':\r\n ans+=1\r\n lis[0][i-1]='X';lis[0][i]='X';lis[1][i-1]='X'; \r\n elif lis[0][i]=='0' and lis[1][i-1]=='0' and lis[1][i]=='0':\r\n ans+=1\r\n lis[0][i]='X';lis[1][i-1]='X';lis[1][i]='X';\r\n# for j in lis:\r\n# print(*j)\r\nprint(ans) \r\n\r\n \r\n \r\n\r\n \r\n", "b = [list(input()) for _ in range(2)]\r\n\r\nn = len(b[0])\r\nans = 0\r\na = []\r\nfor i in range(n):\r\n ai = 0\r\n if b[0][i] == '0':\r\n ai += 1\r\n if b[1][i] == '0':\r\n ai += 1\r\n a.append(ai)\r\nprv = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n prv = 0\r\n elif a[i] == 1:\r\n if prv == 2:\r\n ans += 1\r\n prv = 0\r\n else:\r\n prv = 1\r\n elif a[i] == 2:\r\n if prv == 2:\r\n ans += 1\r\n prv = 1\r\n elif prv == 1:\r\n ans += 1\r\n prv = 0\r\n else:\r\n prv = 2\r\nprint(ans)", "F = [i for i in input()]\r\nS = [i for i in input()]\r\nN = len(F)\r\nif(N==1):\r\n print(0)\r\n exit()\r\nAns = 0\r\n# Starter\r\n\r\nfor i in range(N-1):\r\n if(S[i] == \"0\" and F[i] == \"0\"):\r\n if(S[i+1] == \"0\"):\r\n Ans += 1\r\n S[i] = \"X\"\r\n S[i+1] = \"X\"\r\n F[i] = \"X\"\r\n elif(F[i+1] == \"0\"):\r\n Ans += 1\r\n S[i] = \"X\"\r\n S[i] = \"X\"\r\n F[i+1] = \"X\"\r\n elif(S[i] == \"0\"):\r\n if(S[i+1] == \"0\" and F[i+1] == \"0\"):\r\n Ans += 1\r\n S[i] = \"X\"\r\n S[i+1] = \"X\"\r\n F[i+1] = \"X\"\r\n elif(F[i] == \"0\"):\r\n if(S[i+1] == \"0\" and F[i+1] == \"0\"):\r\n Ans += 1\r\n S[i] = \"X\"\r\n S[i+1] = \"X\"\r\n F[i+1] = \"X\"\r\ni = N-1\r\nif(S[i] == \"0\" and F[i] == \"0\"):\r\n if(S[i-1] == \"0\"):\r\n Ans += 1\r\n \r\n elif(F[i-1] == \"0\"):\r\n Ans += 1\r\n \r\nelif(S[i] == \"0\"):\r\n if(S[i-1] == \"0\" and F[i-1] == \"0\"):\r\n Ans += 1\r\n \r\nelif(F[i] == \"0\"):\r\n if(S[i-1] == \"0\" and F[i-1] == \"0\"):\r\n Ans += 1\r\n\r\nprint(Ans)", "s = [list(input()), list(input())]\r\nans = 0\r\nl = len(s[0])\r\ni = 0\r\nwhile i < l - 1:\r\n a = (s[0][i], s[0][i + 1], s[1][i], s[1][i + 1])\r\n if a.count(\"0\") == 4:\r\n ans += 1\r\n s[0][i + 1] = \"X\"\r\n i+=1\r\n elif a.count(\"0\") == 3:\r\n ans += 1\r\n i += 2\r\n else:\r\n i += 1\r\nprint(ans)\r\n", "s=list(input())\r\ns1=list(input())\r\nm=[s,s1]\r\nans=c=0\r\nn=len(s)\r\nfor i in range(0,n-1):\r\n a=\"\"\r\n \r\n a+=m[0][i]\r\n a+=m[0][i+1]\r\n a+=m[1][i]\r\n a+=m[1][i+1]\r\n j=a.count('0')\r\n if j==3:\r\n c+=1\r\n m[0][i]='-1'\r\n m[0][i+1]='-1'\r\n m[1][i]='-1'\r\n m[1][i+1]='-1'\r\n if j==4:\r\n c+=1\r\n m[0][i]='-1'\r\n m[1][i]='-1'\r\n m[1][i+1]='-1'\r\nprint(c)\r\n \r\n ", "input_1 = input()\r\ninput_2 = input()\r\n\r\nline_1 = [i for i in str(input_1)]\r\nline_2 = [i for i in str(input_2)]\r\n\r\nno = 0\r\nfor i in range(len(line_1) - 1):\r\n if line_1[i] != 'X' and line_2[i] != 'X':\r\n if line_1[i + 1] != 'X':\r\n no += 1\r\n line_1[i] = 'X'\r\n line_2[i] = 'X'\r\n line_1[i + 1] = 'X'\r\n\r\n elif line_2[i + 1] != 'X':\r\n no += 1\r\n line_1[i] = 'X'\r\n line_2[i] = 'X'\r\n line_2[i + 1] = 'X'\r\n\r\n elif line_1[i] != 'X' and line_1[i + 1] != 'X' and line_2[i + 1] != 'X':\r\n no += 1\r\n line_1[i] = 'X'\r\n line_1[i + 1] = 'X'\r\n line_2[i + 1] = 'X'\r\n\r\n elif line_2[i] != 'X' and line_1[i + 1] != 'X' and line_2[i + 1] != 'X':\r\n no += 1\r\n line_2[i] = 'X'\r\n line_1[i + 1] = 'X'\r\n line_2[i + 1] = 'X'\r\n\r\nprint(no)\r\n\r\n \r\n\r\n \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\nl = [[['0','0'],['0','X']],[['0','0'],['X','0']],[['0','X'],['0','0']],[['X','0'],['0','0']]]\nA = [x for x in input()]\nB = [x for x in input()]\nans = 0\nfor i in range(len(A)-1):\n a = [A[i],A[i+1]]\n b = [B[i],B[i+1]]\n if [a,b]==[['0','0'],['0','0']]:\n A[i]=\"X\";B[i]=\"X\";B[i+1]=\"X\"\n ans+=1\n continue\n\n if [a,b] in l:\n A[i]=\"X\";A[i+1]=\"X\";B[i]=\"X\";B[i+1]=\"X\"\n ans+=1\nprint(ans)", "def solve():\r\n f = input() \r\n s = input()\r\n tmp = [list(f), list(s)]\r\n n = len(tmp[0])\r\n dp = [[0] * 3 for _ in range(n + 1)]\r\n tmp = [[x, y] for x, y in zip(*tmp)]\r\n for i in range(2, n + 1):\r\n dp[i][0] = dp[i][1] = dp[i][2] = max(dp[i - 1])\r\n if tmp[i - 1][0] == '0' and tmp[i - 2][0] == '0' and tmp[i - 2][1] == '0':\r\n dp[i][0] = max(dp[i][0], max(dp[i - 2]) + 1)\r\n if tmp[i - 1][1] == '0' and tmp[i - 2][0] == '0' and tmp[i - 2][1] == '0':\r\n dp[i][1] = max(dp[i][1], max(dp[i - 2]) + 1)\r\n if tmp[i - 1][1] == '0' and tmp[i - 1][0] == '0' and tmp[i - 2][0] == '0':\r\n dp[i][2] = max(dp[i][2], dp[i - 1][1] + 1)\r\n if tmp[i - 1][1] == '0' and tmp[i - 1][0] == '0' and tmp[i - 2][1] == '0':\r\n dp[i][2] = max(dp[i][2], dp[i - 1][0] + 1) \r\n\r\n print(max(dp[-1])) \r\n \r\n\r\nsolve()\r\n", "t1 = [i for i in input()]\r\nt2 = [i for i in input()]\r\nfor i in range(len(t1)):\r\n if t1[i] == 'X':\r\n t1[i] = 0\r\n else:\r\n t1[i] = 1\r\n if t2[i] == 'X':\r\n t2[i] = 0\r\n else:\r\n t2[i] = 1\r\n \r\ndef ans(t1,t2,i = 0):\r\n if len(t1) <= 1:\r\n return i\r\n if t1[-1]+t2[-1] == 0:\r\n t1.pop()\r\n t2.pop()\r\n return ans(t1,t2,i)\r\n if t1[-2]+t1[-1]+t2[-2]+t2[-1] == 4:\r\n t1.pop()\r\n t2.pop()\r\n t1[-1] = 0\r\n return ans(t1,t2,1+i)\r\n if t1[-2]+t1[-1]+t2[-2]+t2[-1] == 3:\r\n t1.pop()\r\n t1.pop()\r\n t2.pop()\r\n t2.pop()\r\n return ans(t1,t2,i+1)\r\n if t1[-2]+t1[-1]+t2[-2]+t2[-1] <= 2:\r\n t1.pop()\r\n t2.pop()\r\n return ans(t1,t2,i)\r\n\r\nprint(ans(t1,t2))", "a = list(input())\nb = list(input())\nn = len(a)\nr = p = 0\nfor i in range(n):\n c = 1 if a[i] != b[i] else (0 if a[i] == 'X' else 2)\n p += c\n if p < 3:\n p = c\n else:\n r += 1\n p = 0 if p == 3 else 1\nprint(r)", "def check(i):\r\n\tif s[0][i-1]==s[1][i-1]==s[1][i]==s[0][i]=='0':\r\n\t\treturn 4\r\n\telif s[0][i-1]==s[1][i-1]==s[1][i]=='0':\r\n\t\treturn 0\r\n\telif s[0][i-1]==s[1][i-1]==s[0][i]=='0':\r\n\t\treturn 1\r\n\telif s[0][i]==s[1][i]==s[0][i-1]=='0':\r\n\t\treturn 2\r\n\telif s[0][i]==s[1][i]==s[1][i-1]=='0':\r\n\t\treturn 3\r\n\treturn -1\r\ns=[input(),input()]\r\nn=len(s[0])\r\ndp=[[0]*4 for i in range(n+1)]\r\nfor i in range(1,n):\r\n\tx=check(i)\r\n\t# print(i,x)\r\n\t# if x==-1:continue\r\n\tif x==4 or x==0:\r\n\t\tdp[i][0]=max(dp[i-2])+1\r\n\tif x==4 or x==1:\r\n\t\tdp[i][1]=max(dp[i-2])+1\r\n\tif x==4 or x==2:\r\n\t\tdp[i][2]=max(max(dp[i-2]),dp[i-1][0])+1\r\n\tif x==4 or x==3:\r\n\t\tdp[i][3]=max(max(dp[i-2]),dp[i-1][1])+1\r\n\tif x!=4:\r\n\t\tfor j in range(4):\r\n\t\t\tif j!=x:dp[i][j]=max(dp[i-1][j],dp[i-2][j])\r\nprint(max(dp[-2]))\r\n# print(dp)", "import math\r\nimport sys\r\nimport queue\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef can_insert(a, b):\r\n for i in range(4):\r\n if a[i] == \"1\" and b[i] == \"X\":\r\n return False\r\n return True\r\n\r\n\r\ndef solve():\r\n f = [str(input()) for i in range(2)]\r\n p = [\"1110\", \"1101\", \"1011\", \"0111\"]\r\n\r\n dp = [[0 for j in range(len(f[0]) + 2)] for i in range(4)]\r\n for i in range(1, len(f[0])):\r\n\r\n r = [f[0][i - 1], f[1][i - 1], f[0][i], f[1][i]]\r\n\r\n for j in range(4):\r\n dp[j][i + 1] = dp[j][i] * 1\r\n if can_insert(p[j], r):\r\n dp[j][i + 1] = max(dp[j][i + 1], 1 + max([dp[k][i - 1] for k in range(4)]))\r\n if j >= 2:\r\n y = dp[0][i] if j == 3 else dp[1][i]\r\n dp[j][i + 1] = max(dp[j][i + 1], 1 + y)\r\n\r\n res = 0\r\n for i in range(4):\r\n res = max(res, max(dp[i]))\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "words = input()\r\nwords2 = input()\r\n\r\ncount = 0\r\ncounts = []\r\nfor i in range(len(words)):\r\n cur = 0\r\n if words[i] == '0':\r\n cur += 1\r\n if words2[i] == '0':\r\n cur += 1\r\n counts.append(cur)\r\n\r\nans = 0\r\nfor i in range(len(words) -1):\r\n if counts[i] == 2 and counts[i+1] > 0:\r\n counts[i+1] -= 1\r\n ans += 1\r\n elif counts[i] == 1 and counts[i+1] == 2:\r\n counts[i+1] -= 2\r\n ans += 1\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n ", "grid = [list(input()) for _ in range(2)]\r\nn = len(grid[0])\r\n\r\ncnt = 0\r\nfor i in range(n-1):\r\n if grid[0][i] == grid[1][i] == '0':\r\n if grid[0][i+1] == '0':\r\n grid[0][i] = grid[1][i] = grid[0][i+1] = 'X'\r\n cnt += 1\r\n elif grid[1][i+1] == '0':\r\n grid[0][i] = grid[1][i] = grid[1][i+1] = 'X'\r\n cnt += 1\r\n elif grid[0][i] == '0':\r\n if grid[1][i+1] == grid[0][i+1] == '0':\r\n grid[0][i] = grid[1][i+1] = grid[0][i+1] = 'X'\r\n cnt += 1\r\n elif grid[1][i] == '0':\r\n if grid[1][i+1] == grid[0][i+1] == '0':\r\n grid[1][i] = grid[1][i+1] = grid[0][i+1] = 'X'\r\n cnt += 1\r\nprint(cnt)", "a=list(input())\r\nb=list(input())\r\nc=[]\r\nfor i in range(len(a)):\r\n c.append(int(a[i]==\"0\")+int(b[i]==\"0\"))\r\nd=0\r\nfor i in range(len(a)-1):\r\n if c[i]==2 and c[i+1]==2:\r\n c[i]=0\r\n c[i+1]=1\r\n d=d+1\r\n elif c[i]==1 and c[i+1]==2:\r\n c[i]=0\r\n c[i+1]=0\r\n d=d+1\r\n if c[i]==2 and c[i+1]==1:\r\n c[i]=0\r\n c[i+1]=0\r\n d=d+1\r\nprint(d)", "f = lambda x: int(x == '0')\r\narr = [c1 + c2 for c1, c2 in zip(map(f, input()), map(f, input()))]\r\nres = 0\r\nfor i in range(len(arr) - 1):\r\n if arr[i] + arr[i + 1] >= 3:\r\n res += 1\r\n arr[i], arr[i + 1] = 0, arr[i] + arr[i + 1] - 3\r\nprint(res)", "def main():\r\n a = [i for i in input()]\r\n b = [i for i in input()]\r\n # print(a)\r\n # print(b)\r\n res = 0\r\n # last state\r\n p = 2\r\n for x, y in zip(a, b):\r\n '''\r\n XX XX 0X X0\r\n X0 0X XX XX\r\n '''\r\n if x == y == 'X':\r\n p = 2\r\n elif x == y == '0':\r\n if p == 2:\r\n p = 0\r\n elif p == 1:\r\n res += 1\r\n p = 2\r\n else:\r\n res += 1\r\n p = 1\r\n elif p == 0:\r\n res += 1\r\n p = 2\r\n else:\r\n p = 1\r\n\r\n print(res)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = [[0 if c=='0' else 1 for c in input()]]\r\nS.append([0 if c=='0' else 1 for c in input()])\r\n\r\nans = 0\r\nN = len(S[0])\r\nfor i in range(N-1):\r\n tmp = S[0][i]+S[0][i+1]+S[1][i]+S[1][i+1]\r\n if tmp>1:continue\r\n ans+=1\r\n cnt = 0\r\n \r\n if S[0][i]==0:\r\n cnt+=1\r\n S[0][i]=1\r\n if S[1][i]==0:\r\n cnt+=1\r\n S[1][i]=1\r\n if cnt<3 and S[0][i+1]==0:\r\n cnt+=1\r\n S[0][i+1]=1\r\n if cnt<3 and S[1][i+1]==0:\r\n cnt+=1\r\n S[1][i+1]=1\r\n \r\nprint(ans)\r\n \r\n", "import sys,os\r\nfrom math import gcd,log \r\nfrom bisect import bisect as bi\r\nfrom collections import defaultdict,Counter\r\ninput=sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\nfrom heapq import heappush,heappop\r\nimport random as rd\r\n\r\nl = [list(input().strip())]\r\nl.append(list(input().strip()))\r\nan = 0\r\nn = len(l[0])\r\nfor i in range(n-1):\r\n\tcnt = [l[0][i],l[0][i+1],\r\n\t\t\tl[1][i],l[1][i+1]].count('X')\r\n\tif cnt <= 1:\r\n\t\tan+=1\r\n\t\tif l[0][i]=='X' or l[1][i]=='X':\r\n\t\t\tl[0][i+1] = l[1][i+1] = 'X'\r\n\t\telif (l[0][i+1]=='0'):\r\n\t\t\tl[0][i+1] = 'X' \r\n\t\telse:\r\n\t\t\tl[1][i+1] = \"X\" \r\nprint(an)", "from math import inf\r\n\r\na=[0,0]\r\na[0]=[str(c)for c in list(input().strip()) ]\r\na[1]=[str(X) for X in list(input().strip())]\r\n\r\nan = [-inf,-inf,-inf]\r\nif a[0][0]==a[1][0]=='0':\r\n an[0]=0\r\nelif a[0][0]!=a[1][0]:\r\n an[1]=0\r\nx=0\r\nfor i in range(1,len(a[0])) :\r\n # print(a[0][i],a[1][i],an,x)\r\n if an[0]==0:\r\n if a[0][i]==a[1][i]=='0':\r\n x+=1\r\n\r\n an=[-inf,0 ,-inf]\r\n elif a[0][i]!=a[1][i]:\r\n x+=1\r\n an=[-inf]*3\r\n else:\r\n an = [-inf, -inf, -inf]\r\n elif an[1]==0:\r\n if a[0][i]==a[1][i]=='0':\r\n x+=1\r\n an=[-inf,-inf ,-inf]\r\n elif a[0][i]!=a[1][i]:\r\n pass\r\n else:\r\n an=[-inf,-inf ,-inf]\r\n else:\r\n if a[0][i]==a[1][i]=='0':\r\n\r\n an=[0,-inf ,-inf]\r\n elif a[0][i]!=a[1][i]:\r\n an=[-inf,0,-inf]\r\n else:\r\n an=[-inf,-inf ,-inf]\r\n\r\n\r\nprint(x)", "l1 = list(input())\r\nl2 = list(input())\r\ns = 0\r\nwhile len(l1) >2 and len(l2) >2 :\r\n\tif l1[0] =='X' and l2[0] == 'X':\r\n\t\tl1.pop(0) \r\n\t\tl2.pop(0)\r\n\telif l1[0] == '0' and l2[0] == 'X' :\r\n\t\tif l1[1] == '0' and l2[1] == '0' :\r\n\t\t\ts += 1\r\n\t\t\tl1.pop(1)\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(1)\r\n\t\t\tl2.pop(0)\r\n\t\telif l1[1] == 'X' and l2[1] == 'X' : \r\n\t\t\tl1.pop(1)\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(1)\r\n\t\t\tl2.pop(0)\r\n\t\telse :\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(0)\r\n\telif l1[0] == 'X' and l2[0] == '0' :\r\n\t\tif l1[1] == '0' and l2[1] == '0' :\r\n\t\t\ts += 1\r\n\t\t\tl1.pop(1)\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(1)\r\n\t\t\tl2.pop(0)\r\n\t\telif l1[1] == 'X' and l2[1] == 'X' : \r\n\t\t\tl1.pop(1)\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(1)\r\n\t\t\tl2.pop(0)\r\n\t\telse :\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(0)\r\n\t\t\t\r\n\telse :\r\n\t\tif (l1[1] == 'X' and l2[1] == '0' ) or (l1[1] == '0' and l2[1] == 'X' ):\r\n\t\t\ts += 1\r\n\t\t\tl1.pop(1)\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(1)\r\n\t\t\tl2.pop(0)\r\n\r\n\t\telif (l1[1] == 'X' and l2[1] == 'X' ):\r\n\t\t\tl1.pop(1)\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(1)\r\n\t\t\tl2.pop(0)\r\n\t\telse :\r\n\t\t\ts += 1\r\n\t\t\tl1[1] = 'X'\r\n\t\t\tl2[1] = '0'\r\n\t\t\tl1.pop(0)\r\n\t\t\tl2.pop(0)\r\n\r\nif len(l1) == 2 :\r\n\tif l1[0] == '0' and l2[0] == '0' :\r\n\t\tif l1[1] == '0' or l2[1] == '0' :\r\n\t\t\ts += 1\r\n\telif (l1[0] == '0' and l2[0] == 'X') or (l1[0] == 'X' and l2[0] == '0'):\r\n\t\tif l1[1] == '0' and l2[1] == '0' :\r\n\t\t\ts += 1\r\n\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t", "def f(ch):\r\n if ch=='0':\r\n return 0\r\n else:\r\n return 1\r\n\r\nU=[ [f(i) for i in list(input())],\r\n [f(i) for i in list(input())]]\r\ni=0\r\nsize=len(U[0])\r\nans=0\r\nwhile i+1<size:\r\n if U[0][i]+U[0][i+1]+U[1][i]+U[1][i+1]>1:\r\n i+=1\r\n continue\r\n elif U[0][i]+U[0][i+1]+U[1][i]+U[1][i+1]==1:\r\n U[0][i]=1\r\n U[0][i+1]=1\r\n U[1][i]=1\r\n U[1][i+1]=1\r\n ans+=1\r\n else:\r\n U[0][i]=1\r\n U[0][i+1]=1\r\n U[1][i]=1\r\n ans+=1\r\n ###\r\n ###\r\n ###\r\n i+=1\r\n\r\nprint(ans)\r\n", "A = input()\r\nB = input()\r\nres = 0\r\np0,p1=1,1\r\nfor a,b in zip(A,B):\r\n a, b = a=='X',b=='X'\r\n w = a+b+p0+p1\r\n res += w<=1\r\n p0,p1 = (1,w) if w<=1 else (a,b) \r\nprint(res)", "arr1=str(input())\r\narr2=str(input())\r\narr1=arr1.encode()\r\narr2=arr2.encode()\r\narr1=bytearray(arr1)\r\narr2=bytearray(arr2)\r\nn, tot=len(arr1), 0\r\nfor i in range(n-1):\r\n\tif arr1[i]==48 and arr1[i+1]==48 and arr2[i]==48:\r\n\t\ttot+=1\r\n\t\tarr1[i]=49\r\n\t\tarr1[i+1]=49\r\n\t\tarr2[i]=49\r\n\telif arr1[i]==48 and arr2[i]==48 and arr2[i+1]==48:\r\n\t\ttot+=1\r\n\t\tarr1[i]=49\r\n\t\tarr2[i]=49\r\n\t\tarr2[i+1]=49\r\n\telif arr2[i]==48 and arr2[i+1]==48 and arr1[i+1]==48:\r\n\t\ttot+=1\r\n\t\tarr2[i]=49\r\n\t\tarr2[i+1]=49\r\n\t\tarr1[i+1]=49\r\n\telif arr1[i]==48 and arr1[i+1]==48 and arr2[i+1]==48:\r\n\t\ttot+=1\r\n\t\tarr1[i]=49\r\n\t\tarr1[i+1]=49\r\n\t\tarr2[i+1]=49\r\nprint(tot)", "import sys\r\n\r\n\r\ndef II(): return int(sys.stdin.readline())\r\ndef LI(): return [int(num) for num in sys.stdin.readline().split()]\r\ndef SI(): return sys.stdin.readline().rstrip()\r\n\r\n\r\nup = [char for char in SI()]\r\ndown = [char for char in SI()]\r\n\r\nans = 0\r\nborder = len(up)\r\nind = 0\r\nwhile ind < border - 1:\r\n if up[ind] == up[ind + 1] == down[ind] == '0':\r\n up[ind] = up[ind + 1] = down[ind] = '1'\r\n ans += 1\r\n elif up[ind] == down[ind] == down[ind + 1] == '0':\r\n up[ind] = down[ind] = down[ind + 1] = '1'\r\n ans += 1\r\n elif up[ind] == up[ind + 1] == down[ind + 1] == '0':\r\n up[ind] = up[ind + 1] = down[ind + 1] = '1'\r\n ans += 1\r\n elif up[ind + 1] == down[ind] == down[ind + 1] == '0':\r\n up[ind + 1] = down[ind] = down[ind + 1] = '1'\r\n ans += 1\r\n ind += 1\r\n\r\nprint(ans)", "s=input()\r\ns2=input()\r\nd={\"0\":1,\"X\":0}\r\narr=[]\r\nfor i in range(len(s)):\r\n arr.append(d[s[i]]+d[s2[i]])\r\nans=0\r\nfor i in range(len(s)-1):\r\n if(arr[i]==2 and arr[i+1]>0):\r\n arr[i]=0\r\n arr[i+1]-=1\r\n ans+=1\r\n if(arr[i]==1 and arr[i+1]==2):\r\n arr[i]-=1\r\n arr[i+1]-=2\r\n ans+=1\r\nprint(ans)", "in1 = input()\r\nin2 = input()\r\ns1 = []\r\ns2 = []\r\n\r\nfor i in range(len(in1)):\r\n s1.append(in1[i])\r\nfor i in range(len(in2)):\r\n s2.append(in2[i])\r\n\r\nn = 0\r\nfor i in range(len(s1) - 1):\r\n t = 0\r\n a = s1[i]\r\n b = s1[i+1]\r\n c = s2[i]\r\n d = s2[i+1]\r\n if s1[i] == '0':\r\n t += 1\r\n s1[i] = 'X'\r\n if s2[i] == '0':\r\n t += 1\r\n s2[i] = 'X'\r\n if s1[i+1] == '0':\r\n t += 1\r\n s1[i+1] = 'X'\r\n if s2[i+1] == '0':\r\n if t != 3:\r\n s2[i+1] = 'X'\r\n t += 1\r\n if t >= 3:\r\n n += 1\r\n else:\r\n s1[i] = a\r\n s1[i+1] = b\r\n s2[i] = c\r\n s2[i+1] = d\r\n \r\nprint(n)\r\n \r\n \r\n", "from cmath import inf\r\n\r\n\r\na = input()\r\nb = input()\r\n\r\n# 依次代表 00, 0X, X0, XX\r\nf = [-inf] * 4\r\nT = ['00', '0X', 'X0', 'XX']\r\nfor i, (x,y) in enumerate(zip(list(a), list(b))):\r\n z = x + y\r\n f0 = [-inf] * 4\r\n idx = T.index(z)\r\n if(i == 0):\r\n f0[idx] = 0\r\n else:\r\n if(idx == 0):\r\n f0[1] = f0[2] = f[0] + 1\r\n f0[3] = max(f[1], f[2]) + 1\r\n f0[0] = max(f)\r\n elif(idx == 1):\r\n f0[1] = max(f)\r\n f0[3] = f[0] + 1\r\n elif(idx == 2):\r\n f0[2] = max(f)\r\n f0[3] = f[0] + 1\r\n elif(idx == 3):\r\n f0[3] = max(f)\r\n\r\n f = f0\r\nprint(max(f)) \r\n\r\n\r\n", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\n# import sys\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n l=[]\r\n s=input()\r\n s1=input()\r\n l.append(s)\r\n l.append(s1)\r\n ans=0\r\n cur=0\r\n empty=0\r\n for i in range(len(s)):\r\n cur=0\r\n if l[1][i]=='0':\r\n cur+=1\r\n if l[0][i]=='0':\r\n cur+=1\r\n empty+=cur\r\n if empty>=3:\r\n empty-=3\r\n ans+=1\r\n else:\r\n empty=cur\r\n print(ans)\r\nsolution()", "a1=input()\r\na2=input()\r\nx=[[0,0,0,0] for _ in range(len(a1))]\r\nfor i in range(1, len(a1)):\r\n x[i][3]=max(x[i-1])\r\n if a1[i-1]==a2[i-1]=='0':\r\n if a1[i]=='0':\r\n x[i][0]=x[i-1][3]+1\r\n if a2[i]=='0':\r\n x[i][1]=x[i-1][3]+1\r\n if a1[i]==a2[i]=='0':\r\n if a1[i-1]=='0':\r\n x[i][2]=max(x[i-1][1]+1,x[i][2])\r\n x[i][2]=max(x[i][2],x[i-1][3]+1)\r\n if a2[i-1]=='0':\r\n x[i][2]=max(x[i-1][0]+1,x[i][2])\r\n x[i][2]=max(x[i][2],x[i-1][3]+1)\r\nprint(max(x[-1]))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns1 = list(input().rstrip())\r\ns2 = list(input().rstrip())\r\nn = len(s1)\r\nG = [[] for _ in range(n + 1)]\r\nu = [0]\r\nfor i, j in zip(s1, s2):\r\n u.append(u[-1] + ((i & 8) + (j & 8)) // 8)\r\nfor i in range(n):\r\n G[i].append((i + 1, 0))\r\nfor i in range(n - 1):\r\n c = 1 if u[i + 2] - u[i] <= 1 else 0\r\n G[i].append((i + 2, c))\r\nfor i in range(n - 2):\r\n c = 2 * (min(u[i + 3] - u[i], 1) ^ 1)\r\n G[i].append((i + 3, c))\r\ndp = [0] * (n + 1)\r\nfor i in range(n):\r\n dpi = dp[i]\r\n for j, c in G[i]:\r\n dp[j] = max(dp[j], dpi + c)\r\nans = dp[n]\r\nprint(ans)", "c=l=0\r\nfor x in zip(input(),input()):\r\n r=x.count('0');l,c=((r,c),(r==l,c+1))[l+r>2]\r\nprint(c)", "a = list(input())\r\nb = list(input())\r\nn = len(a)\r\nres=0\r\nfor i in range(n-1):\r\n a1,b1,a2,b2=a[i],b[i],a[i+1],b[i+1]\r\n if a1=='0' and b1=='0' and a2=='0' and b2=='X':\r\n a[i]='X'\r\n b[i]='X'\r\n a[i+1]='X'\r\n res+=1\r\n elif a1=='0' and b1=='0' and a2=='X' and b2=='0':\r\n a[i]='X'\r\n b[i]='X'\r\n b[i+1]='X'\r\n res+=1\r\n elif a1=='0' and b1=='X' and a2=='0' and b2=='0':\r\n a[i]='X'\r\n a[i+1]='X'\r\n b[i+1]='X'\r\n res+=1\r\n elif a1=='X' and b1=='0' and a2=='0' and b2=='0':\r\n b[i]='X'\r\n a[i+1]='X'\r\n b[i+1]='X'\r\n res+=1\r\n elif a1=='0' and b1=='0' and a2=='0' and b2=='0':\r\n a[i]='X'\r\n b[i]='X'\r\n b[i+1]='X'\r\n res+=1\r\n else:\r\n res+=0\r\nprint(res)", "a = []\r\na.append(['X'] + list(input()) + ['X'])\r\nn = len(a[0])\r\na.append(['X'] + list(input()) + ['X'])\r\ncnt = 0\r\nfor i in range(1, n):\r\n #print(a[0][i])\r\n #print(a[1][i])\r\n if a[0][i] == '0' and a[1][i] == '0':\r\n if a[0][i-1] == '0':\r\n cnt += 1\r\n a[0][i-1] = 'X'\r\n a[0][i] = 'X'\r\n a[1][i] = 'X'\r\n continue\r\n elif a[1][i-1] == '0':\r\n cnt += 1\r\n a[1][i-1] = 'X'\r\n a[0][i] = 'X'\r\n a[1][i] = 'X'\r\n continue\r\n elif a[0][i+1] == '0':\r\n cnt += 1\r\n a[0][i+1] = 'X'\r\n a[0][i] = 'X'\r\n a[1][i] = 'X'\r\n continue\r\n elif a[1][i+1] == '0':\r\n cnt += 1\r\n a[1][i+1] = 'X'\r\n a[0][i] = 'X'\r\n a[1][i] = 'X'\r\n continue\r\nprint(cnt)\r\n", "ans = 0\nch1 = ['1'] * 150\nch2 = ['1'] * 150\nt1 = list(input())\nt2 = list(input())\nlen1 = len(t1)\n\nfor i in range(len1):\n ch1[i] = t1[i]\n ch2[i] = t2[i]\nfor i in range(len1):\n if ch1[i] == '0' and ch2[i] == '0' and ch1[i + 1] == '0':\n ch1[i] = ch1[i + 1] = ch2[i] = 'x'\n ans += 1\n elif ch1[i] == '0' and ch2[i] == '0' and ch2[i + 1] == '0':\n ch1[i] = ch2[i] = ch2[i + 1] = 'x'\n ans += 1\n elif ch1[i] == '0' and ch1[i + 1] == '0' and ch2[i + 1] == '0':\n ch1[i] = ch1[i + 1] = ch2[i + 1] = 'x'\n ans += 1\n elif ch2[i] == '0' and ch1[i + 1] == '0' and ch2[i + 1] == '0':\n ch2[i] = ch1[i + 1] = ch2[i + 1] = 'x'\n ans += 1\n\nprint(ans)\n\n\t\t \t\t\t \t\t \t \t\t\t \t \t\t\t\t", "A = input()\r\nB = input()\r\nres = 0\r\np0,p1=1,1\r\nfor a,b in zip(A,B):\r\n a, b = a=='X',b=='X'\r\n w = a+b+p0+p1\r\n if w<=1:\r\n res += 1\r\n p0,p1 = 1,w\r\n else:\r\n p0,p1 = a,b\r\nprint(res)", "a = input()\nb = input()\n\nv2, oa, ob, o2 = 0,0,0,0\nif a[0] == b[0] == '0':\n v2, oa, ob, o2 = 0,-1,-1,-1\nelif a[0] == '0':\n v2, oa, ob, o2 = -1,-1,0,-1\nelif b[0] == '0':\n v2, oa, ob, o2 = -1,0,-1,-1\nelse:\n v2, oa, ob, o2 = -1,-1,-1,0\n\nfor i in range(1, len(a)):\n nv2 = max(v2, oa, ob, o2)\n if a[i] == 'X' or b[i] == 'X':\n nv2 = -1\n\n no2 = -1\n if a[i] == '0' == b[i]:\n no2 = max(v2, oa, ob) + 1\n elif a[i] == '0' or b[i] == '0':\n if v2 > -1:\n no2 = v2 + 1\n else:\n no2 = max(v2, oa, ob, o2)\n\n noa = -1\n if a[i] == b[i] == '0':\n if v2 > -1:\n noa = v2 + 1\n elif a[i] == '0':\n noa = -1\n elif b[i] == '0':\n noa = max(v2, oa, ob, o2)\n \n nob = -1\n if a[i] == b[i] == '0':\n if v2 > -1:\n nob = v2 + 1\n elif b[i] == '0':\n nob = -1\n elif a[i] == '0':\n nob = max(v2, oa, ob, o2)\n v2, oa, ob, o2 = nv2, noa, nob, no2\n\nprint(max(v2, oa, ob, o2, 0))\n\n\n \n\n\n\n\t \t \t\t \t\t\t\t \t \t\t \t \t\t\t \t \t", "from functools import cache\n\nx = input()\ny = input()\n@cache\ndef dfs(a, b: bytes, index: int):\n if index == len(x): return 0\n ans = dfs(x[index], y[index], index + 1)\n if (a == '0' or b == '0') and x[index] == '0' and y[index] == '0':\n ans = max(ans, dfs('X', 'X', index + 1) + 1)\n\n if a == '0' and b == '0' and x[index] == '0':\n ans = max(dfs('X', y[index], index + 1) + 1, ans)\n if a == '0' and b == '0' and y[index] == '0':\n ans = max(dfs(x[index], 'X', index + 1) + 1, ans)\n return ans\n\n\nprint(dfs(x[0], y[0], 1))\n", "# LUOGU_RID: 129930307\na,b=input(),input()\nt1,t2,ans=0,0,0\nfor i in range(len(a)):\n t1=0\n if a[i]=='0':\n t1+=1\n if b[i]=='0':\n t1+=1\n t2+=t1\n if t2>=3:\n t2-=3\n ans+=1\n else:\n t2=t1\nprint(ans)", "a = input()\r\nb = input()\r\n\r\nct = 0\r\n\r\ni = 0\r\n\r\n'''\r\n000\r\n000\r\n\r\n\r\n00\r\nX0\r\n\r\n00\r\n0X\r\n\r\nX0\r\n00\r\n\r\n0X\r\n00\r\n'''\r\n\r\nwhile (i < len(a)):\r\n #check length of 3\r\n if i+2<len(a) and a[i]=='0' and a[i+1]=='0' and a[i+2]=='0' and b[i]=='0' and b[i+1]=='0' and b[i+2]=='0':\r\n ct+=2\r\n i+=2\r\n #check length of 2\r\n else:\r\n if a[i:i+2].count('0') + b[i:i+2].count('0')>=3:\r\n ct+=1\r\n i+=1\r\n i+=1\r\nprint(ct)\r\n", "a = input()\r\nb = input()\r\n \r\nempties = [x.count(\"0\") for x in zip(a, b)]\r\ncnt = 0\r\ncan = 0\r\nfor emp in empties:\r\n can += emp\r\n if can >= 3:\r\n can -= 3\r\n cnt += 1\r\n else:\r\n can = emp\r\nprint(cnt)", "if __name__ == '__main__':\r\n a = list(input())\r\n b = list(input())\r\n n = len(a)\r\n r = p = 0\r\n for i in range(n):\r\n c = 1 if a[i] != b[i] else (0 if a[i] == 'X' else 2)\r\n p += c\r\n if p < 3:\r\n p = c\r\n else:\r\n r += 1\r\n p -= 3\r\n print(r)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef converter(S1, S2, i):\r\n R = S1[i]+S2[i]\r\n R = R.replace('X', '1')\r\n return int(R, 2)\r\n \r\n\r\ndef process(S1, S2):\r\n \"\"\"\r\n 0\r\n 0 = 0\r\n \r\n X\r\n 0 = 1\r\n \r\n 0\r\n X = 2\r\n \r\n X\r\n X = 3\r\n \r\n 0 0\r\n 0 0 means +1 to 01\r\n \r\n \r\n \r\n 0,0\r\n 0 0 \r\n \r\n 0 0 \r\n 0 X\r\n \r\n 0 X\r\n 0 0 \r\n \r\n 0 0 \r\n 0 X\r\n \r\n 0 0 \r\n X 0 \r\n \r\n \r\n \"\"\"\r\n n = len(S1)\r\n d = [None for i in range(4)]\r\n d[converter(S1, S2, 0)] = 0\r\n my_max = 0\r\n for i in range(1, n):\r\n col2 = converter(S1, S2, i)\r\n d2 = [None for i in range(4)]\r\n d2[col2] = my_max\r\n for col1 in range(4):\r\n if d[col1] is not None:\r\n new_values = None\r\n curr_count = d[col1]\r\n if col1==0 and col2==0:\r\n new_values = [1, 2, 3]\r\n elif col1==0 and col2==1:\r\n new_values = [3]\r\n elif col1==0 and col2==2:\r\n new_values = [3]\r\n elif col1==1 and col2==0:\r\n new_values = [3]\r\n elif col1==2 and col2==0:\r\n new_values = [3]\r\n if new_values is not None:\r\n for c in new_values:\r\n if d2[c] is None:\r\n d2[c] = curr_count+1\r\n else:\r\n d2[c] = max(d2[c], curr_count+1)\r\n \r\n d = d2 \r\n my_max = max([x for x in d if x is not None])\r\n print(my_max)\r\n return\r\n \r\nS1 = input().decode().strip()\r\nS2 = input().decode().strip()\r\nprocess(S1, S2)" ]

[ "n, m = map(int, input().split())\r\nn += 1\r\n \r\ns = [[] for i in range(n)]\r\n\r\nfor j in range(2, n, 2): \r\n s[j] = [2]\r\n \r\nfor i in range(3, n, 2):\r\n if s[i]: continue\r\n for j in range(i, n, i): \r\n s[j].append(i)\r\n\r\npresent, alreadyOn, status = {}, set(), ['']*m\r\nfor c in range(m):\r\n inp = list(map(str, input().split()))\r\n collider = int(inp[1])\r\n \r\n if (inp[0] == '+'):\r\n if (collider in alreadyOn):\r\n status[c] = 'Already on'\r\n continue\r\n \r\n for i in s[collider]:\r\n if (i in present):\r\n status[c] = 'Conflict with ' + str(present[i])\r\n break\r\n \r\n else:\r\n status[c] = 'Success'\r\n alreadyOn.add(collider)\r\n for i in s[collider]:\r\n present[i] = collider\r\n \r\n else:\r\n if (collider in alreadyOn):\r\n status[c] = 'Success'\r\n \r\n for i in s[collider]:\r\n present.pop(i)\r\n alreadyOn.remove(collider)\r\n \r\n else:\r\n status[c] = 'Already off'\r\n\r\nfor i in status:\r\n print(i)", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n \ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n \nn, m = mp()\nmd1 = dd(int)\nstatus = dd(int)\npfs = {}\nfor i in range(m):\n a, b = inp().split()\n b = int(b)\n if a == '-':\n if status[b]: \n status[b] = 0\n print(\"Success\")\n for i in pfs[b]: md1[i] = 0\n else:\n print(\"Already off\")\n else:\n if status[b]:\n print(\"Already on\")\n continue\n s = set()\n tb = b\n if tb%2==0:\n s.add(2)\n while tb%2==0: tb//=2\n j = 3\n while j*j<=tb:\n if tb%j==0:\n s.add(j)\n while tb%j==0: tb//=j\n j += 2\n if tb>1: s.add(tb)\n flg = True\n for i in s:\n if md1[i]: \n ind = i\n flg=False\n break\n if flg:\n for i in s:\n md1[i] = b\n pfs[b] = s\n status[b] = 1\n print(\"Success\")\n else:\n print(\"Conflict with\", md1[ind])", "import sys\r\nfrom math import sqrt\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn, m = map(int, inpu().split())\r\nMAXN = n\r\nspf = [0 for i in range(MAXN + 1)]\r\ndef sieve():\r\n spf[1] = 1\r\n for i in range(2, MAXN + 1):\r\n spf[i] = i\r\n for i in range(4, MAXN + 1, 2):\r\n spf[i] = 2 \r\n for i in range(3, int(sqrt(MAXN)) + 1):\r\n if spf[i] == i:\r\n for j in range(i*i, MAXN + 1, i):\r\n if spf[j] == j: # as we want factors in sorted manner\r\n spf[j] = i\r\ndef getFactorization(x):\r\n ret = []\r\n ra = ret.append\r\n while x != 1:\r\n ra(spf[x])\r\n x //= spf[x]\r\n return ret\r\nsieve()\r\ncheck = [0]*(n + 1)\r\na = [0]*(n + 1)\r\nfor _ in range(m) :\r\n sign, p = inpu().split()\r\n p = int(p)\r\n if sign == \"-\" :\r\n if check[p] == 0 :\r\n prin(\"Already off\\n\")\r\n else :\r\n prin(\"Success\\n\")\r\n check[p] = 0\r\n f = getFactorization(p)\r\n for i in f :\r\n a[i] = 0\r\n continue\r\n if check[p] == 1 and sign == \"+\" :\r\n prin(\"Already on\\n\")\r\n continue\r\n f = getFactorization(p)\r\n for i in f :\r\n if a[i] > 0 :\r\n prin(f\"Conflict with {a[i]}\\n\")\r\n break\r\n else :\r\n for i in f :\r\n a[i] = p\r\n check[p] = 1\r\n prin(\"Success\\n\")", "a, b=map(int, input().split())\na+=1\n \nc=[[] for i in range(a)]\nfor j in range(2, a, 2): \n c[j]=[2]\nfor i in range(3, a, 2):\n if c[i]:\n continue\n for j in range(i, a, i):\n c[j].append(i)\np, d, r={}, set(), [''] * b\nfor j in range(b):\n t=input()\n i=int(t[2: ])\n if t[0]=='+':\n if i in d:\n r[j]='Already on'\n continue\n for x in c[i]:\n if x in p:\n r[j]='Conflict with '+str(p[x])\n break\n else:\n r[j]='Success'\n d.add(i)\n for x in c[i]:\n p[x]=i\n else:\n if i in d:\n r[j]='Success'\n for x in c[i]:\n p.pop(x)\n d.remove(i)\n else:\n r[j]='Already off'\nprint('\\n'.join(r))\n\t\t \t\t\t \t \t \t \t \t\t\t \t \t \t\t", "from collections import defaultdict, deque, Counter\r\nfrom sys import stdin, stdout\r\nimport sys\r\nfrom heapq import heappush, heappop\r\nimport math\r\nimport io\r\nimport os\r\nimport math\r\nimport bisect\r\n\r\n#?############################################################\r\nfrom io import BytesIO, IOBase\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\n\r\ndef isPrime(x):\r\n for i in range(2, x):\r\n if i*i > x:\r\n break\r\n if (x % i == 0):\r\n return False\r\n return True\r\n\r\n#?############################################################\r\n\r\n\r\ndef ncr(n, r, p):\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, p - 2, p)) % p\r\n\r\n\r\n#?############################################################\r\n\r\ndef primeFactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n for i in range(3, int(math.sqrt(n))+1, 2):\r\n while n % i == 0:\r\n l.append(int(i))\r\n n = n // i\r\n if n > 2:\r\n l.append(n)\r\n return list(set(l))\r\n\r\n\r\n#?############################################################\r\n\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n if (x == 0):\r\n return 0\r\n while (y > 0):\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n return res\r\n\r\n#?############################################################\r\n\r\n\r\ndef sieve(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\n\r\n#?############################################################\r\n\r\ndef digits(n):\r\n c = 0\r\n while (n > 0):\r\n n //= 10\r\n c += 1\r\n return c\r\n\r\n#?############################################################\r\n\r\n\r\ndef ceil(n, x):\r\n if (n % x == 0):\r\n return n//x\r\n return n//x+1\r\n\r\n#?############################################################\r\n\r\n\r\ndef mapin():\r\n return map(int, input().split())\r\n\r\n#?############################################################\r\n\r\n\r\ndef bs(l, k):\r\n for i in range(26):\r\n if(l[i]%k != 0):\r\n return False\r\n \r\n return True\r\n\r\n\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nMAXN = 100001\r\nspf = [0 for i in range(MAXN)]\r\ndef sieve():\r\n spf[1] = 1\r\n for i in range(2, MAXN):\r\n spf[i] = i\r\n for i in range(4, MAXN, 2):\r\n spf[i] = 2\r\n \r\n for i in range(3, math.ceil(math.sqrt(MAXN))):\r\n if (spf[i] == i):\r\n for j in range(i * i, MAXN, i):\r\n if (spf[j] == j):\r\n spf[j] = i\r\n\r\ndef getFactorization(x):\r\n ret = list()\r\n while (x != 1):\r\n ret.append(spf[x])\r\n x = x // spf[x]\r\n return ret\r\n\r\nsieve()\r\nn, m = mapin()\r\nd = [0]*(n+1)\r\ne = [0]*(n+1)\r\nfor i in range(m):\r\n s = list(input().split(\" \"))\r\n s[1] = int(s[1])\r\n if(s[0] == \"+\"):\r\n if(e[s[1]] == 1):\r\n print(\"Already on\")\r\n else:\r\n x = getFactorization(s[1])\r\n fl = -1\r\n for j in x:\r\n if(d[j]>0):\r\n fl = d[j]\r\n break\r\n if(fl != -1):\r\n print(\"Conflict with \"+ str(fl))\r\n else:\r\n for j in x:\r\n d[j] = s[1]\r\n e[s[1]] = 1\r\n print(\"Success\")\r\n else:\r\n if(e[s[1]] == 0):\r\n print(\"Already off\")\r\n else:\r\n x = getFactorization(s[1])\r\n for j in x:\r\n d[j] = 0\r\n e[s[1]] = 0\r\n print(\"Success\")\r\n \r\n \r\n ", "#------------------------------warmup----------------------------\r\nimport os\r\nimport sys\r\nimport math\r\nfrom io import BytesIO, IOBase\r\n \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\n#-------------------game starts now----------------------------------------------------\r\n# Function to call the actual solution\r\ndef solution(li, n, m):\r\n\ts = [[] for i in range(n)]\r\n\tfor j in range(2, n, 2):\r\n\t\ts[j] = [2]\r\n\tfor i in range(3, n, 2):\r\n\t\tif s[i]:\r\n\t\t\tcontinue\r\n\t\tfor j in range(i, n, i):\r\n\t\t\ts[j].append(i)\r\n\tp, d, r = {}, set(), [''] * m\r\n\tfor j in range(len(li)):\r\n\t\tt = li[j][0]\r\n\t\ti = int(li[j][1])\r\n\t\tif t[0] == '+':\r\n\t\t\tif i in d:\r\n\t\t\t\tr[j] = 'Already on'\r\n\t\t\t\tcontinue\r\n\t\t\tfor q in s[i]:\r\n\t\t\t\tif q in p:\r\n\t\t\t\t\tr[j] = 'Conflict with ' + str(p[q])\r\n\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tr[j] = 'Success'\r\n\t\t\t\td.add(i)\r\n\t\t\t\tfor q in s[i]: p[q] = i\r\n\t\telse:\r\n\t\t\tif i in d:\r\n\t\t\t\tr[j] = 'Success'\r\n\t\t\t\tfor q in s[i]: p.pop(q)\r\n\t\t\t\td.remove(i)\r\n\t\t\telse:\r\n\t\t\t\tr[j] = 'Already off'\r\n\treturn r\r\n \r\n \r\n \r\n# Function to take input\r\ndef input_test():\r\n\t# for _ in range(int(input())):\r\n\t\t# n = int(input())\r\n\t\tn, m = map(int, input().strip().split(\" \"))\r\n\t\tquer = []\r\n\t\tfor i in range(m):\r\n\t\t\tqu = list(map(str, input().strip().split(\" \")))\r\n\t\t\tquer.append(qu)\r\n\t\t# a, b, c = map(int, input().strip().split(\" \"))\r\n\t\t# li = list(map(int, input().strip().split(\" \")))\r\n\t\tout = solution(quer, n+1, m)\r\n\t\tfor i in out:\r\n\t\t\tprint(i)\r\n \r\n# Function to test my code\r\ndef test():\r\n\tpass\r\n \r\n# seive()\r\ninput_test()\r\n# test()", "x, y = map(int, input().split(' '))\nx += 1\n\nl = [[] for i in range(x)]\nfor j in range(2, x, 2):\n l[j] = [2]\nfor i in range(3, x, 2):\n if l[i]:\n continue\n for j in range(i, x, i):\n l[j].append(i)\n\ns, a, r = {}, set(), [''] * y\nfor j in range(y):\n t = input()\n i = int(t[2: ])\n if t[0] == '+':\n if i in a:\n r[j] = 'Already on'\n continue\n for q in l[i]:\n if q in s:\n r[j] = 'Conflict with ' + str(s[q])\n break\n else:\n r[j] = 'Success'\n a.add(i)\n for q in l[i]:\n s[q] = i\n else:\n if i in a:\n r[j] = 'Success'\n for q in l[i]:\n s.pop(q)\n a.remove(i)\n else:\n r[j] = 'Already off'\nprint('\\n'.join(r))\n \t \t\t \t \t\t \t \t \t\t\t", "MAX = 100002\nprimes = [True] * MAX\ndivs = [[] for _ in range(MAX)]\nlamps = [0] * MAX\n\ndef sieve():\n global primes, divs\n primes[0] = primes[1] = False\n d = 1\n for i in range(2, MAX, d):\n if primes[i]:\n for j in range(i + i, MAX, i):\n primes[j] = False\n divs[j].append(i)\n\ndef main():\n global lamps\n n, m = map(int, input().split())\n sieve()\n\n for _ in range(m):\n c, k = input().split()\n k = int(k)\n if c == '+':\n if lamps[k] == k:\n print(\"Already on\")\n continue\n if lamps[k]:\n print(f\"Conflict with {lamps[k]}\")\n continue\n conflict = False\n for d in divs[k]:\n if lamps[d]:\n print(f\"Conflict with {lamps[d]}\")\n conflict = True\n break\n\n if not conflict:\n for d in divs[k]:\n lamps[d] = k\n lamps[k] = k\n print(\"Success\")\n else:\n if lamps[k] != k:\n print(\"Already off\")\n else:\n for d in divs[k]:\n lamps[d] = 0\n lamps[k] = 0\n print(\"Success\")\n\nif __name__ == \"__main__\":\n main()\n\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\nfrom math import gcd\r\nn,k=map(int,input().split())\r\na=[[] for i in range(n+1)] # have primes of i\r\nactive=[0]*(n+1)\r\nact={}\r\nfor i in range(2,n+1):\r\n if not a[i]:\r\n act[i]=0\r\n for j in range(i,n+1,i):\r\n a[j].append(i)\r\nfor _ in range(k):\r\n s,x=input().rstrip().split()\r\n x=int(x)\r\n if s==\"-\":\r\n if active[x]:\r\n print(\"Success\")\r\n active[x]=0\r\n for xx in a[x]:\r\n act[xx]=0\r\n else:\r\n print(\"Already off\")\r\n else:\r\n if active[x]:\r\n print(\"Already on\")\r\n else:\r\n t=1\r\n flag=True\r\n for xx in a[x]:\r\n if act[xx]:\r\n t=xx\r\n flag=False\r\n break\r\n if flag:\r\n print(\"Success\")\r\n active[x]=1\r\n for xx in a[x]:\r\n act[xx]=x\r\n else:\r\n print(\"Conflict with\",act[t])", "import math\r\nimport sys;sc = sys.stdin.readline;out=sys.stdout.write\r\nn,x=map(int,sc().rstrip().split())\r\nprime = [0 for i in range(n+1)]\r\ncheck=[False for i in range(n+1)]\r\ndef sieve():\r\n prime[1] = 1\r\n for i in range(2, n + 1):prime[i] = i\r\n for i in range(4, n + 1, 2):prime[i] = 2 \r\n for i in range(3, int(math.sqrt(n)) + 1):\r\n if prime[i] == i:\r\n for j in range(i*i, n + 1, i):\r\n if prime[j] == j:prime[j] = i\r\ndef getFactorization(x):\r\n ret = [];ra = ret.append\r\n while x != 1:\r\n ra(prime[x])\r\n x //= prime[x]\r\n return ret\r\nsieve();arr=[0]*(n+1)\r\nfor e in range(x):\r\n a,b=map(str,sc().rstrip().split())\r\n if a =='-' and not check[int(b)]:out(\"Already off\"+\"\\n\")\r\n elif a=='-' and check[int(b)]:\r\n out(\"Success\"+\"\\n\");check[int(b)]=False\r\n f=getFactorization(int(b))\r\n for i in f :arr[i] = 0\r\n else :\r\n if check[int(b)]:out(\"Already on\"+\"\\n\");continue\r\n else :\r\n f=getFactorization(int(b))\r\n for i in f :\r\n if arr[i] > 0 :out(\"Conflict with \"+str(arr[i])+\"\\n\");break\r\n else :\r\n for i in f :arr[i] = int(b);\r\n check[int(b)] = True\r\n out(\"Success\"+\"\\n\")", "from math import gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom heapq import heappop, heappush\r\nfrom collections import defaultdict, deque, Counter\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef e(n): # O(NloglogN)\r\n l = [i for i in range(n+1)]\r\n for i in range(2, n):\r\n if l[i] == i:\r\n for p in range(i+i, n+1, i):\r\n l[p] = i\r\n return l\r\n\r\np = e(10**5+10)\r\ndef pf(x):\r\n ans = set()\r\n now = x\r\n while now != 1:\r\n ans.add(p[now])\r\n now //= p[now]\r\n return ans\r\n\r\nn, m = map(int, input().split())\r\nd = defaultdict(list)\r\nac = [0] * (n+1)\r\ns = set()\r\nfor i in range(m):\r\n c,x = input().split()\r\n x = int(x)\r\n if c == \"+\":\r\n if ac[x]:\r\n print(\"Already on\")\r\n continue\r\n pn = pf(x)\r\n for i in pn:\r\n while d[i]:\r\n if not ac[d[i][-1]]:\r\n d[i].pop()\r\n else:\r\n break\r\n if d[i]:\r\n print(\"Conflict with {}\".format(str(d[i][-1])))\r\n break\r\n else:\r\n ac[x] = 1\r\n for i in pn:\r\n d[i].append(x)\r\n print(\"Success\")\r\n else:\r\n if ac[x]:\r\n ac[x] = 0\r\n print(\"Success\")\r\n else:\r\n print(\"Already off\")", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\ns = 100004\r\na = [1]*(s)\r\nfor j in range(4,s,2): a[j] = 0\r\nfor i in range(3,int(s**0.5)+1,2):\r\n for j in range(i*i,s,i): a[j] = 0\r\n\r\nm ={}\r\nfor i in range(2,s):\r\n if a[i]: m[i] = 0\r\n\r\ndef factorization(n):\r\n ans = []\r\n c = 0\r\n while n%2 == 0:\r\n n //= 2\r\n c += 1\r\n if c: ans.append(2)\r\n \r\n for x in range(3,int(n**0.5)+1,2):\r\n c = 0\r\n while n%x == 0:\r\n n //= x\r\n c += 1\r\n if c: ans.append(x)\r\n \r\n if n != 1: ans.append(n)\r\n return ans\r\n\r\ns = set()\r\nn,p = getints()\r\nfor _ in range(p):\r\n q = input().split()\r\n if q[0] == '+':\r\n num = int(q[1])\r\n if num in s: print('Already on')\r\n else:\r\n f = factorization(num)\r\n for x in f:\r\n if m[x] != 0: print('Conflict with',m[x]); break\r\n else:\r\n s.add(num)\r\n for x in f: m[x] = num\r\n print(\"Success\")\r\n else:\r\n num = int(q[1])\r\n if num not in s: print('Already off')\r\n else:\r\n s.remove(num)\r\n f = factorization(num)\r\n for x in f: m[x] = 0\r\n print('Success')\r\n \r\n", "n, m = map(int, input().split())\r\nn += 1\r\n \r\ns = [[] for i in range(n)]\r\nfor j in range(2, n, 2): s[j] = [2]\r\nfor i in range(3, n, 2):\r\n if s[i]: continue\r\n for j in range(i, n, i): s[j].append(i)\r\n \r\np, d, r = {}, set(), [''] * m\r\nfor j in range(m):\r\n t = input()\r\n i = int(t[2: ])\r\n if t[0] == '+':\r\n if i in d:\r\n r[j] = 'Already on'\r\n continue\r\n for q in s[i]:\r\n if q in p:\r\n r[j] = 'Conflict with ' + str(p[q])\r\n break\r\n else:\r\n r[j] = 'Success'\r\n d.add(i)\r\n for q in s[i]: p[q] = i\r\n else:\r\n if i in d:\r\n r[j] = 'Success'\r\n for q in s[i]: p.pop(q)\r\n d.remove(i)\r\n else: r[j] = 'Already off'\r\n \r\nprint('\\n'.join(r))", "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 max_n = 10 ** 5 + 10\r\n divs = [i for i in range(10 ** 5 + max_n)]\r\n used = {}\r\n\r\n for i in range(2, max_n):\r\n if divs[i] == i:\r\n used[i] = 0\r\n for j in range(i * i, max_n, i):\r\n divs[j] = i\r\n\r\n def f(x):\r\n s = set()\r\n while x != 1:\r\n s.add(divs[x])\r\n x = x // divs[x]\r\n return s\r\n\r\n n, m = map(int, sys.stdin.readline().split())\r\n on = set()\r\n for i in range(m):\r\n comm, j = map(str, sys.stdin.readline().split())\r\n j = int(j)\r\n ans = \"\"\r\n\r\n if comm == \"+\":\r\n if j in on:\r\n ans = \"Already on\"\r\n else:\r\n flag = True\r\n dd = f(j)\r\n for div in dd:\r\n if used[div] != 0:\r\n ans = \"Conflict with \" + str(used[div])\r\n flag = False\r\n break\r\n\r\n if flag:\r\n ans = \"Success\"\r\n for div in dd:\r\n used[div] = j\r\n on.add(j)\r\n\r\n else:\r\n if j not in on:\r\n ans = \"Already off\"\r\n else:\r\n dd = f(j)\r\n for div in dd:\r\n used[div] = 0\r\n on.discard(j)\r\n ans = \"Success\"\r\n\r\n sys.stdout.write(ans + \"\\n\")\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", "MAX=100002\nprimes=[True]*MAX\ndivs=[[]for _ in range(MAX)]\nlamps=[0]*MAX\ndef sieve():\n global primes,divs\n primes[0]=primes[1]=False\n d=1\n for i in range(2,MAX,d):\n if primes[i]:\n for j in range(i+i,MAX,i):\n primes[j]=False\n divs[j].append(i)\ndef main():\n global lamps\n n,m=map(int,input().split())\n sieve()\n for _ in range(m):\n c,k=input().split()\n k=int(k)\n if c=='+':\n if lamps[k]==k:\n print(\"Already on\")\n continue\n if lamps[k]:\n print(f\"Conflict with {lamps[k]}\")\n continue\n conflict=False\n for d in divs[k]:\n if lamps[d]:\n print(f\"Conflict with {lamps[d]}\")\n conflict=True\n break\n if not conflict:\n for d in divs[k]:\n lamps[d]=k\n lamps[k]=k\n print(\"Success\")\n else:\n if lamps[k]!=k:\n print(\"Already off\")\n else:\n for d in divs[k]:\n lamps[d]=0\n lamps[k]=0\n print(\"Success\")\nif __name__ == \"__main__\":\n main()\n \t \t \t \t \t\t \t\t\t\t\t \t \t" ]

[ "from math import factorial\na = int(input())\ns = ((factorial(a)//(factorial(5)*factorial(a-5)))+(factorial(a)//(factorial(6)*factorial(a-6)))+(factorial(a)//(factorial(7)*factorial(a-7))))\nprint(s)\n", "from math import comb\r\nn = int(input())\r\nprint(comb(n, 5) + comb(n, 6) + comb(n, 7))\r\n", "n = int(input())\r\nans = int((n * (n-1) * (n-2) * (n-3) * (n-4) * (n-5) * (n-6)) / 5040)\r\nans += int((n * (n-1) * (n-2) * (n-3) * (n-4) * (n-5)) / 720)\r\nans += int((n * (n-1) * (n-2) * (n-3) * (n-4)) / 120)\r\nprint(int(ans))", "n = int(input())\r\nprint(n*(n-1)*(n-2)*(n-3)*(n-4)*(42+7*(n-5)+(n-5)*(n-6))//5040)", "for _ in range(1):\r\n n = int(input())\r\n a = n*(n-1)*(n-2)*(n-3)*(n-4)//120\r\n b = n*(n-1)*(n-2)*(n-3)*(n-4)*(n-5)//720\r\n c = n*(n-1)*(n-2)*(n-3)*(n-4)*(n-5)*(n-6)//5040\r\n print(a+b+c)", "import math\r\nn = int(input())\r\nprint(math.comb(n,5) + math.comb(n,6) + math.comb(n,7))# 1691049604.9852862", "def f(a):\r\n return 1 if a<=1 else a*f(a-1)\r\ndef c(n,m):\r\n return f(n)//f(m)//f(n-m)\r\nn=int(input())\r\nprint(c(n,5)+c(n,6)+c(n,7))", "def hoc(a, b):\r\n if a == 0:\r\n return b\r\n return hoc(b%a, a)\r\n\r\n\r\ndef pt(x, n, m):\r\n r = 1\r\n while n != 0:\r\n if n % 2 != 0:\r\n r *= x\r\n r %= m\r\n n -= 1\r\n else:\r\n x *= x\r\n x %= m\r\n n /= 2\r\n return r\r\n\r\n\r\nn = int(input())\r\ns = 1\r\nr5 = 1\r\nr6 = 1\r\nr7 = 1\r\ns5 = 1\r\ns6 = 1\r\ns7 = 1\r\nfor i in range(2, n + 1):\r\n s *= i\r\n if i == n - 5:\r\n r5 = s\r\n if i == n - 6:\r\n r6 = s\r\n if i == n - 7:\r\n r7 = s\r\n if i == 5:\r\n s5 = s\r\n if i == 6:\r\n s6 = s\r\n if i == 7:\r\n s7 = s\r\n\r\nx = s // (r5 * s5) + s // (r6 * s6) + s // (r7 * s7)\r\nprint(x)\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 16/08/2023 15:10:39 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom math import comb\r\n\r\nn = int(input())\r\nprint(comb(n, 5) + comb(n, 6) + comb(n, 7))", "def ce(n, k):\r\n pr = 1;\r\n for i in range(k):\r\n pr*=n\r\n n-=1\r\n for i in range(1, k+1):\r\n pr//=i\r\n return pr\r\n\r\nn = int(input())\r\nprint(ce(n,5)+ce(n,6)+ce(n,7))", "import math\r\n\r\nn = int(input())\r\nprint(math.comb(n, 5) + math.comb(n, 6) + math.comb(n, 7))\r\n", "def run():\r\n n = eval(input())\r\n print(\r\n n * (n - 1) * (n - 2) * (n - 3) * (n - 4) // 120\r\n + n * (n - 1) * (n - 2) * (n - 3) * (n - 4) * (n - 5) // 720\r\n + n * (n - 1) * (n - 2) * (n - 3) * (n - 4) * (n - 5) * (n - 6) // 5040\r\n )\r\n\r\n\r\nif __name__ == \"__main__\":\r\n run()\r\n", "n = int(input())\n\ndef fact(k):\n res = 1\n for i in range(2, k+1):\n res *= i\n \n return res\n\ndef binom(n, k):\n return (fact(n)) // (fact(k) * fact(n-k))\n\nprint(binom(n, 5) + binom(n, 6) + binom(n, 7))\n \t \t\t \t \t\t\t\t\t\t\t \t\t \t\t\t \t\t\t \t\t", "from math import comb\r\n\r\n\r\nn = int(input())\r\nprint(comb(n,7)+comb(n,6)+comb(n,5))", "n=int(input())-2\r\nprint(n*(n*n-4)*(n*n-1)*(n*n+33)//5040)", "import math\r\nimport sys\r\nimport collections\r\nimport random\r\ninput = sys.stdin.readline\r\nM = 10**9 + 7\r\ndef qe():\r\n return int(input())\r\ndef tr():\r\n return [int(_) for _ in input().split()]\r\ndef rt():\r\n return input()\r\ndef gg(n, x):\r\n ans = 1\r\n for i in range(x):\r\n ans *= (n - i)\r\n return ans\r\nn = qe()\r\nprint(gg(n, 5) // 120 + gg(n, 6) // 720 + gg(n, 7) // 5040)", "from math import factorial\r\n\r\nn = int(input())\r\n\r\ndef combination(n, r):\r\n\r\n ans = 1\r\n smaller = max(r, n - r)\r\n larger = min(r, n - r)\r\n while n > larger:\r\n ans *= n\r\n n -= 1\r\n \r\n return ans//factorial(smaller)\r\n\r\n\r\n\r\nans = combination(n, 5) + combination(n, 6) + combination(n, 7)\r\nprint(ans)", "from math import factorial\r\n\r\nn = int(input())\r\n\r\nfactorial(n) / factorial(n)\r\n\r\nr1 = factorial(n) // (factorial(7)*factorial(n-7))\r\nr2 = factorial(n) // (factorial(6)*factorial(n-6))\r\nr3 = factorial(n) // (factorial(5)*factorial(n-5))\r\n\r\nprint(r1 + r2 + r3)\r\n\r\n\r\n", "def bin(n,k):\r\n res=1\r\n for i in range(n-k+1,n+1):res*=i\r\n for i in range(1,k+1):res//=i\r\n return res\r\nn=int(input())\r\nprint(bin(n,5)+bin(n,6)+bin(n,7))", "n = int(input())\r\nans = (n - 4) * (n - 3) * (n - 2) * (n - 1) * n * (42 + 7 * (n - 5) + (n - 5) * (n - 6)) // 5040\r\nprint(ans)", "def fac(z):\r\n\tif z == 0:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn z*fac(z-1)\r\nn = int(input())\r\na = fac(n) // (fac(5) * fac(n-5))\r\nb = fac(n) // (fac(6) * fac(n-6))\r\nc = fac(n) // (fac(7) * fac(n-7))\r\nprint(a+b+c)", "n = int(input())\r\nq1 = 5\r\nq2 = 6\r\nq3 = 7 \r\n##########\r\nfq1 = 120\r\nfq2 = 720\r\nfq3 = 5040\r\n\r\ns = 1 \r\nfor i in range(1,n+1):\r\n s = s * i\r\n#print(s)\r\n\r\na1 = n - 5\r\na2 = n - 6\r\na3 = n - 7 \r\n\r\n############\r\n\r\ns1 = 1\r\nfor k in range(1,a1+1):\r\n s1 = s1 * k\r\n\r\ns2 = 1\r\nfor j in range(1,a2+1):\r\n s2 = s2 * j\r\ns3 = 1\r\nfor m in range(1,a3+1):\r\n s3 = s3 * m\r\n#print(s)\r\n#print(s1)\r\n#print(s2)\r\n#print(s3)\r\nb1 = s//(s1*fq1)\r\nb2 = s//(s2*fq2)\r\nb3 = s//(s3*fq3)\r\nprint(b1+b2+b3)\r\n\r\n\r\n\r\n" ]

[ "q, r = map(int, input().split())\r\nt1 = input()\r\nt = []\r\nfor o in t1:\r\n t.append(o)\r\nfor j in range(r):\r\n i = 0\r\n while i < len(t)-1:\r\n if t[i] == 'B' and t[i + 1] == 'G':\r\n t[i], t[i + 1] = t[i + 1], t[i]\r\n i += 2\r\n else:\r\n i += 1\r\nt1 = ''.join(t)\r\nprint(t1)\r\n", "n, t = map(int, input().split())\r\nq = list(input())\r\nfor _ in range(t):\r\n i = 0\r\n while i < len(q) - 1:\r\n if q[i] == 'B' and q[i + 1] == 'G':\r\n q[i], q[i + 1] = 'G', 'B'\r\n i += 2\r\n else:\r\n i += 1\r\nfor _ in q:\r\n print(_, end = '')", "import sys\r\n\r\nn, t = map(int, input().split())\r\ns = input().strip()\r\n\r\nfor _ in range(t):\r\n i = 1\r\n while i < n:\r\n if s[i] == 'G' and s[i - 1] == 'B':\r\n s = s[:i - 1] + 'G' + 'B' + s[i + 1:]\r\n i += 1\r\n i += 1\r\n\r\nprint(s)\r\n", "n, t = map(int, input().split())\r\ns = input()\r\nlst = list(s)\r\n\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if lst[i] == 'B' and lst[i+1] == 'G':\r\n lst[i], lst[i+1] = lst[i+1], lst[i]\r\n i += 2\r\n else:\r\n i += 1\r\nfinal = \"\"\r\nfor ch in lst:\r\n final += ch\r\nprint(final)", "n,t = map(int,input().split())\r\nque = list(input())\r\nfor j in range(t):\r\n check = 0\r\n for i in range(len(que)-1):\r\n if que[i+1] ==\"G\" and que[i] == \"B\" and i >= check:\r\n que[i],que[i+1] = que[i+1],que[i]\r\n check = i + 2\r\nprint(\"\".join(que))", "n, t = input().split()\r\nn, t = int(n), int(t)\r\nk = input()\r\nfor j in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if k[i] + k[i + 1] == 'BG':\r\n k = k[:i] + 'GB' + k[i + 2:]\r\n i += 2\r\n else:\r\n i += 1\r\nprint(k)\r\n", "n, t = map(int, input().split())\r\ns = input()\r\n\r\nwhile t:\r\n s = s.replace(\"BG\", \"GB\")\r\n t -= 1\r\nprint(s)", "n, t = map(int, input().split())\r\ns = input()\r\ns1 = ''\r\ncnt = 0\r\nwhile cnt < t:\r\n i = 0\r\n while i < n - 1:\r\n if s[i] == 'B' and s[i + 1] == 'G':\r\n s1 += 'G' + 'B'\r\n i += 2\r\n else:\r\n s1 += s[i]\r\n i += 1\r\n if i == n - 1:\r\n s1 += s[i]\r\n cnt += 1\r\n s = s1\r\n s1 = ''\r\nprint(s)", "nt=list(map(int, input().split()))\r\ns=list(input())\r\ns.append('1')\r\nfor i in range(nt[1]):\r\n for j in range(1,nt[0]+1):\r\n if s[j]=='G' and s[j-1]=='B':\r\n s[j]='0'\r\n s[j-1]='G'\r\n elif s[j-1]=='0':\r\n s[j-1]='B'\r\n pass\r\n if i==nt[1]-1 and s[nt[0]]=='1':\r\n s.remove('1')\r\nprint(''.join(s))", "n,move=map(int,input().split())\r\na=input()\r\nl=[]\r\nfor i in a:\r\n l.append(i)\r\nfor j in range(move):\r\n i=0\r\n while(i<len(l)-1):\r\n if(l[i]=='B'and l[i+1]=='G'):\r\n temp=l[i]\r\n l[i]=l[i+1]\r\n l[i+1]=temp\r\n i=i+2\r\n else:\r\n i=i+1\r\na=\"\"\r\nfor k in l:\r\n a=a+k\r\nprint(a)\r\n\r\n\r\n\r\n", "def 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\ndef result(n, t, s):\n for x in range(t):\n a = \"\"\n i = 0\n\n while i < n - 1:\n if s[i] == 'B' and s[i+1] == 'G':\n a += 'G'\n a += 'B'\n i += 2\n else:\n a += s[i]\n i += 1\n\n if i < n:\n a += s[i]\n \n s = a\n \n return s\n\ndef main():\n n, t = read_ints()\n s = read_str()\n print(result(n, t, s))\n\nif __name__ == '__main__':\n main()", "n,t = map(int,input().split())\r\ns = input()\r\nl=[i for i in range(n)]\r\nrs = []\r\nfor _ in range(t):\r\n for i in range(n-1):\r\n if s[l[i]]=='B' and s[l[i+1]]=='G':\r\n rs.append(i)\r\n for i in rs:\r\n l[i],l[i+1]=l[i+1],l[i]\r\n while rs:\r\n rs.pop()\r\nfor i in l:\r\n print(s[i],end='')", "n, t = map(int, input().split())\r\ns = input()\r\na = [i for i in s]\r\nfor i in range(t):\r\n j = 0\r\n while j < n - 1:\r\n if a[j] == \"B\" and a[j + 1] == \"G\":\r\n a[j] = \"G\"\r\n a[j + 1] = \"B\"\r\n j += 1\r\n j += 1\r\nprint(*a, sep='')", "def rearrange(order):\r\n n=len(order)\r\n i=0\r\n while i<n-1:\r\n if order[i]=='B' and order[i+1]=='G':\r\n order[i],order[i+1]='G','B'\r\n i+=1\r\n i+=1 \r\n\r\nn,t=map(int,input().split())\r\n\r\norder=[c for c in input()]\r\nfor _ in range(t):\r\n rearrange(order)\r\n\r\nprint(''.join(order))", "l, t = input().split(' ')\r\nl = int(l)\r\nt = int(t)\r\nt_limit = 1\r\ns = input()\r\ns = list(s)\r\ns_new = ''\r\nwhile t_limit <= t:\r\n i = 0\r\n while i < len(s) - 1:\r\n if s[i] == 'B' and s[i+1] == 'G':\r\n s[i] = 'G'\r\n s[i+1] = 'B'\r\n i += 1\r\n i += 1\r\n t_limit += 1\r\nfor i in range(len(s)):\r\n s_new += s[i] \r\nprint(s_new)", "m,n = map(int, input().split())\r\nstring = input()\r\nfor i in range(n):\r\n string = string.replace('BG','GB')\r\nprint(string)", "l2=[int(x) for x in input().split()]\r\ns=input()\r\nfor i in range(l2[1]):\r\n s=s.replace('BG','GB')\r\nprint(s)", "o,p=map(int,input().split())\r\nh=input()\r\nh=list(h)\r\ni = 0\r\nwhile p > 0:\r\n i = 0\r\n while i < o-1:\r\n if h[i] == 'B' and h[i+1] == 'G':\r\n h[i],h[i+1]=h[i+1],h[i]\r\n i += 1\r\n i += 1\r\n p -= 1\r\nfor j in h:\r\n print(j,end='')", "n,t=map(int,input().split())\r\nx=list(input())\r\n\r\nfor a in range(t):\r\n j=1\r\n while j<n:\r\n if x[-j]==\"G\" and x[-j-1]=='B':\r\n x[-j],x[-j-1]=x[-j-1],x[-j]\r\n j=j+2\r\n else:\r\n j=j+1\r\n\r\nfor b in x:\r\n print(b,end='')", "n, t = map(int, input().split(\" \"))\ns = input()\ns_list = list(s)\n\n\ndef rearrange(line):\n i = 0\n while i < len(line) - 1:\n if line[i] == \"B\" and line[i + 1] == \"G\":\n line[i], line[i + 1] = line[i + 1], line[i]\n i += 1\n i += 1\n return line\n\n\ni = 1\nwhile i <= t:\n s_list = rearrange(s_list)\n i += 1\nprint(\"\".join(s_list))\n", "n, t = map(int, input().split())\n\nq = input()\nqs = [c for c in q]\n\nfor i in range(t):\n ts = qs[:]\n for j in range(n - 1):\n if qs[j:j + 2] == ['B', 'G']:\n ts[j: j + 2] = ['G', 'B']\n qs = ts\n\nprint(\"\".join(qs))", "n, t = map(int, input().split())\r\no = list(input())\r\nfor _ in range(t):\r\n n_o = o[:]\r\n for i in range(len(o)-1):\r\n if o[i] == \"B\" and o[i+1] == \"G\":\r\n n_o[i] = \"G\"\r\n n_o[i+1] = \"B\"\r\n o = n_o[:]\r\nprint(\"\".join(o))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 15:51:09 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\nn,t=map(int, input().split())\r\nquene = [x for x in input()]\r\nboy_count = len([x for x in quene if x == 'B'])\r\ndef paixu(quene_given,boy_count):\r\n for i in range(len(quene_given)+boy_count):\r\n if i+2 <= len(quene_given):\r\n if quene_given[i] == 'B' and quene_given[i+1] == 'G':\r\n quene_given[i] = 'G'\r\n quene_given[i+1] = 'B'\r\n quene_given.insert(i+2, 'N')\r\n a = [x for x in quene_given if x != 'N']\r\n return a\r\n\r\n\r\nfor _ in range(t):\r\n quene = paixu(quene,boy_count)\r\n \r\nresult = str()\r\n\r\nfor i in range(len(quene)):\r\n result = result + quene[i]\r\nprint(result)\r\n \r\n \r\n", "chir,van=int(input().split()[1]),input()\r\nfor ch in range(chir):van=van.replace(\"BG\",\"GB\")\r\nprint(van)", "n,t=map(int,input().split())\r\ns = input()\r\nl = list(s)\r\nwhile t>0:\r\n i = 0\r\n while i<(len(l)-1):\r\n if l[i]==\"B\" and l[i+1]==\"G\":\r\n l[i],l[i+1]=l[i+1],l[i]\r\n i+=1\r\n i+=1\r\n t-=1\r\nprint(*l,sep=\"\")", "# for _ in range(int(input())):\r\nn,t = [int(x) for x in input().split()]\r\ns = list(input())\r\nfor i in range(t):\r\n new_s = s.copy()\r\n for j in range(len(s)-1):\r\n # print(new_s)\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n new_s[j] = 'G'\r\n new_s[j+1] = 'B'\r\n s = new_s.copy()\r\nprint(\"\".join(s))", "def solve():\r\n n,t = input().split()\r\n s = list(input())\r\n for _ in range(int(t)):\r\n i = 0\r\n while i < int(n)-1:\r\n if s[i] == \"B\" and s[i+1] == \"G\":\r\n s[i],s[i+1] = s[i+1],s[i]\r\n i+=2\r\n else:\r\n i+=1\r\n return \"\".join(s)\r\n\r\nprint(solve())\r\n\r\n ", "n,t = map(int,input().split())\r\ns = list(input())\r\nwhile t:\r\n t-=1\r\n i = 1\r\n while i<n:\r\n if s[i-1] == 'B' and s[i] == 'G':\r\n s[i-1],s[i] = s[i],s[i-1]\r\n i+=2\r\n else:\r\n i+=1\r\nprint(\"\".join(s))", "n, t = map(int, input().split())\r\nline = [i for i in input()]\r\nfor i in range(t):\r\n switch = []\r\n for i in range(n-1):\r\n if (line[i] == \"B\" and line[i+1] == \"G\"):\r\n switch.append(i)\r\n for i in switch:\r\n line[i] = \"G\"\r\n line[i+1] = \"B\"\r\noutput = \"\"\r\nfor i in line:\r\n output += i\r\nprint(output)", "n, t = map(int, input().split())\r\na = input()\r\nfor i in range(t):\r\n a = a.replace('BG', 'GB')\r\nprint(a)", "from collections import deque\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\n\r\nq = deque(s)\r\n\r\nfor _ in range(k):\r\n q2 = deque()\r\n while len(q) > 1:\r\n c1 = q.popleft()\r\n if c1 == 'G':\r\n q2.append(c1)\r\n else:\r\n c2 = q[0]\r\n if c2 == 'B':\r\n q2.append(c2)\r\n else:\r\n q2.append(c2)\r\n q2.append(c1)\r\n q.popleft()\r\n if len(q) > 0:\r\n q2.append(q[0])\r\n q = q2\r\n\r\nwhile len(q) > 0:\r\n print(q.popleft(), end='')\r\n", "n,t = map(int,input().split())\r\ns = input()\r\nl=[i for i in s]\r\nrs=[]\r\nfor _ in range(t):\r\n for i in range(n-1):\r\n if l[i]=='B' and l[i+1]=='G':\r\n rs.append(i)\r\n for i in rs: \r\n l[i],l[i+1]=l[i+1],l[i]\r\n rs=[]\r\nfor i in l:\r\n print(i,end='')", "def change(line):\r\n final_line=[]\r\n position=[]\r\n for i in range(0,len(line)-1):\r\n if line[i]=='B' and line[i+1]=='G':\r\n position.append(i)\r\n for j in position:\r\n line_reserve=line[j+1]\r\n line[j+1]=line[j]\r\n line[j]=line_reserve\r\n return line\r\n\r\nn,l=map(int,input().split())\r\ns=input()\r\nline=[]\r\nfor m in s:\r\n line.append(m)\r\nfor k in range(0,l):\r\n change(line)\r\nfor w in range(0,len(line)):\r\n print(line[w],end='')\r\n", "size,test= map(int, input().split())\r\nS=input().strip()\r\nS=list(S) \r\nfor j in range(test):\r\n i = 0\r\n while i <size-1:\r\n if S[i] == 'B' and S[i + 1] == 'G':\r\n S[i], S[i + 1] = S[i + 1], S[i]\r\n i += 2 \r\n else:\r\n i += 1\r\nprint(\"\".join(S))\r\n", "n, t = [int(i) for i in input().split()]\r\nx = input()\r\nfor i in range(t):\r\n x = x.replace('BG', \"GB\")\r\nprint(x)\r\n", "n, t = list(map(int, input().split()))\r\ns = list(input())\r\ncount = 0\r\nfor k in range(0,t):\r\n bool = False\r\n for i in range(0,n-1):\r\n if bool:\r\n bool = False\r\n continue\r\n if(s[i]=='B' and s[i+1]=='G'):\r\n temp = s[i]\r\n s[i]= s[i+1]\r\n s[i+1] = temp\r\n bool = True\r\nprint(('').join(s))", "number_of_children, time = map(int, input().split())\r\ninitial_arrangement = list(input())\r\nfor t in range(time):\r\n i = 0\r\n while i < number_of_children - 1:\r\n if initial_arrangement[i] == 'B' and initial_arrangement[i + 1] == 'G':\r\n initial_arrangement[i], initial_arrangement[i + 1] = initial_arrangement[i + 1], initial_arrangement[i]\r\n i += 2\r\n else:\r\n i += 1\r\nprint(''.join(initial_arrangement)) ", "def onesec(s):\r\n newstr=\"\"\r\n i=0\r\n while i<len(s)-1:\r\n if s[i]==\"B\" and s[i+1]==\"G\":\r\n newstr+=\"GB\"\r\n i+=2\r\n else:\r\n newstr+=s[i]\r\n i+=1\r\n if i == len(s) - 1:\r\n newstr += s[i]\r\n return newstr\r\n\r\nn,t=map(int, input().split())\r\ns=input()\r\nfor i in range(0,t):\r\n s=onesec(s)\r\nprint(s)\r\n\r\n# def onesec(s):\r\n# for i in range(0,len(s)-1):\r\n# if s[[i]==\"B\" and s[i+1]==\"G\"]:\r\n# s[i],s[i+1]=s[i+1],s[i]\r\n# else:\r\n# continue\r\n# return s\r\n \r\n# n,t=map(int, input().split())\r\n# string=input()\r\n# s=list(string)\r\n# print(s)\r\n# for i in range(0,n):\r\n# s=onesec(s)\r\n# print(s)\r\n", "n, t = map(int, input().split())\r\ns = [i for i in input()]\r\n\r\nfor i in range(t):\r\n j = 0\r\n while (j+1 < n):\r\n if s[j] == \"B\" and s[j+1] == \"G\":\r\n s[j], s[j+1] = s[j+1], s[j]\r\n j += 2\r\n else:\r\n j+=1\r\n\r\nprint(\"\".join(s))\r\n", "n, t = input().split()\r\nn, t = int(n), int(t)\r\n\r\nqueue = list(input())\r\n\r\nfor i in range(t):\r\n\r\n\r\n j = 1\r\n while j < len(queue):\r\n if queue[j] == 'G' and queue[j-1] == 'B':\r\n queue[j], queue[j-1] = queue[j-1], queue[j]\r\n j += 1\r\n j += 1\r\n\r\nrez=''\r\nprint(rez.join(queue))", "n,t = map(int,input().split())\r\ns = list(input())\r\nlength = len(s)\r\nl = []\r\nfor i in range(length-1):\r\n if s[i] == 'B':\r\n l.append(i)\r\nlen1 = len(l)\r\nfor __ in range(t):\r\n for i in range(len1):\r\n if l[i] >= length-1:\r\n continue\r\n else: \r\n if s[l[i]+1] == 'G':\r\n v = s.pop(l[i])\r\n s.insert(l[i]+1,v)\r\n v = l.pop(i)\r\n l.insert(i,v+1)\r\nprint(''.join(s))", "a,b=map(int,input().split())\r\ns=input()\r\nwhile b:\r\n s=s.replace('BG','GB')\r\n b-=1\r\nprint(s)", "n, t = map(int, input().split())\r\n\r\ninp = input()\r\n\r\nfor i in range(t):\r\n inp = inp.replace('BG', 'GB') # replace all BG with GB (wouldn't have thought of this)\r\n\r\nprint(inp)", "n,t=map(int,input().split())\r\nf=input()\r\ni=0\r\nwhile t>0:\r\n f=f.replace(\"BG\",\"GB\")\r\n t-=1\r\n \r\nprint(f)\r\n", "n,s=map(int,input().split())\r\nq=list(input())\r\nfor j in range(s):\r\n i=1\r\n while i<n:\r\n if q[i-1]=='B' and q[i]=='G':\r\n q[i-1],q[i]=q[i],q[i-1]\r\n i = i + 2\r\n else:\r\n i=i+1\r\nprint(''.join(q))", "n, t = map(int, input().split())\r\ns = input()\r\n\r\n# Convert the input string to a list for easier manipulation\r\nqueue = list(s)\r\n\r\n# Iterate through each second\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n # If a boy is standing in front of a girl, swap them\r\n if queue[i] == 'B' and queue[i + 1] == 'G':\r\n queue[i], queue[i + 1] = queue[i + 1], queue[i]\r\n i += 2 # Skip the next girl since they already moved\r\n else:\r\n i += 1\r\n\r\n# Convert the list back to a string and print the result\r\nresult = ''.join(queue)\r\nprint(result)\r\n", "n, t = [int(x) for x in input().split()]\r\ns = [x for x in input()]\r\ni = 1\r\nwhile t > 0:\r\n while i < n:\r\n if s[i - 1] == 'B' and s[i] == 'G':\r\n s[i - 1], s[i] = s[i], s[i - 1]\r\n i += 1\r\n i += 1\r\n i = 1\r\n t -= 1\r\nprint(''.join(s))", "def code(*args):\r\n n,t,queue = args\r\n\r\n while t > 0:\r\n\r\n i = 0\r\n while i in range(n-1):\r\n if (queue[i] == 'B' and queue[i+1] == 'G'):\r\n queue[i], queue[i+1] = queue[i+1], queue[i]\r\n i += 1\r\n i += 1\r\n t -= 1\r\n \r\n return queue\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n n, t = list(map(int, input().split()))\r\n queue = list(input())\r\n\r\n result = code(n, t, queue) # Pass arguments\r\n print(''.join(result))\r\n\r\n", "def transform_queue(n, t, s):\r\n queue = list(s)\r\n\r\n for _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if queue[i] == 'B' and queue[i + 1] == 'G':\r\n queue[i], queue[i + 1] = queue[i + 1], queue[i]\r\n i += 2 # Skip the next position since it's a girl now\r\n else:\r\n i += 1\r\n\r\n return ''.join(queue)\r\n\r\n# Read input\r\nn, t = map(int, input().split())\r\ns = input()\r\n\r\n# Calculate and print the final arrangement\r\nresult = transform_queue(n, t, s)\r\nprint(result)", "string = [int(i) for i in input().split()]\r\npos = list(input())\r\nn, t = string[0], string[1]\r\nres = 0\r\nfor i in range(t):\r\n for j in range(n):\r\n if j == n - 1:\r\n break\r\n elif res == 1:\r\n res = 0\r\n continue\r\n elif pos[j] == 'B' and pos[j + 1] == 'G':\r\n res = 1\r\n pos[j], pos[j + 1] = pos[j + 1], pos[j]\r\n res = 0\r\nprint(''.join(pos))", "n, t = map(int, input().split())\r\nq = list(input())\r\n\r\nfor _ in range(t):\r\n v = 0\r\n while v< n - 1:\r\n if q[v] == \"B\" and q[v + 1] == \"G\":\r\n q[v], q[v + 1] = q[v + 1], q[v]\r\n v += 2\r\n else:\r\n v += 1\r\n\r\nprint(\"\".join(q))\r\n", "n, t = map(int, input().split())\r\ns = input()\r\ns = [s[k] for k in range(n)]\r\nj = 1\r\nwhile j <= t:\r\n i = 0\r\n while i < (len(s) - 1):\r\n if (s[i] == \"B\") and (s[i + 1] == \"G\"):\r\n s[i] = \"G\"\r\n s[i + 1] = \"B\"\r\n i += 1\r\n i += 1\r\n j += 1\r\nout = \"\"\r\nfor el in s:\r\n out += el\r\nprint(out)", "\r\nn, t = map(int, input().split())\r\n\r\nstudentQueue = list(input())\r\n\r\n\r\nfor t in range(t):\r\n i = 0\r\n while i < n-1:\r\n if studentQueue[i] == \"B\" and studentQueue[i+1] == \"G\":\r\n studentQueue[i], studentQueue[i + 1] = studentQueue[i + 1], studentQueue[i]\r\n i += 2\r\n else: i += 1\r\n\r\nresult = ''.join(studentQueue)\r\nprint(result)\r\n", "n, t = map(int, input().split())\r\ns = input()\r\nfor i in range(t):\r\n j = 0\r\n while j < n-1:\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n try:\r\n s = s[:j] + 'G' + 'B' + s[j+2:]\r\n except:\r\n s = s[:j] + 'G' + 'B'\r\n j += 2\r\n continue\r\n j += 1\r\nprint(s)\r\n\r\n", "n,t=map(int,input().split())\r\ns=input()\r\na=[]\r\nfor i in s:\r\n a.append(i)\r\nwhile t>0:\r\n i=0\r\n while i<n-1:\r\n \r\n if a[i]=='B' and a[i+1]=='G':\r\n a[i]='G'\r\n a[i+1]='B'\r\n i+=1\r\n i+=1 \r\n \r\n t-=1\r\nan=\"\"\r\nfor i in a:\r\n an+=i \r\nprint(an)\r\n ", "a = [int(x) for x in input().split()]\r\ns = list(input())\r\nfor i in range(a[1]):\r\n j = 0\r\n while j < a[0] - 1:\r\n if s[j] == \"B\" and s[j + 1] == \"G\":\r\n s[j] = \"G\"; s[j + 1] = \"B\"\r\n j += 2\r\n else:\r\n j += 1\r\nfor i in s:\r\n print(i, end=\"\")\r\n\r\n", "n,t=map(int,input().split())\r\na=list(input())\r\nfor k in range(t):\r\n s=[0]*n\r\n for i in range(n-1):\r\n if a[i]==\"B\" and a[i+1]==\"G\" and s[i]==0:\r\n a[i],a[i+1]=a[i+1],a[i]\r\n s[i+1]=1\r\nw=''\r\nfor i in a:\r\n w+=i\r\nprint(w)\r\n", "n , t = input().split()\r\nn = int(n)\r\nt = int(t)\r\nss = input()\r\nss = str(ss)\r\nss = list(ss)\r\n#new_str = s\r\nnew_str = []\r\nfor i in range(t):\r\n j = 0\r\n while j < len(ss):\r\n if j < len(ss) - 1:\r\n if ss[j] == 'B' and ss[j+1] == 'G':\r\n new_str.append('G')\r\n new_str.append('B')\r\n j += 2\r\n else:\r\n new_str.append(ss[j])\r\n j += 1\r\n else:\r\n new_str.append(ss[j])\r\n j += 1\r\n ss = new_str\r\n new_str = []\r\nprint(''.join(ss))", "no, time = map(int, input().split())\nline = str(input())\n\nfor i in range(time):\n line = line.replace(\"BG\",\"GB\")\nprint(line)\n", "n11, t11 = map(int, input().split())\r\ns11 = input()\r\n\r\nqueue = list(s11)\r\n\r\nfor _ in range(t11):\r\n i = 0\r\n while i < n11 - 1:\r\n if queue[i] == \"B\" and queue[i + 1] == \"G\":\r\n queue[i], queue[i + 1] = queue[i + 1], queue[i]\r\n i += 2\r\n else:\r\n i += 1\r\n\r\nresult = \"\".join(queue)\r\nprint(result)\r\n", "n, t = map(int, input().split())\r\nqueue = list(input())\r\nfor _ in range(t):\r\n used = [False for _ in range(n)]\r\n for i in range(n-1):\r\n if queue[i] == 'B' and queue[i+1] == 'G' and not used[i] and not used[i+1]:\r\n queue[i] = 'G'\r\n queue[i+1] = 'B'\r\n used[i] = True\r\n used[i+1] = True\r\nqueue = ''.join(c for c in queue)\r\nprint(queue)", "a=input().split()\r\nnum=int(a[0])\r\ntime=int(a[1])\r\n\r\nx=input()\r\n\r\nfor i in range(time):\r\n x=x.replace(\"BG\",\"GB\")\r\nprint(x)\r\n", "n,t=map(int,input().split())\na=input()\nj=0\nwhile j<t:\n l=0\n i=1+l\n while i<n:\n if a[l]==\"B\" and a[i]==\"G\":\n a=a[:l]+\"G\"+a[l+1:]\n a=a[:i]+\"B\"+a[i+1:]\n l+=2\n i+=2\n else :\n l+=1\n i+=1\n j+=1\nprint(a)\n\n\n\n\n\n\n\n\n", "a,b=map(int,input().split())\r\nx=list(input())\r\nindex=[]\r\nfor f in range(b):\r\n for c in range(a-1):\r\n if x[c] == 'B' and x[c+1]==\"G\":\r\n index.append(c)\r\n for g in range(len(index)):\r\n x[index[g]],x[index[g]+1] = x[index[g]+1], x[index[g]]\r\n index.clear()\r\n c=0\r\nfor k in x:\r\n print(k,end=\"\")", "from collections import Counter\r\ndef solve(s, T):\r\n ls = list(s)\r\n while T > 0:\r\n ptr = 0\r\n while ptr < len(ls):\r\n if ls[ptr] == 'G':\r\n if ptr > 0 and ls[ptr - 1] == 'B':\r\n ls[ptr - 1] = 'G'\r\n ls[ptr] = 'B'\r\n ptr += 1\r\n ptr += 1\r\n T -= 1\r\n return ''.join(ls)\r\n \r\n\r\nT = int(input().split()[1])\r\ns = input()\r\nprint(solve(s, T))", "a,b=map(int,input().split())\r\nc=input()\r\nfor i in range(b):\r\n c=c.replace(\"BG\",\"GB\")\r\nprint(c)", "m,n = input().split(\" \")\r\nm,n = int(m),int(n)\r\ns = input()\r\nfor i in range(n):\r\n s = s.replace(\"BG\",\"GB\")\r\nprint(s)", "n,t=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nfor i in range(t):\r\n c=0\r\n while c<len(s)-1:\r\n \r\n if s[c]==\"B\" and s[c+1]==\"G\":\r\n s[c],s[c+1] = s[c+1],s[c]\r\n c+=1\r\n c+=1\r\n \r\nprint(\"\".join(s))\r\n ", "n= int(input().split()[1])\r\norder = [k for k in input()]\r\nchk = order.copy()\r\nfor i in range(n):\r\n for j in range(len(order)-1):\r\n if chk[j]==\"B\" and chk[j+1]==\"G\":\r\n order[j],order[j+1]=\"G\",\"B\" \r\n chk = order.copy()\r\nprint(\"\".join(order))", "n, t = map(int, input().split())\ns = list(input())\n\nfor i in range(t):\n mem_idx = []\n for j in range(1, len(s)):\n if s[j-1] == 'B' and s[j] == 'G':\n mem_idx.append(j-1)\n #s[j-1], s[j] = s[j], s[j-1]\n for j in mem_idx:\n s[j], s[j+1] = s[j+1], s[j]\nprint(\"\".join(s))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 17:27:19 2023\r\n\r\n@author: 27823\r\n\"\"\"\r\n#输入#\r\nn,t=map(int,input().split())\r\nqueue=list(input())\r\ntime=0\r\n#定义函数#\r\ndef next_second(queue):\r\n QUEUE=queue[:]#for循环有先后顺序，使得原本判定为false可能因为前面操作误判为true#\r\n for i in range(len(queue)-1):\r\n if queue[i]==\"B\" and queue[i+1]==\"G\":\r\n QUEUE[i],QUEUE[i+1]=queue[i+1],queue[i]\r\n return QUEUE\r\n#while循环迭代#\r\nwhile time<t:\r\n queue=next_second(queue)\r\n time+=1\r\n#输出# \r\nqueue_last=\"\"\r\nfor child in queue:\r\n queue_last=queue_last+child\r\nprint(queue_last)", "def permutGB(L) :\r\n i = 0\r\n while(i<len(L)-1):\r\n if L[i]=='B' and L[i+1]=='G':\r\n L[i], L[i+1]=L[i+1], L[i]\r\n i+=2\r\n else :\r\n i+=1\r\n\r\nn = int(input().split(\" \")[1])\r\nL = list(input())\r\nfor i in range(n):\r\n permutGB(L)\r\nprint(\"\".join(L))\r\n", "n, m = map(int, input().split())\r\nq = input()\r\nfor _ in range(m):\r\n q = q.replace(\"BG\", \"GB\")\r\nprint(q)\r\n", "n, x = list(map(int, input().split(\" \")))\nq = list(input())\nwhile x > 0:\n i = 0\n while i < n - 1:\n if q[i] == \"B\" and q[i+1] == \"G\":\n q[i] = \"G\"\n q[i+1] = \"B\"\n i+=2\n continue\n i+=1 \n x-=1\n\nprint(\"\".join(q))", "n = [int(x)for x in input().split(\" \")]\r\na = list(input())\r\nfor j in range(0,n[1]):\r\n i = 0\r\n while i < len(a)-1:\r\n if a[i] == \"B\" and a[i+1] == \"G\":\r\n a[i], a[i+1] = a[i+1], a[i]\r\n i += 1\r\n i += 1\r\nprint(\"\".join(a))", "n,t = map(int, input().split())\r\nline = input()\r\n\r\nfor i in range(t):\r\n if 'BG' in line:\r\n line = line.replace('BG','GB')\r\nprint(line)", "strLen, time = map(int, input().split())\r\nqueue = input()\r\nans = list(queue)\r\n\r\nwhile time > 0:\r\n i = 1\r\n while (i < strLen):\r\n if (ans[i] == \"G\" and ans[i-1] == \"B\"):\r\n ans[i], ans[i-1] = \"B\", \"G\"\r\n i += 1\r\n i += 1\r\n time -= 1\r\nans = \"\".join(ans)\r\nprint(ans)\r\n", "n , t = map(int,input().split())\r\nmy_str = input()\r\nwhile t > 0:\r\n my_str = my_str.replace('BG','GB')\r\n t -= 1\r\nprint(my_str)", "n,t=map(int,input().split())\r\nqueue=str(input())\r\n\r\n\r\nfor i in range(t):\r\n if queue.count('BG')!=-1:\r\n queue=queue.replace('BG','GB')\r\nprint(queue)", "# Read input\r\nn, t = map(int, input().split())\r\ninitial_arrangement = list(input())\r\n\r\n# Perform the transformations for 't' seconds\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if initial_arrangement[i] == \"B\" and initial_arrangement[i + 1] == \"G\":\r\n # Swap the positions of a boy and a girl\r\n initial_arrangement[i], initial_arrangement[i + 1] = initial_arrangement[i + 1], initial_arrangement[i]\r\n i += 2 # Skip the girl, as she has moved forward\r\n else:\r\n i += 1\r\n\r\n# Output the final arrangement\r\nfinal_arrangement = ''.join(initial_arrangement)\r\nprint(final_arrangement)\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\r\narr = list(input())\r\np = ('B', 'G')\r\nfor i in range(t):\r\n x = 0\r\n while (x < n-1):\r\n if ((arr[x], arr[x+1]) == p):\r\n arr[x], arr[x+1] = arr[x+1], arr[x]\r\n x+=1\r\n x+=1\r\nprint(''.join(arr))", "v=int(input()[2:]);s=input()\r\nwhile v:s=s.replace('BG','GB');v-=1\r\nprint(s)", "params = list(map(int, input().split()))\r\ns = input()\r\n\r\nfor _ in range(params[1]):\r\n s = s.replace(\"BG\", \"GB\", s.count(\"BG\"))\r\n\r\nprint(s)", "#initializes time and initial line\r\nsituation = input().split(' ')\r\ntime = int(situation[1])\r\nline = input()\r\n\r\n#swaps any boy with the girl infront of him per designated times\r\nwhile time != 0:\r\n line = line.replace('BG', 'GB')\r\n time -= 1\r\n\r\n#prints resulting line\r\nprint(line)", "n,t = map(int,input().split())\r\nqueue = input()\r\n\r\nfor i in range(t):\r\n queue = queue.replace(\"BG\",\"GB\")\r\nprint(queue)", "n,t = map(int,input().split())\r\nr = input()\r\nL = []\r\nfor i in range(t+1):\r\n L.append([])\r\nfor i in range(len(r)):\r\n L[0].append(r[i])\r\nfor i in range(1,t+1):\r\n for j in range(len(r)):\r\n L[i].append(L[i-1][j])\r\n for j in range(len(r)-1):\r\n if L[i-1][j] == 'B' and L[i-1][j+1] == 'G':\r\n L[i][j] = 'G'\r\n L[i][j+1] = 'B'\r\nANS = L[t][0]\r\nfor i in range(len(r)-1):\r\n ANS = ANS +L[t][i+1]\r\nprint(ANS)", "(n,t)=map(int,input().split(' '))\r\ns=input(\"\")\r\nfor i in range (t):\r\n s=s.replace('BG','GB')\r\n \r\nprint(s)\r\n", "n, t = map(int, input().split())\r\nq = list(input())\r\n\r\ndef find(q, n):\r\n pair = []\r\n i = 0\r\n while i < n - 1:\r\n if q[i] == 'B' and q[i + 1] == 'G':\r\n pair.append([i, i + 1])\r\n i += 2\r\n else:\r\n i += 1\r\n return pair\r\n \r\nfor _ in range(t):\r\n p = find(q, n)\r\n for i in p:\r\n a, b = i[0], i[1]\r\n q[a], q[b] = q[b], q[a]\r\n \r\ns = \"\"\r\nfor i in q:\r\n s += i\r\nprint(s)", "# cook your dish here\r\nn,t=map(int,input().split())\r\ns=input()\r\narr=[]\r\nfor i in s:\r\n arr.append(i)\r\nfor i in range(t):\r\n j=0\r\n while j<n-1:\r\n if arr[j]=='B' and arr[j+1]=='G':\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n j+=1\r\n j+=1\r\nans=''\r\nfor i in arr:\r\n ans+=i\r\nprint(ans)", "children, target_time = [int(x) for x in input().split()]\r\nqueue = input()\r\n\r\nfor time in range(target_time):\r\n queue = queue.replace(\"BG\", \"GB\")\r\n\r\nprint(queue)", "a = input().split()\r\ncount_children = int(a[0])\r\ncount_seconds = int(a[1])\r\nchildren = input()\r\ng = 'G'\r\nb = 'B'\r\nfor i in range(count_seconds):\r\n check = False\r\n for n in range(count_children - 1):\r\n if check == True:\r\n check = False\r\n continue\r\n if children[n] == b and children[n + 1] == g and check == False:\r\n children = children[:n] + g + children[n + 1:]\r\n children = children[:n + 1] + b + children[n + 2:]\r\n check = True\r\nprint(children)", "n, test = map(int, input().split())\r\nsw = list(input())\r\n \r\nfor b in range(test):\r\n i = 0\r\n while i < n - 1:\r\n if sw[i] == 'B' and sw[i + 1] == 'G':\r\n \r\n sw[i], sw[i + 1] = sw[i + 1], sw[i]\r\n i += 2 \r\n else:\r\n i += 1\r\n \r\nfor char in sw:\r\n print(char, end='')\r\n \r\nprint()", "n,t=map(int,input().split())\r\ns=input()\r\nl=list(s)\r\nfor j in range(t):\r\n i=0\r\n while(n-1>i):\r\n if(l[i]=='B' and l[i+1]=='G'):\r\n l[i]='G'\r\n l[i+1]='B'\r\n i+=2\r\n else:\r\n i+=1\r\n \r\nfor i in l:\r\n print(i,end='')\r\n \r\n ", "n,t = map(int, input().split())\r\ns = list(input())\r\nfor i in range(t):\r\n x = []\r\n for j in range(n-1):\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n x.append(j)\r\n for k in x:\r\n s[k]='G'\r\n s[k+1]='B'\r\nprint(''.join(s))\r\n", "n, t = map(int, input().split())\r\ns = input()\r\nq = list(s)\r\nfinal_s = \"\"\r\nwhile(t > 0):\r\n i = 0\r\n while i < len(s) - 1:\r\n if q[i] == \"B\" and q[i + 1] == \"G\":\r\n q[i], q[i + 1] = q[i + 1], q[i]\r\n i += 1\r\n i += 1\r\n t -= 1\r\n\r\nfor i in range(len(q)):\r\n final_s += q[i]\r\n\r\nprint(final_s)", "x,y=list(map(int,input().split()))\r\ns=input()\r\nwhile(y):\r\n s=s.replace(\"BG\",\"GB\")\r\n y-=1\r\nprint(s) \r\n\r\n ", "n, t = list(map(int, input().split()))\r\ns = input()\r\nwhile t!=0:\r\n if \"BG\" in s:\r\n s = s.replace(\"BG\", \"GB\")\r\n t-=1\r\nprint(s)", "n, t = map(int, input().split())\r\narrangement = list(input())\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if arrangement[i] == 'B' and arrangement[i + 1] == 'G':\r\n arrangement[i], arrangement[i + 1] = arrangement[i + 1], arrangement[i]\r\n i += 2 \r\n else:\r\n i += 1\r\nprint(\"\".join(arrangement))\r\n", "import sys\r\nimport bisect\r\nfrom math import *\r\nfrom queue import PriorityQueue\r\n# Fast input reading\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n# Constants\r\nMOD = 10**9 + 7\r\nINF = float('inf')\r\n\r\n# Utility functions\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n# Main function\r\ndef main():\r\n n,t=map(int,input().split())\r\n s=input()\r\n s=[i for i in s]\r\n for i in range(t):\r\n j=0\r\n while(j<n-1):\r\n if(s[j]=='B' and s[j+1]=='G'):\r\n s[j],s[j+1]=s[j+1],s[j]\r\n j+=1\r\n j+=1\r\n print(''.join(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, t = map(int, input().split())\r\n\r\nmas = [i for i in input()]\r\n\r\n\r\nfor i in range(t):\r\n pos = []\r\n for j in range(0, n - 1):\r\n if mas[j] == \"B\" and mas[j + 1] == \"G\":\r\n pos.append(j)\r\n \r\n for i in pos:\r\n mas[i] = \"G\"\r\n mas[i+1] = \"B\"\r\n\r\nprint(*mas, sep=\"\")", "n, t = map(int, input().split())\r\nline = list(input())\r\n\r\nfor i in range(t):\r\n each_person = 0\r\n while each_person < n-1:\r\n if line[each_person] == 'B' and line[each_person+1] == 'G':\r\n line[each_person], line[each_person+1] = line[each_person+1], line[each_person]\r\n each_person += 2\r\n else:\r\n each_person += 1\r\n\r\nline = \"\".join(line)\r\nprint(line)", "# coding=utf-8\n\n# solve\ndef solve():\n a = input()\n s = a.split()\n n, t = int(s[0]), int(s[1])\n b = input()\n for i in range(t):\n j = 0\n cur = ''\n while j < n:\n if j < n - 1 and b[j] == 'B' and b[j + 1] == 'G':\n cur = cur + \"GB\"\n j += 2\n else:\n cur = cur + b[j]\n j += 1\n b = cur\n print(b)\n\n\n# main\nif __name__ == \"__main__\":\n solve()\n", "a, b = map(int, input().split())\r\nc = list(input())\r\nd = 0\r\nfor i in range(b):\r\n d = 1\r\n while d < a:\r\n if c[d] == 'G' and c[d-1] == 'B':\r\n c[d], c[d-1] = c[d-1], c[d]\r\n d += 2\r\n else:\r\n d += 1\r\nprint(''.join(c))", "n, t = (int(i) for i in input().split())\r\nline = input()\r\n\r\nfor j in range(t):\r\n if 'BG' in line:\r\n line = line.replace('BG', 'GB')\r\nprint(line)\r\n", "n, t = list(map(int, input().split()))\r\n\r\ns = list(input())\r\n\r\nfor i in range(t):\r\n x = 0\r\n while x < n -1:\r\n if s[x] == \"B\" and s[x+1] == \"G\":\r\n s[x], s[x+1] = s[x+1], s[x]\r\n x += 2\r\n else:\r\n x += 1\r\n \r\nprint(\"\".join(s))", "n,h=map(int,input().split())\r\ns=input()\r\nf=0\r\nfor i in range(h):\r\n\ttemp=''\r\n\tf=0\r\n\twhile f<len(s):\r\n\t\t\t\tif s[f]=='B' and (f+1)<n and s[f+1]=='G':\r\n\t\t\t\t\ttemp=temp+s[f+1]+s[f]\r\n\t\t\t\t\tf+=2\r\n\t\t\t\telse:\r\n\t\t\t\t\ttemp=temp+s[f]\r\n\t\t\t\t\tf+=1\r\n\ts=temp\r\nprint(s)", "x,y = map(int,input().split())\r\nlist_0 = []\r\nfor i in input():\r\n list_0.append(i)\r\nlist_1 = list_0.copy()\r\nfor time in range(y):\r\n list_0 = list_1.copy()\r\n for i in range(x-1):\r\n if list_0[i] == 'B' and list_0[i+1] == 'G':\r\n list_1[i] = 'G'\r\n list_1[i+1] = 'B'\r\nfor i in list_1:\r\n print(i, end='')", "n, t = map(int, input().split())\r\ninitial_arrangement = list(input())\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if initial_arrangement[i] == \"B\" and initial_arrangement[i + 1] == \"G\":\r\n \r\n initial_arrangement[i], initial_arrangement[i + 1] = initial_arrangement[i + 1], initial_arrangement[i]\r\n \r\n i += 2\r\n else:\r\n \r\n i += 1\r\nprint(\"\".join(initial_arrangement))\r\n", "num=input()\r\na=num.split()\r\nx=int(a[0])\r\nn=int(a[1])\r\nmystr=input()\r\nmy_list=list(mystr)\r\ncount=0\r\n\r\nfor _ in range(n):\r\n l=0\r\n while l < len(my_list) - 1:\r\n if my_list[l]=='B' and my_list[l+1]=='G':\r\n temp=my_list[l]\r\n my_list[l]=my_list[l+1]\r\n my_list[l+1]=temp\r\n l+=2\r\n else:\r\n l += 1\r\n \r\n \r\nresult=\"\".join(my_list)\r\nprint(result)\r\n", "n, t = input().split()\r\nn = int(n)\r\nt = int(t)\r\n\r\ns = list(input())\r\nfor _ in range(t):\r\n i = 0\r\n while i < len(s) - 1:\r\n if(s[i] == 'B' and s[i + 1] == 'G'):\r\n s[i], s[i + 1] = s[i + 1], s[i]\r\n i += 1\r\n i += 1\r\n\r\nprint(\"\".join(s))", "a, b = map(int, input().split())\r\ns = input()\r\nfor i in range(b):\r\n #一行即可实现 s = s.replace('BG', 'GB')\r\n j = 0\r\n while j < a-1:\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n s = s[:j] + 'G' + 'B' + s[j+2:]\r\n j += 2\r\n else:\r\n j += 1\r\nprint(s)\r\n", "n,t = map(int,input().split())\r\na = input()\r\n\r\nfor j in range(t):\r\n newer=\"\"\r\n a = a.replace(\"BG\",\"GB\")\r\n\r\nprint(a)\r\n", "n,t = input().split()\r\nn = int(n)\r\nt = int(t)\r\nque = input()\r\nlis = []\r\nfor i in range(len(que)):\r\n lis.append(que[i])\r\nfor i in range(0 , t):\r\n changed = False\r\n for c in range(len(lis) - 1):\r\n if lis[c] == 'B' and lis[c + 1] == 'G' and changed == False:\r\n lis[c] = 'G'\r\n lis[c + 1] = 'B'\r\n changed = True\r\n else:\r\n changed = False\r\nfor x in lis:\r\n print(x,end=\"\")", "n,t=map(int,input().split())\r\ns=list(input())\r\nS=''\r\nflag=False\r\nfor i in range(t):\r\n\tx=0\r\n\twhile x<len(s)-1:\r\n\t\t\t# print('sx',s[x],'sx+1',s[x-1])\r\n\t\tif (s[x]=='B') and (s[x+1]=='G'):\r\n\t\t\ts[x],s[x+1]=s[x+1],s[x]\r\n\t\t\tflag=True\r\n\t\t\tx+=1\r\n\t\tx+=1\r\n\t\t\t\r\n\t\t\r\nfor j in s:\r\n\tS+=j\r\n\r\nprint(S)", "# Queue at the School Difficulty:800\r\nn, t = map(int, input().split())\r\ns = list(input())\r\nfor i in range(t):\r\n j = 0\r\n while j < n-1:\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n s[j], s[j+1] = 'G', 'B'\r\n j += 2\r\n else:\r\n j += 1\r\nfor k in range(n):\r\n print(s[k], end='')\r\n", "n, seconds = map(int, input().split(\" \"))\r\nqueue = input()\r\nchildren = list(queue)\r\n\r\nfor _ in range(seconds):\r\n i = 0\r\n while i < len(children) - 1:\r\n if children[i] == 'B' and children[i + 1] == 'G':\r\n children[i], children[i + 1] = children[i + 1], children[i]\r\n i += 1\r\n i += 1\r\n\r\nresult = ''.join(children)\r\nprint(result)", "a,t=map(int,input().split())\r\ns=list(input())\r\nfor _ in range(t):\r\n i=0\r\n while i<a-1:\r\n if s[i]=='B' and s[i+1]=='G':\r\n s[i],s[i+1]=s[i+1],s[i]\r\n i+=2\r\n else:i+=1\r\nprint(''.join(s))\r\n", "n,t=map(int,input().split())\r\ns=list(input())\r\nfor i in range(t):\r\n i=0\r\n while i<n-1:\r\n if s[i] ==\"B\" and s[i+1] == \"G\":\r\n s[i],s[i+1] = s[i+1],s[i]\r\n i += 2\r\n else:\r\n i += 1\r\nprint(\"\".join(s)) ", "n, t = (int(x) for x in input().split())\nq = list(input())\n\ndef swap (a, b):\n temp = a\n a = b\n b = temp\n\nfor rep in range(0,t):\n curr = list()\n idx=0\n while idx<len(q):\n if idx+1<len(q) and q[idx]==\"B\" and q[idx+1]==\"G\":\n curr.append(\"G\")\n curr.append(\"B\")\n idx+=2\n else:\n curr.append(q[idx])\n idx+=1\n q = curr\n\nprint(\"\".join(q))\n\t\t \t \t \t \t\t\t \t \t\t \t \t \t\t\t\t \t", "n, t = list(map(int, input().split()))\r\nq = list(input())\r\n\r\nfor i in range(t):\r\n pos = 1\r\n while pos < n:\r\n if q[-pos] > q[-pos-1]:\r\n q[-pos], q[-pos-1] = q[-pos-1], q[-pos]\r\n pos += 2\r\n else:\r\n pos += 1\r\nprint(\"\".join(q))\r\n\r\n\r\n", "n, t = map(int, input().split()) # Number of students and number of minutes\r\nqueue = list(input()) # Initial queue of students\r\n\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if queue[i] == \"B\" and queue[i + 1] == \"G\":\r\n # Swap the positions of \"B\" and \"G\"\r\n queue[i], queue[i + 1] = queue[i + 1], queue[i]\r\n i += 2 # Skip the next student since they already swapped\r\n else:\r\n i += 1\r\n\r\n# Print the final queue after t minutes\r\nprint(\"\".join(queue))\r\n", "n, t = map(int, input().split())\r\na = list(input())\r\nwhile t > 0:\r\n i = 0\r\n while i < n-1:\r\n if a[i] == \"B\" and a[i + 1] == 'G':\r\n a[i], a[i+1] = a[i+1], a[i]\r\n i += 1\r\n i += 1\r\n t -= 1\r\nprint(''.join(a))\r\n", "def queue(q):\r\n q1=''\r\n i=0\r\n while i<n-2:\r\n if q[i:i+2]=='BG':\r\n q1=q1+'GB'\r\n i+=2\r\n else:\r\n q1=q1+q[i]\r\n i+=1\r\n if i ==n-2:\r\n if q[-2:]=='BG':\r\n return(q1+'GB')\r\n else:\r\n return(q1+q[-2:])\r\n else:\r\n return(q1+q[-1])\r\n\r\n\r\n\r\nn,t=map(int,input().split())\r\nq0=input()\r\nfor i in range(t):\r\n q0=queue(q0)\r\nprint(q0)", "# from timm.models import create_model\r\n# import math\r\n# import torch\r\n# import torch.nn as nn\r\n# import numpy as np\r\n# import matplotlib.pyplot as plt\r\n# from functools import partial\r\n# import os\r\n\r\nn,m = map(int,input().split())\r\ns = list(input())\r\nfor _ in range(m):\r\n i = 0\r\n while i < n-1:\r\n if s[i] == 'B' and s[i+1] == 'G':\r\n s[i]='G'\r\n s[i+1]='B'\r\n i+=2\r\n else:\r\n i+=1\r\nprint(''.join(s))\r\n", "n, t = map(int, input().split())\r\ns = input()\r\na = list(s)\r\nn = len(a)\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if a[i] == 'B' and a[i + 1] == 'G':\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n i += 2 \r\n else:\r\n i += 1 \r\nres= ''.join(a)\r\nprint(res)", "n, t = (int(x) for x in input().split())\r\ns = input()\r\nnew_s = s\r\nfor _ in range(t):\r\n for i in range(n-1):\r\n if s[i] == 'B' and s[i+1] == 'G':\r\n new_s = new_s[:i] + 'GB' + new_s[i+2:]\r\n s = new_s\r\nprint(s)\r\n", "t = int(input()[2:])\r\ns = input()\r\nfor _ in range(t):\r\n s = s.replace(\"BG\", \"GB\")\r\nprint(s)\r\n", "n,t=map(int, input().split())\r\ns=list(input())\r\ns1=s.copy()\r\nfor i in range(t):\r\n j=1\r\n while j>=0 and j<n:\r\n if s[j]==\"G\":\r\n s1[j],s1[j-1]=s1[j-1],s1[j]\r\n j+=1\r\n j+=1\r\n s=s1.copy()\r\ns=''.join(s1)\r\nprint(s)", "nt=input().split()\r\nn=int(nt[0])\r\nt=int(nt[1])\r\nq=input()\r\nfor j in range(t):\r\n i=0\r\n while i<n-1:\r\n if q[i]==\"B\" and q[i+1]==\"G\":\r\n q=q[:i]+\"G\"+\"B\"+q[i+2:]\r\n i+=2\r\n else:\r\n i+=1\r\nprint(q)", "n,t = map(int,input().split())\r\ns = input()\r\ns = list(s)\r\nfor j in range(t):\r\n l = 0\r\n r = 1\r\n while r < len(s):\r\n if s[l] == \"B\" and s[r] == \"G\":\r\n s[l] = \"G\"\r\n s[r] = \"B\"\r\n l += 2\r\n r += 2\r\n else:\r\n l += 1\r\n r += 1\r\nprint(\"\".join(s))", "import sys\r\n\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nn = numbers[0]\r\nt = numbers[1]\r\n\r\ns = list(sys.stdin.readline())[:-1]\r\n\r\nj = 1\r\n\r\nwhile j <= t:\r\n i = 0\r\n while i < len(s) - 1:\r\n if s[i] == 'B' and s[i+1] == 'G':\r\n s[i] = 'G'\r\n s[i+1] = 'B'\r\n i += 1\r\n i += 1\r\n j += 1\r\n \r\nprint(''.join(s))\r\n", "n,t = map(int,input().split())\r\nline = [*input()]\r\ntime = 0\r\nwhile time < t:\r\n i = 0\r\n while i < n- 1:\r\n if line[i] == \"B\" and line[i+1] == \"G\":\r\n line[i],line[i+1] = line[i+1],line[i]\r\n i += 1\r\n i += 1\r\n time += 1\r\nprint(\"\".join(line))\r\n", "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\nn,k=map(int,input().split())\r\nss=list(input())\r\n\r\nnofgirls=ss.count('G')\r\n\r\nif nofgirls==0:pass\r\nelse:\r\n for i in range(k):\r\n j=n-2\r\n while j>-1:\r\n i=j+1\r\n if ss[j]=='B':\r\n ss[i],ss[j]=ss[j],ss[i];j-=2\r\n else:j-=1 \r\n \r\nprint(''.join(ss)) \r\n ", "x, y = map(int, input().split())\r\narr = str(input())\r\nfor i in range(y):\r\n arr = arr.replace(\"BG\", \"GB\")\r\nprint(arr)", "# Решение задач проекта CODEFORSES, Задача 266B\r\n#\r\n# (C) 2021 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nB. Очередь в школе\r\nограничение по времени на тест2 секунды\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nНа перемене в школьной столовой образовалась очередь из n человек, в которой стоят мальчики и девочки. Изначально ребята\r\nвстали в таком порядке, в котором они забежали в столовую. Однако через некоторое время мальчикам стало неловко, \r\nчто они стоят в очереди перед девочками, и они стали каждую секунду пропускать девочек вперед.\r\n\r\nОпишем процесс более точно. Пусть позиции в очереди последовательно пронумерованы целыми числами от 1 до n, причем тот,\r\nкто стоит на позиции номер 1 обслуживается первым. Тогда, если в момент времени x на i-ой позиции стоит мальчик, \r\nа на (i + 1)-ой — девочка, то в момент времени x + 1 на i-ой позиции будет находиться девочка, а на (i + 1)-ой — мальчик.\r\nМоменты времени заданы в секундах.\r\n\r\nВам задано расположение ребят в начальный момент времени, определите, как будет выглядеть очередь через t секунд.\r\n\r\nВходные данные\r\nВ первой строке заданы два целых числа n и t (1 ≤ n, t ≤ 50), обозначающие количество ребят в очереди и время, спустя\r\nкоторое требуется определить, как будет выглядеть очередь.\r\n\r\nВ следующей строке задана строка s, обозначающая начальную расстановку школьников. Если на i-ой позиции в очереди стоит\r\nмальчик, то i-ый символ строки s равен «B», иначе i-ый символ равен «G».\r\n\r\nВыходные данные\r\nВыведите строку a, обозначающую расположение ребят в очереди спустя t секунд. Если на i-ой позиции через заданное\r\nвремя будет стоять мальчик, то i-ый символ a должен быть равен «B», иначе он должен быть равен «G».\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=[int(i) for i in input().split()]\r\na2=input()\r\na3=[]\r\nw=0\r\n\r\nfor q in range(a1[1]):\r\n a3=[]\r\n# print(a2,' = ',a3,' = ',q)\r\n# двигаем окно размером в 2 клетки\r\n while w < (a1[0]-1):\r\n# print(a2[w],a2[w+1],' ',w)\r\n if a2[w] == 'B' and a2[w+1]=='G':\r\n a3.append(str(a2[w+1]))\r\n a3.append(str(a2[w]))\r\n w=w+2\r\n else:\r\n a3.append(str(a2[w]))\r\n w=w+1\r\n if len(a2) != len(a3):a3.append(str(a2[-1]))\r\n# print(a2,' = ',a3,' = ',q)\r\n w = 0\r\n a2 = a3\r\n# print(a2,' = ',a3,' = ',q)\r\n# print(q+1,end = '---')\r\n# for e in a2:\r\n# print(e,end = '')\r\n# print()\r\nfor e in a2:\r\n print(e,end = '')\r\n#print(ANS,' TIME:',datetime.now() - start_time) ", "n,t=map(int,input().split())\r\ns=input()\r\nlst=[]\r\nfor j in range(n):\r\n lst.append(s[j])\r\nwhile t>0:\r\n situation=[]\r\n for i in range(n-1):\r\n if lst[i]=='B'and lst[i+1]=='G':\r\n situation.append(i)\r\n for k in situation:\r\n lst[k],lst[k+1]='G','B' \r\n t-=1\r\nprint(''.join(lst)) ", "t = int(input()[2:])\r\ns = input()\r\nwhile t:\r\n s = s.replace('BG', 'GB')\r\n t -= 1\r\nprint(s)\r\n", "t=int(input()[2:])\r\ns=input()\r\nwhile t:\r\n s=s.replace('BG','GB')\r\n t-=1\r\nprint(s)", "n, t = map(int, input().split())\r\nque = input()\r\nfor i in range(t):\r\n for j in range(n - 1):\r\n if (que[j] == 'B') * (que[j + 1] == 'G'):\r\n que = que[:j] + 'gb' + que[j+2:]\r\n # print(que)\r\n que = que.upper()\r\nprint(que)\r\n", "n,m = map(int, input().split())\r\ns = input()\r\nn1 = n\r\nstack = []\r\n\r\nfor i in range(m):\r\n s1 = ''\r\n for j in range(n):\r\n try:\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n stack.append([j, j+1])\r\n except:\r\n pass\r\n for j in stack:\r\n s = s[:j[0]] + s[j[0] + 1:j[1] + 1] + s[j[0]:j[1]] + s[j[1] + 1:]\r\n stack = []\r\nprint(s)", "a,b=map(int,input().split())\r\ns=input()\r\nfor i in range(b):\r\n\ts=s.replace('BG','GB')\r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 16 23:37:55 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nnt = input().split()\r\nn = int(nt[0])\r\nt = int(nt[1])\r\nline = list(input())\r\nwhile t > 0 :\r\n t -= 1\r\n i = n-1\r\n while i > 0 :\r\n if (line[i] == 'G')&(line[i-1] == 'B') :\r\n line[i] = 'B'\r\n line[i-1] = 'G'\r\n i-=2\r\n else:\r\n i -=1\r\nprint(''.join(line))", "n, t = [int(i) for i in input().split()]\r\ns = input()\r\na = list(s)\r\nfor i in range(t):\r\n for j in range(n-1):\r\n if s[j] == \"B\" and s[j+1] == \"G\":\r\n a[j] = \"G\"\r\n a[j+1] = \"B\"\r\n j += 1\r\n s = \"\".join(a)\r\nprint(s)\r\n", "def change(l):\r\n l1 = []\r\n i = 0\r\n while i+1 <= len(l):\r\n if l[i] == ' ':\r\n l.pop(i)\r\n elif l[i]== 'B':\r\n if l[i] == 'B' and l[i+1] == 'G':\r\n l1.extend(['G','B'])\r\n l.pop(i)\r\n l.pop(i)\r\n else:\r\n l1+='B'\r\n l.pop(i)\r\n else:\r\n l1+='G'\r\n l.pop(i)\r\n\r\n return l1\r\n\r\n\r\nn,t = map(int,(input().split()))\r\ns = list(input())\r\ns1 = ''\r\nfor j in range(t):\r\n s.append(' ')\r\n s = change(s)\r\nfor i in range(len(s)):\r\n s1+=s[i]\r\n\r\nprint(s1)", "n,t=map(int,input().split())\na=list(input())\nfor _ in range(t):\n i=0\n while i<n-1:\n if a[i]=='B' and a[i+1]=='G':\n a[i],a[i+1]=a[i+1],a[i]\n i+=2\n else:\n i+=1\nprint(\"\".join(a))", "n,t=[int(x) for x in input().split()]\r\ns=input()\r\nfor i in range(t):\r\n l=list(s)\r\n for j in range(n-1):\r\n if s[j]=='B' and s[j+1]=='G':\r\n l[j]='G'\r\n l[j+1]='B'\r\n j+=1\r\n s=''.join(l)\r\nprint(s)", "n,t = map(int, input().split())\r\nqueue = str(input())\r\nfor tick in range(t):\r\n i = 0\r\n while i < (n-1):\r\n if queue[i] == 'B' and queue[i+1] == 'G':\r\n queue = queue[:i] + queue[i+1] + queue[i] + queue[(i+2):]\r\n i += 1\r\n i += 1\r\nprint(queue)", "n, t = map(int, input().split())\nchildren = list(input())\n\nwhile (t>0):\n\ti=0\n\twhile i<(n-1):\n\t\tif (children[i]=='B' and children[i+1]=='G'):\n\t\t\tchildren[i],children[i+1]=children[i+1],children[i]\n\t\t\ti+=1\n\t\ti+=1\n\tt-=1\n\nprint(''.join(children))\n", "a, b = map(int, input().split())\r\ns = input()\r\nfor i in range(b):\r\n s = s.replace('BG', 'GB')\r\nprint(s)\r\n", "k = input().split()\r\nq = input()\r\nfor i in range(int(k[1])):\r\n if 'BG' in q:\r\n q=q.replace('BG','GB')\r\nprint(q)", "n,t=list(map(int,input().split(\" \")))\r\ns=input()\r\ns=list(s)\r\nif len(s)==1:\r\n print(\"\".join(s))\r\nelse:\r\n while t!=0:\r\n i=0\r\n j=1\r\n while i<len(s) and j<len(s):\r\n if i<len(s) and j<len(s) and s[i]==\"B\" and s[j]==\"G\":\r\n s[i],s[j]=s[j],s[i]\r\n i=i+2\r\n j=i+1\r\n elif i<len(s) and j<len(s) and s[i]==\"G\" and s[j]==\"B\":\r\n i=i+1\r\n j=j+1\r\n elif i<len(s) and j<len(s) and s[i]==\"G\" and s[j]==\"G\":\r\n i=i+1\r\n j=j+1\r\n elif i<len(s) and j<len(s) and s[i]==\"B\" and s[j]==\"B\":\r\n i=i+1\r\n j=j+1\r\n t=t-1\r\n print(\"\".join(s))", "n, t = map(int, input().split())\r\ns = input()\r\n\r\nx = list(s)\r\n\r\nfor i in range(t):\r\n i = 0 \r\n \r\n while i < n -1 :\r\n \r\n if x[i] == 'B' and x[i+1] == 'G':\r\n \r\n x[i] , x[i+1] = x[i+1] , x[i]\r\n i+=2\r\n \r\n else:\r\n i+=1\r\nout= \"\".join(x)\r\nprint(out)\r\n\r\n\r\n", "n,t=map(int,input().split())\r\nqueue=input()\r\nfor _ in range(t):\r\n ql=list(queue)\r\n for i in range(len(queue)-1):\r\n if queue[i]=='B' and queue[i+1]=='G':\r\n ql[i],ql[i+1]=ql[i+1],ql[i]\r\n queue=''\r\n for i in ql:\r\n queue+=i\r\nprint(queue)\r\n \r\n \r\n", "a,w = map(int,input().split())\r\nb = input()\r\nc = [i for i in b]\r\nfor _ in range(w):\r\n q = 0\r\n while(q<(a-1)):\r\n if(c[q]=='B' and c[q+1]=='G'):\r\n c[q]='G'\r\n c[q+1] = 'B'\r\n q+=2\r\n else: q+=1\r\nprint(*c,sep=\"\")", "# dumb brute force\r\nn, t = map(int, input().split())\r\ns = input()\r\n# for _ in range(t):\r\n# j = 0\r\n# while j < n - 1:\r\n# if s[j] == 'B' and s[j + 1] == 'G':\r\n# t = list(s)\r\n# t[j], t[j + 1] = 'G', 'B'\r\n# j += 2\r\n# s = ''.join(t)\r\n# else: j += 1\r\n# print(s)\r\n\r\n# smarter brute force\r\nfor _ in range(t):\r\n s = s.replace('BG', 'GB')\r\nprint(s)", "l_q , t = input().split(\" \")\r\nq = input()\r\nd = list(q)\r\nj = 0\r\ng =d.copy()\r\nw = \"\"\r\nwhile j < int(t):\r\n \r\n for i in range(len(d)):\r\n if g[i] == \"B\":\r\n \r\n \r\n d.insert(i+2,\"B\")\r\n d.pop(i)\r\n \r\n \r\n \r\n g = d.copy()\r\n \r\n j +=1\r\n \r\n\r\nfor s in g:\r\n w+=s\r\nprint(w)", "x, y = map(int, input().split())\nqueue = list(map(str, input()))\nfor j in range(y):\n i = 0\n while i< (x-1):\n if queue[i] == \"B\" and queue[i+1] == \"G\":\n queue[i], queue[i+1] = queue[i+1], queue[i]\n i+=2\n else:\n i+=1\n \nprint(''.join(queue))\n", "n,t=map(int,input().split())\r\nch=list(input(\"\"))\r\nfor i in range(t):\r\n j,k=0,1\r\n while j<n and k<n:\r\n if(ch[j]==\"B\" and ch[k]==\"G\"):\r\n ch[k]=\"B\"\r\n ch[j]=\"G\"\r\n j+=2\r\n k+=2\r\n else:\r\n j+=1\r\n k+=1\r\n \r\ns=\"\"\r\nfor char in ch:\r\n if char != \" \":\r\n s += char\r\nprint(s) \r\n", "n, t = input().split(\" \")\r\nq = list(input())\r\nfor s in range(int(t)):\r\n swapped = False\r\n for i,g in enumerate(q):\r\n if i == 0 or swapped:\r\n swapped = False\r\n continue\r\n if g == 'G' and q[i-1] == 'B':\r\n swapped = True\r\n q[i] = 'B'\r\n q[i-1] = 'G'\r\nprint(\"\".join(q))", "# During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second.\n\n# Let's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i + 1)-th position, then at time x + 1 the i-th position will have a girl and the (i + 1)-th position will have a boy. The time is given in seconds.\n\n# You've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds.\n# Input\n\n# The first line contains two integers n and t (1 ≤ n, t ≤ 50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.\n\n# The next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals \"B\", otherwise the i-th character equals \"G\".\n# Output\n\n# Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal \"B\", otherwise it must equal \"G\"\n\nnumber_of_childer, time = list(map(int, input().split()))\n\nseq = list(input())\n\nfor i in range(time):\n pos = 0\n while True:\n if pos >= len(seq)-1:\n break\n if seq[pos] == 'B' and seq[pos+1] == 'G':\n seq[pos], seq[pos+1] = seq[pos+1], seq[pos]\n pos += 2\n else:\n pos += 1\n\nprint(''.join(seq))\n", "n,t = map(int,input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(t):\r\n j = 0\r\n while j <= n - 2 :\r\n if s[j] == \"B\" and s[j + 1] == \"G\":\r\n s[j],s[j + 1] = s[j + 1],s[j]\r\n j = j + 1\r\n j += 1\r\nfor i in range(len(s)):\r\n print(s[i],end=\"\")", "x,y = map(int , input().split())\r\na = input()\r\nb = 0\r\nc = 0\r\nd = []\r\np = a\r\nfor _ in range(y):\r\n\ta = a.replace('BG','GB')\r\n\r\nprint(a)", "n,t=map(int,input().split())\r\nnum=input()\r\nwhile t:\r\n num=num.replace(\"BG\",\"GB\")\r\n t-=1\r\nprint(num)\r\n", "n, t = map(int, input().split())\r\nkiu = list(input())\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if kiu[i] == 'B' and kiu[i + 1] == 'G':\r\n kiu[i], kiu[i + 1] = kiu[i + 1], kiu[i]\r\n i += 2\r\n else:\r\n i += 1\r\nvlt = ''.join(kiu)\r\nprint(vlt)", "entrada = input()\ncadena = list(input())\nn, t = entrada.split(\" \")\nn = int(n)\nt = int(t)\ncont = 0\nwhile t > 0:\n while cont+1 < len(cadena):\n if cadena[cont] == \"B\" and cadena[cont+1] == \"G\":\n cadena[cont] = \"G\"\n cadena[cont+1] = \"B\"\n cont += 1\n cont += 1\n cont = 0 \n t -= 1\nrta = \"\".join(cadena)\nprint(rta)\n\n", "num, tum = map(int, input().split())\r\ns = input()\r\ns_list = list(s)\r\nwhile tum > 0:\r\n i = 1\r\n while i < num:\r\n if s_list[i] == 'G' and s_list[i - 1] == 'B':\r\n s_list[i] = 'B'\r\n s_list[i - 1] = 'G'\r\n i += 1\r\n i += 1\r\n tum -= 1\r\nresult = ''.join(s_list)\r\nprint(result)", "n,t = map(int,input().split())\r\n\r\ns = input()\r\n\r\nst = list(s) \r\n\r\nwhile(t > 0):\r\n for i in range(n-1):\r\n if s[i] == \"B\" and s[i + 1] == \"G\":\r\n st[i] = \"G\"\r\n st[i+1] = \"B\"\r\n t -= 1\r\n s = \"\".join(st)\r\n\r\nprint(s)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 12:19:19 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\n\r\n\r\n\r\n \r\n \r\ndatas=input().split()\r\nt=int(datas[1])\r\ns=input()\r\nss=[]\r\n\r\nfor i in s:\r\n ss.append(i) #字符串不能直接通过索引进行替换单词\r\n \r\n \r\n\r\nfor i in range(t):\r\n for m in range(0,len(ss)-1,1):\r\n if ss[m]=='B' and ss[m+1]=='G': #使用str.replace(old,new,max)替换字符串中的字符,但只能进行单词间的替换\r\n ss[m]='G'\r\n ss[m+1]='B1'\r\n for z in range(len(ss)):\r\n if ss[z]=='B1':\r\n ss[z]='B'\r\n \r\ns=''\r\nfor i in ss:\r\n s+=i\r\n \r\n \r\nprint(s)", "n,t=map(int,input().split())\r\ns=list(input(\"\"))\r\ni=0\r\nwhile i != t :\r\n e=0\r\n while e < n-1 :\r\n if s[e] == \"B\" and s[e+1] == \"G\" :\r\n s[e],s[e+1]=s[e+1],s[e]\r\n e+=2\r\n else:\r\n e+=1\r\n i+=1\r\nprint(\"\".join(s))\r\n", "n, t = map(int, input().split())\r\ns = input()\r\nfor _ in range(t):\r\n if 'BG' in s:\r\n s = s.replace('BG', 'GB')\r\nprint(s)", "from collections import deque\r\nlength,rot = map(int,input().split())\r\nstring = input()\r\narr = []\r\nfor i in string:\r\n arr.append(i)\r\nif length==1:\r\n print(string)\r\nelse:\r\n for i in range(rot):\r\n j = 0\r\n while j+1<length:\r\n if arr[j]==\"B\" and arr[j+1]==\"G\":\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n j += 1\r\n j += 1\r\n print(\"\".join(arr))", "# URL: https://codeforces.com/problemset/problem/266/B\nn, t = map(int, input().split())\nline = list(input())\nfor _ in range(t):\n pos = 0\n while pos < n:\n if pos + 1 < n and line[pos] == 'B' and line[pos + 1] == 'G':\n line[pos], line[pos + 1] = 'G', 'B'\n pos += 2\n else:\n pos += 1\n\nprint(''.join(line))\n", "n,t=map(int,input ().split())\r\nk=list(input().strip())\r\nfor i in range(1,t+1,1):\r\n j=0\r\n while(j<n-1):\r\n if(k[j]=='B' and k[j+1]=='G'):\r\n k[j],k[j+1]=k[j+1],k[j]\r\n j=j+2\r\n else:j=j+1\r\n \r\na=\"\".join(k)\r\nprint(a)", "nt = input()\r\nl = nt.split(' ')\r\nl = [int(s) for s in l]\r\nn = l[0]\r\nt = l[1]\r\ns = input()\r\nfor i in range(0,t):\r\n lst = s.split('BG')\r\n s = 'GB'.join(lst)\r\nprint(s)", "def main():\r\n n, t = map(int, input().split(\" \"))\r\n s = input()\r\n\r\n for _ in range(t):\r\n i = 0\r\n res = \"\"\r\n while i < n:\r\n if i < n - 1 and s[i] == \"B\" and s[i + 1] == \"G\":\r\n res += \"GB\"\r\n i += 2\r\n else:\r\n res += s[i]\r\n i += 1\r\n s = res\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l,n=map(int, input().split())\r\na=input()\r\nc=\"\"\r\n\r\nfor i in range(0,n):\r\n c=\"\"\r\n j=0\r\n while j<l:\r\n if ( j!=l-1 and a[j]==\"B\" and a[j+1]==\"G\" ):\r\n c=c+\"G\"+\"B\"\r\n j=j+2\r\n \r\n else:\r\n c=c+a[j]\r\n j=j+1\r\n \r\n a=c\r\n \r\nprint(c)", "n, t = map(int, input().split())\na = input()\na = list(a)\nfor _ in range(t):\n i = 0\n while i < n-1:\n if a[i] == 'B' and a[i+1] == 'G':\n temp = a[i]\n a[i] = a[i+1]\n a[i+1] = temp\n i += 2\n else:\n i += 1\na = ''.join(a)\nprint(a)", "people_num,waiting_time=[int(x) for x in input().split()]\r\nlist_children=list(input())\r\nfor i in range(waiting_time):\r\n list_test = list_children[:]\r\n for j in range(len(list_children)-1):\r\n if list_test[j] == \"B\" and list_test[j+1] == \"G\":\r\n list_children[j] , list_children[j+1] = list_children[j+1] , list_children[j]\r\nprint(\"\".join(list_children))", "n,t = map(int,input().split())\r\ns = list(input())\r\nfor _ in range(t):\r\n i=0\r\n while(i<n-1):\r\n if s[i]=='B' and s[i+1]=='G':\r\n s[i],s[i+1] = s[i+1],s[i]\r\n i+=2\r\n else:\r\n i+=1\r\nres = \"\".join(s)\r\nprint(res)", "t = int(input().split()[1])\r\narr = [i for i in input()]\r\nfor j in range(t):\r\n i = 1\r\n while(i < len(arr)):\r\n if arr[i-1] == 'B' and arr[i] == 'G':\r\n arr[i-1] = 'G'\r\n arr[i] = 'B'\r\n i += 2\r\n else:\r\n i += 1\r\nprint(''.join(arr))", "a,b=map(int,input().split())\r\nc=input()\r\nwhile b>0:\r\n c=c.replace(\"BG\",\"GB\")\r\n b-=1\r\nprint(c)", "seconds = int(input().split()[1])\r\nline = input()\r\nfor s in range(seconds):\r\n line = line.replace('BG', 'GB')\r\nprint(line)", "def replace(string1):\r\n return string1.replace(\"BG\",\"GB\")\r\n\r\nnum = int(input().split()[1])\r\norg = input()\r\ncount = 0\r\nwhile count < num:\r\n org = replace(org)\r\n count += 1\r\n\r\nprint(org)", "n,t = map(int, input().split())\r\ns = input()\r\nfor x in range(t):\r\n s = s.replace('BG', 'GB')\r\nprint(s)\r\n \r\n", "n,t=map(int,input().split())\r\ns=list(input())\r\nfor i in range(t):\r\n j=0\r\n while j<n-1:\r\n if s[j]=='B' and s[j+1]=='G':\r\n s[j],s[j+1]=s[j+1],s[j]\r\n j+=1\r\n j+=1\r\nprint(''.join(s))\r\n", "n,t=map(int,input().split())\r\na=list(input())\r\nfor i in range(t):\r\n j=0\r\n while j<n-1:\r\n if a[j]=='B':\r\n if a[j+1]=='G':\r\n a[j]='G'\r\n a[j+1]='B'\r\n j=j+2\r\n continue\r\n j+=1\r\nprint (\"\".join(a))", "m,n=input().split()\nz=list(input())\nfor _ in range(int(n)):\n i=0\n while i<int(m)-1:\n if z[i]=='B' and z[i+1]=='G':\n z[i],z[i+1]='G','B'\n i+=2\n else:\n i+=1\nfor x in z:\n print(x,end='')\n \n ", "\ndef transform_queue(initial_queue: list, t: int) -> str:\n for time in range(t):\n index = 1\n while index < len(initial_queue):\n if initial_queue[index] == 'G' and initial_queue[index - 1] == 'B':\n initial_queue[index], initial_queue[index - 1] = initial_queue[index - 1], initial_queue[index]\n index += 1\n index += 1\n return \"\".join(initial_queue)\n\ndef main():\n n, t = map(int, input().strip().split())\n initial_queue = input().strip()\n print(transform_queue(list(initial_queue), t))\n\nif __name__ == \"__main__\":\n main()\n", "n, t = map(int, input().split(' '))\r\nqueue = list(input())\r\n\r\nfor i in range(t):\r\n j = 1\r\n while j < n:\r\n if queue[-j] == 'G' and queue[-j-1] == 'B':\r\n queue[-j], queue[-j-1] = queue[-j-1], queue[-j]\r\n j += 2\r\n else:\r\n j += 1\r\n\r\nprint(''.join(queue))", "def swap(l1,i1,i2):\r\n t=l1[i1],l1[i2]\r\n l1[i2],l1[i1]=t\r\n return l1\r\nn,t=map(int,input().split())\r\nl1=list(map(str,input()))\r\nfor j in range(t):\r\n sk=-1\r\n for j1 in range(n-1):\r\n if j1==sk:\r\n continue\r\n elif ord(l1[j1])<ord(l1[j1+1]):\r\n swap(l1,j1,j1+1)\r\n sk=j1+1\r\nprint(*l1,sep=\"\") ", "import sys\r\n\r\n\r\ndef iinp():\r\n return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef linp():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef lsinp():\r\n return sys.stdin.readline().strip().split()\r\n\r\n\r\ndef digit():\r\n return [int(i) for i in (list(sys.stdin.readline().strip()))]\r\n\r\n\r\ndef char():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\nfrom math import factorial\r\n\r\n\r\ndef solve():\r\n n, t = linp()\r\n word = char()\r\n\r\n for a in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if word[i] == \"B\" and word[i + 1] == \"G\":\r\n word[i + 1], word[i] = word[i], word[i + 1]\r\n i += 1\r\n i += 1\r\n print(\"\".join(word))\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "result = \"\"\r\nn,t = input().split(\" \")\r\nn = int(n)\r\nt = int(t)\r\ns = input()\r\ncheck = False\r\nletters = []\r\nfor letter in s:\r\n letters.append(letter)\r\nfor x in range(t):\r\n for i in range(n-1):\r\n if s[i] == \"B\" and s[i+1] == \"G\":\r\n letters[i] = \"G\"\r\n letters[i+1] = \"B\"\r\n s = \"\"\r\n for x in letters:\r\n s += x\r\nresult = s\r\nprint(f\"{result}\")", "n, t = map(int, input().split())\r\nr = input()\r\nr=list(r)\r\nfor i in range(t):\r\n j=0\r\n while j <=n-1:\r\n if j<n-1:\r\n if r[j] == \"B\" and r[j+1] == \"G\":\r\n r[j], r[j+1] = r[j+1], r[j]\r\n j+=1\r\n j+=1\r\nprint(\"\".join(r))\r\n", "l, time = map(int, input().split())\r\ns = input()\r\n\r\nfor i in range(time):\r\n s = s.replace('BG', 'GB')\r\n\r\nprint(s)\r\n\r\n\r\n\r\n \r\n", "n,t=map(int,input().split())\ns=input()\nfor i in range(t):\n s=s.replace('BG','GB')\nprint(s)", "t=int(input()[2:])#空的前两位不要\ns=input()\nwhile t:\n s=s.replace('BG','GB')\n t-=1\nprint(s)", "ip = [int(x) for x in input().split(\" \")]\nt = ip[1]\nn = ip[0]\nfin = list(input())\nfina = fin[:]\nfor x in range(t):\n fin = fina[:]\n for a in range(len(fin)):\n try:\n if(fin[a] == \"B\"):\n if(fin[a+1] == \"G\"):\n fina[a] = \"G\"\n fina[a+1] = \"B\"\n except:\n pass\n\nprint(\"\".join(fina))\n\n\n", "def swap(queue, i, j):\r\n temp = queue[i]\r\n queue[i] = queue[j]\r\n queue[j] = temp\r\n\r\nn, t = [int(i) for i in input().split(\" \")]\r\n\r\nqueue = list(input())\r\n\r\nx = 0\r\nnum_swaps = 1\r\n\r\nwhile x < t and num_swaps > 0:\r\n num_swaps = 0\r\n i = 0\r\n while i < n-1:\r\n if queue[i] == \"B\" and queue[i+1] == \"G\":\r\n swap(queue, i, i+1)\r\n num_swaps += 1\r\n i += 1\r\n i += 1\r\n x += 1\r\n\r\nprint(\"\".join(queue))", "n, t = map(int,input().split())\r\na = [el for el in input()]\r\nfor i in range(t):\r\n j = 0\r\n while j < n - 1:\r\n if a[j] == 'B' and a[j+1] == 'G':\r\n a[j], a[j+1] = a[j+1], a[j]\r\n j += 2\r\n else:\r\n j += 1\r\nprint(*a, sep='')\r\n", "s0=input().split()\r\nn,t=int(s0[0]),int(s0[1])\r\ns=input()\r\nfor i in range(t):\r\n q=[]\r\n for j in range(n):\r\n if (j+1)<=(n-1) and s[j] in \"B\" and s[j+1] in \"G\":\r\n q.append(\"G\")\r\n elif (j-1)>=0 and s[j] in \"G\" and s[j-1] in \"B\":\r\n q.append(\"B\")\r\n else:\r\n q.append(s[j])\r\n s=\"\".join(q)\r\nprint(s)", "n,t = map(int,input().split(\" \"))\r\ns = list(input())\r\np = [-1]\r\nfor i in range(0,t):\r\n for j in range(n-1):\r\n if s[j] == \"B\" and s[j+1] == \"G\" and j != p[-1]:\r\n s[j+1] = \"B\"\r\n s[j] = \"G\"\r\n p.append(j+1)\r\n \r\n p = [-1]\r\n\r\nprint(''.join(s))", "n , t = map(int , input().split())\r\nstring = input()\r\ns = list(string)\r\n\r\nfor i in range(t) :\r\n j = 1\r\n while j < n :\r\n if s[j-1] == \"B\" and s[j] == \"G\" :\r\n s[j-1] = \"G\"\r\n s[j] = \"B\"\r\n j += 2\r\n else :\r\n j += 1\r\n \r\nchange_string = \"\".join(s)\r\nprint(change_string)", "'''\nAttempt at implementing problem 266B at codeforces\n\nDuring the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second.\n\nLet's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i + 1)-th position, then at time x + 1 the i-th position will have a girl and the (i + 1)-th position will have a boy. The time is given in seconds.\n\nYou've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds.\n\nInput\nThe first line contains two integers n and t (1 ≤ n, t ≤ 50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find.\n\nThe next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals \"B\", otherwise the i-th character equals \"G\".\n\nOutput\nPrint string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal \"B\", otherwise it must equal \"G\".\n\n\n'''\n\n\ndef swap(some_list: list, index_one, index_two) -> list:\n temp = some_list[index_one]\n some_list[index_one] = some_list[index_two]\n some_list[index_two] = temp\n return some_list\n\ndef get_input() -> list:\n user_inputs = []\n processed_inputs = []\n for i in range(2):\n user_input = input()\n user_inputs.append(user_input)\n split_nums = user_inputs[0].split(\" \")\n #Add the split string to a new list\n for elem in split_nums:\n processed_inputs.append(int(elem))\n processed_inputs.append(user_inputs[1])\n return processed_inputs\n\ndef main() -> None:\n user_inputs = get_input()\n length = user_inputs[0]\n time = user_inputs[1]\n queue_str = user_inputs[-1]\n #queue as a list\n queue = [char for char in queue_str]\n\n for i in range(time):\n swap_indicies = [] #This will store tuples, of the indicies that need to be swapped. It is cleared every run.\n for index in range(length):\n #if the person is a boy AND they aren't at the end of the line AND they are in front of a girl\n if queue[index] == \"B\" and index < length-1 and queue[index+1] == \"G\":\n swap_indicies.append((index,index+1)) #Add the two indicies as a tuple to the list.\n for indicies in swap_indicies:\n queue = swap(queue, indicies[0], indicies[1])\n result_queue = ''.join(queue) \n\n print(result_queue)\n\nmain()", "n, t = map(int, input().split())\nq = list(input())\n\nfor _ in range(t):\n i = 0 \n while i < len(q) - 1:\n if q[i] == 'B' and q[i + 1] == 'G':\n q[i], q[i + 1] = q[i + 1], q[i]\n i += 2\n else:\n i += 1\n\nprint(''.join(q))\n", "n,m=map(int,input().split())\r\nx=input()\r\nwhile m:\r\n\tx=x.replace(\"BG\",\"GB\")\r\n\tm-=1\r\nprint (x)\r\n ", "t=int(input()[2:]);s=input()\r\nwhile t:s=s.replace('BG','GB');t-=1\r\nprint(s)", "n = input().split()\nn1 = [int(a) for a in n]\ns = input()\ns1 = [a for a in s]\n\nfor i in range(n1[1]):\n\ts2 = s1[:]\n\tfor j in range(n1[0] - 1):\n\t\tif s1[j] == \"B\" and s1[j + 1] == \"G\":\n\t\t\ts2[j] = \"G\"\n\t\t\ts2[j + 1] = \"B\"\n\ts1 = s2\n\nprint(\"\".join(s1))\n\n", "n, t = map(int, input().split())\r\ns = input()\r\n\r\ni = 0\r\nwhile (i < t):\r\n s = s.replace('BG', 'GB')\r\n i += 1\r\nprint(s)", "n,t = [int(x) for x in input().split()][:2]\r\ns = input()\r\ns = list(s)\r\nfor x in range(t) :\r\n i = 1\r\n while i<n :\r\n if s[i-1] == 'B' and s[i] =='G':\r\n s[i-1],s[i]=s[i],s[i-1]\r\n i+=2\r\n else :\r\n i+=1\r\n\r\nprint(\"\".join(s))\r\n\r\n\r\n", "n, t = input().split(' ')\r\ns = list(input())\r\n\r\nfor z in range(int(t)):\r\n new_s = s[:]\r\n for i in range(int(n) - 1):\r\n if s[i] == 'B' and s[i + 1] == 'G':\r\n new_s[i], new_s[i + 1] = new_s[i + 1], new_s[i]\r\n \r\n s = new_s\r\n\r\nprint(''.join(s))", "n,t=map(int,input().split())\r\na=str(input())\r\nl=[]\r\nfor i in a:\r\n l.append(i)\r\ncount=0\r\nwhile(count<t):\r\n i=0\r\n while(i<len(l)-1):\r\n if(l[i]=='B' and l[i+1]=='G'):\r\n l[i],l[i+1]=l[i+1],l[i]\r\n i+=2\r\n else:\r\n i+=1\r\n count+=1\r\nfor i in l:\r\n print(i,end='')", "a,b = map(int,input().split())\r\nn = list(input())\r\nnl = []\r\nk = 0\r\nfor i in n:\r\n nl.append(i)\r\nfor i in range(b):\r\n if k>0:\r\n n = []\r\n for i in nl:\r\n n.append(i)\r\n for j in range(1,len(n)+1):\r\n if j<len(n):\r\n if n[j-1]==\"B\" and n[j] == \"G\":\r\n nl[j-1] = \"G\"\r\n nl[j] = \"B\"\r\n k+=1\r\nprint(''.join(nl))", "input1 = input()\r\ninput1 = input1.split()\r\npeopleOnLine = input1[0]\r\npeopleOnLine = int(peopleOnLine)\r\n\r\ntime = int(input1[1])\r\n\r\ninput2 = input()\r\n\r\nlistOfPeople = list(input2)\r\n\r\n\r\nt = 0\r\n\r\n# print(\"Starting List\", listOfPeople)\r\nfor i in range(time):\r\n # print(\"Seconds:\", i)\r\n t = 0\r\n for n in range(peopleOnLine):\r\n try:\r\n if listOfPeople[t] == \"B\" and listOfPeople[t+1] == \"G\":\r\n listOfPeople[t] = \"G\"\r\n listOfPeople[t+1] = \"B\"\r\n t += 1\r\n except:\r\n continue\r\n # print(t, listOfPeople)\r\n t += 1\r\n\r\n\r\n# 5 2\r\n# print(listOfPeople)\r\n\r\noutput = \"\".join(listOfPeople)\r\nprint(output)\r\n", "spots, time = input().split()\r\nspots, time = int(spots), int(time)\r\nline = [*input()]\r\nfor i in range(time):\r\n changed = False\r\n for j in range(spots-1):\r\n if changed == True:\r\n changed = False\r\n continue\r\n else:\r\n if line[j] == \"B\" and line[j+1] == \"G\":\r\n changed = True\r\n line[j], line[j+1] = 'G', 'B'\r\n else:\r\n changed = False\r\nprint(''.join(line))\r\n", "def main():\r\n line=input()\r\n line=line.split()\r\n length=int(line[0])\r\n seconds=int(line[1])\r\n boyGirl=input()\r\n new=[]\r\n for i in range(len(boyGirl)):\r\n if boyGirl[i]=='G':\r\n new.append('G')\r\n else:\r\n new.append('B')\r\n\r\n for _ in range(seconds):\r\n record=0\r\n\r\n for k in range(length-1):\r\n if record==1:\r\n record=0\r\n pass\r\n elif new[k]=='B' and new[k+1]=='G':\r\n new[k]='G'\r\n new[k+1]='B'\r\n record=1\r\n toReturn=''\r\n for i in range(length):\r\n toReturn+=new[i]\r\n print(toReturn)\r\n\r\n\r\n # for i in range(length):\r\n # for \r\nmain()", "n, t = map(int, input().split())\r\ns1 = input()\r\nfor i in range(t):\r\n l = 0\r\n s2 = s1\r\n s1 = ''\r\n while l < n:\r\n if l < n - 1 and s2[l] < s2[l+1]:\r\n s1 += s2[l+1] + s2[l]\r\n l += 2\r\n else:\r\n s1 += s2[l]\r\n l += 1\r\nprint(s1)", "w,v=map(int,input().split(' '))\r\nx=input()\r\nfor i in range(v):\r\n x=x.replace(\"BG\",\"GB\")\r\nprint(x)", "n, t = map(int, input().split())\r\ns = input()\r\n\r\n# Convert the string to a list to make it mutable\r\ns = list(s)\r\n\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if s[i] == \"B\" and s[i + 1] == \"G\":\r\n # Swap a boy and a girl\r\n s[i], s[i + 1] = s[i + 1], s[i]\r\n i += 2 # Move two positions forward\r\n else:\r\n i += 1 # Move one position forward\r\n\r\n# Convert the list back to a string\r\ns = ''.join(s)\r\nprint(s)\r\n", "n=int(input()[2:]);x=input()\r\nwhile n:x=x.replace('BG','GB');n-=1\r\nprint(x)", "a = input()\r\nb = a.split()\r\nn = int(b[0])\r\nt = int(b[1])\r\nc = input()\r\nd = [x for x in c]\r\n\r\nfor i in range(t):\r\n\ttmp = d[:]\r\n\tfor j in range(n - 1):\r\n\t\tif d[j] == 'B' and d[j + 1] == 'G':\r\n\t\t\ttmp[j] = 'G'\r\n\t\t\ttmp[j + 1] = 'B'\r\n\td = tmp\r\n\r\nprint(\"\".join(d))\r\n", "def f(z):\r\n new = \"\"\r\n for i in z:\r\n new+= i\r\n return (new)\r\n\r\nn, t = map(int,input().split())\r\ns = str(input())\r\ni = 0\r\nl = []\r\nfor k in range (n):\r\n l += s[k]\r\n b = []\r\nwhile i<t:\r\n \r\n for j in range(n-1):\r\n if l[j] == 'B' and l[j+1] == 'G':\r\n b += [j]\r\n for c in b:\r\n l[c] = 'G'\r\n l[c+1] = 'B'\r\n\r\n \r\n i+=1\r\nprint(f(l))\r\n\r\n \r\n", "n, t = map(int, input().split())\r\ns = [i for i in input()]\r\n\r\ni=0\r\nwhile(t > 0):\r\n while i < n:\r\n if i == n-1:\r\n i += 1\r\n elif s[i] == \"B\" and s[i+1] == \"G\":\r\n s[i], s[i+1] = s[i+1], s[i]\r\n i += 2\r\n else:\r\n i += 1\r\n t -= 1\r\n i = 0\r\nprint(''.join(s))", "tmp = input()\r\ntmp = tmp.split()\r\nn = int(tmp[0])\r\nt = int(tmp[1])\r\ns = list(input())\r\ntemp = s\r\nj = 0\r\n\r\nfor i in range(t):\r\n while j <= len(s) - 2:\r\n if s[j] == \"B\" and s[j + 1] == \"G\":\r\n temp[j] = \"G\"\r\n temp[j + 1] = \"B\"\r\n j += 2\r\n else:\r\n j += 1\r\n s = temp\r\n j = 0\r\nprint(\"\".join(s))", "p, t = map(int, input().split())\nq = input()\n\nfor i in range(t):\n if 'BG' in q:\n q = q.replace('BG', 'GB')\n \nprint(q)", "l=input().split()\r\nn=int(l[0])\r\nt=int(l[1])\r\nr=list(input())\r\n\r\nwhile t>0:\r\n l1=[]\r\n for x in range(n-1):\r\n if r[x]=='B' and r[x+1]=='G':\r\n l1.append(x)\r\n for y in l1:\r\n r[y]='G'\r\n r[y+1]='B'\r\n t-=1\r\nprint(''.join(r))", "list=input().split()\r\nn=int(list[0])\r\nt=int(list[1])\r\nlist=input()\r\nfor i in range(t):\r\n if \"BG\" in list:\r\n list=list.replace(\"BG\",\"GB\")\r\nprint(list)\r\n", "def change_order(word):\r\n word_list = list(word)\r\n i = 0\r\n while i < len(word) - 1:\r\n if word_list[i] == \"B\" and word_list[i + 1] == \"G\":\r\n word_list[i] = \"G\"\r\n word_list[i + 1] = \"B\"\r\n i += 2\r\n else:\r\n i += 1\r\n return \"\".join(word_list)\r\n\r\n\r\nn, t = [int(x) for x in input().split()]\r\nsequence = input()\r\ni = 0\r\n\r\nwhile i < t:\r\n sequence = change_order(sequence)\r\n i += 1\r\n\r\nprint(sequence)\r\n", "import sys\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\r\ndef MI(): return map(int, sys.stdin.readline().rstrip().split())\r\ndef SI(): return sys.stdin.readline().rstrip()\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\n\r\ndef main():\r\n n,t = MI()\r\n s = list(SI())\r\n for i in range(t):\r\n j = 0\r\n while j < n -1:\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n s[j],s[j+1] = s[j+1],s[j]\r\n j += 2\r\n else:\r\n j += 1\r\n print(\"\".join(s))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=input().split()\r\nb=input()\r\nn=int(a[1])\r\ni=1\r\nwhile i<=n:\r\n if 'BG' in b:\r\n b=b.replace('BG','GB')\r\n i+=1\r\nprint(b)", "input1 = list(map(int,input().split()))\r\nstr = list(input().upper())\r\n\r\nif all(1<=i<=50 for i in input1):\r\n x,y = input1\r\n for _ in range(y):\r\n j = 1\r\n i = 0\r\n while j<x:\r\n if str[i]=='B' and str[i+1]=='G':\r\n str[i]='G'\r\n str[i+1]='B'\r\n i+=1\r\n j+=1\r\n i+=1\r\n j+=1\r\noutput = ''\r\nfor i in str:\r\n output+=i\r\n\r\nprint(output)", "s = []\nn, t = map(int, input().split())\nstr_ = input()\nj = 1\nfor i in range(n):\n s.append(str_[i])\nwhile j <= t:\n i = 0\n while i < n - 1:\n if s[i] == 'B' and s[i + 1] == 'G':\n s[i] = 'G'\n s[i + 1] = 'B'\n i += 1\n i += 1\n j += 1\nprint(''.join(s))", "\r\nnum_of_children , time = map(int , input().split())\r\n\r\nqueue = input()\r\n\r\nresult = list(queue[:])\r\n\r\nfor _ in range(time) :\r\n queue_2 = \"\".join(result)\r\n for i in range(num_of_children - 1) :\r\n if queue_2[i] == 'B' and queue_2[i + 1] == 'G':\r\n result[i] = 'G'\r\n result[i + 1] = 'B'\r\n\r\nprint(\"\".join(result)) ", "n, time = input().strip().split()\r\nstring = list(input())\r\n\r\n\r\nfor i in range(int(time)):\r\n j = int(n) - 2\r\n while j >= 0:\r\n if string[j + 1] == \"G\" and string[j] == \"B\":\r\n string[j] = \"G\"\r\n string[j + 1] = \"B\"\r\n j -= 1\r\n j -= 1\r\n\r\nprint(\"\".join(string))\r\n\r\n", "a,b=map(int,input().split())\r\ns=list(input())\r\nfor i in range(b):\r\n i=0\r\n while i <a-1:\r\n if s[i]==\"B\" and s[i+1]==\"G\":\r\n s[i],s[i+1]=\"G\",\"B\"\r\n i+=2 \r\n else:\r\n i+=1\r\nprint(\"\".join(s))", "s = input()\r\ns = s.split(' ')\r\nn = int(s[0])\r\nt = int(s[1])\r\no = input()\r\nfor i in range(t):\r\n if \"BG\" in o:\r\n o = o.replace(\"BG\", \"GB\")\r\nprint(o)\r\n", "def swapKids(ans):\r\n boysToSwap = []\r\n for idx, letter in enumerate(ans):\r\n if(idx <= len(ans)-2):\r\n if(letter == \"B\" and ans[idx+1] == \"G\"):\r\n boysToSwap.append(idx)\r\n for boy in boysToSwap:\r\n ans[boy] = \"G\"\r\n ans[boy+1] = \"B\"\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n n, t = [int(x) for x in input().split(\" \")]\r\n queue = input()\r\n answer = list(queue)\r\n for i in range(t):\r\n # print(f\"Time is: {i+1}\")\r\n answer = swapKids(answer)\r\n # print(str(answer))\r\n print(''.join(answer))", "n,k=map(int,input().split())\r\ns=input()\r\nz=\"\"\r\nwhile k>0:\r\n z=s.replace(\"BG\",\"GB\")\r\n s=z\r\n k-=1\r\n\r\nprint(s)", "n, t = list(map(int, input().split()))\ns = input()\nfor i in range(t):\n a = []\n j = 0\n while j < len(s):\n if j < len(s)-1 and s[j] == 'B' and s[j+1] == 'G':\n a.append('G')\n a.append('B')\n j += 2\n else:\n a.append(s[j])\n j += 1\n s = ''.join(a)\nprint(s)", "n,t=map(int,input().split())\r\ns=input()\r\nl=list(s)\r\nfor i in range(t):\r\n i=0\r\n while(i<len(s)-1):\r\n if l[i] == 'B' and l[i+1] == 'G':\r\n l[i], l[i+1] = l[i+1], l[i]\r\n i=i+2\r\n else:\r\n i=i+1\r\nresult = ''.join(l) \r\nprint(result)\r\n \r\n", "def solve():\r\n n, t = map(int, input().split())\r\n str = input()\r\n for _ in range(t):\r\n i = 0\r\n while i < n-1:\r\n if str[i] == 'B' and str[i+1] == 'G':\r\n str = str[:i] + 'G' + 'B' + str[i+2:]\r\n i += 2\r\n else:\r\n i += 1\r\n print(str)\r\n \r\nsolve()\r\n ", "n,t = map(int,input().split(\" \"))\r\ns = list(input())\r\nfor i in range(t): \r\n j = 0\r\n while(j < n-1):\r\n if(s[j] == 'B' and s[j+1] == 'G'):\r\n s[j] = 'G'\r\n s[j + 1] = 'B'\r\n j = j + 2\r\n \r\n else:\r\n j = j + 1\r\n \r\nr = \"\".join(s)\r\nprint(r)", "x,y=map(int,input().split())\r\nn=input()\r\nl=list(n)\r\nm=\"\"\r\n\r\nfor _ in range(y):\r\n a=0\r\n while a<x-1:\r\n if l[a]==\"B\" and l[a+1]==\"G\":\r\n l[a],l[a+1]=l[a+1],l[a]\r\n a+=2\r\n else:\r\n a+=1\r\nm=m.join(l)\r\nprint(m)", "length, time = map(int, input().split())\nqueue = list(input())\nG_list = [0]\nlen_G = 1\nfor i in range(length):\n if queue[i] == \"G\":\n G_list.append(i + 1)\n len_G += 1\nfor _ in range(time):\n for i in range(1, len_G):\n if G_list[-i] > (G_list[-i - 1] + 1):\n G_list[-i] -= 1\noutput = \"\"\nfor i in range(1, length + 1):\n if i in G_list:\n output += \"G\"\n else:\n output += \"B\"\nprint(output)\n\n \t \t \t\t \t \t\t\t \t \t", "p,t = map(int,input().split())\r\nm = list(input())\r\nn = m\r\ns = ''\r\nfor i in range(t):\r\n for j in range(p-1):\r\n if m[j] == 'B' and m[j + 1] == 'G' :\r\n n[j] = 'X'\r\n else:\r\n n[j] = m[j]\r\n for q in range(len(n)):\r\n if n[q] == 'X' :\r\n n[q] = 'G'\r\n n[q + 1] = 'B'\r\nfor k in n:\r\n s += k\r\nprint(s)", "def solve(): \r\n n,t = map(int, input().split())\r\n s = input()\r\n for i in range(t):\r\n for j in range(n-1):\r\n if(s[j]=='B') and (s[j+1]=='G'):\r\n s= s[:j]+'gb'+s[j+2:]\r\n s = s.upper()\r\n print(s)\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, t = map(int, input().split())\r\na = input()\r\nfor _ in range(t):\r\n a = a.replace('BG', 'GB')\r\n m=-1\r\nprint(a) ", "T = int(input()[2:])\r\nv = input()\r\n\r\nwhile T:\r\n v = v.replace('BG', 'GB')\r\n T -= 1\r\n\r\nprint(v)\r\n", "n,t = map(int, input().split())\r\ns = str(input())\r\nln = len(s)\r\nif len(s) == n:\r\n q = 0\r\n while q < t:\r\n i = 0\r\n p = 1\r\n while i < ln and p < ln:\r\n if s[i] == \"B\" and s[p] == \"G\":\r\n s = s[:i] + \"G\" + s[p:]\r\n s = s[:p] + \"B\" + s[p+1:]\r\n i += 2\r\n p += 2\r\n else:\r\n i += 1\r\n p += 1\r\n q += 1\r\n print(s)\r\n", "n, t = [int(x) for x in input().split()]\norder = input()\n\nfor x in range(t):\n order = order.replace(\"BG\", \"GB\")\n\nprint(order)\n", "# https://codeforces.com/problemset/problem/266/B\r\n\r\nn, t = [int(x) for x in input().split()]\r\nword = input()\r\n\r\nfor _ in range(t):\r\n pos = len(word)-1\r\n while pos > 0:\r\n if word[pos] == 'G' and word[pos-1] == 'B':\r\n word = f'{word[:pos-1]}GB{word[pos+1:]}'\r\n pos -= 1\r\n pos -= 1\r\nprint(word)\r\n", "n,t=map(int,input().split())\r\nstring = input()\r\nfor _ in range(t):\r\n string = string.replace('BG','GB')\r\nprint(string)", "n, t = map(int,input().split())\nw = list(input())\nq =0\nfor i in range(t):\n for z in range(n-1):\n if w[q]=='B' and w[q+1]=='G':\n w[q],w[q+1]=w[q+1],w[q]\n q+=2\n else:\n q+=1\n if q>=len(w)-1:\n break\n q =0\nprint(''.join(w)) \n \n\t \t\t\t\t\t \t\t \t\t\t\t\t\t\t \t \t\t\t", "s=input().split()\r\nn=int(s[0])\r\nt=int(s[1])\r\nq=input()\r\nfor i in range(t):\r\n q=q.replace('BG','GB',n)\r\nprint(q)", "a,b = map(int,input().split())\r\nc = list(input())\r\n\r\nfor i in range(b):\r\n j = 1\r\n while j<a:\r\n if c[-j] == 'G' and c[-j-1] == 'B':\r\n c[-j],c[-j-1] = c[-j-1],c[-j]\r\n j += 2\r\n else:\r\n j += 1\r\n \r\n\r\nprint(''.join(c))\r\n ", "def change(x):\r\n y = {}\r\n for i in range(n):\r\n if i < n-1 and x[i] == 'B' and x[i+1] == 'G':\r\n y[i] = 'G'\r\n y[i+1] = 'B'\r\n elif i > 0 and x[i-1] == 'B' and x[i] == 'G':\r\n continue\r\n else:\r\n y[i] = x[i]\r\n return y\r\n\r\n\r\nn,t = map(int,input().split())\r\nst = input()\r\ndic = {}\r\nfor i in range(n):\r\n dic[i] = st[i]\r\nfor i in range(t):\r\n dic = change(dic)\r\nout = ''\r\nfor i in range(n):\r\n out += dic[i]\r\nprint(out)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=int(input()[2:])\r\nb=input()\r\nwhile a:\r\n b=b.replace('BG','GB')\r\n a-=1\r\nprint(b)", "value = list(map(int, input().split(' ')))\r\nt = value[1]\r\nvalue = input()\r\nfor i in range(t):\r\n value = value.replace(\"BG\", \"GB\")\r\nprint(value)", "n, t = map(int, input().split())\r\ns = list(input().strip())\r\n\r\n# Iterate for t seconds\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if s[i] == 'B' and s[i+1] == 'G':\r\n # Swap boy and girl\r\n s[i], s[i+1] = s[i+1], s[i]\r\n i += 2 # Move to the next pair\r\n else:\r\n i += 1\r\n\r\n# Print the final arrangement\r\nprint(''.join(s))\r\n", "a,b=map(int,input().split())\nx=list(input())\nfor i in range(b):\n j=0\n while j<len(x)-1:\n if x[j]==\"B\"and x[j+1]==\"G\":\n x[j]=\"G\"\n x[j+1]=\"B\"\n j+=1\n j+=1\ny=\"\".join(x)\nprint(y)\n \t\t\t\t\t \t\t \t\t\t\t\t\t\t \t \t \t", "n,t=map(int, input().split())\r\ns=input()\r\nfor i in range(t):\r\n s=s.replace ('BG', 'GB')\r\nprint(s)", "n, t = map(int, input().split()) \r\nA = list(input())\r\nfor _ in range(t):\r\n i = 0\r\n while i<len(A)-1:\r\n if A[i]=='B' and A[i+1]=='G':\r\n A[i],A[i+1]=A[i+1],A[i]\r\n i+=2\r\n else:\r\n i+=1\r\nprint(''.join(A))\r\n", "n,t = map(int,input().split())\r\ns = input()\r\nwhile t:\r\n s = s.replace('BG','GB')\r\n t -= 1\r\nprint(s)", "a=int(input()[2:]);x=input()\r\nwhile a:x=x.replace('BG','GB');a-=1\r\nprint(x)", "n, t = map(int, input().split())\r\nl = list(input())\r\n\r\nfor _ in range(t):\r\n j = 0\r\n while j <= len(l) - 2:\r\n i = j\r\n if l[i] == \"B\" and l[i + 1] == \"G\":\r\n a = l[i]\r\n b = l[i + 1]\r\n l[i], l[i + 1] = b, a\r\n j = i + 2\r\n else:\r\n j = i + 1\r\nprint(\"\".join(l))", "n, t = map(int, input().split())\r\ns = [k for k in input()]\r\n\r\nfor i in range(t):\r\n m = len(s)\r\n j = 0\r\n while j < m - 1:\r\n if s[j] == \"B\" and s[j + 1] == \"G\":\r\n s[j], s[j + 1] = s[j + 1], s[j]\r\n j += 2\r\n else:\r\n j += 1\r\na = \"\"\r\nfor l in s:\r\n a += l\r\nprint(a)", "n, t = [int(x) for x in input().split()]\r\ns = list(input()) # Convert the string to a list for in-place operations.\r\n\r\n# Perform t time steps.\r\nfor _ in range(t):\r\n # Use index to iterate through the list so we can modify it while iterating.\r\n i = 0\r\n while i < n - 1:\r\n # If we find a 'B' followed by a 'G', swap them.\r\n if s[i] == 'B' and s[i + 1] == 'G':\r\n s[i], s[i + 1] = s[i + 1], s[i] # Swap the two elements.\r\n i += 2 # Move two positions forward to avoid re-swapping.\r\n else:\r\n i += 1 # Move to the next position.\r\n\r\n# Convert the list back to a string and print it.\r\nprint(''.join(s))\r\n", "nt = input().split()\nn, t = int(nt[0]), int(nt[1])\nseq = list(input()); k = seq.copy()\n\nfor i in t*[0]:\n for a in range(len(seq)-1):\n if seq[a] == 'B' and seq[a+1] == 'G':\n k[a] = \"G\"; k[a+1] = \"B\"\n seq = k.copy()\n\nprint(\"\".join(seq))\n", "n,t = map(int, input().split())\r\ns = input()\r\nfor _ in range(t):\r\n s = s.replace('BG','GB')\r\n\r\nprint(s)\r\n", "n, t = map(int, input(\"\").split())\r\ns = list(input(\"\"))\r\nfor i in range(t):\r\n j = 0\r\n while j<n-1:\r\n #print(i,'j=',j,s)\r\n if s[j] == 'B' and s[j+1] == 'G':\r\n s[j+1] = 'B'\r\n s[j] = 'G'\r\n j += 1\r\n j += 1\r\n\r\ns1=''.join(s)\r\nprint(s1)\r\n", "n,m = map(int,input().split())\r\nx = input()\r\nwhile m>0:\r\n x = x.replace(\"BG\",\"GB\")\r\n m -= 1\r\nprint(x)", "a,b = map(int,input().split())\r\nc = list(input())\r\nfor i in range(b):\r\n d = []\r\n for g in range(a):\r\n if c[g] == 'B' and g != a - 1:\r\n d.append(g)\r\n for t in d:\r\n if c[t + 1] == 'G':\r\n c[t],c[t + 1] = c[t + 1],c[t]\r\nprint(''.join(c))", "(n,t) = map(int,input().split())\r\nq = list(input())\r\ndef change(m):\r\n i = 0\r\n while i < m-1:\r\n if q[i] == 'B' and q[i + 1] == 'G':\r\n q[i] = 'G'\r\n q[i + 1] = 'B'\r\n i += 2\r\n else:\r\n i += 1\r\nfor i in range(t):\r\n change(n)\r\nprint(''.join(q))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 8 22:28:06 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nlist1=input().split()\r\nt=int(list1[1])\r\nqueue=input()\r\nchange='BG'\r\nexchange='GB'\r\nfor i in range(t):\r\n queue=queue.replace(change,exchange)\r\nprint(queue)", "n, t = map(int, input().split()) # Read n and t\r\nqueue = list(input()) # Read the initial queue arrangement as a string\r\n\r\nfor _ in range(t):\r\n i = 0\r\n while i < n - 1:\r\n if queue[i] == 'B' and queue[i+1] == 'G': # Found a boy-girl pair\r\n queue[i], queue[i+1] = queue[i+1], queue[i] # Swap positions\r\n i += 2 # Skip the swapped pair\r\n else:\r\n i += 1\r\n\r\nresult = ''.join(queue)\r\nprint(result)" ]

[ "from collections import defaultdict\n\n\ndef process_word(word, index):\n return word.count('r'), len(word), index.setdefault(word, len(index))\n\n\ndef main():\n index = {}\n input()\n essay = list(map(lambda word: process_word(word, index), input().lower().split()))\n queue = essay[:]\n\n syn = defaultdict(list)\n for _ in range(int(input())):\n word, rep = map(lambda w: process_word(w, index), input().lower().split())\n syn[rep[2]].append(word[2])\n queue.append(rep)\n queue.sort(reverse=True)\n best = {}\n\n while queue:\n n_r, length, word = queue.pop()\n if word in best:\n continue\n best[word] = n_r, length\n for rep in syn[word]:\n if rep not in best:\n queue.append((n_r, length, rep))\n\n sum_n_r, sum_len = 0, 0\n for n_r, length in map(lambda w: best[w[2]], essay):\n sum_n_r += n_r\n sum_len += length\n\n print(sum_n_r, sum_len)\n\n\nmain()", "from collections import defaultdict\nfrom sys import stdin \n \ndef main():\n stdin.readline()\n num = {}\n stat = lambda word: (word.count('r'), \n len(word), num.setdefault(word, len(num)))\n essay = list(map(stat, stdin.readline().lower().split()))\n queue = []\n for word in essay:\n queue.append(word)\n n_synonym = int(stdin.readline())\n synonym = defaultdict(list)\n for i in range(n_synonym):\n word, rep = map(stat, stdin.readline().lower().split())\n synonym[rep[2]].append(word[2])\n queue.append(rep)\n queue.sort(reverse=True)\n best = {}\n while queue:\n n_r, length, word = queue.pop()\n if word in best:\n continue\n best[word] = n_r, length\n for rep in synonym[word]:\n if rep not in best:\n queue.append((n_r, length, rep))\n \n sum_n_r, sum_len = 0, 0\n for n_r, length, word in essay:\n n_r, length = best[word]\n sum_n_r += n_r\n sum_len += length\n print(sum_n_r, sum_len)\n \nif __name__ == '__main__':\n main()", "from collections import defaultdict\r\n\r\ninput()\r\nindex = {}\r\nstat = lambda word: (word.count('r'), \r\n len(word), index.setdefault(word, len(index)))\r\nessay = list(map(stat, input().lower().split()))\r\nqueue = essay[:]\r\n\r\nsyn = defaultdict(list)\r\nfor i in range(int(input())):\r\n word, rep = map(stat, input().lower().split())\r\n syn[rep[2]].append(word[2])\r\n queue.append(rep)\r\nqueue.sort(reverse=True)\r\nbest = {}\r\nwhile queue:\r\n n_r, length, word = queue.pop()\r\n if word in best:\r\n continue\r\n best[word] = n_r, length\r\n for rep in syn[word]:\r\n if rep not in best:\r\n queue.append((n_r, length, rep))\r\nsum_n_r, sum_len = 0, 0\r\nfor n_r, length in map(lambda w: best[w[2]], essay):\r\n sum_n_r += n_r\r\n sum_len += length\r\nprint(sum_n_r, sum_len)", "if 1:\r\n import sys\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n def I():\r\n return input()\r\n\r\n def II():\r\n return int(input())\r\n\r\n def MII():\r\n return map(int, input().split())\r\n\r\n def LI():\r\n return list(input().split())\r\n\r\n def LII():\r\n return list(map(int, input().split()))\r\n\r\n def LFI():\r\n return list(map(float, input().split()))\r\n\r\n def GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n def LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n inf = float('inf')\r\n\r\nif 1:\r\n from io import BytesIO, IOBase\r\n import math\r\n\r\n import random\r\n import os\r\n\r\n import bisect\r\n import typing\r\n from collections import Counter, defaultdict, deque\r\n from copy import deepcopy\r\n from functools import cmp_to_key, lru_cache, reduce\r\n from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\n from itertools import accumulate, combinations, permutations, count\r\n from operator import add, iand, ior, itemgetter, mul, xor\r\n from string import ascii_lowercase, ascii_uppercase, ascii_letters\r\n from typing import *\r\n BUFSIZE = 4096\r\n\r\n class 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 class 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 sys.stdin = IOWrapper(sys.stdin)\r\n sys.stdout = IOWrapper(sys.stdout)\r\n\r\ndfs, hashing = 0, 0\r\n\r\nif dfs:\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 return wrappedfunc\r\n\r\nif hashing:\r\n RANDOM = random.getrandbits(20)\r\n class Wrapper(int):\r\n def __init__(self, x):\r\n int.__init__(x)\r\n\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nread_from_file = 0\r\nif read_from_file:\r\n file = open(\"input.txt\", \"r\").readline().strip()[1:-1]\r\n fin = open(file, 'r')\r\n input = lambda: fin.readline().strip()\r\n output_file = open(\"output.txt\", \"w\")\r\n def fprint(*args, **kwargs):\r\n print(*args, **kwargs, file=output_file)\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 a = self.parent[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 merge(self, a, b):\r\n pa, pb = self.find(a), self.find(b)\r\n if pa == pb: return False\r\n self.parent[pb] = pa\r\n return True\r\n\r\ntmp = set()\r\n\r\nn = II()\r\nessay = LI()\r\n\r\nfor i in range(n):\r\n essay[i] = essay[i].lower()\r\n tmp.add(essay[i])\r\n\r\nm = II()\r\npairs = []\r\nfor _ in range(m):\r\n s1, s2 = LI()\r\n s1 = s1.lower()\r\n s2 = s2.lower()\r\n tmp.add(s1)\r\n tmp.add(s2)\r\n pairs.append((s2, s1))\r\n\r\ntmp = list(tmp)\r\ntot = len(tmp)\r\nv1 = [inf] * tot\r\nv2 = [inf] * tot\r\n\r\nmapping = {s: i for i, s in enumerate(tmp)}\r\npath = [[] for _ in range(tot)]\r\nfor a, b in pairs:\r\n path[mapping[a]].append(mapping[b])\r\n\r\nfor i in sorted(range(tot), key=lambda x: (tmp[x].count('r'), len(tmp[x]))):\r\n if v1[i] == inf:\r\n a, b = tmp[i].count('r'), len(tmp[i])\r\n v1[i] = a\r\n v2[i] = b\r\n stack = [i]\r\n while stack:\r\n u = stack.pop()\r\n for v in path[u]:\r\n if v1[v] == inf:\r\n v1[v] = a\r\n v2[v] = b\r\n stack.append(v)\r\n\r\nans1 = 0\r\nans2 = 0\r\nfor w in essay:\r\n ans1 += v1[mapping[w]]\r\n ans2 += v2[mapping[w]]\r\n\r\nprint(ans1, ans2)" ]

[ "from collections import defaultdict, deque, Counter\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ndef inpNum():\r\n return int(input())\r\ndef inpStr():\r\n return input()\r\ndef inpSepNum():\r\n return map(int, input().split())\r\ndef inpNumList():\r\n return list(map(int, input().split()))\r\ndef inpChList():\r\n return list(input().split())\r\n\r\ndef fill_cross(loc, char, grid):\r\n row, col = loc\r\n # vertical\r\n #up\r\n n_row = row\r\n while n_row >= 0 and grid[n_row][col] != '*':\r\n if char == 'T' and grid[n_row][col] == 'S':\r\n print('YES')\r\n exit(0)\r\n grid[n_row][col] = char\r\n n_row -= 1\r\n \r\n #Down\r\n n_row = row + 1\r\n while n_row < len(grid) and grid[n_row][col] != '*':\r\n if char == 'T' and grid[n_row][col] == 'S':\r\n print('YES')\r\n exit(0)\r\n grid[n_row][col] = char\r\n n_row += 1\r\n\r\n # Horizontal\r\n # left\r\n n_col = col\r\n while n_col >= 0 and grid[row][n_col] != '*':\r\n if char == 'T' and grid[row][n_col] == 'S':\r\n print('YES')\r\n exit(0)\r\n grid[row][n_col] = char\r\n n_col -= 1\r\n \r\n # right \r\n n_col = col + 1\r\n while n_col < len(grid[0]) and grid[row][n_col] != '*':\r\n if char == 'T' and grid[row][n_col] == 'S':\r\n print('YES')\r\n exit(0)\r\n grid[row][n_col] = char\r\n n_col += 1\r\n\r\nn , m = inpSepNum()\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\ns_loc, t_loc = [], []\r\n\r\nfor r in range(len(grid)):\r\n for c in range(len(grid[0])):\r\n if grid[r][c] == 'S':\r\n s_loc = [r, c]\r\n if grid[r][c] == 'T':\r\n t_loc = [r, c]\r\n\r\nfill_cross(s_loc, 'S', grid)\r\nfill_cross(t_loc, 'T', grid)\r\n\r\n# horizontal scan\r\nfor row in range(n):\r\n start = '*'\r\n for col in range(m):\r\n if start == 'S' and grid[row][col] == 'T' or start == 'T' and grid[row][col] == 'S':\r\n print('YES')\r\n exit(0)\r\n if grid[row][col] != '.':\r\n start = grid[row][col]\r\n\r\n# vertical scan\r\nfor col in range(m):\r\n start = '*'\r\n for row in range(n):\r\n if start == 'S' and grid[row][col] == 'T' or start == 'T' and grid[row][col] == 'S':\r\n print('YES')\r\n exit(0)\r\n if grid[row][col] != '.':\r\n start = grid[row][col]\r\nprint('NO')", "n,m=map(int,input().split())\nN=range(n)\nM=range(m)\nD=(0,1,2,3)\ng=[input()for _ in range(n)]\nI=1<<20\nv=[[[I]*4 for _ in M]for _ in N]\nq=[]\nfor i in N:\n for j in M:\n if'S'==g[i][j]:\n for d in D:\n q+=[(i,j,d)]\n v[i][j][d]=0\n if'T'==g[i][j]:x,y=i,j\ndr=[-1,0,1,0]\ndc=[0,1,0,-1]\nwhile q:\n i,j,k=q.pop()\n for d in D:\n a,b=i+dr[d],j+dc[d]\n if 0<=a<n and 0<=b<m and g[a][b]!='*':\n l=v[i][j][k]+(k!=d)\n if l<v[a][b][d]:\n v[a][b][d]=l\n if v[a][b][d]<3:\n if a==x and b==y:\n print('YES')\n exit()\n\n\n else:q+=[(a,b,d)]\n\n\n\n\n\n\n\n\n\nprint('NO')\n\n", "n, m = map(int, input().split())\na = [input() for _ in range(n)]\n\ns = t = None\n\nfor i in range(n):\n for j in range(m):\n if a[i][j] == 'S':\n s = (i, j)\n elif a[i][j] == 'T':\n t = (i, j)\n\nrow_cnt = [[0] * (m + 1) for _ in range(n)]\ncol_cnt = [[0] * (n + 1) for _ in range(m)]\n\nfor i in range(n):\n for j in range(m):\n row_cnt[i][j + 1] = row_cnt[i][j] + (a[i][j] == '*')\n col_cnt[j][i + 1] = col_cnt[j][i] + (a[i][j] == '*')\n\ndef row_free(i, j, k):\n if j > k: j, k = k, j\n return row_cnt[i][k + 1] - row_cnt[i][j] == 0\n\ndef col_free(i, j, k):\n if j > k: j, k = k, j\n return col_cnt[i][k + 1] - col_cnt[i][j] == 0\n\nif s[1] > t[1]:\n s, t = t, s\n\nans = 'NO'\n\nfor i in range(n):\n if col_free(s[1], i, s[0]) and col_free(t[1], i, t[0]) and row_free(i, s[1], t[1]):\n ans = 'YES'\n break\n\nif ans == 'NO':\n if s[0] > t[0]:\n s, t = t, s\n\n for j in range(m):\n if row_free(s[0], j, s[1]) and row_free(t[0], j, t[1]) and col_free(j, s[0], t[0]):\n ans = 'YES'\n break\n\nprint(ans)\n", "#!/usr/bin/env python3\n# 793B_way.py - Codeforces.com/problemset/problem/793/B by Sergey 2017\n\nimport unittest\nimport sys\n\n###############################################################################\n# Way Class (Main Program)\n###############################################################################\n\n\nclass Way:\n \"\"\" Way 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, self.m] = map(int, uinput().split())\n\n # Reading the grid into a single line\n self.line = \"\".join(uinput() for i in range(self.n))\n\n self.grid = []\n for col in range(self.m):\n self.grid.append([0] * self.n)\n for row in range(self.n):\n symb = self.line[(row * self.m) + col]\n if symb == \"*\":\n self.grid[col][row] = 1\n else:\n self.grid[col][row] = 0\n if symb == \"S\":\n self.start = (col, row)\n if symb == \"T\":\n self.end = (col, row)\n\n # Cells linked to the start\n self.start_linkedx = self.get_linkedx(self.start)\n self.start_linkedy = self.get_linkedy(self.start)\n\n # Cells linked to the end\n self.end_linkedx = self.get_linkedx(self.end)\n self.end_linkedy = self.get_linkedy(self.end)\n\n self.linkedx = list(\n set(self.start_linkedx).intersection(self.end_linkedx))\n self.linkedy = list(\n set(self.start_linkedy).intersection(self.end_linkedy))\n\n def is_linked(self, start, end):\n if start[0] != end[0] and start[1] != end[1]:\n return False\n if self.grid[start[0]][start[1]]:\n return False\n if self.grid[end[0]][end[1]]:\n return False\n if start[0] == end[0]:\n y = min(start[1], end[1]) + 1\n while y < max(start[1], end[1]):\n if self.grid[start[0]][y]:\n return False\n y += 1\n if start[1] == end[1]:\n x = min(start[0], end[0]) + 1\n while x < max(start[0], end[0]):\n if self.grid[x][start[1]]:\n return False\n x += 1\n return True\n\n def get_linkedx(self, start):\n result = []\n y = start[1]\n for x in range(start[0], -1, -1):\n if self.grid[x][y]:\n break\n result.append(x)\n for x in range(start[0] + 1, self.m):\n if self.grid[x][y]:\n break\n result.append(x)\n return sorted(result)\n\n def get_linkedy(self, start):\n result = []\n x = start[0]\n for y in range(start[1], -1, -1):\n if self.grid[x][y]:\n break\n result.append(y)\n for y in range(start[1] + 1, self.n):\n if self.grid[x][y]:\n break\n result.append(y)\n return sorted(result)\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = \"NO\"\n\n for x in self.linkedx:\n if self.is_linked((x, self.start[1]), (x, self.end[1])):\n result = \"YES\"\n break\n for y in self.linkedy:\n if self.is_linked((self.start[0], y), (self.end[0], y)):\n result = \"YES\"\n break\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 \"\"\" Way class testing \"\"\"\n\n # Constructor test\n test = \"5 5\\n..S..\\n****.\\nT....\\n****.\\n.....\"\n d = Way(test)\n self.assertEqual(d.n, 5)\n self.assertEqual(d.m, 5)\n self.assertEqual(d.line, \"..S..****.T....****......\")\n self.assertEqual(d.grid[0][0], 0) # Empty cell\n self.assertEqual(d.grid[0][1], 1) # Road work\n self.assertEqual(d.start, (2, 0))\n self.assertEqual(d.end, (0, 2))\n\n self.assertEqual(d.is_linked((0, 0), (1, 1)), False)\n self.assertEqual(d.is_linked((0, 0), (4, 0)), True)\n self.assertEqual(d.is_linked((0, 0), (0, 1)), False)\n self.assertEqual(d.is_linked((0, 0), (0, 2)), False)\n\n self.assertEqual(d.get_linkedx((0, 0)), [0, 1, 2, 3, 4])\n self.assertEqual(d.get_linkedy((0, 0)), [0])\n\n self.assertEqual(d.start_linkedx, [0, 1, 2, 3, 4])\n self.assertEqual(d.end_linkedx, [0, 1, 2, 3, 4])\n self.assertEqual(d.linkedx, [0, 1, 2, 3, 4])\n\n # Sample test\n self.assertEqual(Way(test).calculate(), \"YES\")\n\n # Sample test\n test = \"5 5\\nS....\\n****.\\n.....\\n.****\\n..T..\"\n self.assertEqual(Way(test).calculate(), \"NO\")\n\n # Sample test\n test = \"\"\n # self.assertEqual(Way(test).calculate(), \"0\")\n\n # My tests\n test = \"\"\n # self.assertEqual(Way(test).calculate(), \"0\")\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 = Way(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(Way().calculate())\n", "# changed\ndef answer(grid):\n def find(type):\n for i, row in enumerate(grid):\n for j, c in enumerate(row):\n if c == type:\n return (i, j)\n return (-1, -1)\n\n home = find(\"S\")\n work = find(\"T\")\n\n # mark 0 turns away from work\n for i in range(work[0], -1, -1):\n if grid[i][work[1]] == \"*\":\n break;\n grid[i][work[1]] = \"0\"\n for i in range(work[0], len(grid)):\n if grid[i][work[1]] == \"*\":\n break;\n grid[i][work[1]] = \"0\"\n for j in range(work[1], -1, -1):\n if grid[work[0]][j] == \"*\":\n break;\n grid[work[0]][j] = \"0\"\n for j in range(work[1], len(grid[0])):\n if grid[work[0]][j] == \"*\":\n break;\n grid[work[0]][j] = \"0\"\n\n # check to get to 0 turns away from work\n for i in range(home[0], -1, -1):\n if grid[i][home[1]] == \"*\":\n break;\n x, y = i, home[1]\n\n for xi in range(x, -1, -1):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for xi in range(x, len(grid)):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for yi in range(y, -1, -1):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n for xi in range(y, len(grid[0])):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n \n for i in range(home[0], len(grid)):\n if grid[i][home[1]] == \"*\":\n break;\n x, y = i, home[1]\n \n for xi in range(x, -1, -1):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for xi in range(x, len(grid)):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for yi in range(y, -1, -1):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n for xi in range(y, len(grid[0])):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n \n for j in range(home[1], -1, -1):\n if grid[home[0]][j] == \"*\":\n break;\n x, y = home[0], j\n\n for xi in range(x, -1, -1):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for xi in range(x, len(grid)):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for yi in range(y, -1, -1):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n for xi in range(y, len(grid[0])):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n \n for j in range(home[1], len(grid[0])):\n if grid[home[0]][j] == \"*\":\n break;\n x, y = home[0], j\n \n for xi in range(x, -1, -1):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for xi in range(x, len(grid)):\n if grid[xi][y] == \"*\":\n break;\n if grid[xi][y] == \"0\":\n return \"YES\"\n for yi in range(y, -1, -1):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n for xi in range(y, len(grid[0])):\n if grid[x][yi] == \"*\":\n break;\n if grid[x][yi] == \"0\":\n return \"YES\"\n\n return \"NO\"\n \n\nif __name__ == \"__main__\":\n n, m = map(int, input().split())\n grid = []\n for _ in range(n):\n grid.append(list(input()))\n print(answer(grid))\n", "n,m=map(int,input().split())\r\nN=range(n)\r\nM=range(m)\r\nD=(0,1,2,3)\r\ng=[input()for _ in range(n)]\r\nI=1<<20\r\nv=[[[I]*4 for _ in M]for _ in N]\r\nq=[]\r\nfor i in N:\r\n for j in M:\r\n if'S'==g[i][j]:\r\n for d in D:\r\n q+=[(i,j,d)]\r\n v[i][j][d]=0\r\n if'T'==g[i][j]:x,y=i,j\r\ndr=[-1,0,1,0]\r\ndc=[0,1,0,-1]\r\nwhile q:\r\n i,j,k=q.pop()\r\n for d in D:\r\n a,b=i+dr[d],j+dc[d]\r\n if 0<=a<n and 0<=b<m and g[a][b]!='*':\r\n l=v[i][j][k]+(k!=d)\r\n if l<v[a][b][d]:\r\n v[a][b][d]=l\r\n if v[a][b][d]<3:\r\n if a==x and b==y:\r\n print('YES')\r\n exit()\r\n else:q+=[(a,b,d)]\r\nprint('NO')", "def sol():\r\n nums=(input()).split(' ')\r\n n=int(nums[0])\r\n m=int(nums[1])\r\n mat=['' for _ in range(n)]\r\n for i in range(n):\r\n mat[i]=input()\r\n if 'S' in mat[i]:\r\n home=[i,mat[i].find('S')]\r\n if 'T' in mat[i]:\r\n office=[i,mat[i].find('T')]\r\n dr=[[1,0],[-1,0],[0,1],[0,-1],]\r\n dv=dr[:2]\r\n dh=dr[2:]\r\n def cango(home,dr):\r\n res=set()\r\n for d in dr:\r\n p=home[0]\r\n q=home[1]\r\n while 0<=p<n and 0<=q<m and mat[p][q]!='*':\r\n res.add(q if d[0]==0 else p)\r\n p=p+d[0]\r\n q=q+d[1]\r\n return res\r\n hhome=cango(home,dh)\r\n hoffice=cango(office,dh)\r\n hc=hhome & hoffice\r\n for q in hc:\r\n start=min(home[0],office[0])\r\n end=max(home[0],office[0])\r\n path=True\r\n for p in range(start+1,end):\r\n if mat[p][q]=='*':\r\n path=False\r\n break\r\n if path:\r\n return True\r\n vhome=cango(home,dv)\r\n voffice=cango(office,dv)\r\n vc=vhome & voffice\r\n for p in vc:\r\n start=min(home[1],office[1])\r\n end=max(home[1],office[1])\r\n path=True\r\n for q in range(start+1,end):\r\n if mat[p][q]=='*':\r\n path=False\r\n break\r\n if path:\r\n return True\r\n return False\r\nprint ('YES' if sol() else 'NO') \r\n ", "# 793B\nimport collections\ndef do():\n row, col = map(int, input().split(\" \"))\n g = [[\"\"]*col for _ in range(row)]\n sx = sy = tx = ty = 0\n for i in range(row):\n for j,c in enumerate(input()):\n g[i][j] = c\n if c == \"S\":\n sx, sy = i, j\n elif c == \"T\":\n tx, ty = i, j\n stack = [[sx, sy, -1, 0]]\n seen = [[[3,3,3,3] for __ in range(col)] for _ in range(row)]\n seen[sx][sy] = [0,0,0,0]\n # d = {-1:\"\", 0:\"UP\", 1:\"DOWN\", 2:\"left\", 3:\"right\"}\n while stack:\n # s = stack[-1]\n # print([s[0], s[1], d[s[2]], s[3]])\n x, y, direction, count = stack.pop()\n if count == 3:\n continue\n if x == tx and y == ty:\n return \"YES\"\n if 0<=x-1<row and 0<=y<col and g[x-1][y] != '*':\n nc = count if direction == -1 else count + (direction != 0)\n if seen[x-1][y][0] > nc:\n seen[x-1][y][0] = nc\n stack.append([x-1, y, 0, nc])\n if 0<=x+1<row and 0<=y<col and g[x+1][y] != '*':\n nc = count if direction == -1 else count + (direction != 1)\n if seen[x+1][y][1] > nc:\n seen[x+1][y][1] = nc\n stack.append([x+1, y, 1, nc])\n if 0<=x<row and 0<=y-1<col and g[x][y-1] != '*':\n nc = count if direction == -1 else count + (direction != 2)\n if seen[x][y-1][2] > nc:\n seen[x][y-1][2] = nc\n stack.append([x, y-1, 2, nc])\n if 0<=x<row and 0<=y+1<col and g[x][y+1] != '*':\n nc = count if direction == -1 else count + (direction != 3)\n if seen[x][y+1][3] > nc:\n seen[x][y+1][3] = nc\n stack.append([x, y+1, 3, nc])\n return \"NO\"\n\nprint(do())", "from itertools import product\r\n\r\n\r\ndef paint_cross(s_row, s_col, char, grid, n):\r\n # down\r\n for i in range(s_row + 1, n):\r\n if grid[i][s_col] == \".\":\r\n grid[i][s_col] = char\r\n else:\r\n break\r\n # up\r\n for i in range(s_row - 1, -1, -1):\r\n if grid[i][s_col] == \".\":\r\n grid[i][s_col] = char\r\n else:\r\n break\r\n # right\r\n for j in range(s_col + 1, m):\r\n if grid[s_row][j] == \".\":\r\n grid[s_row][j] = char\r\n else:\r\n break\r\n # left\r\n for j in range(s_col - 1, -1, -1):\r\n if grid[s_row][j] == \".\":\r\n grid[s_row][j] = char\r\n else:\r\n break\r\n\r\n\r\nn, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\nh_row, h_col = None, None\r\nr_row, r_col = None, None\r\n\r\nfor (i, j) in product(range(n), range(m)):\r\n if grid[i][j] == \"S\":\r\n h_row, h_col = i, j\r\n elif grid[i][j] == \"T\":\r\n r_row, r_col = i, j\r\n\r\n if h_row is not None and r_col is not None:\r\n break\r\n\r\n\r\npaint_cross(h_row, h_col, \"S\", grid, n)\r\npaint_cross(r_row, r_col, \"T\", grid, n)\r\n\r\n# try to find S+dots+T or T+dots+S row-wise\r\nfor i in range(n):\r\n last = \"*\"\r\n for j in range(m):\r\n if (grid[i][j], last) == (\"T\", \"S\") or (grid[i][j], last) == (\"S\", \"T\"):\r\n print(\"YES\")\r\n exit()\r\n if grid[i][j] == \"*\":\r\n last = \"*\"\r\n elif grid[i][j] != \".\":\r\n last = grid[i][j]\r\n\r\n# try to find S+dots+T or T+dots+S column-wise\r\nfor j in range(m):\r\n last = \"*\"\r\n for i in range(n):\r\n if (grid[i][j], last) == (\"T\", \"S\") or (grid[i][j], last) == (\"S\", \"T\"):\r\n print(\"YES\")\r\n exit()\r\n if grid[i][j] == \"*\":\r\n last = \"*\"\r\n elif grid[i][j] != \".\":\r\n last = grid[i][j]\r\n\r\nprint(\"NO\")", "import sys\r\nfrom collections import deque\r\n\r\ndef main():\r\n n,m=map(int,sys.stdin.readline().split())\r\n field=[]\r\n for _ in range(n):\r\n field.append(list(sys.stdin.readline().rstrip()))\r\n \r\n istart,jstart=[(i,j) for i in range(n) for j in range(m) if field[i][j]=='S'][0]\r\n iend,jend=[(i,j) for i in range(n) for j in range(m) if field[i][j]=='T'][0]\r\n \r\n result='NO'\r\n \r\n #hor+ver+hor\r\n jstart1=jstart-1\r\n while jstart1>=0:\r\n if field[istart][jstart1]=='*': break\r\n jstart1-=1\r\n jstart1+=1\r\n \r\n jstart2=jstart+1\r\n while jstart2<m:\r\n if field[istart][jstart2]=='*': break\r\n jstart2+=1\r\n jstart2-=1\r\n \r\n jend1=jend-1\r\n while jend1>=0:\r\n if field[iend][jend1]=='*': break\r\n jend1-=1\r\n jend1+=1\r\n \r\n jend2=jend+1\r\n while jend2<m:\r\n if field[iend][jend2]=='*': break\r\n jend2+=1\r\n jend2-=1\r\n \r\n for j in range(max(jstart1,jend1),min(jstart2,jend2)+1):\r\n if all(field[i][j]!='*' for i in range(min(istart,iend),max(istart,iend)+1)): \r\n result='YES'\r\n sys.stdout.write(result+'\\n')\r\n return\r\n \r\n #ver+hor+ver\r\n istart1=istart-1\r\n while istart1>=0:\r\n if field[istart1][jstart]=='*': break\r\n istart1-=1\r\n istart1+=1\r\n \r\n istart2=istart+1\r\n while istart2<n:\r\n if field[istart2][jstart]=='*': break\r\n istart2+=1\r\n istart2-=1\r\n \r\n iend1=iend-1\r\n while iend1>=0:\r\n if field[iend1][jend]=='*': break\r\n iend1-=1\r\n iend1+=1\r\n \r\n iend2=iend+1\r\n while iend2<n:\r\n if field[iend2][jend]=='*': break\r\n iend2+=1\r\n iend2-=1\r\n \r\n for i in range(max(istart1,iend1),min(istart2,iend2)+1):\r\n if all(field[i][j]!='*' for j in range(min(jstart,jend),max(jstart,jend)+1)): \r\n result='YES'\r\n sys.stdout.write(result+'\\n')\r\n return\r\n \r\n sys.stdout.write(result+'\\n')\r\n \r\nmain()\r\n\r\n", "def extendS(D,N,M,row,col,level=1):\r\n for r in range(row, -1, -1):\r\n if D[r][col]==\"*\": break\r\n if D[r][col]==\"T\": return True\r\n D[r][col]=\"S\"\r\n if level:\r\n extendS(D,N,M,r,col,0)\r\n for r in range(row+1,N):\r\n if D[r][col]==\"*\": break\r\n if D[r][col]==\"T\": return True\r\n D[r][col]=\"S\"\r\n if level:\r\n extendS(D,N,M,r,col,0)\r\n for c in range(col,-1,-1):\r\n if D[row][c]==\"*\": break\r\n if D[row][c]==\"T\": return True\r\n D[row][c]=\"S\"\r\n if level:\r\n extendS(D,N,M,row,c,0)\r\n for c in range(col+1,M):\r\n if D[row][c]==\"*\": break\r\n if D[row][c]==\"T\": return True\r\n D[row][c]=\"S\"\r\n if level:\r\n extendS(D,N,M,row,c,0)\r\n return False\r\n\r\n\r\ndef extendT(D,N,M,row,col):\r\n for r in range(row,-1,-1):\r\n if D[r][col]==\"*\": break\r\n if D[r][col]==\"S\": \r\n return True\r\n for r in range(row+1,N):\r\n if D[r][col]==\"*\": break\r\n if D[r][col]==\"S\": \r\n return True\r\n for c in range(col,-1,-1):\r\n if D[row][c]==\"*\": break\r\n if D[row][c]==\"S\": \r\n return True\r\n for c in range(col+1,M):\r\n if D[row][c]==\"*\": break\r\n if D[row][c]==\"S\": \r\n return True\r\n return False\r\n\r\nN,M=map(int, input().split())\r\nD=[]\r\nsr,sc=-1,-1\r\ntr,tc=-1,-1\r\nfor n in range(N):\r\n s=list(input())\r\n D.append(s)\r\n for m in range(M):\r\n if s[m]==\"S\":\r\n sr,sc=n,m\r\n if s[m]==\"T\":\r\n tr,tc=n,m\r\nif extendS(D,N,M,sr,sc):\r\n print(\"YES\")\r\nelse:\r\n print((\"NO\",\"YES\")[extendT(D,N,M,tr,tc)])", "n,m = list(map(int,input().split()))\r\nmat = []\r\nfor _ in range(n):\r\n s = list(input())\r\n mat.append(s)\r\ninf = 1<<21\r\ndis = [[[inf]*4 for _ in range(m)]for _ in range(n)]\r\ndx,dy = [0,0,1,-1],[1,-1,0,0]\r\nq = []\r\nx,y = -1,-1\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]=='S':\r\n for d in range(4):\r\n q.append([i,j,d])\r\n dis[i][j][d] = 0\r\n if mat[i][j]=='T':\r\n x,y = i,j\r\nwhile q:\r\n i,j,k = q.pop()\r\n for d in range(4):\r\n nx = i+dx[d]\r\n ny = j+dy[d]\r\n if nx>=0 and nx<n and ny>=0 and ny<m and mat[nx][ny]!='*':\r\n val = dis[i][j][k] + (k!=d)\r\n if val<dis[nx][ny][d]:\r\n dis[nx][ny][d] = val\r\n if dis[nx][ny][d]<3 and nx==x and ny==y:\r\n print(\"YES\")\r\n exit()\r\n if dis[nx][ny][d]<3:\r\n q.append([nx,ny,d])\r\n\r\nprint(\"NO\")", "n, m = map(int, input().split())\r\na = []\r\nx, y = 0, 0\r\n\r\n\r\ndef f(c, x, y):\r\n for i in range(x + 1, n):\r\n if a[i][y] == 'T':\r\n print('YES')\r\n exit()\r\n if a[i][y] == '.':\r\n a[i][y] = c\r\n elif a[i][y] != c:\r\n break\r\n for i in range(x - 1, -1, -1):\r\n if a[i][y] == 'T':\r\n print('YES')\r\n exit()\r\n if a[i][y] == '.':\r\n a[i][y] = c\r\n elif a[i][y] != c:\r\n break\r\n for j in range(y + 1, m):\r\n if a[x][j] == 'T':\r\n print('YES')\r\n exit()\r\n if a[x][j] == '.':\r\n a[x][j] = c\r\n elif a[x][j] != c:\r\n break\r\n for j in range(y - 1, -1, -1):\r\n if a[x][j] == 'T':\r\n print('YES')\r\n exit()\r\n if a[x][j] == '.':\r\n a[x][j] = c\r\n elif a[x][j] != c:\r\n break\r\n\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == 'S':\r\n x, y = i, j\r\n a.append(list(s))\r\nf('1', x, y)\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '1':\r\n f('2', i, j)\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '2':\r\n f('3', i, j)\r\nprint('NO')\r\n\r\n\r\n", "\r\ndef is_valid(x, y, grid):\r\n\tn = len(grid)\r\n\tm = len(grid[0])\r\n\r\n\treturn 0 <= x < n and 0 <= y < m and grid[x][y] != '*'\r\n\r\ndef send_mark_ray(point, direc, mark):\r\n\tglobal grid\r\n\r\n\tx, y = point\r\n\tdx, dy = direc\r\n\twhile is_valid(x, y, grid):\r\n\t\tgrid[x][y] = mark\r\n\t\tx += dx\r\n\t\ty += dy\r\n\r\ndef ray_tracing(point, direc, mark):\r\n\tglobal grid\r\n\r\n\tx, y = point\r\n\tdx, dy = direc\r\n\twhile is_valid(x, y, grid):\r\n\t\tif grid[x][y] == mark:\r\n\t\t\treturn True\r\n\r\n\t\tx += dx\r\n\t\ty += dy\r\n\r\n\treturn False\r\n\r\ndef found_collisions(point, targ):\r\n\tglobal grid\r\n\r\n\tx, y = point\r\n\tfor dx, dy in steps:\r\n\t\tx, y = point\r\n\t\twhile is_valid(x, y, grid):\r\n\t\t\tfor move in steps:\r\n\t\t\t\tif ray_tracing((x,y), move, 'A'):\r\n\t\t\t\t\treturn True\r\n\r\n\t\t\tx += dx\r\n\t\t\ty += dy\r\n\r\n\treturn False\r\n\r\ndef find_char(grid, target):\r\n\tfor i, row in enumerate(grid):\r\n\t\tfor j, c in enumerate(row):\r\n\t\t\tif c == target:\r\n\t\t\t\treturn (i, j)\r\n\r\nsteps = [(1,0), (0, 1), (-1,0), (0,-1)]\r\n\r\n\r\nn, m = [int(x) for x in input().split(' ')]\r\n\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\nS = find_char(grid, 'S')\r\nT = find_char(grid, 'T')\r\n\r\nfor i in range(4):\r\n\tsend_mark_ray(S, steps[i], 'A')\r\n\r\n\r\nans = 'YES' if found_collisions(T, 'A') else 'NO'\r\n\r\nprint(ans)", "import sys\r\n\r\ndef solve():\r\n def run(r, c, visited):\r\n visited[r][c] = True\r\n for i in range(c + 1, m + 2):\r\n if visited[r][i] or (not ok[r][i]):\r\n break\r\n visited[r][i] = True\r\n\r\n for i in range(c - 1, -1, -1):\r\n if visited[r][i] or (not ok[r][i]):\r\n break\r\n visited[r][i] = True\r\n\r\n for i in range(r + 1, n + 2):\r\n if visited[i][c] or (not ok[i][c]):\r\n break\r\n visited[i][c] = True\r\n\r\n for i in range(r - 1, -1, -1):\r\n if visited[i][c] or (not ok[i][c]):\r\n break\r\n visited[i][c] = True\r\n\r\n n, m = map(int, input().split())\r\n\r\n ok = [[False]*(m + 2)]\r\n\r\n for i in range(n):\r\n s = input()\r\n ok.append([False] + [True if ch != '*' else False for ch in s] + [False])\r\n\r\n if 'S' in s:\r\n start = (i + 1, s.find('S') + 1)\r\n\r\n if 'T' in s:\r\n goal = (i + 1, s.find('T') + 1)\r\n\r\n ok.append([False]*(m + 2))\r\n\r\n visited = [[False]*(m + 2) for i in range(n + 2)]\r\n visited[start[0]][start[1]] = True\r\n\r\n run(start[0], start[1], visited)\r\n\r\n '''\r\n for i in range(n + 2):\r\n print(*[1 if visited[i][j] else 0 for j in range(m + 2)], file=sys.stderr)\r\n '''\r\n\r\n visited1 = [[False]*(m + 2) for i in range(n + 2)]\r\n\r\n for i in range(n + 2):\r\n for j in range(m + 2):\r\n if visited[i][j]:\r\n run(i, j, visited1)\r\n\r\n '''\r\n print(file=sys.stderr)\r\n for i in range(n + 2):\r\n print(*[1 if visited1[i][j] else 0 for j in range(m + 2)], file=sys.stderr)\r\n '''\r\n\r\n visited2 = [[False]*(m + 2) for i in range(n + 2)]\r\n\r\n for i in range(n + 2):\r\n for j in range(m + 2):\r\n if visited1[i][j]:\r\n run(i, j, visited2)\r\n\r\n '''\r\n print(file=sys.stderr)\r\n for i in range(n + 2):\r\n print(*[1 if visited2[i][j] else 0 for j in range(m + 2)], file=sys.stderr)\r\n '''\r\n\r\n ans = 'YES' if visited2[goal[0]][goal[1]] else 'NO'\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "from collections import deque\r\n\r\nN, M = list(map(int, input().split()))\r\nK = 2\r\nGOAL = 'T'\r\nGRID = []\r\n\r\nstart = ()\r\nend = ()\r\n\r\nfor _ in range(N):\r\n line = input()\r\n arr = []\r\n for x in range(len(line)):\r\n i = line[x]\r\n if i == '.':\r\n arr.append(float(\"inf\"))\r\n elif i == '*':\r\n arr.append(-1)\r\n else:\r\n if i == 'S': start = (_, x)\r\n elif i == 'T': end = (_, x)\r\n arr.append(i)\r\n GRID.append(arr)\r\n\r\n\r\nqueue = deque()\r\n\r\ndef do_plus(number, x, y):\r\n global N, M, GRID, queue, K, GOAL\r\n\r\n to_left = y - 1\r\n while to_left > -1:\r\n this = GRID[x][to_left]\r\n if this == 'S': break\r\n if this == GOAL: return True\r\n if this <= number-1: break\r\n GRID[x][to_left] = number\r\n queue.append([number+1, x, to_left])\r\n to_left -= 1\r\n\r\n to_right = y + 1\r\n while to_right < M:\r\n this = GRID[x][to_right]\r\n if this == 'S': break\r\n if this == GOAL: return True\r\n if this <= number-1: break\r\n GRID[x][to_right] = number\r\n queue.append([number+1, x, to_right])\r\n to_right += 1\r\n\r\n to_down = x + 1\r\n while to_down < N:\r\n this = GRID[to_down][y]\r\n if this == 'S': break\r\n if this == GOAL: return True\r\n if this <= number-1: break\r\n GRID[to_down][y] = number\r\n queue.append([number+1, to_down, y])\r\n to_down += 1\r\n\r\n to_top = x - 1\r\n while to_top > -1:\r\n this = GRID[to_top][y]\r\n if this == 'S': break\r\n if this == GOAL: return True\r\n if this <= number-1: break\r\n GRID[to_top][y] = number\r\n queue.append([number+1, to_top, y])\r\n to_top -= 1\r\n \r\n return False\r\n\r\nqueue.append([0, start[0], start[1]])\r\n\r\ncan_find = \"NO\"\r\n\r\nwhile queue:\r\n number, x, y = queue.popleft()\r\n if number > K: continue\r\n if do_plus(number, x, y):\r\n can_find = \"YES\"\r\n break\r\n\r\nprint(can_find)" ]

[ "n = int(input())\r\na = [int(i) for i in input().split()]\r\nx = sum(a)\r\ncounter = 0\r\n\r\nfor i in range(len(a)):\r\n difference = x - a[i]\r\n if difference % 2 == 0:\r\n counter = counter + 1\r\n\r\nprint(counter)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n\r\n\r\nSum=sum(l)\r\nif(Sum%2==0):\r\n\tprint(len([i for i in l if i%2==0]))\r\nelse:\r\n\tprint(len([i for i in l if(i%2==1)]))\r\n", "n = int(input())\neven,odd=0,0\nx=[int(i) for i in input().split()]\nfor i in x:\n if i%2==0:\n even+=1\n else :\n odd+=1\nprint(odd if odd%2==1 else even)\n \t\t\t \t\t \t \t \t\t\t \t\t\t\t \t\t", "n=int(input())\r\nk=list(map(int,input().split()))\r\n\r\ns=sum(k)\r\nans=0\r\nfor i in range(n):\r\n if (s-k[i])%2==0:\r\n ans+=1\r\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\ntot, odd, even = 0, 0, 0\ntot = sum(a)\nfor i in range(n):\n if a[i]%2==0: even += 1\n else: odd += 1\nif tot%2==0:\n print(even)\nelse:\n print(odd)\n\n", "n = int(input())\n\na = [int(a) for a in input().split()]\n\nsum = 0\nfor x in a:\n sum += x\n\nprint(len([a for a in a if a % 2 == sum % 2]))\n\t\t \t \t \t\t \t\t\t \t\t\t\t \t\t \t\t", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nsumm = sum(lst)\r\nres = 0\r\nif summ % 2 == 0:\r\n for i in lst:\r\n if i % 2 == 0:\r\n res += 1\r\nelse:\r\n for i in lst:\r\n if i % 2 != 0:\r\n res += 1\r\n\r\nprint(res)", "n = input()\r\ns = [int(x) for x in input().split()]\r\nif sum(s)%2 !=0:\r\n for i in range(0,len(s)): s[i] += 1\r\np = 0\r\nfor x in s:\r\n if x%2 == 0: p+=1\r\n \r\n\r\nprint(p)", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\n\r\nodd = 0\r\neven = 0\r\n\r\nfor i in range(n):\r\n if(x[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\nif(odd%2==0):\r\n print(even)\r\nelif(odd%2!=0):\r\n print(odd)\r\nelse:\r\n print(\"0\")", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nodd = 0\r\nfor i in l:\r\n\tif i%2 == 1:\r\n\t\todd += 1\r\n\r\nif odd%2 == 1:\r\n\tprint(odd)\r\nelse:\r\n\tprint(n-odd)\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nSum = 0\r\nMax = 0\r\nfor i in range(n):\r\n Sum+=a[i]\r\nk = 0\r\na = sorted(a)\r\nif Sum%2 == 0:\r\n for i in range(n):\r\n if a[i]%2 == 0:\r\n k+=1\r\nelse:\r\n for i in range(n):\r\n if a[i]%2 != 0:\r\n k+=1 \r\nprint(k)\r\n", "n = int(input())\r\n\r\n\r\ncookies = [int(i) for i in input().split()]\r\n\r\ntotal = 0\r\n\r\nodds = 0 \r\nfor cookie in cookies :\r\n if cookie&1 :\r\n odds += 1 \r\n \r\n total += cookie \r\n\r\nevens = n - odds \r\n\r\nif total & 1 :\r\n print(odds)\r\nelse :\r\n print(evens)", "l=int(input())\r\n\r\nx=input()\r\nx=x.split()\r\nfor i in range(l):\r\n x[i]=int(x[i])\r\n\r\nd=0\r\ne=0\r\na=0\r\nfor i in range(l):\r\n a+=x[i]\r\n\r\nfor i in range(l):\r\n if x[i]%2==0:\r\n d+=1\r\n else:\r\n e+=1\r\n\r\nif a%2==0:\r\n print(d)\r\nelse: \r\n print(e)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in a:\r\n\tif i%2==1:\r\n\t\tcount+=1\r\nif count%2==1:\r\n\tprint(count)\r\nelse:\r\n\tprint(n-count)", "n = int(input().strip())\r\nA = list(map(int,input().strip().split()))\r\neveCo,oddCo,s = 0,0,0\r\nfor i in range(n):\r\n t = A[i]\r\n if t%2 == 0:\r\n eveCo += 1\r\n else:\r\n oddCo += 1\r\n s += t\r\n\r\nif s%2 == 0:\r\n print(eveCo)\r\nelse:\r\n print(oddCo)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncounte = 0\r\ncounto = 0\r\n\r\nb = sum(a) % 2\r\n\r\nprint(sum(i % 2 == b for i in a))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = 0\r\ns = sum(arr)\r\nfor i in arr:\r\n\tif (s-i)%2 == 0:\r\n\t\tans += 1\r\nprint(ans)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=sum(a)\r\nc=0\r\nfor i in a:\r\n if (s-i)%2==0:\r\n c+=1\r\nprint(c)", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ncc=dict(Counter(arr))\r\nans=0\r\n#print(cc)\r\ns=0\r\nfor k,v in cc.items():\r\n s+=k*v\r\n\r\nfor k,v in cc.items():\r\n if (s-k)%2==0:\r\n ans+=v\r\nprint(ans)\r\n", "# LUOGU_RID: 101468449\nn, *a = map(int, open(0).read().split())\r\ns = sum(a) & 1\r\nprint(n - sum((x & 1) ^ s for x in a))", "bags = int(input())\r\ncookies = list(map(int, input().split()))\r\ntotal = sum(cookies)\r\nfrom collections import defaultdict\r\ncount = defaultdict(int)\r\nfor cookie in cookies:\r\n if cookie in count.keys():\r\n count[cookie] += 1\r\n else:\r\n count[cookie] = 1\r\npossible = list()\r\nfor key, value in count.items():\r\n if (total - key) % 2 == 0:\r\n possible.append(value)\r\ntotal = sum(possible)\r\nprint(total)\r\n", "n=int(input())\r\nc=[int(x) for x in input().split()]\r\nsumm=0\r\ncount=0\r\nfor x in c:\r\n summ+=x\r\nfor i in c:\r\n if (summ-i)%2==0:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n c+=i%2\r\nif sum(l)%2:\r\n print(c)\r\nelse:\r\n print(n-c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = 0\r\nif sum(a)%2 == 0:\r\n for i in range(n):\r\n if a[i]%2 == 0:\r\n k += 1\r\nelse:\r\n for i in range(n):\r\n if a[i]%2 == 1:\r\n k += 1\r\nprint(k)", "n = int(input())\r\nvalues = input().split()\r\na = []\r\nall_s = 0\r\n\r\nfor i in range(n):\r\n s = int(values[i])\r\n\r\n a.append(s)\r\n all_s += s\r\n\r\n\r\nc = 0\r\nfor i in range(n):\r\n if (all_s - a[i])%2 == 0:\r\n c += 1\r\n\r\nprint(c)", "n, a = int(input()), (int(i) for i in input().split())\nres = even = odd = 0\nfor i in a:\n res += i\n even += 1 - (i & 1)\n odd += i & 1\nres = even if res & 1 == 0 else odd\nprint(res)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = 0\r\np = 0\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n k += 1\r\n else:\r\n p += 1\r\n if sum(a) % 2 == 0:\r\n print(k)\r\n else:\r\n print(p)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nif sum(a)%2==1:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n count = count+1\r\n print(count)\r\nelse:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n count = count+1\r\n print(count)\r\n ", "def separate_nums(text):\n split_text = text.split(\" \")\n total_sum = 0\n num_array = []\n for num in split_text:\n num_array.append(int(num))\n total_sum += int(num)\n return {\"total_sum\": total_sum, \"num_array\": num_array,}\n\n\ndef main():\n total_of_bags = int(input())\n cookies_in_each_bag = input()\n num_of_ways = 0\n separate_nums_result = separate_nums(cookies_in_each_bag)\n for num in separate_nums_result[\"num_array\"]:\n if(separate_nums_result[\"total_sum\"] - num)%2 == 0:\n num_of_ways+=1\n print(num_of_ways)\n\n\nif __name__ == \"__main__\":\n main()", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nif n ==1: print(1)\r\nelse:\r\n c = 0\r\n a = sum(l)\r\n for i in l:\r\n if (a-i)%2==0: c += 1\r\n print(c)", "input()\r\na=[int(x)%2 for x in input().split()]\r\nprint(a.count(sum(a)%2))", "n = int(input())\r\nbags = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n\tif (sum(bags)-bags[i]) % 2 == 0:\r\n\t\tcount+=1\r\n\r\nprint(count)", "# http://codeforces.com/problemset/problem/129/A\r\ndef main():\r\n num = int(input())\r\n nums = list(map(int, input().split()))\r\n total = sum(nums)\r\n cant = 0\r\n for i in nums:\r\n val = total - i\r\n if val % 2 == 0:\r\n cant += 1\r\n print(cant)\r\n\r\nmain()", "n = int(input())\r\nodd = sum(int(c) % 2 for c in input().split())\r\nprint(odd if odd % 2 else n - odd)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nce = 0\r\nco = 0\r\ns = 0\r\nfor i in l:\r\n if i % 2 == 0:\r\n ce += 1\r\n else:\r\n co += 1\r\n s += i\r\n\r\nif s % 2 == 0:\r\n print(ce)\r\nelse:\r\n print(co)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nk = sum(a)\nif k % 2 == 1:\n print(sum([x % 2 for x in a]))\nelse:\n print(n - sum([x % 2 for x in a]))\n", "input()\r\na,b=0,0\r\nfor x in input().split():\r\n if ord(x[-1])%2:\r\n a+=1\r\n else:\r\n b+=1\r\nif a%2:\r\n print(a)\r\nelse:\r\n print(b)\r\n", "rep = 0\r\nnumberSum = 0\r\nnumList = []\r\ncookies = 0\r\nevens = 0\r\nodds = 0\r\n\r\nrep = int(input())\r\ncookies = (input())\r\nnumList = list(map(int, cookies.split()))\r\nfor i in numList:\r\n numberSum = numberSum + i\r\n if i % 2 == 0:\r\n evens += 1\r\n else:\r\n odds += 1\r\n \r\n\r\nif numberSum % 2 == 0:\r\n print(evens)\r\nelse:\r\n print(odds)\r\n\r\n \r\n \r\n", "n = int(input())\ncookies_in_bag = [int(x) for x in input().split(\" \")]\n\ntotal_cookies = sum(cookies_in_bag)\n\nways_to_partition = sum(1 for bag in cookies_in_bag if (total_cookies - bag) % 2 == 0)\nprint(ways_to_partition)\n\n \t\t\t\t\t\t \t\t \t \t\t\t \t\t\t\t \t", "n=int(input())\r\nctr=0\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n k=l.copy()\r\n k.remove(l[i])\r\n if sum(k)%2==0:\r\n ctr=ctr+1\r\n\r\n\r\nprint(ctr)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n\tif i%2!=0:\r\n\t\tc+=1\r\nif c==1:\r\n\tprint(1)\r\nelif c%2!=0:\r\n\tprint(c)\r\nelse:\r\n\tprint(n-c)", "input()\r\na, count = list(map (int, input().split())), 0\r\nfor i in a: \r\n if (sum(a)-i) % 2 == 0:\r\n count = (count + 1) \r\nprint(count)", "def cookies(sum,a):\r\n count=0\r\n for i in range(len(a)):\r\n if sum%2==0:\r\n if a[i]%2==0:\r\n count+=1\r\n else:\r\n if a[i]%2!=0:\r\n count+=1\r\n print(count) \r\nn=int(input(\"\"))\r\nnumbers = list(map(int, input().split()))\r\nsum=0\r\nif n==len(numbers):\r\n for i in range(len(numbers)):\r\n sum=sum+numbers[i]\r\n cookies(sum,numbers)\r\n", "from math import inf\nfrom collections import *\nimport math, os, sys, heapq, bisect, random, threading\nfrom functools import lru_cache, reduce\nfrom itertools import *\nimport sys\n\n\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef out(var): sys.stdout.write(str(var) + \"\\n\") # for fast output, always take string\n\n\ndef inpu(): return int(inp())\n\n\ndef lis(): return list(map(int, inp().split()))\n\n\ndef stringlis(): return list(map(str, inp().split()))\n\n\ndef sep(): return map(int, inp().split())\n\n\ndef strsep(): return map(str, inp().split())\n\n\ndef fsep(): return map(float, inp().split())\n\n\nM, M1 = 1000000007, 998244353\n\n\ndef get_divisors(n):\n a = 0\n for i in range(1, int(n / 2) + 1):\n if n % i == 0:\n a += i\n return a\n\n\ndef main():\n #sys.stdin = open(\"test2\", 'r')\n n = inpu()\n a = lis()\n res = 0\n for i in range(len(a)):\n temp = sum(a) - a[i]\n if temp % 2 == 0:\n res += 1\n print(res)\n\n\n\nif __name__ == '__main__':\n # sys.setrecursionlimit(1000000)\n # threading.stack_size(1024000)\n # threading.Thread(target=main).start()\n main()\n\n\t\t \t\t \t \t\t\t \t\t \t \t\t\t\t \t", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nh = 0\r\nnh = 0\r\n\r\nfor i in b:\r\n if i%2==0:\r\n h+=1\r\n else:\r\n nh+=1\r\n\r\nif nh%2==1:\r\n print(nh)\r\nelse:\r\n print(h)\r\n", "n=int(input())\r\ns=[0 if i%2==0 else 1 for i in list(map(int,input().split()))]\r\nif sum(s)%2==0:\r\n print(s.count(0))\r\nelse:\r\n print(sum(s))", "def solve():\r\n n = int(input())\r\n numbers = list(map(int, input().split()))\r\n if sum(numbers)%2 == 0:\r\n return len([i for i in numbers if i%2==0])\r\n return len([i for i in numbers if i % 2 == 1])\r\n\r\n\r\nprint(solve())", "a=int(input())\r\nb=input().split()\r\nsum=0\r\ncount=0\r\nfor i in b:\r\n sum+=int(i)\r\n\r\nif(sum%2==0):\r\n for i in b:\r\n if(int(i)%2==0):\r\n count+=1\r\nelse:\r\n for i in b:\r\n if(int(i)%2!=0):\r\n count+=1\r\n\r\nprint(count)\r\n\r\n", "\r\na=input()\r\nb=list(map(int,input().split()))\r\nc=sum(b)\r\nif c%2==0:\r\n d=0 \r\nelse:\r\n d=1\r\nval=0\r\nfor i in b:\r\n if i%2==d:\r\n val=val+1 \r\nprint(val)", "#https://codeforces.com/problemset/problem/129/A\nn=int(input())\nl=list(map(int,input().split()))\ns=sum(l)\no=0\nfor i in l:\n\to+= i&1\nif s&1:\n\tprint(o)\nelse:\n\tprint(n-o)\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst_sum = sum(lst)\r\n\r\ncnt = 0\r\nchoice = 0\r\nif lst_sum % 2 == 0:\r\n choice = 0\r\nelse:\r\n choice = 1\r\n\r\nfor i in lst:\r\n if i % 2 == choice:\r\n cnt += 1\r\n\r\nprint(cnt)", "'''n=int(input())\r\nv=n%7\r\nif v==0:\r\n print((n//7)*2,(n//7)*2)\r\nelif v==1:\r\n print((n//7)*2,(n//7)*2+1)\r\nelif v==6:\r\n print((n//7)*2+1,(n//7)*2+2)\r\nelse:\r\n print((n//7)*2,(n//7)*2+2)\r\ns=input()\r\nt=input()\r\nf='aeiou'\r\nif len(s)!=len(t):\r\n print('No')\r\nelse:\r\n for i in range(len(s)):\r\n if f.find(s[i])==-1 and f.find(t[i])==-1:\r\n pass\r\n elif f.find(s[i])!=-1 and f.find(t[i])!=-1:\r\n pass\r\n else:\r\n print('No')\r\n break\r\n else:\r\n print('Yes')\r\nm=input()\r\nn=input().split()\r\nx=10000000000000000000000000000000000000000000000000000000\r\nf=-111111111111111111111111111111111111111111111111111111111111111111111\r\nfor i in range(len(n)-1):\r\n if i%2==0:\r\n for z in n:\r\n if int(z)<=x:\r\n x=int(z)\r\n n.remove(str(x))\r\n else:\r\n for z in n:\r\n if int(z)>=f:\r\n f=int(z)\r\n n.remove(str(f))\r\nprint(int(n[0]))'''\r\na=input()\r\nb=input().split()\r\nc=0\r\nd=0\r\nfor i in b:\r\n c+=int(i)\r\nx=c%2\r\nif x==0:\r\n for i in b:\r\n if int(i)%2==0:\r\n d+=1\r\nelse:\r\n for i in b:\r\n if int(i)%2==1:\r\n d+=1\r\nprint(d)\r\n \r\n \r\n\r\n\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nj=0\r\n\r\nc=0\r\nfor i in range(n):\r\n sum=0\r\n for k in range(n):\r\n \r\n if k==j:\r\n pass\r\n else:\r\n sum+=l[k]\r\n if sum%2==0:\r\n c+=1\r\n j+=1\r\nprint(c) ", "n= int(input())\r\na= list(map(int, input().split()))\r\ns= sum(a)\r\nway= 0\r\nwaynot= 0\r\n\r\nfor x in a:\r\n if x%2 == 1:\r\n way += 1\r\n else:\r\n waynot += 1\r\n\r\nif s%2 == 1:\r\n print(way)\r\nelse:\r\n print(waynot)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(n):\r\n if lst[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\nif sum(lst)%2==0:\r\n print(e)\r\nelse:\r\n print(o)\r\n ", "size = int(input())\r\ncounte=0\r\ncounto=0\r\narr = list(map(int,input().split()))\r\nfor i in arr:\r\n if i%2==0:\r\n counte+=1\r\n else:\r\n counto+=1\r\nif counto%2==0:\r\n print(counte)\r\nelse:\r\n print(counto)\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nimp=0\r\ns=0\r\nfor i in range(n):\r\n if L[i]%2==1:\r\n imp=imp+1\r\nif imp%2==1:\r\n if imp>2:\r\n s=imp\r\n else :\r\n s=1\r\nelse:\r\n s=n-imp\r\nprint(s)", "n=int(input());\narr=map(int,input().split())\nsum=0;\nji=0;\nou=0;\nfor j in arr:\n sum+=j\n if( j%2==0):\n ou+=1;\n elif (j%2==1):\n ji+=1\nif(sum%2==0):\n print(ou)\nelse:\n print(ji)", "bags = int(input())\r\ncookie_numbers = [*map(lambda x: int(x), input().split())]\r\n\r\ndef bag_finder(numbers):\r\n anslist = [i for i in numbers if (sum(numbers) - i) % 2 == 0]\r\n print(len(anslist))\r\n \r\nbag_finder(cookie_numbers)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nce=0\r\nco=0\r\nfor i in a:\r\n\ts+=i\r\n\tif i%2==0 :\r\n\t\tce+=1\r\n\telse :\r\n\t\tco+=1\r\nif s%2==0 :\r\n\tprint(ce)\r\nelse :\r\n\tprint(co)", "n = int(input())\r\na = [int(a) for a in input().split(' ')]\r\ns=sum(a)\r\nc=0\r\nfor i in range(n):\r\n if (s-a[i]) %2 == 0:\r\n c+=1\r\nprint(str(c))", "n=int(input())\r\nsum=0\r\nodd_cnt=0\r\neven_cnt=0\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n sum+=x[i]\r\n if x[i]&1:\r\n odd_cnt+=1\r\n else :\r\n even_cnt+=1\r\nif sum&1 : \r\n print(odd_cnt) \r\nelse : \r\n print(even_cnt) \r\n", "n = int(input())\nbags = list(map(int, input().split()))\n\ntotalCookies = sum(bags)\nways = 0\n\nif totalCookies % 2 == 0:\n\tways = sum(1 for cookies in bags if not cookies%2)\nelse:\n\tways = sum(1 for cookies in bags if cookies%2)\n\nprint(ways)", "t = int(input())\r\n\r\nleft = list(map(int, input().split()))\r\nsold = sum(left)\r\nc = 0\r\n\r\nfor l in left:\r\n if (sold - l) % 2 == 0:\r\n c += 1\r\n\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=sum(a)\r\ncount=0\r\nif c%2==0:\r\n for i in a:\r\n if i%2==0:\r\n count+=1\r\nelse:\r\n for i in a:\r\n if i%2!=0:\r\n count+=1\r\nprint(count)", "n=int(input())\r\nar=[]\r\nar=list(map(int,input().split()))\r\nod=0\r\nev=0\r\nx=0\r\nfor x in range(n):\r\n if ar[x]%2==1:\r\n od+=1\r\n else:\r\n ev+=1 \r\n x+=1\r\nif od%2==1:\r\n print(od)\r\nelse:\r\n print(ev)\r\n ", "a = input()\nb = list(map(int,input().split()))\nc = sum(b)%2\nd = 0\nfor i in b:\n if (i-c)%2==0:\n d+=1\nprint(d)", "n = int(input())\r\nA = list(map(int, input().split()))\r\ns = sum(A)\r\nans = 0\r\nfor a in A:\r\n if (s-a)%2 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=[0,0]\r\nsu=0\r\nfor i in a:\r\n if i&1:\r\n count[1]+=1\r\n else:\r\n count[0]+=1\r\n su+=i\r\nif su%2==0:\r\n #Sum is even then choose the evens\r\n print(count[0])\r\nelse:\r\n print(count[1])\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\no=e=int(0)\r\ns=sum(b)\r\nfor x in b:\r\n if x%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\nif s%2==0:\r\n print(e)\r\nelse:\r\n print(o)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncounte,counto=0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n counte+=1\r\n elif(l[i]%2!=0):\r\n counto+=1\r\nif(counto%2==0):\r\n print(counte)\r\nelif(counto%2!=0):\r\n print(counto)", "n = int(input())\na = list(map(int,input().split()))\neven = odd = 0\nfor i in range(n):\n if a[i] % 2 == 0:\n even += 1\n else:\n odd += 1\n\nprint(odd if odd % 2 else even)", "def the_sum(lst, index):\r\n removed_element = lst.pop(index)\r\n remaining_sum = sum(lst)\r\n lst.insert(index, removed_element)\r\n return remaining_sum\r\nbags = int(input())\r\nthe_bags = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(bags):\r\n if the_sum(the_bags, i) % 2 == 0 :\r\n count += 1\r\nprint(count)\r\n", "from sys import stdin; inp = stdin.readline\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 a = IA()\r\n t = sum(a)\r\n count = 0 \r\n for n in a:\r\n if (t-n)%2==0:\r\n count += 1\r\n return count \r\n\r\nif __name__ == '__main__':\r\n print(main())", "_ = input()\r\nodds = 0\r\nevens = 0\r\n\r\nfor x in input().strip().split():\r\n if int(x) & 1:\r\n odds += 1\r\n else:\r\n evens += 1\r\n\r\n\r\nif odds & 1:\r\n count = odds\r\nelse:\r\n count = evens\r\n\r\nprint(count)\r\n", "#!/usr/bin/env python3\n\ndef main():\n from itertools import accumulate\n \n n, ans = int(input()), 0\n arr = [int(ai) for ai in input().split()]\n summ = sum(arr)\n\n for ai in arr:\n ans += (ai&1) if (summ & 1) else not(ai&1)\n \n print(ans)\n\nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\na = list(map(int,input().strip().split(' ')))\r\ns = 0\r\nfor i in range (n) :\r\n temp = a[i]\r\n a[i] = 0\r\n if (sum(a)%2 ==0) :\r\n s +=1\r\n a[i] = temp\r\nprint(s)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=0\r\ne, o =0,0\r\nfor i in a:\r\n if i%2==0:\r\n e+=1\r\n elif i%2==1:\r\n o+=1\r\n s=(s+i)%2\r\nif s==0:\r\n print(e)\r\nelse:\r\n print(o)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum(l)\r\ncount = 0\r\nfor i in l:\r\n if (s-i)%2==0:\r\n count+=1\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(sum(1 for i in l if (sum(l)-i)%2==0))", "n = int(input())\r\n*a, = map(int, input().split())\r\nc1 = 0\r\nc2 = 0\r\nfor i in a:\r\n if i % 2:\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 % 2:\r\n print(c1)\r\nelse:\r\n print(c2)", "input( )\r\nl = list( map( int , input( ).split( ) ) )\r\nprint( sum( [i % 2 == sum( l ) % 2 for i in l] ) )", "in1 = int(input())\r\nin2 = input().split()\r\nin2 = list(map(int,in2))\r\nk=0\r\ns=sum(in2)\r\nif s%2==0:\r\n for i in in2:\r\n if i%2==0:\r\n k=k+1\r\nelse:\r\n for i in in2:\r\n if i%2!=0:\r\n k=k+1\r\nprint(k)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor x in a:\r\n v = sum(a) - x\r\n if v % 2 == 0:\r\n counter += 1\r\n else:\r\n continue\r\nprint(counter)\r\n\r\n\r\n", "n=int(input())\nl=list(map(int,input().split()))\nres=sum(l)\ncount=0\nif res%2==0:\n for x in l:\n if x %2==0:\n count +=1\nelse:\n for x in l:\n if x%2!=0:\n count+=1\nprint(count)\n\t \t\t\t \t \t\t\t \t\t\t \t \t\t \t\t", "n = input()\nvalues = input()\nvalues = values.split()\nsum = 0\nfor i in range(int(n)):\n sum += int(values[i])\ncounter = 0 \nfor j in range(int(n)):\n check = sum - int(values[j])\n if(check%2 == 0):\n counter += 1\nprint(counter)\n\n \t \t \t \t \t \t\t\t\t\t\t\t\t\t \t", "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\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n count+=1\r\n\r\ns=n-count\r\nif(s%2==0):\r\n print(count)\r\nelse:\r\n print(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if (sum(l)-l[i])%2==0:\r\n c+=1\r\nprint(c)\r\n ", "input()\nn = list(map(int,input().split()))\nans = 0\nfor i in n:\n if (sum(n)-i) % 2 == 0:\n ans += 1\n else:\n pass\nprint(ans)", "from sys import stdin, stdout\r\nimport math,sys\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nimport bisect as bi\r\nimport heapq \r\n\r\n'''\r\n#------------------PYPY FAst I/o--------------------------------#\r\n \r\ndef I():return (int(stdin.readline()))\r\ndef In():return(map(int,stdin.readline().split()))\r\n'''\r\n#------------------Sublime--------------------------------------#\r\n \r\n#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\ndef I():return (int(input()))\r\ndef In():return(map(int,input().split()))\r\n\r\n\r\n\r\ndef main():\r\n try:\r\n n=I()\r\n l=list(In())\r\n z=sum(l)\r\n #print(z)\r\n ans=0\r\n for x in l:\r\n if( z-x)%2==0:\r\n ans+=1\r\n print(ans)\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n for _ in range(1):\r\n main()", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nc=0\r\nfor i in l:\r\n if (s-i)%2==0:\r\n c=c+1\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n k=l.copy()\r\n k.remove(i)\r\n if sum(k)&1==0:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\ncookies=input().split()\r\nsum=0\r\nway=0\r\nfor i in range(n):\r\n sum=sum+int(cookies[i])\r\nfor j in range(n):\r\n if (sum-int(cookies[j]))%2==0:\r\n way=way+1\r\nprint(way)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\no=0\r\ne=0\r\nfor i in range (n):\r\n if(l1[i]%2!=0):\r\n o+=1\r\n else:\r\n e+=1\r\nif(o%2==0):\r\n print(e)\r\nelse:\r\n print(o)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\npis = list(filter(lambda x: x&1 == 0, lst))\r\nprint(len(pis) if sum(lst) % 2 == 0 else n-len(pis))", "if __name__ == '__main__':\r\n num = int(input())\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n num_odd = num_even = 0\r\n for i in range(num):\r\n if line[i] % 2 == 1:\r\n num_odd += 1\r\n else:\r\n num_even += 1\r\n if num_odd % 2 == 1:\r\n print(num_odd)\r\n else:\r\n print(num_even)\r\n", "t=int(input())\r\nx=list(map(int,input().split( )))\r\nj=sum(x)%2\r\ni=0\r\nways=0\r\nwhile i<len(x):\r\n if x[i]%2==j:\r\n ways+=1\r\n i+=1\r\nprint(ways)", "n=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\ns=sum(arr)\r\nctr=0\r\nif s%2==0:\r\n for i in arr:\r\n if i%2==0:\r\n ctr+=1\r\nif s%2!=0:\r\n for i in arr:\r\n if i%2!=0:\r\n ctr+=1\r\nprint(ctr)", "def steal_cookies():\r\n (input())\r\n cookie_bags = input()\r\n cookie_bags = cookie_bags.split(' ')\r\n cookie_bags = [ int(x) for x in cookie_bags]\r\n methods = 0\r\n for bag in cookie_bags:\r\n if (sum(cookie_bags) - bag) % 2 == 0:\r\n methods += 1\r\n return methods\r\n\r\nprint(steal_cookies())", "N = int(input())\nCoke = [int(i) for i in input().split()]\nE = 0\nO = 0\n\nfor i in Coke:\n if i%2 == 0:\n E += 1\n else:\n O += 1\n\nif O%2 == 1:\n print(O)\nelse:\n print(E)", "# A. Cookies\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsm = sum(a)\r\nodd, even = 0, 0\r\nfor digit in a:\r\n if digit % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif sm % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = sum(a) % 2\r\nprint(len(list(filter(lambda x: x%2 == t, a))))\r\n", "import bisect\r\nimport itertools\r\n\r\ndef main():\r\n\tn = input()\r\n\ta = [int(x) % 2 for x in input().split()]\r\n\tprint(a.count(sum(a) % 2))\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "from functools import reduce\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ntot = reduce((lambda x, y: x + y), a)\r\nres = 0\r\nfor i in range(n):\r\n now = tot - a[i]\r\n if (now % 2) is 0:\r\n res += 1\r\nprint(res)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\ncnt=0\r\nfor i in l:\r\n k=s-i\r\n if(k%2==0):\r\n cnt+=1\r\nprint(cnt)\r\n", "n = int(input())\na = [int(x) for x in input().split()][:n]\nsum, count = 0, 0\nfor i in range(n): sum += a[i]\nfor i in range(n):\n\tif (sum - a[i]) % 2 == 0: count += 1\nprint(count)\n\n \t\t \t \t \t\t\t \t \t \t\t", "n = int(input())\narr = list(map(int, input().split()))\ns = sum(arr)\nans = 0\nfor i in arr:\n if ((s-i) & 1):\n continue\n else:\n ans += 1\nprint(ans)\n", "n = int(input())\r\nlis = [int(i) for i in input().split()]\r\nevens = []\r\nsum = 0\r\nfor i in range(n):\r\n sum += lis[i]\r\n if lis[i]%2==0:\r\n evens.append(lis[i])\r\nif sum%2!=0:\r\n print(n-len(evens))\r\nelse:\r\n print(len(evens))", "n=int(input())\r\nA=[int(x) for x in input().split()]\r\nSum=sum(A)\r\nif Sum%2==0:\r\n cnt_even=0\r\n for i in A:\r\n if i%2==0:\r\n cnt_even+=1\r\n print(cnt_even)\r\nelse:\r\n cnt_odd=0\r\n for i in A:\r\n if i%2!=0:\r\n cnt_odd+=1\r\n print(cnt_odd)", "#!/usr/bin/python3\nn = int(input());\ncookies = [int(x) for x in input().split()]\ne,o = 0,0;\ns = sum(cookies);\nfor i in cookies:\n\tif (i%2):\n\t\to += 1;\n\telse:\n\t\te += 1;\nif (s%2):\n\tprint(o);\nelse:\n\tprint(e);\n\n\n", "import sys\n#from collections import Counter as C\n#from heapq import *\n# sys.stdin = open('in.txt', 'r') \n# sys.stdout = open('out.txt', 'w')\nn=int(input())\na=tuple(map(int,input().split()))\ns=sum(a)\nans=0\nif s&1:\n\tfor i in a:\n\t\tif i&1:\n\t\t\tans+=1\nelse:\n\tfor i in a:\n\t\tif not(i&1):\n\t\t\tans+=1\nprint(ans)", "class Solver:\r\n \r\n def solve(self, bagCounts):\r\n sum = 0\r\n evens = 0\r\n odds = 0\r\n\r\n for bagCount in bagCounts:\r\n if bagCount % 2 == 0:\r\n evens += 1\r\n else:\r\n odds += 1\r\n sum += bagCount\r\n return evens if sum % 2 == 0 else odds\r\n\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input())\r\n bagCounts = list(map(int, input().split()))\r\n\r\n solver = Solver()\r\n print(solver.solve(bagCounts))", "n = int(input())\r\ncnt = 0\r\nfor c in input().split():\r\n cnt+=(int(c)) % 2\r\nif cnt %2 >0:\r\n print(cnt)\r\nelse:\r\n print(n-cnt)", "n=int(input())\r\ncount=0\r\nl=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n q=l[0:i]+l[i+1:n+1]\r\n if sum(q)%2==0:\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\na = [ int(x) for x in input().split() ]\r\ns = sum(a)\r\n\r\nans = 0\r\nfor x in a:\r\n\tif (s - x) % 2 == 0:\r\n\t\tans += 1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nfor i in a:\r\n if i%2 ==0:\r\n even=even+1\r\n else:\r\n odd=odd+1\r\ns=sum(a)\r\nif s%2==0:\r\n print(even)\r\nelse:\r\n print(odd)", "def func(a, flag):\r\n n = 0\r\n for i in a:\r\n if i %2 == flag:\r\n n += 1\r\n print(n)\r\n \r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\ns = sum(a);\r\nif(s %2 == 0):\r\n func(a, 0)\r\nelse:\r\n func(a, 1)\r\n", "input()\r\nn = list(map(int, input().split()))\r\n\r\nqe = len([x for x in n if x % 2 == sum(n) % 2])\r\n\r\nprint(qe)", "# solution to codeforces.com/problemset/problem/275/A\r\n\r\nn = int(input())\r\ntotal = 0\r\nlist = []\r\n\r\nfor i in input().split():\r\n total += int(i)\r\n list.append(int(i))\r\n\r\n\r\nways = 0\r\nif total%2 == False:\r\n for j in list:\r\n if j%2 == False:\r\n ways += 1\r\n\r\nelif total%2 == True:\r\n for k in list:\r\n if k%2 == True:\r\n ways += 1\r\n\r\nprint(ways)\r\n \r\n \r\n", "n = int(input())\r\np = input().split()\r\nodd = 0\r\neven = 0\r\noddness = 0\r\nfor i in p:\r\n if int(i)%2 == 0:\r\n even += 1\r\n else:\r\n oddness += 1\r\n odd += 1\r\nif oddness%2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n \r\n ", "n=int(input());s=input().split();ans=0;k=[]\nfor i in s:\n k.append(int(i))\npd=sum(k)\nfor j in range(0,n):\n if (pd-k[j])%2==0:\n ans+=1\nprint(ans)", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nx = sum(arr)\r\n\r\ncount_eve = 0\r\ncount_odd = 0\r\n\r\nfor i in arr:\r\n\tif i% 2 == 0:\r\n\t\tcount_eve += 1\r\n\telse:\r\n\t\tcount_odd += 1\r\n\r\n\r\nif x % 2 == 0:\r\n\tprint(count_eve)\r\nelse:\r\n\tprint(count_odd)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nk=0\r\nfor i in range(n):\r\n if (sum(s[:i])+sum(s[i+1:])) % 2 == 0:\r\n k += 1\r\nprint(k)\r\n", "n = int(input())\r\ncookies = [int(num) for num in input().split()[:n]]\r\n\r\nsum = sum(cookies)\r\ncount = 0\r\nfor i in cookies:\r\n if(((sum - i)%2)==0):\r\n count = count + 1\r\nprint(count)", "\nn = int(input())\n\na = list(map(int,input().split()))\n\ncounter = 0\n\nfor i in range(n):\n res = 0\n for j in range(n):\n if j != i:\n res += a[j]\n if res % 2 == 0:\n counter += 1\n\nprint(counter)\n\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\n\r\ncount = 0\r\nfor i in a:\r\n if (sum(a) - i) % 2 == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "n_bags = int(input())\nbags = [int(i) for i in input().split(' ')]\nt_sum = sum(bags)\nways = sum([1 if (t_sum - i) % 2 == 0 else 0 for i in bags])\nprint(ways)\n\t \t\t\t \t \t \t \t\t \t\t", "n = int(input())\r\ncookies = list(map(int, input().rstrip().split()))\r\n\r\nSum = sum(cookies)\r\n\r\nif(Sum & 1):\r\n\r\n count = 0\r\n for i in cookies:\r\n if(i & 1):\r\n count += 1\r\n\r\n print(count)\r\nelse:\r\n \r\n count = 0\r\n for i in cookies:\r\n if(i % 2 == 0):\r\n count += 1\r\n print(count)\r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(sum(1 for i in a if i % 2 == sum(a) % 2))", "n = int(input())\r\nO_b = list(map(int, input().split()))\r\nsister_b = sum(O_b)\r\nt = 0\r\n\r\nfor b in O_b:\r\n if (sister_b - b) % 2 == 0:\r\n t += 1\r\n \r\nprint(t)", "numbag = int(input())\nbags = str(input()).split()\ncookies = 0\nways = 0\nfor x in bags:\n \n cookies += int(x)\nfor x in bags:\n if (cookies - int(x)) % 2 == 0:\n ways += 1\nprint (ways)\n \t \t\t\t\t\t\t\t\t\t \t \t \t \t\t\t \t\t \t", "n = int(input())\r\nk2 = 0\r\ns = 0\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n x = a[i]\r\n if x%2 == 0:\r\n k2+=1\r\n s+=x\r\nif(s%2==0):\r\n print(k2)\r\nelse:\r\n print(n-k2)", "'''\r\n##======================================================================================================================================##\r\n ## _____ _ _ _ _____ _ _ _ _ _____ _____ ____ ___ ____ ___ ##\r\n ## | / \\ | \\ / | | | | |\\ | | | | | | | | \\ | | | ##\r\n ## |_____ / \\ | \\/ | |_____ | | | \\ | | __ --- |_____ |____| | | | |___ |___| ##\r\n ## | / \\ | | | | | | \\ | | | | | | | | | | \\ ##\r\n ## _____| / \\ | | _____| \\ __ / | \\| |_____| _____| | | |___/ |____ | \\ ##\r\n##======================================================================================================================================##\r\n\r\n------------------------------Samsung_Spider------------------------------\r\n'''\r\nn = int(input()); t = 0\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n if i % 2 != 0:\r\n t += 1\r\nif sum(a) % 2 == 0:\r\n print(n - t)\r\nelse:\r\n print(t)", "input()\r\na=[0,0]\r\nfor i in map(int,input().split()):a[i%2]+=1\r\nprint(a[1]if a[1]%2 else a[0])\r\n", "m = input()\n\ncookies= input().split(\" \")\ncookies = [int(x) for x in cookies]\n\ntot = 0\n \nsteal = 0\n\nfor cookie in cookies:\n tot += cookie\n\nfor cookie in cookies:\n if (tot - cookie) % 2 == 0:\n steal+=1\nprint(steal)\n", "n = int(input())\r\nnumbers = [int(x) for x in input().split(\" \")]\r\n\r\nuneven_total = 0\r\nfor num in numbers:\r\n if num % 2 == 1:\r\n uneven_total += 1\r\n\r\nif uneven_total % 2 == 1:\r\n print(uneven_total)\r\nelse:\r\n print(n-uneven_total)\r\n", "bags = int(input())\ncookies = list(map(int,list(input().split())))\n\nif sum(cookies)%2 == 0:\n n = 0\n for i in cookies:\n if i%2 == 0:\n n += 1\nelse:\n n = 0\n for i in cookies:\n if i%2 != 0:\n n += 1\n\nprint(n)\n\t\t\t\t\t\t\t \t\t\t\t\t \t\t \t \t \t\t \t\t", "a=int(input());c,d=0,0\r\nfor i in map(int,input().split()):c+=i;d+=i%2\r\nprint(d if c%2 else a-d)", "n = int(input())\r\nb = list(map(int, input().split()))\r\ng = sum(b)%2\r\n\r\nans = 0\r\nfor i in b:\r\n if g == 1:\r\n ans += i%2\r\n else:\r\n ans += i%2 == g\r\nprint(ans)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\neve,odd=0,0\r\nfor i in range(0,n):\r\n\tif a[i]%2==0:\r\n\t\teve+=1\r\n\telse:\r\n\t\todd+=1\r\nif odd%2==0:\r\n\tprint(eve)\r\nelse:\r\n\tprint(odd)", "input()\r\n\r\nl =list( map(int, input().split()))\r\n\r\nevens = 0\r\nodds = 0\r\nsumm = 0\r\nfor e in l:\r\n if e % 2 == 0:\r\n evens+=1\r\n else:\r\n odds += 1\r\n summ += e\r\n \r\nif (summ % 2 == 0):\r\n print(evens)\r\nelse:\r\n print(odds)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc,o=0,0\r\nfor i in l:\r\n if i%2==0:\r\n c+=1\r\n else:\r\n o+=1\r\nif sum(l)%2:\r\n print(o)\r\nelse:\r\n print(c)", "n = int(input())\r\nk=0\r\nCookies = [int(i) for i in input().split()]\r\nAll = sum(Cookies)\r\nfor i in Cookies:\r\n if (All - int(i))%2==0:\r\n k=k+1\r\n\r\nprint(k)\r\n", "n_bags = int(input())\n\ncookies_in_bags = input().split()\n\nn_cookies = 0\neven_bags = 0\nodd_bags = 0\n\n\nfor cookies in cookies_in_bags:\n n_cookies += int(cookies)\n if int(cookies) % 2 == 0:\n even_bags += 1\n else:\n odd_bags += 1\n\nif n_cookies % 2 == 0:\n print(even_bags)\nelse:\n print(odd_bags)\n\t \t\t \t \t\t\t \t \t\t\t \t \t\t\t\t \t", "n=int(input())\r\narr=[int(x)%2 for x in input().split()]\r\ns=sum(arr)\r\nif(s%2==0):\r\n print(len(arr)-s)\r\nelse:\r\n print(s)", "n = input()\r\na = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor x in a:\r\n if x % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nans = even if sum(a) % 2 == 0 else odd\r\nprint(ans) ", "n=int(input())\r\neven=0\r\nsum=0\r\nl=[int(i) for i in input().split()]\r\nfor count in l:\r\n sum+=count\r\n even+=(count%2==0)\r\nif(sum%2==0):\r\n print(even)\r\nelse:\r\n print(n-even)\r\n \r\n ", "\nn = int(input())\na = list(map(int, input().split(' ')))\n\nev_count, odd_count = 0,0\ntotal = 0\n\nfor b in a:\n\ttotal += b\n\tif b%2 == 0:\n\t\tev_count += 1\n\telse:\n\t\todd_count += 1\n\nif total%2 == 0:\n\tprint(ev_count)\nelse:\n\tprint(odd_count)\n\n", "num_bags = input()\nbags = input().split()\nint_bags = [int(i) for i in bags]\nsum_bags = sum(int_bags)\n\ncount = 0\nfor i in range(len(int_bags)):\n num = sum_bags - int_bags[i]\n if num % 2 == 0 or num == 0:\n count += 1\nprint(count)\n\n\t \t\t \t\t \t \t \t \t \t", "n = int(input())\r\n\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n\r\ncnt1 = 0\r\ncnt2 = 0\r\n\r\nfor i in a:\r\n if i % 2 == 0:\r\n cnt1 += 1\r\n else:\r\n cnt2 += 1\r\n\r\nif cnt2 % 2 == 0:\r\n print(cnt1)\r\nelse:\r\n print(cnt2)", "import math\r\ndef olgayhahahalolxD(s):\r\n alist=list(map(int,s.split()))\r\n cx=0\r\n for x in alist:\r\n if (sum(alist)-x)%2==0:\r\n cx+=1\r\n return cx\r\nt=int(input())\r\ns=input()\r\nprint(olgayhahahalolxD(s)) ", "x=int(input())\r\ny=input().split()\r\np=[]\r\nq=[]\r\nfor i in y:\r\n if int(i)%2==0:\r\n p.append(i)\r\n else:\r\n q.append(i)\r\nr=len(q)\r\nif r%2==0:\r\n print(len(p))\r\nelse:\r\n print(len(q))\r\n\r\n\r\n\r\n", "def cookies(lst):\r\n even, odd = 0, 0\r\n for elem in lst:\r\n if elem % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd % 2 == 0:\r\n return even\r\n return odd\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(cookies(a))\r\n", "n=int(input())\nl=[int(x) for x in input().split()]\ns=sum(l)\nans=0\nfor e in l:\n if (s-e)%2==0:\n ans+=1\nprint(ans)\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nc=0 \r\nfor i in l:\r\n if (sum(l)-i)%2==0:\r\n c+=1\r\nprint(c) \r\n ", "n=int(input())\r\ncnts = list(map(int, input().split()))\r\ncnt=0\r\nif len(cnts)<=1:\r\n print(1)\r\nelse:\r\n for i in range(0,len(cnts)):\r\n if (sum(cnts[0:i])+sum(cnts[i+1:]))%2==0:\r\n cnt+=1\r\n print(cnt)\r\n", "n=int(input())\nl=list(map(int,input().split()))\nc=0\ns=sum(l)\nfor i in range(n):\n\tif (s-l[i])%2==0:\n\t\tc+=1\nprint(c)\n\n\n\n\n\n", "n = int(input().strip())\r\nll = list(map(int,input().split()))\r\nsumm = sum(ll)\r\nif summ % 2 != 0:\r\n tok = 0\r\n for i in ll:\r\n if i % 2 != 0:\r\n tok += 1\r\n print(tok)\r\nelse:\r\n chet = 0\r\n for i in ll:\r\n if i % 2 == 0:\r\n chet += 1\r\n print(chet)", "import sys\r\nn=int(input())\r\nlista=[int(x) for x in input().strip().split()]\r\ne=0\r\no=0\r\nsuma=0\r\nfor i in range(len(lista)):\r\n if(lista[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\n suma+=lista[i]\r\nif(suma%2==0 and e!=0):\r\n print(e)\r\nelif(suma%2!=0 and o!=0):\r\n print(o)\r\nelse:\r\n print(\"0\")\r\n", "n=int(input())\r\nbags=list(map(int,input().split()))\r\nways=0\r\nfor i in range(n):\r\n if ((sum(bags)-bags[i]) % 2) !=1:\r\n ways+=1\r\n \r\nprint(ways)\r\n", "n = int(input())\r\n\r\nlst = list(map(int,input().split()))\r\no = 0;e=0\r\nfor i in lst:\r\n if(i%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\n\r\nif(o%2==1):\r\n print(o)\r\nelse:\r\n print(e)", "n = input()\na = [int(i) for i in input().split(' ')]\n\nx = sum(a)\nodd = 0\neven = 0\nfor i in a:\n if i % 2 == 1:\n odd += 1\n else:\n even += 1\nif x % 2 == 1:\n print(odd)\nelse:\n print(even)\n", "n=int(input());a=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):\r\n if (sum(a)-a[i])%2==0:\r\n x+=1\r\nprint(x)\r\n", "\r\nn = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\nsuma = sum(nums)\r\ncont = 0\r\nfor i in nums:\r\n if (suma - i) % 2 == 0:\r\n cont += 1\r\n \r\nprint(cont)\r\n", "n = [int(i) for i in input().split()][0]\r\na = [int(i) for i in input().split()]\r\nsa = sum (a)\r\nodd = [i for i in a if i%2 == 0]\r\neven = [i for i in a if i%2 == 1]\r\nif (sa % 2 == 0):\r\n print (len (odd))\r\nelse:\r\n print (len (even))", "bags = int(input())\r\ncookies = [int(i) for i in input().split()]\r\n\r\ntotal = 0\r\ncount = 0\r\n\r\nfor i in range(bags):\r\n total += cookies[i]\r\n\r\nfor i in range(bags):\r\n if (total - cookies[i]) % 2 == 0:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nX = sum(arr)\r\ncount = 0\r\nfor x in arr:\r\n if (X - x) % 2 == 0:\r\n count += 1\r\n\r\nprint(count)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nans = 0\r\nfor i in range(n):\r\n if (s-a[i]) % 2 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nz = 0\r\nk = 0\r\na = list(map(int, input().split()))\r\nz = sum(a)\r\nfor i in range(n):\r\n if (z - a[i]) % 2 == 0:\r\n k += 1\r\nprint(k)\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nc=0\r\nfor i in t:\r\n if (sum(t)-i)%2==0:\r\n c+=1\r\nprint(c) ", "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 Cookies():\r\n n = inp()\r\n bagList = inlt()\r\n\r\n num_odd = 0\r\n num_even = 0\r\n totalSum = sum(bagList)\r\n\r\n for cookie in bagList:\r\n if cookie % 2 == 0:\r\n num_even += 1\r\n else:\r\n num_odd += 1\r\n \r\n if totalSum%2 == 0:\r\n print(num_even)\r\n else:\r\n print(num_odd)\r\n return\r\n\r\n\r\nCookies()", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nways = 0\r\nif sum(a) % 2 == 0:\r\n for i in a:\r\n if i % 2 == 0:\r\n ways += 1\r\nelse:\r\n for i in a:\r\n if i % 2 == 1:\r\n ways += 1\r\n\r\nprint(ways)\r\n", "import sys\nimport math\n\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\n\ndef solve():\n\tn = int(input())\n\ta = input().split()\n\teven, odd = 0, 0\n\n\tfor i in range(n):\n\t\tif int(a[i]) & 1:\n\t\t\todd += 1\n\t\telse:\n\t\t\teven += 1\n\n\tprint(odd if odd & 1 else even)\n\n\n\n\nif __name__ == \"__main__\":\n\ttest_cases = 1\n\tfor _ in range(test_cases):\n\t\tsolve()\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nsum_bag,count=sum(a),0\r\n\r\nfor i in a:\r\n if((sum_bag-i)%2==0):\r\n count+=1\r\nprint(count)", "# _ = input()\r\n# bags = list(map(int, input().split()))\r\n# total_cookies = sum(bags)\r\n# total_ways = 0\r\n\r\n# for cookies in bags:\r\n# if (total_cookies - cookies) % 2 == 0:\r\n# total_ways += 1\r\n\r\n# print(total_ways)\r\n\r\n_ = input()\r\nbags = list(map(int, input().split()))\r\n\r\ntotal_ways = len([0 for cookies in bags if (sum(bags)-cookies) % 2 == 0])\r\n\r\nprint(total_ways)", "n=int(input())\r\ncookies=list(map(int,input().split()))\r\ncount=0\r\nfor x in cookies:\r\n\tif (sum(cookies)-x)%2==0:\r\n\t\tcount=count+1\r\nprint(count)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n x = l[:i]+l[i+1:]\r\n if sum(x)%2 == 0 :\r\n c+=1\r\nprint(c) \r\n", "n = input()\n\nnums = [int(x) for x in input().split(\" \")]\n\ntotal = sum(nums)\nways = 0\n\nfor num in nums:\n\tif (total - num) % 2 == 0:\n\t\tways += 1\n\nprint(ways) ", "n = int(input())\r\nA = list(map(int,input().split()))\r\nb = 0\r\nfor i in range(n):\r\n if (sum(A) - A[i]) % 2 == 0:\r\n b += 1\r\nprint(b)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(0,n):\r\n sum+=l[i]\r\nways=0\r\nfor i in range(0,n):\r\n if (sum-l[i])%2==0:\r\n ways+=1\r\nprint(ways)", "n = int(input())\r\ncookies = list(map(int, input().split()))\r\nnum_odd = 0\r\nfor count in cookies:\r\n if count & 1:\r\n num_odd += 1\r\nif sum(cookies) & 1:\r\n print(num_odd)\r\nelse:\r\n print(n - num_odd)\r\n", "n=int(input());l=list(map(int,input().split()));eve,odd=0,0\r\nfor i in l:\r\n if i%2 == 0:\r\n eve+=1\r\n else:\r\n odd+=1\r\nif odd%2==0:\r\n print(eve)\r\nelse:\r\n print(odd)", "x = int(input())\r\ny = [int(i) for i in input().split()]\r\na = sum(y)\r\nb = 0\r\nfor i in y:\r\n if (a - i) % 2 == 0:\r\n b += 1\r\nprint(b)", "l=int(input())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\nc_e=0\r\nc=0\r\nfor i in range (l):\r\n if arr[i]%2==0:\r\n c_e+=1\r\n else:\r\n c+=1\r\nif s%2==0:\r\n print(c_e)\r\nelse:\r\n print(c)\r\n", "n = int(input())\r\npckts = [int(i) for i in input().split(' ')]\r\nsumm = sum(pckts)\r\npckts = sum(list(map(lambda x : x%2, pckts)))\r\nscenario = bool(summ % 2)\r\nif not scenario:\r\n print(n - pckts)\r\nelse : \r\n print(pckts)", "s=int(input())\r\nl=list(map(int,input().split()))\r\nm,n,u=0,0,0\r\nfor i in l:\r\n\tu+=i\r\n\tif i%2:\r\n\t\tm+=1\r\n\telse:n+=1\r\nif u%2:\r\n\tprint(m)\r\nelse:print(n)", "count_of_package = int(input())\r\ncookies = [int(x) for x in input().split()]\r\neven_number_of_coockies = 0\r\nodd_number_of_cookies = 0\r\ni = 0\r\nwhile i < count_of_package:\r\n\tif cookies[i]%2 == 0:\r\n\t\teven_number_of_coockies += 1\r\n\telse:\r\n\t\todd_number_of_cookies += 1\r\n\ti += 1\r\nif sum(cookies)%2 == 0:\r\n\tprint(even_number_of_coockies)\r\nelse:\r\n\tprint(odd_number_of_cookies)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\no,e=0,0\r\nfor i in lst:\r\n if(i%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nif(o%2==0):\r\n print(e)\r\nif(o%2!=0):\r\n print(o)\r\n ", "n=int(input())\r\ns=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if sum(s)%2==0:\r\n if s[i]%2==0:\r\n count+=1\r\n else:\r\n if s[i]%2==1:\r\n count+=1\r\nprint(count)\r\n\r\n", "n = int(input())\r\nsingle_bag_cookies = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor item in single_bag_cookies:\r\n new_list = single_bag_cookies[:]\r\n new_list.remove(item)\r\n if sum(new_list)%2 == 0:\r\n count += 1\r\nprint(count)", "n = int(input())\npar = 0\nimpar = 0\nbags = input().split()\nfor i in range(n):\n num = int(bags[i])\n if num%2 == 0:\n par += 1\n else:\n impar += 1\n\nif impar%2 == 0:\n print(par)\nelse:\n print(impar)\n ", "n, y, x, mm, count= int(input()), 0, 0, input(), 0\r\narr= mm.split(\" \")\r\nwhile(n!=0):\r\n m= int(arr[count])\r\n if(m%2==0):\r\n x+=1\r\n else:\r\n y+=1\r\n n-=1\r\n count+=1\r\nif(y%2==1):print(y)\r\nelse:print(x) ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ns = sum(a)\r\nodd = 0\r\nfor i in a:\r\n if i & 1:\r\n odd += 1\r\nif s & 1:\r\n print(odd)\r\nelse:\r\n print(n - odd)", "input()\nl = list(map(lambda x: int(x), input().split()))\ns = sum(l)\nways = 0\nfor i in l:\n if (s - i) % 2 == 0: ways += 1 \nprint(ways)\n\n \t\t\t \t \t\t\t\t\t \t\t \t\t", "n=int(input())\r\nlst=[int(i)for i in input().split()]\r\nsu=sum(lst)\r\nfor i in lst:\r\n if (su-i)%2:\r\n n-=1\r\nprint(n)\r\n ", "n = int(input())\narr = []\narr = input().split()\n\nsuma = 0; ans = 0\n\nfor i in range (0,n):\n suma += int(arr[i])\n\nfor i in range(0,n):\n if ((suma - int(arr[i]) ) % 2 == 0):\n ans += 1\n\nprint(ans)\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nS = sum(s)\r\nans = 0\r\nfor i in range(n):\r\n if (S - s[i]) % 2 == 0:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nd = [int(_) for _ in input().split()]\r\nx = 0\r\nfor i in d:\r\n if (sum(d)-i)%2==0:\r\n x+=1\r\nprint(x)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split(\" \")] \r\nnb=0\r\ns=sum(l)\r\nfor i in range(n):\r\n if((s-l[i])%2==0):\r\n nb+=1\r\nprint(nb)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ns = eve = odd = 0\r\n\r\nfor x in a:\r\n s += x\r\n if x & 1:\r\n odd += 1\r\n else:\r\n eve += 1\r\n\r\nif s & 1:\r\n print(odd)\r\nelse:\r\n print(eve)", "from typing import Counter\r\n\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nres=sum(l)\r\ncount=0\r\nif res%2==0:\r\n for x in l:\r\n if x %2==0:\r\n count +=1\r\nelse:\r\n for x in l:\r\n if x%2!=0:\r\n count+=1\r\nprint(count)", "\r\nn = input()\r\na = 0\r\nb = 0\r\nfor i in list(map(int, input().split())):\r\n if i % 2:\r\n a += 1\r\n else:\r\n b += 1\r\nif a % 2:\r\n print(a)\r\nelse:\r\n print(b)\r\n", "n = int(input())\r\ncakes = []\r\nres = 0\r\ncsum = 0\r\n\r\ncakes.append(list(map(int,input().split())))\r\n\r\nfor i in range(n):\r\n csum += cakes[0][i]\r\n\r\nfor i in range(n):\r\n a = cakes[0][i]\r\n\r\n if (csum - a) % 2 == 0:\r\n res += 1\r\n\r\nprint(res)\n# Mon Sep 27 2021 01:11:14 GMT+0300 (Москва, стандартное время)\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk = list(filter(lambda x : x%2,l))\r\nprint([n-len(k),len(k)][sum(l)%2])", "n = int(input())\r\nb = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n\tif (sum(b)-b[i]) % 2 == 0:\r\n\t\tc+=1\r\n \r\nprint(c)", "t=int(input())\r\nk=0\r\nl=0\r\na=input().split()\r\na=list(map(int,a))\r\nfor i in range(len(a)):\r\n if(a[i]%2==0):\r\n k+=1\r\n else:\r\n l+=1\r\nif(l%2==0):\r\n print(k)\r\nelse:\r\n print(l)", "n = int(input())\r\ncookies = list(map(int,input().split()))\r\n\r\nsuum = sum(cookies)\r\ntries = 0\r\n\r\nfor i in range(n):\r\n if (suum - cookies[i]) % 2 == 0:\r\n tries += 1\r\nprint(tries)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum1=sum(a)\r\ncnt=0\r\nif sum1%2==0:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n cnt+=1\r\nelse:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n cnt+=1\r\nprint(cnt) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nc2=0\r\nm=sum(l)\r\nfor i in l:\r\n if i%2==0:\r\n c+=1\r\n else:\r\n c2+=1\r\nif m%2==0:\r\n print(c)\r\nelse:\r\n print(c2)", "n = int(input())\r\nt = list(map(int, input().split()))\r\nm = sum(t) % 2\r\nprint(sum(i % 2 == m for i in t))", "n = int(input())\narr = list(map(int, input().split()))\n\ntotal_sum = sum(arr)\ncount = 0\nfor i in range(n):\n if (total_sum-arr[i])%2 == 0:\n count += 1\nprint(count)\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nu=0;f=sum(a)\r\nif f%2==0:c=0\r\nelse:\r\n c=1\r\nfor i in range(n):\r\n if a[i]%2==c:\r\n u+=1\r\nprint(u)", "bags = int(input())\ncookies = []\ntotal = 0\nsolutions = 0\n\ncookies = [int(num) for num in input().split(' ')]\n\nfor cookie in cookies:\n total += cookie\n\nfor el in cookies:\n option = total - el\n if option == 0 or option % 2 == 0:\n solutions += 1\n\nprint(solutions)\n", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nk=[int(x) for x in a if x%2!=0]\r\nif len(k)%2==0:\r\n print(n-len(k))\r\nelif n==len(k):\r\n print(n)\r\nelif (sum(a)-sum(k))%2==0:\r\n print(len(k))\r\nelse:\r\n print(1)", "def solution():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\r\n\tsm=sum(arr)\r\n\r\n\tans=0\r\n\tfor i in arr:\r\n\t\tk=sm-i\r\n\t\tif k==0 or k%2==0:\r\n\t\t\tans+=1\r\n\tprint(ans)\r\n\r\n\r\n\treturn\r\n\r\n\r\n# t=int(input())\r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "n= int(input())\r\na= list(map(int,input().split()))\r\nprint(len(list(filter(lambda x: x%2 , a )))if sum(list(filter(lambda x: x%2 , a ))) % 2 else len(list(filter(lambda x: x%2==0 , a ))) )", "input()\r\na=list(map(int,input().split()))\r\nprint(sum([x%2==sum(a)%2 for x in a]))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nc=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n c=c+1\r\nif(s%2==0):\r\n print(c)\r\nelse:\r\n print(n-c)", "n = input()\r\nn = int(n)\r\n\r\na = list(map(int, input().split()))\r\n\r\nsum = 0\r\nfor i in a:\r\n sum += i\r\n\r\nans = 0\r\nfor i in a:\r\n sum -= i\r\n if sum % 2 == 0:\r\n ans += 1;\r\n sum += i\r\n \r\nprint(ans)\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = sum(l)\r\nt = 0\r\nfor b in l:\r\n if (s - b) % 2 == 0:\r\n t += 1\r\nprint(t)", "n = int(input())\nbags = input().split()\nsoma = 0\nfor i in bags:\n\tsoma+= int(i)\n\nqtd = 0\nfor i in bags:\n\tif (soma - int(i))%2 == 0:\n\t\tqtd+=1\n\nprint(qtd)", "n = int(input())\r\n\r\nlb = list(map(int, input().split()))\r\nsb = sum(lb)\r\nt = 0\r\n\r\nfor b in lb:\r\n if (sb - b) % 2 == 0:\r\n t += 1\r\n\r\nprint(t)", "#A. Cookies\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ne = 0\r\no = 0\r\nfor i in a:\r\n if i%2!=0:\r\n o+=1\r\n else:\r\n e+=1\r\ns = sum(a)\r\nif s%2==0:\r\n print(e)\r\nelse:\r\n print(o)", "n = int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n even, odd, total = 0, 0, 0\r\n nums = list(map(int, input().split()))\r\n for elem in nums:\r\n if elem%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n total+=elem\r\n if total%2==0:\r\n print(even)\r\n else:\r\n print(odd)\r\n \r\n", "n = int(input())\ntab = list(map(int, input().split()))\nif sum(tab) % 2 == 0:\n print(len(list(filter(lambda x: x % 2 == 0, tab))))\nelse:\n print(len(list(filter(lambda x: x % 2 == 1, tab))))\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ns = sum(arr)%2\r\nprint(len([i for i in arr if i%2 == s]))\r\n", "n=int(input())\narr=[int(x) for x in input().split(' ')]\ntotal=sum(arr)\nodds=len([x for x in arr if x&1])\nif total&1:\n\tprint(odds)\nelse:\n\tprint(n-odds)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ns=sum(a)\r\nres=0\r\nif s%2==0:\r\n for i in a:\r\n if i%2==0:\r\n res+=1\r\nelse:\r\n for i in a:\r\n if i%2!=0:\r\n res+=1\r\nprint(res)", "'''s=input()\r\nt=input()\r\nv1=[]\r\nv2=[]\r\nv=['a', 'e','i','o','u']\r\nres=None\r\nif len(s)!=len(t):\r\n print('No')\r\nelse:\r\n for i in s:\r\n if i in v:\r\n v1.append('0')\r\n else:\r\n v1.append('1')\r\n for i in t:\r\n if i in v:\r\n v2.append('0')\r\n else:\r\n v2.append('1')\r\n for i in range(len(t)):\r\n if v1[i]!=v2[i]:\r\n res=False\r\n break\r\n else:\r\n res=True\r\n if res:\r\n print('Yes')\r\n else:\r\n print('No')\r\n''' #Номер 2\r\n\"\"\"\r\na=int(input())\r\nb=[int(i) for i in input().split()]\r\nfor i in range(a-1):\r\n if i%2==0:\r\n b.sort()\r\n b.pop()\r\n else:\r\n b.sort(reverse=True)\r\n b.pop()\r\nprint(*b)\"\"\"#Номер 3\r\na=int(input())\r\nb=[int(i) for i in input().split()]\r\nres=0\r\nfor i in b:\r\n c=b.copy()\r\n c.pop(b.index(i))\r\n if sum(c)%2==0:\r\n res+=1\r\nprint(res)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nsum1 = sum(a)\r\nres = 0\r\n\r\nfor bag in a:\r\n if sum1 & 1 and bag & 1:\r\n res += 1\r\n elif not(sum1 & 1) and not(bag & 1):\r\n res += 1\r\n\r\nprint(res)\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\nl = li()\r\nans = 0\r\ns = sum(l)\r\nfor i in l:\r\n if (s-i) % 2 == 0:\r\n ans += 1\r\nprint(ans)", "n=int(input());a=[*map(int,input().split())]\r\nb=sum(x%2 for x in a)\r\nprint([n-b,b][sum(a)%2])", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nif sum(a) % 2 != 0:\r\n print(len(list(filter(lambda x: x % 2 != 0, a))))\r\n\r\nelse:\r\n print(len(list(filter(lambda x: x % 2 == 0, a))))", "n = int (input ())\r\ns = list(map(int,input().split()))\r\ncounter = 0\r\na = sum (s)\r\nfor i in range (n):\r\n if (a - s[i]) % 2 == 0:\r\n counter += 1\r\nprint (counter)", "a=int(input())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n\tif i%2!=0:\r\n\t\tcount+=1\r\nif count%2==0:\r\n\tprint(a-count)\r\nelse:\r\n\tprint(count)", "z=int(input())\r\na=list(map(int,input().split()))\r\nx=sum(a)%2\r\nd=0\r\nfor i in a:\r\n if x-(i%2)==0:\r\n d+=1\r\nprint(d)\r\n", "n = int(input())\na = list(map(int, input().split()))\nodd = 0\nfor x in a:\n if x % 2 == 1:\n odd += 1\nif odd % 2 == 1:\n print(odd)\nelse:\n print(n - odd)", "n = int(input())\na = [int(i) for i in input().split()]\n#print(a)\ngive = 0\nfor i in range(n):\n if (sum(a) - a[i]) % 2 == 0:\n \n give += 1\nprint(give)\n", "x = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(len(l)):\r\n if i == 0:\r\n if sum(l[i+1:]) % 2 == 0:\r\n s+= 1\r\n elif i != 0 and i != len(l)-1:\r\n if (sum(l[:i]) + sum(l[i+1:])) %2 == 0:\r\n s += 1\r\n elif i == len(l)-1:\r\n if sum(l[:i]) % 2 == 0:\r\n s+= 1\r\nprint(s)\r\n\r\n \r\n\r\n", "n = int(input())\r\narr = input()\r\nsum_cookies = 0\r\nans = 0\r\nnum = [int(i) for i in arr.split()]\r\nfor i in num:\r\n sum_cookies += i\r\n if i & 1:\r\n ans += 1\r\nif sum_cookies & 1:\r\n print(ans)\r\nelse:\r\n print(n - ans)\r\n\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nif sum(x)%2==0:\r\n c=0\r\n for i in x:\r\n if i%2==0:\r\n c+=1\r\n print(c)\r\nelse:\r\n c = 0\r\n for i in x:\r\n if i % 2 == 1:\r\n c += 1\r\n print(c)", "n = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\nb=[]\r\ncount=0\r\nfor i in range(n):\r\n for j in range(len(a)):\r\n if i!=j :\r\n b.append(a[j])\r\n else: b.append(0)\r\n\r\n\r\n sum1 = sum(b)\r\n if sum1%2==0:\r\n count=count+1\r\n \r\n b=[]\r\n\r\nprint(count)", "t=int(input())\r\nx=[int(q) for q in input().split()]\r\nprint(sum([i%2==sum(x)%2 for i in x]))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Aug 4 21:43:50 2020\n\n@author: vru\n\"\"\"\nn = int(input())\nx = []\nx = input().split()\ns = 0\nflag = 0\nfor i in range(len(x)):\n x[i] = int(x[i])\n s = s + x[i]\nfor i in range(len(x)):\n if (s-x[i])%2 ==0:\n flag = flag + 1\nprint(flag) \n\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nm=0\r\nfor i in range(n):\r\n\tif s%2==0:\r\n\t\tif a[i]%2==0:\r\n\t\t\tm+=1\r\n\telse:\r\n\t\tif a[i]%2!=0:\r\n\t\t\tm+=1\r\nprint(m)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nv = 0\r\nc = 0\r\nfor i in l:\r\n c+=i\r\nfor i in l:\r\n if (c-i)%2 == 0:\r\n v+=1\r\nprint(v)\r\n", "n = int(input())\r\no = 0\r\ne = 0\r\na = input().split()\r\ns = [int(i) for i in a]\r\nfor i in s:\r\n if i%2 == 1:\r\n o+=1\r\n else:\r\n e+=1\r\nif o%2 == 1:\r\n print(o)\r\nelse:\r\n print(e)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=[i%2 for i in l]\r\nprint((sum(l)%2)*l.count(1)+(1-sum(l)%2)*l.count(0))", "N=int(input())\n\nA=list(map(int,input().split()))\nx=sum(A)\nans=0\nfor i in range(N):\n if((x-A[i])%2==0):\n ans+=1\n\nprint(ans)\n", "n=int(input())\r\nll=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n sum=0\r\n for j in range(n):\r\n if i!=j:\r\n sum+=ll[j]\r\n if sum%2==0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncookies = list(map(int, input().split()))\r\neven_cookies = odd_cookies = 0\r\n\r\nfor cookie in cookies:\r\n if cookie % 2 == 0:\r\n even_cookies += 1\r\n else:\r\n odd_cookies += 1\r\n\r\nif odd_cookies % 2 == 0:\r\n print(even_cookies)\r\nelse:\r\n print(odd_cookies)", "n=int(input())\r\na=list(map(int,input().split()))\r\no=0\r\ne=0\r\nfor i in a:\r\n if(i%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\ns=sum(a)\r\nif(s%2==0):\r\n print(e)\r\nelse:\r\n print(o)", "num = int(input())\r\nbags = list(map(int, input().split()))\r\ntotal = sum(bags)\r\neven = [x for x in bags if x % 2 == 0]\r\nodd = [x for x in bags if x % 2 != 0]\r\nif total % 2 == 0:\r\n print(len(even))\r\nelse:\r\n print(len(odd))", "n = int(input())\r\n\r\nbags = input().split(' ')\r\n\r\nfor i in range(n):\r\n bags[i] = int(bags[i])\r\n\r\ntotal = sum(bags)\r\n\r\nif total % 2 == 0:\r\n print(len(list(filter(lambda x: x % 2 == 0, bags))))\r\nelse:\r\n print(len(list(filter(lambda x: x % 2 != 0, bags))))", "n=int(input())\r\nl = list(map(int,input().strip().split()))[:n]\r\nodd=even=0\r\nfor i in l:\r\n if i%2==0:\r\n even+=1 \r\n else:\r\n odd+=1 \r\ncount=0\r\nif odd%2==0:\r\n count=even\r\nelse:\r\n count=odd \r\nprint(count)", "# https://codeforces.com/contest/129/problem/A\r\n\r\nn = int(input())\r\n\r\ncookies = map(int, input().split())\r\n\r\neven = odd = total = 0\r\nfor i in cookies:\r\n total += i\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif total % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "n = int(input())\nsum = 0\n\nnums = [int(x) for x in input().split()]\n\nfor v in nums:\n sum += v\n \ncount = 0\nif sum % 2 == 0:\n for v in nums:\n if v % 2 == 0:\n count+=1;\n\nif sum % 2 != 0:\n for v in nums:\n if v % 2 != 0:\n count+=1;\n\nprint(count);", "n=int(input())\r\nl=list(map(int,input().split()))\r\nle,lo=[],[]\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n le.append(l[i])\r\n else:\r\n lo.append(l[i])\r\nif(sum(l)%2==0):\r\n print(len(le))\r\nelse:\r\n print(len(lo))\r\n", "n=int(input())\nl=list(map(int,input().strip().split()))\n\n\n\n\n\nr=0\n\ns = sum(l)\nfor j in l:\n\tif (s-j)%2==0:\n\t\tr+=1\nprint(r)", "size = int(input())\r\ncookies = [int(i) for i in input().split()]\r\nans = sum(cookies)\r\nodd = [n for n in cookies if (n & 1) == 1]\r\noddLen = len(odd)\r\nevenLen = size - oddLen\r\nif (ans & 1) == 1:\r\n print(oddLen)\r\nelse:\r\n print(evenLen)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsum1 = sum(arr)\r\nodd, even, ans = 0, 0, 0\r\nfor i in range(len(arr)):\r\n if arr[i] % 2 == 1:\r\n odd += 1\r\n else:\r\n even += 1\r\nif sum1 % 2 == 0:\r\n ans = even\r\nif sum1 % 2 == 1:\r\n ans = odd\r\nprint(ans)", "# Templates for the inputs:\r\nfrom typing import List\r\nfrom collections import Counter, defaultdict\r\nimport sys\r\n\r\ndef stringInput() -> str:\r\n return sys.stdin.readline()\r\n \r\ndef listInput() -> List[int]:\r\n return list(map(int, input().split()))\r\n \r\ndef string_list() -> List[int]:\r\n return list(input())\r\ndef intInput() -> int:\r\n return int(input())\r\n \r\n\r\n \r\ndef solve():\r\n # Write your code here...\r\n num_bags = intInput()\r\n list_ = listInput()\r\n total = sum(list_)\r\n \r\n tmp = 0\r\n for num in list_:\r\n if (total - num) % 2 == 0:\r\n tmp += 1\r\n print(tmp)\r\n \r\n \r\n \r\n# Driver code... \r\nif __name__ == '__main__':\r\n solve()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \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\nt=sum(i%2==0 for i in a)\r\nprint([t,n-t][sum(a)%2!=0])\r\n", "N = int(input())\r\nls = list(map(int, input().split()))\r\nm = sum(ls)%2\r\ncnt = 0\r\nfor i in ls:\r\n if i%2==m: cnt+=1\r\nprint(cnt)\r\n", "n = int(input())\nA = list(map(int, input().split()))\n\nc = 0\nfor a in A:\n if (sum(A) - a) % 2 == 0:\n c += 1\n\nprint(c)\n", "n = int(input())\ncookies = [int(i) for i in input().split()]\n\nways = 0\nsum = 0\nfor c in cookies:\n sum += c\n\nif sum % 2 == 0:\n for c in cookies:\n if c % 2 == 0:\n ways += 1\nelse:\n for c in cookies:\n if c % 2 == 1:\n ways += 1\n\nprint(ways)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 15 20:41:10 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\ns.sort()\r\nj = 0\r\nfor i in s:\r\n j += i\r\nans = 0\r\nif j % 2 == 0:\r\n for i in s:\r\n if i % 2 == 0:\r\n ans += 1\r\n print(ans)\r\nelse:\r\n for i in s:\r\n if i % 2 != 0:\r\n ans += 1\r\n print(ans)", "n = int(input())\nv = list(map(int, input().split()))\no = sum(i % 2 for i in v)\ne = n - o\nprint([e, o][sum(v) % 2])\n", "sayi=int(input())\r\ncanta=input().split()\r\ntoplam=0\r\nsonuc=0\r\nfor n in canta:\r\n toplam+=int(n)\r\nfor n in canta:\r\n if (toplam-int(n))%2==0:\r\n sonuc+=1\r\nprint(sonuc)", "__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 count_stealing_ways(n: int, cookie_bags: list) -> int:\r\n sum_cookies = sum(cookie_bags)\r\n temp = sum_cookies % 2\r\n\r\n return sum(1 for bag in cookie_bags if bag % 2 == temp)\r\n\r\n\r\ndef main() -> int:\r\n n = int(input())\r\n cookie_bags = [int(word) for word in input().split()]\r\n\r\n print(count_stealing_ways(n, cookie_bags))\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "n = int(input())\ns2 = input()\nt = []\nk = 0\nfor i in range(0, n):\n t.append(int(s2.split()[i]))\no = 0\ne = 0\nfor i in range(0, n):\n if t[i] % 2 == 0:\n e += 1\n else:\n o += 1\nif o % 2 == 0:\n k = e\nelif o == 1:\n k = 1\nelse:\n k = o\nprint(k)\n", "n = int(input())\ncookies = [int(x) for x in input().split(' ')]\n\ntotal = 0\neven = 0\nodd = 0\nfor i in range(n):\n\tif cookies[i] % 2 == 0:\n\t\teven += 1\n\telse:\n\t\todd += 1\n\ttotal += cookies[i]\n\nif total % 2 == 0:\n\tprint(even)\nelse:\n\tprint(odd)", "n = int(input())\na = list(map(int,input().split(' ')))\ns = sum(a)\n\ncnt = 0\nfor x in a:\n if (s - x)%2==0:\n cnt += 1\nprint(cnt)\n\n", "N = int(input())\r\nArr = list(map(int,input().split()))\r\nSum = sum(Arr)\r\nCount = 0\r\nfor i in range(N):\r\n if ( Sum - Arr[i] ) % 2 == 0:\r\n Count = Count + 1\r\n\r\nprint(Count)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = sum(l)\r\nans = 0\r\nfor i in l:\r\n if (s - i) % 2 == 0: ans -= -1\r\nprint(ans)", "y=int(input())\r\nx=list(map(int,input().split()))\r\np=0\r\nfor i in x:\r\n if i%2==0:p+=1\r\nprint(p if sum(x)%2==0 else y-p) ", "numCookies = int(input())\r\nlist = [int(x) for x in input().split(\" \")]\r\nSum = sum(list)\r\nsol = 0\r\nif Sum %2 == 0:\r\n for num in list:\r\n if num%2==0:\r\n sol+=1\r\nelse:\r\n for num in list:\r\n if num%2!=0:\r\n sol+=1\r\nprint(sol)", "n=int(input())\r\ns=[int(x)%2 for x in input().split()]\r\nprint(s.count(sum(s)%2))", "n,c=int(input()),0\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nfor i in range(n):\r\n\tif (s-l[i])%2==0:\r\n\t\tc+=1\r\nprint(c)", "n = int(input())\r\n\r\nnEven = 0\r\nnOdd = 0\r\n\r\nfor i in input().split():\r\n\r\n if (int(i) & 1) == 0:\r\n nEven += 1\r\n else:\r\n nOdd += 1\r\n\r\n\r\nif nOdd & 1 == 0:\r\n print(abs(nEven))\r\nelse:\r\n print(nOdd)", "n = int(input())\r\na = map(int, input().split())\r\n\r\nn0 = n1 = 0\r\nfor x in a:\r\n if x % 2 == 0:\r\n n0 += 1\r\n else:\r\n n1 += 1\r\n\r\nif n0 == 0 and n1 % 2 == 1:\r\n print(n1)\r\nelif n0 == 0 and n1 % 2 == 0:\r\n print(0)\r\nelif n1 == 0:\r\n print(n0)\r\nelse:\r\n if n1 % 2 == 1:\r\n print(n1)\r\n else:\r\n print(n0)\r\n", "n = int(input())\r\nbags = list(map(int, input().split()))\r\n\r\nodd_count = 0\r\nfor cookies in bags:\r\n if cookies % 2 == 1:\r\n odd_count += 1\r\n\r\neven_count = n - odd_count\r\n\r\nif odd_count % 2 == 0:\r\n print(even_count)\r\nelse:\r\n print(odd_count)\r\n", "n = int(input())\r\nbags = list(map(int, input().split()))\r\nways = 0\r\nfor i in bags:\r\n if (sum(bags) - i) % 2 == 0:\r\n ways += 1\r\n else:\r\n pass\r\nprint(ways)", "c=int(input())\r\na=input()\r\na=a.split()\r\ncon=0\r\nfor k in range (len(a)):\r\n a[k]=int(a[k])\r\nb=sum(a)\r\nfor t in range(len(a)):\r\n if (b-a[t])%2==0:\r\n con=con+1\r\nprint(con)", "bags = int(input())\ncookies = input()\ncookies = cookies.split()\ncounter = 0\n\nfor i in range(len(cookies)):\n cookies[i] = int(cookies[i])\n\nfor i in range(len(cookies)):\n\n if (sum(cookies)-cookies[i])%2 == 0:\n counter += 1\nprint(counter)", "import sys\n\ndef main():\n\n n = int(input())\n arr = list(map(int, sys.stdin.readline().split()))\n\n s = sum(arr)\n c = 0\n\n for val in arr:\n if (s - val) % 2 == 0:\n c += 1\n\n return c\n\nprint(main())", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\na = 0\r\nfor i in s:\r\n a += i\r\nb = 0\r\nfor i in s:\r\n if (a-i)%2 == 0:\r\n b += 1\r\nprint(b)", "from collections import Counter\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\ns=sum(lst)\r\na = Counter(lst)\r\nans=0\r\n# print(a)\r\nfor i in a:\r\n if s%2==0 and i%2==0:\r\n ans+=a[i]\r\n elif s%2==1 and i%2==1:\r\n ans+=a[i]\r\nprint(ans)\r\n\r\n", "n=int(input());sum=0;even=0;odd=0\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n sum+=i\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif sum%2==0: print(even)\r\nelse:print(odd)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(n):\r\n if (sum(A) - A[i]) % 2 == 0:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nsm = sum(a)\ncnt = 0\nfor i in range(n):\n if (sm-a[i])%2 == 0:\n cnt += 1\n \nprint(cnt)\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\np=sum(t)\r\nq=0\r\nfor j in range(n):\r\n if (p-t[j])%2==0:\r\n q+=1\r\nprint(q)\r\n", "#July 4, 2014\r\nx=input()\r\nsa=input().split(' ')\r\nsa2=[int(t) for t in sa]\r\neven=0\r\nodd=0\r\n\r\nfor element in sa2:\r\n if element%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n \r\nsumx=sum(sa2)\r\nif sumx%2==0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)%2==0:\r\n count_=0\r\n for i in a:\r\n if i%2==0:\r\n count_+=1\r\n print(count_)\r\nelif sum(a)%2==1:\r\n count_=0\r\n for i in a:\r\n if i%2==1:\r\n count_+=1\r\n print(count_)", "n=input();l=sorted(map(int, input().split()))\r\nc = 0\r\nfor i in range(int(n)):\r\n if (sum(l) - l[i]) % 2 == 0:\r\n c += 1\r\nprint(c) ", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\ns = sum(arr)\r\ncounter = 0\r\nfor i in arr:\r\n if (s - i) % 2 == 0:\r\n counter += 1\r\n\r\nprint(counter)", "#Cookies\r\nodd=0\r\nbags=int(input())\r\ncoo=input()\r\nmoo=coo.split()\r\n\r\n\r\nfor j in moo:\r\n if int(j)%2!=0:\r\n odd+=1\r\n\r\nif odd==1:\r\n print(1)\r\nelif odd%2==1:\r\n print(odd)\r\nelse:\r\n print(bags-odd)", "ways = 0;\r\n\r\n# number of elements as input\r\nn = int(input())\r\nlst = a = list(map(int, input().strip().split()))[:n]\r\n# iterating till the range\r\n# adding the element\r\n\r\nfor i in range(0, n):\r\n if ((sum(lst)-lst[i]) % 2 == 0):\r\n ways += 1\r\n\r\nprint(ways)", "import sys\r\nimport 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 non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\ns = sum(lst)\r\nif s%2 == 0:\r\n count = 0\r\n for i in range(n):\r\n if lst[i]%2 == 0:\r\n count += 1\r\n print(count)\r\nelse:\r\n count = 0\r\n for i in range(n):\r\n if lst[i]%2 != 0:\r\n count += 1\r\n print(count)", "s = int(input(\"\"))\nel = input(\"\")\narr = el.split(\" \")\nfor i in range(0, s):\n arr[i] = int(arr[i])\ntotal = sum(arr)\ncount = 0\nfor j in range(0, s):\n rem = total - arr[j]\n if rem%2 == 0:\n count+=1\nprint(count) ", "a = int(input())\r\nb = input().split()\r\n\r\nssum = 0\r\nfor x in range (0,a):\r\n\tssum = ssum + int(b[x])\r\n\r\nse = 0\r\nif ssum%2 == 0:\r\n\tse = 1\r\n\r\nnum = 0\r\nif se == 0:\r\n\t#find all the odds\r\n\tfor y in range(0,a):\r\n\t\tif int(b[y])%2 != 0:\r\n\t\t\tnum = num+1\r\nelse:\r\n\t#find all the evens\r\n\tfor z in range (0,a):\r\n\t\tif int(b[z])%2 == 0:\r\n\t\t\tnum = num+1\r\n\r\nprint(str(num))", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\ns=sum(arr)\r\nc=0\r\nfor i in arr:\r\n if (s-i)%2==0:\r\n c=c+1\r\nprint(c)\r\n ", "\r\ndef main_function():\r\n input()\r\n a = [int(i) for i in input().split(\" \")]\r\n sum_of_cookies = sum(a)\r\n counter = 0\r\n if sum_of_cookies % 2:\r\n for i in a:\r\n if i % 2:\r\n counter += 1\r\n else:\r\n for i in a:\r\n if not i % 2:\r\n counter += 1\r\n return counter\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\na = list(map(int, input().split()))\r\nss = sum(a)\r\ncnt = 0\r\nif ss%2 == 0:\r\n\tfor i in a:\r\n\t\tif i%2 == 0:\r\n\t\t\tcnt += 1\r\nelse:\r\n\tfor i in a:\r\n\t\tif i%2 == 1:\r\n\t\t\tcnt += 1\r\nprint (cnt)", "n = int(input())\r\na = list(map(int, input().split()))\r\ntotal = sum(a)\r\nret = 0\r\nif total%2 == 0:\r\n for bag in a:\r\n if bag%2 == 0:\r\n ret +=1\r\nelse:\r\n for bag in a:\r\n if bag%2 == 1:\r\n ret +=1\r\nprint(ret)", "\r\nn = int(input())\r\n\r\nl_b = list(map(int, input().split()))\r\ns_b = sum(l_b)\r\nt = 0\r\n\r\nfor b in l_b:\r\n if (s_b - b) % 2 == 0:\r\n t += 1\r\n\r\nprint(t)", "n1 = input()\r\nn2 = list(map(int, input().split()))\r\ns = sum(n2)\r\neven = []\r\nodd = []\r\nfor i in n2:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif s%2==0:\r\n print(len(even))\r\nelse:\r\n print(len(odd))", "_ = input()\r\nbags = list(map(int, input().split()))\r\ntotal_cookies = sum(bags)\r\ntotal_ways = 0\r\n\r\nfor cookies in bags:\r\n if (total_cookies - cookies) % 2 == 0:\r\n total_ways += 1\r\n\r\nprint(total_ways)", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn = I()\r\narr = L()\r\nev, od = 0, 0\r\nfor i in arr:\r\n if i%2 == 0:\r\n ev += 1 \r\n else:\r\n od += 1\r\nif od%2 != 0:\r\n print(od)\r\nelse:\r\n print(ev)", "n = int(input())\r\ncookies = [int(i) for i in input().split()]\r\nans = 0\r\nquantity = 0\r\n\r\nfor i in cookies:\r\n if i % 2 != 0:\r\n quantity += 1\r\n\r\nif quantity % 2 == 0:\r\n ans = n - quantity\r\nelse:\r\n ans = quantity\r\n\r\nprint(ans)", "# Author: SaykaT\r\n# Problem: 129AA.py\r\n# Time Created: August 24(Monday) 2020 || 12:23:17\r\n\r\n#>-------------------------<#\r\nimport sys\r\n\r\ninput = sys.stdin.readline\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 = int(input())\r\n ls = list(map(int, input().split()))\r\n\r\n odd_count = 0\r\n for i in ls:\r\n if i % 2 == 1:\r\n odd_count += 1\r\n if odd_count % 2 == 1:\r\n print(odd_count)\r\n else:\r\n print(n - odd_count)\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "n = int(input())\narr = [int(num) for num in input().split()]\narr_sum = sum(arr)\ncount = 0\nfor num in arr:\n\tif(arr_sum - num) % 2 == 0:\n\t\tcount += 1\nprint(count)", "n =int(input())\r\na = [int(x) for x in input().split()]\r\nsumm = sum(a)\r\nc=0\r\nfor x in a:\r\n if (summ-x)%2==0:\r\n c+=1\r\nprint(c)", "# Templates for the inputs:\r\nfrom typing import List\r\nfrom collections import Counter, defaultdict\r\nimport sys\r\n\r\ndef stringInput() -> str:\r\n return sys.stdin.readline()\r\n \r\ndef listInput() -> List[int]:\r\n return list(map(int, input().split()))\r\n \r\ndef string_list() -> List[int]:\r\n return list(input())\r\ndef intInput() -> int:\r\n return int(input())\r\n \r\n\r\n \r\ndef solve():\r\n # Write your code here...\r\n num_bags = intInput()\r\n list_ = listInput()\r\n \r\n forward = [0]\r\n backward = [0]\r\n \r\n for num in list_:\r\n forward.append(num + forward[-1])\r\n \r\n inverted = list_[::-1]\r\n \r\n for num in inverted:\r\n backward.append(num + backward[-1])\r\n \r\n backward.reverse()\r\n tmp = 0\r\n for i in range(len(list_)):\r\n if (forward[i] + backward[i+1]) % 2 == 0:\r\n tmp += 1\r\n \r\n \r\n print(tmp)\r\n \r\n \r\n# Driver code... \r\nif __name__ == '__main__':\r\n solve()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "input()\r\nmat = list(map(int, input().split()))\r\ntot = sum(mat)\r\nprint(len([v for v in mat if v&1==0]) if tot&1==0 else len([v for v in mat if v&1==1]))\r\n", "n = int(input())\r\na = [int(x) for x in input().split(\" \")] \r\nj=0\r\nfor i in range(n):\r\n b= list(a)\r\n b.pop(i)\r\n if sum(b)%2==0:\r\n \r\n j+=1\r\nprint(j)", "n = input()\r\ncoockies = list(map(int, input().split()))\r\ns = sum(coockies)\r\nans = 0\r\nif s % 2 == 0:\r\n ans = len([x for x in coockies if x % 2 == 0])\r\nelse:\r\n ans = len([x for x in coockies if x % 2 == 1])\r\nprint(ans, end=\"\")\r\n", "n= int(input())\r\nval = list(map(int, input().split()))\r\ntotal = sum(val)\r\ncount =0\r\nrem = total % 2\r\n\r\nfor i in range(n):\r\n if val[i] % 2 ==rem:\r\n count +=1\r\n\r\nprint(count)", "n = int(input())\r\nlist = [int(i) for i in input().split()]\r\nnum = 0\r\nif sum(list)%2 == 0:\r\n for i in list:\r\n if i % 2 == 0:\r\n num += 1\r\nelse:\r\n for i in list:\r\n if i % 2 != 0:\r\n num += 1\r\nprint(num)\r\n", "hat = int(input())\r\nlst = [int(x) for x in input().split()]\r\nodd = 0\r\nfor i in lst:\r\n if i % 2 == 1:\r\n odd += 1\r\nif odd % 2 == 0:\r\n print(hat - odd)\r\nelse:\r\n print(odd)\r\n", "n = int(input())\na = [int(s) for s in input().split()]\n\nsum = 0\nans = 0\nfor i in a:\n sum += i\n if i % 2 == 1:\n ans += 1\n\nif sum % 2 == 0:\n print(n-ans)\nelse:\n print(ans)", "n = int(input())\r\nl = [int(i) for i in input().split()][:n] #n space seprated integers input\r\ncount = 0\r\nfor i in l:\r\n s=sum(l)-i\r\n if(s%2==0):\r\n count+=1\r\n\r\nprint(count)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nd=0\r\nif(s%2==0):\r\n k=0\r\nelse:\r\n k=1\r\nfor o in a:\r\n if(o%2==k):\r\n d+=1\r\nprint(d)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nchet=0\r\nnechet=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n chet+=1\r\n else:\r\n nechet+=1\r\nif s%2!=0:\r\n print(nechet)\r\nelse:\r\n print(chet)", "n = int(input())\nl = list(map(int,input().split()))\nc = 0\nif n == 1:\n print(1)\nelse:\n if sum(l) % 2 == 0:\n for i in range(n):\n if l[i] % 2 == 0:\n c+=1\n else:\n for i in range(n):\n if l[i] % 2 != 0:\n c+=1\n print(c)\n", "from sys import stdin, stdout\r\n\r\nnum = int(stdin.readline())\r\narray = stdin.readline().split()\r\n\r\ndef main(array):\r\n count = 0\r\n for i in range(0,num):\r\n sum = 0\r\n lists = 0\r\n for e in range(0,num):\r\n if(int(e != i)):\r\n sum+=int(array[e])\r\n if(sum%2==0):\r\n count+=1\r\n return count\r\n \r\n\r\nif __name__ == \"__main__\":\r\n print(main(array))", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nm=0\r\nif(n==1):\r\n print(1)\r\nelse:\r\n s=sum(n1)\r\n if(s%2==0):\r\n for i in n1:\r\n if(i%2==0):\r\n m=m+1\r\n else:\r\n for i in n1:\r\n if(i%2!=0):\r\n m=m+1\r\n print(m)\r\n", "N = int(input())\r\nl = list(map(int, input().split()))\r\nsm = 0\r\ncount = 0\r\nfor x in l:\r\n sm += x\r\nl.sort(reverse = True)\r\n\r\nfor a in l:\r\n k = sm - a\r\n if k % 2 == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum(l)\r\nif s%2 == 0:\r\n l1 = [i for i in l if i%2 == 0]\r\nelse:\r\n l1 = [i for i in l if i%2!=0]\r\nprint(len(l1))\r\n", "i=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nd={}\r\n\r\ntotal=0\r\n\r\ne=0\r\no=0\r\n\r\nfor x in l:\r\n\r\n total+=x\r\n\r\n if x%2:\r\n o+=1\r\n else:\r\n e+=1\r\n\r\n\r\nif total%2:\r\n print(o)\r\nelse:\r\n print(e)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ncnt = 0\r\na = list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n if (sum(a) - a[i]) % 2 == 0:\r\n cnt = cnt + 1\r\nprint(cnt)", "from math import floor\r\n\r\n\r\ndef main():\r\n p = input()\r\n arr = list(map(int, input().split()))\r\n s = sum(arr)\r\n k = 0\r\n for i in arr:\r\n if (s - i) % 2 == 0:\r\n k += 1\r\n print(k)\r\n\r\nif __name__ == '__main__':\r\n main()", "n = input()\na = list(map(int, input().split()))\nc0, c1 = 0, 0\nx = sum(a)\nfor i in a:\n if i % 2 == 1:\n c0 += 1\n else:\n c1 += 1\nif x % 2 == 0:\n print(c1)\nelse:\n print(c0)", "from functools import reduce\r\n\r\ninput()\r\n*bag_is_odd, = map((2).__rmod__, map(int, input().split()))\r\n\r\nif reduce(int.__xor__, bag_is_odd):\r\n print(sum(bag_is_odd))\r\nelse:\r\n print(sum(map((1).__sub__, bag_is_odd)))", "import math as mt\r\nfrom collections import defaultdict,deque\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom os import path\r\nfrom heapq import *\r\n\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\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\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n sm=sum(a)\r\n cnt=0\r\n for i in a:\r\n if(not((sm-i)&1)):\r\n cnt+=1\r\n\r\n return cnt\r\n\r\n\r\n# for _ in range(int(input())):\r\nif __name__ == \"__main__\":\r\n print(solve())", "n = int(input())\r\nv = list(map(int, input().split()))\r\nans = 0\r\nodd = sum(i for i in v) % 2\r\n\r\nfor i in v:\r\n\tif (i&1) == odd:\r\n\t\tans += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ne, o = 0, 0\r\nfor i in map(int, input().split()):\r\n if i%2==0:\r\n e += 1\r\n else:\r\n o += 1\r\n\r\nprint(o if o%2==1 else e)", "def solve(arr, n):\n count = 0\n s = sum(arr)\n for i in arr:\n if (s - i) % 2 == 0:\n count += 1\n return count\n\n\ndef main():\n # vars = list(map(int, input().split(\" \")))\n n = int(input())\n arr = list(map(int, input().split(\" \")))\n # for i in range(n):\n # arr.append(list(map(int, list(input()))))\n print(solve(arr, n))\n\n\nmain()\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\necnt = len([i for i in data if i % 2 == 0])\r\n\r\nif sum(data) % 2 == 0:\r\n print(ecnt)\r\nelse:\r\n print(n - ecnt)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd,even = 0,0\r\nfor num in a:\r\n if num%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\nif sum(a)%2==0:\r\n print(even)\r\nelse:\r\n print(odd)", "n = int(input())\np = list(map(int, input().split()))\neven = list(filter(lambda x: x%2==0, p))\nodd = list(filter(lambda x: x%2==1, p))\ns = sum(p)\nprint(len(odd) if s%2==1 else len(even))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx,y,z=0,0,0\r\nfor i in l:\r\n if i%2 ==0:\r\n x+=1\r\n elif i%2 !=0: \r\n y+=1\r\n z+=i \r\nif z%2==0:\r\n print(x)\r\nif z%2!=0:\r\n print(y)\r\n ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=sum(a)\r\nr=0\r\nfor i in range(n):\r\n if (s-a[i])%2==0:\r\n r=r+1\r\nprint(r)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ne, o, = 0, 0\r\n\r\nfor i in l:\r\n if i % 2 != 0:\r\n o += 1\r\n else:\r\n e += 1\r\n\r\nif o % 2 == 0:\r\n print(e)\r\nelse:\r\n print(o) ", "evenbags = 0\r\noddbags = 0\r\nNOT = int(input())\r\n# vals = input()\r\n# lista = vals.split() # splits the values into a list\r\nlistb = [int(val) for val in input().split()]\r\nfor a in listb:\r\n if a % 2 == 0:\r\n evenbags += 1\r\n else:\r\n oddbags += 1\r\nif oddbags % 2 == 0:\r\n print(evenbags)\r\nelse:\r\n print(oddbags)\r\n", "n = int(input())\r\neven, odd = 0, 0\r\na = [int(x) for x in input().split()]\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif odd %2 == 1:\r\n print(odd)\r\nelse:\r\n print(even)", "n = int(input())\r\ncookies = [int(i) for i in input().split()]\r\nsum = 0\r\ncount = 0\r\nfor cookie in cookies:\r\n\tsum += cookie\r\nfor cookie in cookies:\r\n\tif (sum - cookie) % 2 == 0:\r\n\t\tcount += 1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nif sum(a)%2 :\r\n for x in a :\r\n if x%2 : \r\n s+=1\r\nelse:\r\n for x in a:\r\n if x%2==0 :\r\n s+=1\r\nprint(s)", "n = int(input())\na = list(map(int, input().split()))\nc = [0, 0]\nfor i in a:\n c[i % 2] += 1\nprint(c[sum(a) % 2])\n\n \t\t\t\t \t \t\t \t \t\t\t\t\t \t\t\t", "n=int(input())\r\nv=[int(i) for i in input().split()]\r\ne,o=0,0\r\nfor i in v:\r\n if(i%2==0):\r\n e=e+1\r\n else:\r\n o=o+1\r\nif(sum(v)%2==0):\r\n print(e)\r\nelse:\r\n print(o)\r\n \r\n", "n = int(input()) \r\nbags = list(map(int,input().split()))\r\nsomme = sum(bags) \r\nsize = bags[0]\r\ncounter = 0\r\nfor bag in bags : \r\n if (somme - bag) % 2 == 0 : \r\n counter += 1\r\n\r\nprint(counter)", "from sys import stdin\r\n\r\nn = int(input())\r\nk = [int(i) for i in stdin.readline().split()]\r\nans = 0\r\nt = sum(k)\r\nfor i in k:\r\n if (t-i)%2==0: ans += 1\r\nprint(ans)", "n = int(input().strip())\r\nA = list(map(int, input().strip().split()))\r\ns = sum(A)\r\nans = 0\r\nfor a in A:\r\n if (s - a) % 2 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in l:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif sum(l) % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)", "n = int(input())\r\nnums = map(int, input().split())\r\nnumOdd = 0\r\nnumEven = 0\r\ntotalSum = 0\r\n \r\nfor num in nums:\r\n totalSum += num\r\n if num % 2 == 0:\r\n numEven += 1\r\n else:\r\n numOdd += 1\r\n n -= 1\r\n \r\nif totalSum % 2 == 0:\r\n print(numEven)\r\nelse:\r\n print(numOdd)", "n=int(input())\nl= list(map(int, input().split()))\nw=0\ns=0\nfor i in range(n):\n s+=l[i]\nif s%2==0:\n for i in range(n):\n if l[i]%2==0:\n w+=1\n print(w)\nelse:\n for i in range(n):\n if l[i]%2==1:\n w+=1\n print(w)", "n = int(input())\r\ndaf = list(map(int, input().split()))\r\nsum_daf = sum(daf)\r\n\r\nif sum_daf%2:\r\n has = sum([1 for i in range(n) if daf[i]%2])\r\n print(has)\r\nelse:\r\n has = sum([1 for i in range(n) if daf[i]%2==0])\r\n print(has)\r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nodd = 0\r\nfor i in a:\r\n if i%2==1:\r\n odd+=1\r\nif odd%2==0:\r\n ans = n-odd\r\nelse:\r\n ans = odd\r\n\r\nprint(str(ans)+\"\\n\")\r\n", "a=int(input())\r\ns=input().split()\r\nsum=0\r\nfor i in range(len(s)):\r\n s[i]=int(s[i])\r\n sum+=s[i]\r\nkol=0\r\nfor i in range(len(s)):\r\n if (sum-s[i])%2==0:\r\n kol+=1\r\nprint(kol) ", "n=int(input())\r\nlist=list(input().split())\r\neven = 0\r\nodd = 0\r\nsum =0\r\nfor i in list:\r\n sum += int(i)\r\n if int(i)%2==1:\r\n odd = odd + 1\r\n else: even = even + 1\r\n \r\nif sum %2==1:\r\n print(odd)\r\nelse: print(even)", "n=int(input())\r\na= list(map(int, input().split()))\r\ns=sum(a)\r\nc1,c2=0,0\r\nif s%2==0:\r\n for i in a:\r\n if i%2==0:c1+=1\r\n print(c1)\r\nelse:\r\n for i in a:\r\n if i%2!=0:c2+=1\r\n print(c2)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nc=0\r\nfor i in a:\r\n rem=sum(a)-i\r\n if(rem%2==0 or rem==0):\r\n c+=1\r\nprint(c)", "n=int(input())\r\nl=[int(e) for e in input().split()]\r\ns=0\r\nfor i in range(n):\r\n l1=l.copy()\r\n l1.remove(l[i])\r\n if(sum(l1)%2==0):\r\n s+=1\r\nprint(s)", "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\nIgnore duplicate groups 'a...a'/'b...b'\r\nIf num groups is odd, AB already equals BA\r\nelse if even we need to minimize the steps\r\n -Minimize by choosing the smallest group of a..a/b..b\r\n and inverting the values\r\n\r\nn%4 = 1\r\nn%4 = 3\r\n\r\n11\r\n13\r\n\r\n11 = 3,7,1\r\n13 = 5,7,1\r\n\r\n7/11 14/22'\r\nMissing size requirement\r\n'''\r\ndef divideTwo(nums, i, j):\r\n cnt = 0\r\n while nums[j][0] > 2:\r\n nums[j][0] = (nums[j][0]+nums[i][0]-1)//nums[i][0]\r\n cnt += 1\r\n return cnt\r\n\r\ndef solve():\r\n t = II()\r\n a = LII()\r\n s = sum(a)\r\n odds = 0\r\n evens = 0\r\n for num in a:\r\n if num&1:\r\n odds += 1\r\n else:\r\n evens += 1\r\n if s&1:\r\n print(odds)\r\n else:\r\n print(evens)\r\n\r\nsolve()", "n = int(input())\r\nbags = list(map(int, input().split()))\r\n\r\neven_count = 0\r\nfor i in range(n):\r\n remaining_sum = sum(bags) - bags[i]\r\n if remaining_sum % 2 == 0:\r\n even_count += 1\r\n\r\nprint(even_count)", "n=int(input())\r\nlst = [int(a) for a in input().split()]\r\nj=0\r\nfor i in lst:\r\n l=lst[:]\r\n l.remove(i)\r\n if sum(l)%2==0:\r\n j+=1\r\nprint(j)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ntotal, ans = sum(a), 0\r\nfor x in a:\r\n if (total - x) % 2 == 0:\r\n ans += 1\r\nprint(ans)", "N=int(input())\r\ny=0\r\nm=list(map(int,input().split()))\r\nif sum(m)%2==0:\r\n for i in range(0,N):\r\n if m[i]%2==0:\r\n y+=1\r\nelse:\r\n for i in range(0,N):\r\n if not m[i]%2==0:\r\n y+=1\r\nprint(y)", "n = int(input())\r\n\r\nar = list(map(int, input().split()))\r\n\r\ntotal, even, odd = 0, 0, 0\r\n\r\nfor i in ar:\r\n total += i\r\n if i % 2 == 0: even += 1\r\n else: odd += 1\r\n\r\nif total % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "def main():\n input()\n cookies = [int(_) for _ in input().split()]\n n_cookies = sum(cookies)\n n_ways = sum(c % 2 == 0 for c in cookies) if n_cookies % 2 == 0 \\\n else sum(c % 2 != 0 for c in cookies)\n\n print(n_ways)\n\n\nif __name__ == '__main__':\n main()\n", "'''input\n1\n1\n'''\nn = int(input())\na = list(map(int, input().split()))\nif sum(a) % 2 == 0:\n\tprint(len([x for x in a if x % 2 == 0]))\nelse:\n\tprint(len([x for x in a if x % 2 == 1]))", "n=int(input())\r\nm=list(map(int,input().split()))[:n]\r\ns=sum(m)\r\nd=0\r\nif (s%2==0):\r\n for i in range(0,n):\r\n if (m[i]%2==0):\r\n d=d+1\r\nelse:\r\n for j in range(0,n):\r\n if (m[j]%2!=0):\r\n d=d+1\r\nprint(d)\r\n", "#code\r\nn=int(input());\r\n#print(n);\r\na=[]\r\nb=0\r\nc=0\r\ns=0\r\na = [int(item) for item in input().split()]\r\nfor i in range(0,n):\r\n j=a[i]\r\n s+=j\r\n a.append(j);\r\n if a[i]%2 == 0:\r\n b+=1\r\n else:\r\n c+=1\r\nif s%2==0:\r\n print(b)\r\nelse:\r\n print(c)", "def transform(x):\n return int(x)\n\nn = int(input())\ncookiesInBag = list(map(transform,input().split()))\ncookiesSum = sum(cookiesInBag)\nways = 0\n\ni = 0\nwhile i < n:\n if (cookiesSum - cookiesInBag[i]) % 2 == 0: ways += 1\n i += 1\nprint(ways)\n\t\t\t \t \t \t \t\t\t \t\t\t \t \t \t\t\t \t\t", "bag_num = int(input())\r\nline1 = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(len(line1)):\r\n if (sum(line1)-line1[i]) % 2 == 0:\r\n counter += 1\r\nprint(counter)\r\n", "\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\na=sum(l)\r\ncou=0\r\nif a%2==0:\r\n\tfor i in l:\r\n\t\tif i%2==0:\r\n\t\t\tcou=cou+1\r\nelse:\r\n\tfor i in l:\r\n\t\tif i%2==1:\r\n\t\t\tcou+=1\r\nprint(cou)", "t = int(input())\r\nn = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nsumList = 0\r\nfor i in range(0, t):\r\n sumList += n[i]\r\n if n[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif odd % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nfrom heapq import *\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 = inp()\r\nl = li()\r\ns = sum(l)\r\nans = 0\r\nfor i in l:\r\n ans += ((s-i) % 2 == 0)\r\npr(ans)\r\n", "n = int(input())\r\npax = [int(string) for string in input().split()]\r\ns = sum(pax)\r\nres = 0\r\nfor p in pax :\r\n res += 1 if p % 2 == s % 2 else 0\r\nprint(res)", "n = int(input())\nl = [int(x) % 2 for x in input().split()]\nodd = l.count(1)\neven = l.count(0)\nif odd % 2:\n\tprint(odd)\nelse:\n\tprint(even)\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\neven=odd=0\r\nfor i in l:\r\n if(i%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nif(sum(l)%2==0):\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "def main():\n n = int(input())\n cookies_per_bag = list(map(int, input().split()))\n totalCookies = sum(cookies_per_bag)\n\n counter = 0\n for bag in cookies_per_bag:\n if((totalCookies-bag)%2 == 0):\n counter += 1\n print(counter)\n\nif __name__ == \"__main__\":\n main()", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nkol_ch = 0\r\nkol_nch = 0\r\nfor i in lst:\r\n if i % 2 == 0:\r\n kol_ch += 1\r\n else:\r\n kol_nch += 1\r\n\r\nif kol_nch % 2 == 0:\r\n print(kol_ch)\r\nelse:\r\n print(kol_nch)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nk = 0\r\nif sum(lst) % 2 == 0:\r\n for i in range(n):\r\n if lst[i] % 2 == 0:\r\n k += 1\r\nelse:\r\n for i in range(n):\r\n if lst[i] % 2 == 1:\r\n k += 1\r\nprint(k)\r\n", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\nn = sum(nums)\r\ncnt = 0\r\nfor x in nums:\r\n\tif (n - x) % 2 == 0:\r\n\t\tcnt += 1\r\nprint(cnt)", "n = int(input())\nlist_of_cookies_bags = list(map(int, input().split(' ')))\ntotal_of_cookies = sum(list_of_cookies_bags)\nprint(len(list(filter(lambda x: (total_of_cookies -x) % 2 == 0, list_of_cookies_bags))))", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nco,ce=0,0\r\nfor i in a:\r\n\tif i%2!=0:\r\n\t\tco+=1\r\n\telse:\r\n\t\tce+=1\r\n\r\nif co%2!=0:\r\n\tprint(co)\r\nelse:\r\n\tprint(ce)", "n = int(input())\r\ngems = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor gem in gems:\r\n if (sum(gems) - gem) % 2 == 0:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\ncookies = [int(x) for x in input().split()]\r\ns=sum(cookies)\r\ntotal=0\r\nif s%2==0:\r\n for i in cookies:\r\n if i%2==0:\r\n total+=1\r\nelse:\r\n for i in cookies:\r\n if i%2!=0:\r\n total+=1\r\nprint(total)", "n = int(input())\nar = list(map(int, input().split()))\nr = sum(ar) % 2\nprint(sum(1 for _ in filter(lambda x: x % 2 == r, ar)))\n\n", "n = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\ntotal = sum(nums)\r\neven = 0\r\nodd = 0\r\n\r\nfor x in nums:\r\n if x % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif total % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "n = int(input())\r\nk = 0\r\nl = [int(i) for i in input().split()]\r\nif sum(l) % 2 == 0:\r\n for i in l:\r\n if i % 2 == 0:\r\n k += 1\r\nelse:\r\n for i in l:\r\n if i % 2 != 0:\r\n k += 1\r\nprint(k)", "n = int(input())\r\n\r\namt= list(map(int, input().split(' ')))\r\n\r\ncount=0\r\ntotalC= sum(amt)\r\n\r\nfor i in amt:\r\n if (totalC-i)%2==0:\r\n count+=1\r\n \r\nprint(count)", "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\n \r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nres = 0 \r\nif n == 1:\r\n res = 1\r\nelse:\r\n s = sum(a)\r\n if s%2 == 0:\r\n for i in a:\r\n if i%2 == 0:\r\n res += 1\r\n else:\r\n for i in a:\r\n if i%2 != 0:\r\n res += 1\r\n\r\nprint(res)", "n = input()\r\nnums = [int(i) for i in input().split()]\r\neven = []\r\nodd = []\r\n\r\nfor i in nums:\r\n if i % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nif len(odd) % 2 != 0:\r\n print(len(odd))\r\nelse:\r\n print(len(even))\r\n", "x = int(input())\r\nx = [int(i) for i in input().split()]\r\nodd = 0\r\neven = 0\r\nfor i in x:\r\n if i % 2 == 1:\r\n odd += 1\r\n else:\r\n even += 1\r\n \r\nif odd % 2 == 1:\r\n print(odd)\r\nelse:\r\n print(even)", "a = int(input())\r\nb = input()\r\na2 = 0\r\na1 = 0\r\nsumm = 0\r\nfor i in (b.split()):\r\n i = int(i)\r\n summ += i\r\n if i % 2 == 0:\r\n a2 += 1\r\n else:\r\n a1 += 1\r\nif summ % 2 == 0:\r\n print(a2)\r\nelse:\r\n print(a1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nsumma = 0\r\neven = 0\r\nodd = 0\r\nfor i in range(n):\r\n\tsumma += a[i]\r\n\tif a[i] % 2 == 0:\r\n\t\teven += 1\r\n\telse:\r\n\t\todd += 1\r\nif summa % 2 == 0:\r\n\tprint(even)\r\nelse:\r\n\tprint(odd)", "n = int(input())\naa = list(map(int, input().split()))\ns = sum(aa)\nres = 0\nfor a in aa:\n if (s-a)%2 == 0:\n res += 1\nprint(res)", "n = int(input())\r\ncookies = list(map(int, input().split()))\r\ntot = sum(cookies)\r\nans = 0\r\nfor bag in cookies:\r\n if (tot - bag) & 1 == 0: ans += 1\r\nprint(ans)", "evens, odds = 0, 0\r\nint(input())\r\nbags = [int(i) for i in input().split()]\r\nfor bag in bags:\r\n\tif bag%2: \r\n\t\todds += 1\r\n\telse: \r\n\t\tevens += 1\r\nprint((evens, odds) [odds%2])", "\r\nn = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ns = 0\r\nodd = 0\r\neven = 0\r\n\r\nfor i in range(n):\r\n s += l[i]\r\n if (l[i] % 2 == 0):\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\nif s % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)", "n=int(input())\r\nco=list(map(int,input().split()))\r\nl=0\r\nfor i in range(n):\r\n if (sum(co)-co[i])%2==0:\r\n l+=1\r\nprint(l)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a) % 2\r\nans = n\r\nfor i in a:\r\n ans -= s ^ (i % 2)\r\nprint(ans)", "bags = int(input())\r\ncookies = [int(x) for x in input().split()]\r\nsum = sum(cookies)\r\ncounter = 0\r\n\r\nfor i in range(bags):\r\n if (sum - cookies[i]) % 2 == 0:\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ncounter = 0\r\nif sum(a) % 2 == 0:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n counter += 1\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 != 0:\r\n counter += 1\r\nprint(counter)\r\n", "sz= int(input())\r\nl = list(map(int,input().split()))\r\nsm = sum(l);ct = 0\r\nfor i in l:\r\n if (sm-i)%2 == 0:\r\n ct += 1\r\nprint(ct)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nx,y=0,0\r\nfor i in range(n):\r\n if(l[i]%2==1):\r\n x=x+1\r\n else:\r\n y=y+1\r\nif(s%2==0):\r\n print(y)\r\nelse:\r\n print(x)\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 A = list(map(int, wtf[1].split()))\r\n B = []\r\n C = []\r\n for a in A:\r\n if a%2 == 0:\r\n C.append(a)\r\n else:\r\n B.append(a)\r\n On = len(B)\r\n En = len(C)\r\n if On%2 == 0:\r\n print(En)\r\n else:\r\n print(On)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\ne=0\r\no=0\r\nfor i in range (n):\r\n s+=a[i]\r\n if a[i]%2 == 0 :\r\n e+=1\r\n if a[i]%2 !=0 :\r\n o+=1\r\nif s%2 == 0 and o==n :\r\n print(\"0\")\r\nelif s%2 == 0 :\r\n print(e)\r\nelse:\r\n print(o)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nf=sum(l)\r\nc=0\r\nif(f%2==0):\r\n for i in l:\r\n if i%2==0:\r\n c+=1\r\nelse:\r\n for i in l:\r\n if(i%2!=0):\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\r\n\r\ncookies = [int(i) for i in input().split()]\r\n\r\nif sum(cookies) % 2 == 0: #even\r\n\ttf = [i % 2 == 0 for i in cookies]\r\nelse: #odd\r\n\ttf = [i % 2 == 1 for i in cookies]\r\n\t\r\nprint(sum(tf))", "numCookies = int(input())\r\ncookies = list(map(int, input().split(' ')))\r\ntotalCookies = sum(cookies)\r\ncount = 0\r\nfor cookieBag in cookies:\r\n if (totalCookies - cookieBag) % 2 == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nparity = 0 if sum(a) % 2 == 0 else 1\nprint(len([x for x in a if x % 2 == parity]))\n", "n = int(input())\na = list(map(int, input().split()))\np = sum(a)\ncount = 0\nif p%2 == 1:\n for i in range(n):\n if a[i]%2 == 1:\n count += 1\nelif p%2 == 0:\n for i in range(n):\n if a[i]%2 == 0:\n count += 1\nprint(count)", "# Author: SaykaT\r\n# Problem: 129A.py\r\n# Time Created: August 24(Monday) 2020 || 12:19:17\r\n\r\n#>-------------------------<#\r\nimport sys\r\n\r\ninput = sys.stdin.readline\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 = int(input())\r\n ls = list(map(int, input().split()))\r\n initial_sum = sum(ls)\r\n ans = 0\r\n\r\n for i in ls:\r\n tmp = initial_sum - i\r\n if tmp % 2 == 0:\r\n ans += 1\r\n print(ans)\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "n = int(input())\na = list(map(int, input().rstrip().split()))\ne = 0\no = 0\ns = 0\nfor x in a:\n if x % 2 == 0:\n e += 1\n else:\n o += 1\n s += x\nif s % 2 == 0:\n print(e)\nelse:\n print(o)", "mn = int(input())\r\n\r\na_b = list(map(int, input().split()))\r\nc_b = sum(a_b)\r\nnn = 0\r\n\r\nfor b in a_b:\r\n if (c_b - b) % 2 == 0:\r\n nn += 1\r\n\r\nprint(nn)", "m = int(input())\r\nn = input()\r\nsumma = 0\r\nspisok = n.split(' ')\r\nchet = 0\r\nnechet = 0\r\n#print(spisok)\r\nfor i in spisok:\r\n #type(i)\r\n i_abc = int(i)\r\n summa = summa + i_abc\r\n \r\n if i_abc % 2 == 0:\r\n chet = chet +1\r\n else:\r\n nechet = nechet + 1\r\nif summa % 2 == 0:\r\n print(chet)\r\nelse:\r\n print(nechet)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = sum(a)\r\ncount = 0\r\n\r\nfor i in a:\r\n if (s - i) % 2 == 0:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\no, e = 0, 0\r\nfor i in range(len(a)):\r\n if (a[i] % 2 == 0):\r\n e += 1\r\n else:\r\n o += 1\r\n# print(o , e)\r\nif (o % 2 == 1):\r\n print(o)\r\nelse:\r\n print(e)", "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nc = 0\r\ns = sum(l)\r\n\r\nfor i in l :\r\n if (s - i )% 2 == 0 :\r\n c +=1\r\nprint(c)\r\n\r\n", "from math import log10,ceil\r\ndef solve():\r\n n=int(input());a=list(map(int,input().split()));r=sum(a);c=0\r\n if r%2==0:\r\n for i in a:\r\n if i%2==0:c+=1\r\n else:\r\n for i in a:\r\n if i%2!=0:c+=1\r\n print(c)\r\nsolve()", "n = int(input())\r\nlis = list(map(int,input().split()))\r\neven = 0\r\nodd =0\r\nfor i in lis:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\np = sum(lis)\r\nif p%2==0:\r\n print(even)\r\nelse:\r\n print(odd)", "n=int(input())\r\na=input().split()\r\nt,s=0,0\r\nfor n in a:\r\n t+=int(n)\r\nfor n in a:\r\n if (t-int(n))%2==0:\r\n s+=1\r\nprint(s)", "t=int(input())\r\na=list(map(int,input().split()))\r\nm=sum(a)%2\r\ncount=0\r\nfor i in a:\r\n if i%2==m:\r\n count=count+1\r\nprint(count)\r\n", "n=int(input())\r\nbags=list(map(int,input().split()))\r\nc=0\r\nif sum(bags)%2==1:\r\n for i in bags:\r\n if i%2==1:\r\n c+=1\r\nelse:\r\n for i in bags:\r\n if i%2==0:\r\n c+=1\r\nprint(c)\r\n ", "#!/usr/bin/python3\n\nn = int(input())\n\nbags = [int(i) for i in input().split(' ')]\nbags_sum = sum(bags)\nsolutions = 0\n\nfor i in range(0, n):\n if (bags_sum - bags[i]) % 2 == 0:\n solutions += 1\n\nprint(solutions)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in l:\r\n\tif (sum(l) - i) % 2 == 0:\r\n\t\tk += 1\r\nprint(k)", "n = int(input())\r\na = 0\r\nb = 0\r\ns = 0\r\nfor i in input().split():\r\n p = int(i)\r\n s += p\r\n if p%2 == 0 :\r\n a += 1\r\n else :\r\n b += 1\r\nprint(a if s%2 == 0 else b)\r\n \r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\ncount_odd = 0\r\ncount_even = 0\r\nn= int(input())\r\nlst = [int(x) for x in input().split()]\r\nres = sum(lst)\r\nif res % 2 == 1:\r\n for item in lst:\r\n if item % 2 == 1:\r\n count_odd += 1\r\n print(count_odd)\r\nelse:\r\n for item in lst:\r\n if item % 2 == 0:\r\n count_even += 1\r\n print(count_even)\r\n\r\n", "n = input()\r\nbags = list(map(int,input().split())) \r\nans = 0\r\nif sum(bags) % 2 == 0:\r\n for i in bags:\r\n if i % 2 == 0:\r\n ans += 1\r\nelse:\r\n for j in bags:\r\n if j % 2 != 0:\r\n ans += 1\r\nprint (ans)\r\n", "n = int(input())\r\nbags = list(map(int, input().split()))\r\nways = 0\r\nfor i in range(len(bags)):\r\n if (sum(bags) - bags[i]) % 2 == 0:\r\n ways += 1\r\nprint(ways)\r\n", "\r\nsteals_bags = []\r\n\r\nbags = int(input())\r\ncookies = list(map(int, input().split()))\r\n\r\nif (sum(cookies) % 2 == 0):\r\n steals_bags = [number for number in cookies if number % 2 == 0]\r\nelse:\r\n steals_bags = [number for number in cookies if number % 2 != 0]\r\n\r\nprint(len(steals_bags))\r\n\r\n\r\n\r\n\r\n", "def even(number):\r\n if number == 0:\r\n return True\r\n elif number % 2 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn = int(input())\r\ncookies = list(map(int, input().split()))\r\ncount = 0\r\ncookies_sum = sum(cookies)\r\nfor x in cookies:\r\n left = cookies_sum - x\r\n if even(left):\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\nrez = 0\n\na = [int(i) for i in input().split()]\n\ns = sum(a)\n\nfor i in a:\n if (s - i) % 2 == 0:\n rez += 1\nprint(rez)\n", "\r\ndef compute_ways_number(total, bags_contents):\r\n x = 0\r\n if total%2 == 0:\r\n for i in bags_contents:\r\n if i%2 == 0:\r\n x += 1\r\n else:\r\n for i in bags_contents:\r\n if i%2 != 0:\r\n x += 1\r\n return x\r\n\r\n\r\ntotal = 0\r\nbags_num = int(input())\r\nbags_contents = input().split(' ')\r\n\r\nfor i in range(len(bags_contents)):\r\n bags_contents[i] = int(bags_contents[i])\r\n total += bags_contents[i]\r\n\r\nprint(compute_ways_number(total, bags_contents))\r\n", "def main():\r\n\tn=int(input())\r\n\tcookies=input().split(\" \")\r\n\tcookies=list(map(int,cookies))\r\n\tif sum(cookies)%2==0:\r\n\t\tcont=0\r\n\t\tfor i in range(len(cookies)):\r\n\t\t\tif cookies[i]%2==0:\r\n\t\t\t\tcont+=1\r\n\t\tprint(cont)\r\n\telse:\r\n\t\tcont=0\r\n\t\tfor i in range(len(cookies)):\r\n\t\t\tif cookies[i]%2==1:\r\n\t\t\t\tcont+=1\r\n\t\tprint(cont)\r\nmain()", "n = int(input())\r\na = list(map(int, input().split()))\r\nchet = 0\r\nnechet = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\nif sum(a) % 2 != 0:\r\n print(nechet)\r\nelse:\r\n print(chet)", "n = int(input())\na = list(map(int, input().split()))\n\nodd_num = len([e for e in a if e % 2 == 1])\neven_num = len([e for e in a if e % 2 == 0])\n\nif odd_num % 2 == 0:\n print(even_num)\nelse:\n print(odd_num)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nce, co, total = 0, 0, 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n ce += 1\r\n else:\r\n co += 1\r\n total += a[i]\r\n\r\nif total % 2 == 0:\r\n print(ce)\r\nelse:\r\n print(co)", "n = input()\r\nw = list(map(int, input().split()))\r\nif sum(w) % 2 == 0:\r\n print(len(list(filter(lambda x: (x % 2 == 0), w))))\r\n\r\nelse:\r\n print(len(list(filter(lambda x: (x % 2 == 1), w))))", "n=int(input())\r\np= [int(x) for x in input().split()]\r\na=[s for s in p if s%2==0]\r\nif sum(p)%2==0:\r\n print(len(a))\r\nelse:\r\n print(n-len(a))", "n = int(input())\r\neven = odd = 0\r\narr = list(map(int, input().split()))\r\nfor i in arr:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nflag = (odd % 2 == 1)\r\nif(flag):\r\n print(odd)\r\nelse:\r\n print(even)\r\n", "# t=int(input())\r\n# while t>0:\r\n # n=int(input())\r\n # s=input()\r\n # if s in \"FBFFBFFB\":\r\n # print(\"YES\")\r\n # else:\r\n # print(\"NO\")\r\n# s=input()\r\n# if(\"H\" in s or \"Q\" in s or \"9\" in s or \"+\" in s):\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n # t-=1\r\nn=int(input())\r\nl=input().split(' ')\r\nl=[int(x) for x in l]\r\ndef even(l):\r\n e=0\r\n for i in l:\r\n if(i%2==0):\r\n e+=1\r\n return e\r\ns=sum(l)\r\nif(s%2==0):\r\n print(even(l))\r\nelse:\r\n print(len(l)-even(l))\r\n", "n = int(input())\r\ni = input().split()\r\n\r\na = 0\r\nfor x in range(len(i)):\r\n a = a + int(i[x])\r\n\r\ncount = 0\r\nif a % 2 == 0:\r\n for x in range(len(i)):\r\n if int(i[x]) % 2 == 0:\r\n count = count + 1\r\nelse:\r\n for x in range(len(i)):\r\n if int(i[x]) % 2 != 0:\r\n count = count + 1\r\n\r\nprint(count)", "n=int(input())\r\nf=[int(i) for i in input().split()]\r\nsposobs=0\r\nif sum(f)%2==0:\r\n for i in range(n):\r\n if f[i]%2==0:\r\n sposobs+=1\r\nelse:\r\n for i in range(n):\r\n if f[i]%2!=0:\r\n sposobs+=1\r\nprint(sposobs)\r\n", "N = int(input()) \r\nl = list(map(int, input().split())) \r\neven = 0 \r\nodd = 0 \r\nfor i in l :\r\n if i % 2 == 0 :\r\n even += 1\r\n else :\r\n odd += 1 \r\nif (odd % 2 == 0) :\r\n print(even)\r\nelse :\r\n print(odd) ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nodd_count = 0\r\neven_count = 0\r\n\r\nfor num in arr:\r\n if num % 2 == 0:\r\n even_count += 1\r\n else:\r\n odd_count += 1\r\n\r\nresult = odd_count if odd_count % 2 == 1 else even_count\r\nprint(result)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-27 23:30:46\nLastEditTime: 2021-11-27 23:34:54\nDescription: Cookies\nFilePath: CF129A.py\n'''\n\n\ndef func():\n _ = int(input())\n cookies = list(map(int, input().strip().split()))\n if sum(cookies) % 2 == 0:\n print(len(list(filter(lambda el: el % 2 == 0, cookies))))\n else:\n print(len(list(filter(lambda el: el % 2 != 0, cookies))))\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nans=0\r\nfor i in range(len(l)):\r\n x=s-l[i]\r\n if(x%2==0):\r\n ans+=1\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Aug 1 11:55:52 2020\r\n\r\n@author: alber\r\n\"\"\"\r\n\r\n\r\nx = int(input())\r\n\r\ncookies = list(map(int,input().split()))\r\n\r\ntotal_cookies = sum(cookies)\r\n\r\nif x == 1:\r\n print(1)\r\n \r\nelse:\r\n\r\n if total_cookies%2 == 0:\r\n olga = [i for i in cookies if i%2 == 0]\r\n\r\n else:\r\n olga = [i for i in cookies if i%2 != 0]\r\n \r\n print(len(olga)) ", "n = int(input())\na = list(map(int, input().split()))\nc = 0\nfor i in range(0,len(a)):\n r = a[0]\n a.pop(0)\n q = sum(a)\n a.append(r)\n if q%2==0:\n c += 1\nprint(c)", "n=int(input())\r\nL=[]\r\nL=[int(x) for x in input().split(\" \")]\r\nnb=0\r\nsomme=sum(L)\r\nfor i in range(n):\r\n if((somme-L[i])%2==0) :\r\n nb+=1 \r\n \r\n\r\nprint(nb)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nsum1 = sum(l)\r\ncnt = 0\r\nfor i in l:\r\n temp = sum1 - i\r\n if temp % 2 == 0:\r\n cnt += 1\r\nprint(cnt)\r\n", "n= int(input())\r\nn= list(map(int, input().split()))\r\ne=0\r\no=0\r\n\r\ns= sum(n)\r\n\r\nfor i in range(len(n)):\r\n if n[i]%2== 0:\r\n e+=1\r\n else:\r\n o+=1\r\n \r\nif s%2==0:\r\n print(e)\r\n \r\nelse:\r\n print(o)", "a=int(input())\r\nb=input()\r\nc=b.split(' ')\r\nd=[]\r\nw=0\r\nfor i in c:\r\n d.append(int(i))\r\n w=w+int(i)\r\nx=0\r\nfor j in d:\r\n if (w-j)%2==0:\r\n x=x+1\r\n else:\r\n pass\r\nprint(x)", "nb_bags = int(input())\r\ncookies = [int(x) for x in input().split()]\r\nsum_cookies = sum(cookies)\r\nways = 0\r\nif sum_cookies%2==0:\r\n for i in cookies:\r\n ways += i%2==0\r\nelse:\r\n for i in cookies:\r\n ways += i%2==1\r\nprint(ways)\r\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\ninput()\r\na=[*q()]\r\nif sum(a)%2:\r\n print(len([i for i in a if i%2]))\r\nelse:\r\n print(len([i for i in a if not i%2]))", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in a:\r\n if (sum(a)-i)%2 == 0:\r\n c+=1\r\nprint(c)", "# coding: utf-8\nn = int(input())\na = [int(i)%2 for i in input().split()]\nif sum(a)%2==0:\n print(a.count(0))\nelse:\n print(a.count(1))\n", "n = int(input())\r\nstring = input()\r\nnumbers = list(map(int, string.split()))\r\na = sum(numbers) % 2\r\nb = 0\r\nfor x in numbers:\r\n if x % 2 == a:\r\n b += 1\r\nprint(b)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nq, w = 0, 0\r\nfor i in range(n):\r\n s += l[i]\r\n if l[i] % 2 == 0:\r\n q += 1\r\n else:\r\n w += 1\r\nif s % 2 == 0:\r\n print(q)\r\nelse:\r\n print(w)", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nx=sum(li)\r\nc=0\r\nfor i in li:\r\n\tif (x-i)%2==0:\r\n\t\tc=c+1\r\nprint(c)", "n = int(input())\ncookies = list(map(int , input().split(\" \")))\n\ntotal = sum(cookies)\n\nodds = [i for i in cookies if i % 2 != 0]\nevens = [i for i in cookies if i % 2 == 0]\n\nif total % 2 == 0 :\n print(len(evens))\nelse :\n print(len(odds))\n\n", "bags = int(input())\narr = list(map(int, input().split()))\n\ntotal = sum(arr)\n\nfrom collections import Counter\ncount = Counter(arr)\n\nfinal = 0\nfor bag in set(arr):\n if not ((total - bag) % 2):\n final += count[bag]\n\nprint(final)\n \n \n\n", "n = int(input()) # Number of Bags\r\nd = [int(x) for x in input().split()] # Cookies on each Bag\r\n\r\neven = 0\r\nodd = 0\r\ntotal = sum(d)\r\n\r\nfor i in d:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif total %2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)", "num = 0\nn = int(input())\nres = list(map(int, input().split()))\ns = sum(res)\n\nfor i in range(n):\n if (s - res[i])%2 == 0:\n num += 1\n\nprint(num)\n# Sat Sep 25 2021 11:46:08 GMT+0300 (Москва, стандартное время)\n", "def main():\r\n input()\r\n cookies = [int(c) for c in input().split()]\r\n\r\n even_odd = [0, 0]\r\n for e in cookies:\r\n even_odd[e % 2] += 1\r\n\r\n even, odd = even_odd\r\n print(odd if odd % 2 else even)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=sum(b)\r\nd=0\r\nfor i in range(a):\r\n if (c-b[i])%2==0:\r\n d=d+1\r\nprint(d)\r\n", "n= int(input()); li= list(map(int, input().split())); od=0; ev=0; sm=0\r\nfor i in li:\r\n if i%2==0:\r\n ev+=1\r\n else:\r\n od+=1\r\n sm+= i\r\n \r\nif sm%2==0:\r\n print(ev)\r\nelse:\r\n print(od)", "n = eval(input())\r\nl = list(map(int,input().split()))\r\nr = 0\r\ni=0\r\nwhile i < n:\r\n if (sum(l)-l[i]) % 2 == 0 :\r\n r+=1\r\n i+=1\r\nprint(r)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in l:\r\n s=s+i\r\nif s%2==0:\r\n for i in l:\r\n if i%2==0:\r\n c=c+1\r\nelse:\r\n for i in l:\r\n if i%2!=0:\r\n c=c+1\r\nprint(c) ", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\ncount=0\r\nfor i in a:\r\n\tif((sum(a)-i)%2==0):\r\n\t\tcount +=1\r\n\r\nprint(count)", "'''Author: Abdurasul !!!'''\r\ninput();a=list(map(int,input().split()));k=0\r\nfor i in range(len(a)):\r\n if a[i]%2==0:k=k+1\r\nif sum(a)%2==0:print(k)\r\nelse:print(len(a)-k)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = sum(a)\r\ncount = 0\r\nfor i in range(n):\r\n if (s-a[i])%2==0:\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\nl = list()\r\nc = input().split()\r\ns=0\r\nfor i in range(n):\r\n l = l + [int(c[i])]\r\nfor i in range(n):\r\n if((sum(l)-l[i])%2==0):\r\n s = s+1\r\nprint(s)", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nsm = sum(arr)\r\nans = []\r\n\r\nif sm%2 == 0:\r\n ans = [int(x) for x in arr if x%2 == 0]\r\nelse:\r\n ans = [int(x) for x in arr if x%2 != 0]\r\n\r\nprint(len(ans))", "n=int(input())\r\n\r\ncookies=list(map(int, input().split()))\r\nways=0\r\ntotal = sum(cookies)\r\n\r\nfor i in cookies:\r\n if (total-i)%2==0:\r\n ways+=1 \r\n\r\nprint(ways)", "\r\n\r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\n\r\ncnt = 0\r\n\r\nfor i in x:\r\n if (sum(x) - i) % 2 == 0:\r\n cnt += 1\r\n \r\nprint(cnt)", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = sum(a)\r\np = 0\r\nif s%2==0:\r\n for x in a:\r\n if(x%2==0):\r\n p+=1\r\nelse:\r\n for x in a:\r\n if(x%2==1):\r\n p+=1\r\nprint(p)", "packages = int(input())\ncookies = [int(item) for item in input().split(' ')]\n\ncookies_sum = sum(cookies)\nvariations = 0\nfor cookie in cookies:\n if (cookies_sum - cookie) % 2 == 0:\n variations += 1\nprint(variations)\n\n", "number = int(input())\r\narr = list(map(int, input().split()))\r\ncounter = 0\r\ncount = 0\r\nfor i in arr :\r\n counter += i\r\nfor i in arr :\r\n if (counter - i) % 2 == 0 :\r\n count += 1\r\nprint(count)", "t=int(input())\r\nn=list(map(int,input().split()[:t]))\r\ns=0\r\nif sum(n)%2==0:\r\n\tfor i in range(t):\r\n\t\tif n[i]%2==0:\r\n\t\t\ts=s+1\r\n\tprint(s)\r\nelse:\r\n\tfor i in range(t):\r\n\t\tif n[i]%2!=0:\r\n\t\t\ts=s+1\r\n\tprint(s)\r\n\t\r\n\t\r\n\t\t", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn = int(input())\r\nq = [int(x) for x in input().split()]\r\ncodd = 0\r\nceven = 0\r\nfor x in q:\r\n\tif x&1:\r\n\t\tcodd += 1\r\n\telse:\r\n\t\tceven += 1\r\nprint(codd if codd&1 else ceven)\r\n", "input()\r\nA=list(map(int,input().split()))\r\nx =sum(A)\r\nan = 0\r\nif x%2==0:\r\n \r\n for i in A:\r\n if i%2 == 0:\r\n an+=1\r\nelse:\r\n for i in A:\r\n if i%2 == 1:\r\n an+=1\r\nprint(an) \r\n ", "n = int(input())\n\ncookie_bags = list(map(int, input().split()))\ntotal_cookies = sum(cookie_bags)\n\nnum_ways = 0\nfor num_cookies in cookie_bags:\n if (total_cookies - num_cookies) % 2 == 0:\n num_ways += 1\n\nprint(num_ways)\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ns=sum(l)\r\nc=0\r\nfor i in l:\r\n if i%2==s%2:\r\n c+=1 \r\nprint(c)", "n = int(input())\r\nS = [int(i) for i in input().split()]\r\nsumm = 0\r\nnch = 0\r\nfor i in S:\r\n if i%2==1:\r\n nch += 1\r\n summ += i\r\nif summ % 2 == 1:\r\n print(nch)\r\nelse:\r\n print(n-nch)\r\n", "a = int(input())\r\n\r\nb = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor x in b:\r\n if (sum(b)-x)%2 == 0:\r\n count+=1\r\n\r\nprint(count)", "n=int(input())\r\nli=list(map(int,input().split()))\r\ntotal=sum(li)\r\ncount=0\r\nfor i in li:\r\n if (total-i)%2==0:\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ns = sum(l)\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if ((s - l[i]) % 2 == 0):\r\n cnt += 1\r\nprint(cnt)", "n=int(input())\nc=0\na=list(map(int,input().split()))\nt=sum(a)\nz=t%2\nfor i in a:\n\tif i%2==z:\n\t\tc+=1\nprint(c)", "from sys import stdin, stdout\r\ndef stdinhack():\r\n for line in stdin: yield line\r\nnext_line = lambda: next(stdinhack()).split()\r\nwrite = lambda x : stdout.write(x)\r\n\r\ndef solve ():\r\n n = int(next_line()[0])\r\n a = list(map(int, next_line()))\r\n ans = 0\r\n for i in range(n):\r\n sum = 0\r\n for j,val in enumerate(a):\r\n if i!=j: sum+=val\r\n if(sum%2==0): ans+=1\r\n print(ans)\r\n return\r\nif __name__ == '__main__':\r\n solve()\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif sum(a) % 2 == 0:\r\n b = [i for i in a if i%2 == 0]\r\nelse:\r\n b = [i for i in a if i%2 != 0]\r\n\r\nprint(len(b))", "N = int(input())\nA = list(map(int, input().split()))\nsuma = sum(A)\nans = 0\nfor a in A:\n if (suma - a) % 2 == 0:\n ans += 1\nprint(ans)\n", "n=int(input())\r\nls=list(map(int,input().split()))\r\nsum=sum(ls)\r\neven=0\r\nfor e in ls:\r\n\tif e%2==0:\r\n\t\teven+=1\r\nodd=len(ls)-even\r\n\r\nif(sum%2==0):\r\n\tprint(even)\r\nelse:\r\n\tprint(odd)", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nc = 0\r\nfor x in a:\r\n c += x % 2\r\nprint(c if c % 2 != 0 else n - c)\r\n \r\n \r\n \r\n", "n = int(input())\na = [int(i) for i in input().split()]\ns = sum(a)\n\nif s % 2 == 0:\n cnt_0 = 0\n for i in a:\n if i % 2 == 0: cnt_0 += 1\n\n print(cnt_0)\nelse:\n cnt_1 = 0\n for i in a:\n if i % 2 == 1: cnt_1 += 1\n\n print(cnt_1)\n", "def cookies(n,bag):\r\n count=0\r\n sum_bag=sum(bag)\r\n for i in range(len(bag)):\r\n if(sum_bag-bag[i])%2==0:\r\n count=count+1\r\n else:\r\n continue\r\n return(count)\r\n\r\nn=int(input())\r\nbag=list(map(int,input().split()))\r\nresult=cookies(n,bag)\r\nprint(result)", "n = input()\nbags = [int(x) for x in input().split()]\n\ntotal = sum(bags)\n\nways = 0\n\nif total % 2 == 1:\n for each in bags:\n if each % 2 == 1:\n ways += 1\nelse:\n for each in bags:\n if each % 2 == 0:\n ways += 1\n\nprint(str(ways))\n\n\t\t\t\t \t\t \t\t\t\t\t \t\t\t\t\t \t\t\t \t\t", "a=int(input())\nbags = [int(bag_temp) for bag_temp in input().strip().split(' ')]\ncont=0\nfor i in bags:\n if i%2!=0:\n cont+=1\nif cont%2!=0:\n print(cont)\nelse:\n print(len(bags)-cont)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nco, ce, sm = 0, 0, 0\r\nfor i in l:\r\n if i%2 == 0:\r\n ce += 1\r\n else:\r\n co += 1\r\n sm += i\r\nif sm%2 == 0:\r\n print(ce)\r\nelse:\r\n print(co)\r\n", "inp = int(input())\r\nl = list(map(int,input().split()))\r\nodd = 0\r\n\r\nfor x in l:\r\n if x % 2 != 0:\r\n odd += 1\r\n\r\nprint(inp - odd if odd %2 == 0 else odd)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=sum(a)\r\neven=[]\r\nodd=[]\r\nfor char in a:\r\n if char%2==0:\r\n even.append(char)\r\n else:\r\n odd.append(char)\r\nif m%2==0:\r\n print(len(even))\r\nelse:\r\n print(len(odd))", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nsum=0\r\nresult=0\r\nfor i in range(len(list)):\r\n sum+=list[i]\r\nif sum%2==0:\r\n for i in range(len(list)):\r\n if list[i]%2==0:\r\n result+=1\r\nelse:\r\n for i in range(len(list)):\r\n if list[i]%2!=0:\r\n result+=1\r\nprint(result)\r\n ", "'''\r\nt= input()\r\nlng= len(t)\r\nli1=[]; li2=[]\r\nfor i in range(lng):\r\n if t[i]!='a':\r\n li1.append(t[i])\r\n elif t[i]=='a':\r\n li2.append(i)\r\n \r\naa= ''.join(li1)\r\nif len(aa)==0:\r\n print(t); exit(0)\r\nif len(aa)%2==1:\r\n print(':('); exit(0)\r\nif len(aa)%2==0:\r\n #print(123)\r\n l= int(len(aa)/2); lp= l#; print(l)\r\n ll= aa[l:]; lll=aa[0:l] #; print(ll)\r\n if ll!=lll:\r\n print(':('); exit(0)\r\n if ll not in t:\r\n print(':('); exit(0)\r\n tp= t[::-1]; tc= ll[::-1]#; print(tp,tc)\r\n if tp.find(tc)!=0:\r\n print(':('); exit(0)\r\n if tp.find(tc)==0:\r\n ul= len(tc)\r\n lu= tp[ul:][::-1]\r\n print(lu); exit(0)\r\n \r\n '''\r\n#print(ord(\"T\")-ord('A')+1)\r\n'''\r\ndef fk (a):\r\n if a=='ACTG':\r\n return 0\r\n # print(a)\r\n cv=0\r\n # cv+= min(abs(ord(a[0])-ord('A')), (ord('A')-ord('A')+1+ 26- ord(a[0])))\r\n cv+= (min(abs(ord(a[0])-ord('A')), (ord('A')-ord('A')+1+ 26- (ord(a[0])-ord('A')+1) ), (ord(a[0])-ord('A')+ abs(27- (ord(\"A\")-ord('A')+1)) ) ))\r\n \r\n # cv+= min(abs(ord(a[1])-ord('C')), (ord('C')-ord('A')+1+ 26- ord(a[1])))\r\n cv+= (min(abs(ord(a[1])-ord('C')), (ord('C')-ord('A')+1+ 26- (ord(a[1])-ord('A')+1) ), (ord(a[1])-ord('A')+ abs(27- (ord(\"C\")-ord('A')+1)) ) ))\r\n \r\n #cv+= min(abs(ord(a[2])-ord('T')), (ord('T')-ord('A')+1+ 26- ord(a[2])))#; print(abs(ord(a[2])-ord('T')), (ord('T')-ord('A')+1+ 26- ord(a[2])))\r\n cv+= (min(abs(ord(a[2])-ord('T')), (ord('T')-ord('A')+1+ 26- (ord(a[2])-ord('A')+1) ), (ord(a[2])-ord('A')+ abs(27- (ord(\"T\")-ord('A')+1)) ) ))\r\n \r\n #cv+= min(abs(ord(a[3])-ord('G')), (ord('G')-ord('A')+1+ 26- ord(a[3])))\r\n cv+= (min(abs(ord(a[3])-ord('G')), (ord('G')-ord('A')+1+ 26- (ord(a[3])-ord('A')+1) ), (ord(a[3])-ord('A')+ abs(27- (ord(\"G\")-ord('A')+1)) ) ))\r\n \r\n return cv\r\n\r\nn= int(input()); s=input(); li=[]\r\nfor i in range(n-4+1):\r\n ab= s[i:i+4]\r\n li.append(fk(ab))\r\nli.sort()\r\nprint(li[0])\r\n'''\r\n'''\r\nn= int(input())\r\nli= list(map(str, input().split())); li= li*2; li= ''.join(li); li= li.replace('0',' ')\r\nli1= li.split()\r\ntry:\r\n print(len(max(li1)))\r\nexcept:\r\n print(0)'''\r\n\r\n'''\r\nfrom math import *\r\n\r\ndef prmfct(n):\r\n li=[]\r\n while n%2==0:\r\n li.append(2)\r\n n= n/2\r\n for i in range(3,int(sqrt(n))+1,2):\r\n while n%i==0:\r\n li.append(int(i))\r\n n=int(n/i)\r\n if n>2:\r\n li.append(int(n))\r\n \r\n \r\n return li\r\n\r\n\r\nn,m= input().split(); n,m= int(n), int(m)\r\n\r\nif m%n!=0:\r\n print(-1)\r\nelse:\r\n lim= prmfct(int(m/n))\r\n li= list(set(lim))\r\n if len(li)==2 and li[0]==2 and li[1]==3:\r\n print(len(lim))\r\n elif len(li)==1 and (li[0]==2 or li[0]==3):\r\n print(len(lim))\r\n elif len(li)==0:\r\n print(0)\r\n else:\r\n print(-1)'''\r\n'''\r\nfrom math import *\r\na,b= input().split(); a,b= int(a), int(b)\r\nprint(factorial(min(a,b)))'''\r\n\r\n#from math import *\r\n#def fact(n):\r\n# li=[]\r\n# for i in range(1,int(sqrt(n))+1):\r\n# if n%i==0:\r\n# li.append(i)\r\n# if i!=n/i:\r\n# li.append(int(n/i))\r\n# li.sort()\r\n# return li\r\n#\r\n#n= int(input())\r\n#li1= list(map(int, input().split()))\r\n#ab= max(li1)\r\n#li2= fact(ab)\r\n#li3= list(i for i in li1 if i not in li2)\r\n#li4= list(set(list(i for i in li1 if li1.count(i)==2)))\r\n#li3.extend(li4)\r\n#print(ab, max(li3))\r\n\r\n\r\n\r\n\r\n\r\n## A Python program to print all \r\n## permutations of given length \r\n#from itertools import permutations \r\n# \r\n## Get all permutations of length 2 \r\n## and length 2 \r\n#perm = permutations([1, 2, 3,4,5,6,7,8,9,0], 4) \r\n#j=1\r\n## Print the obtained permutations \r\n#for i in list(perm):\r\n# li= list(i)\r\n# li[0]=str(li[0]); li[1]=str(li[1]); li[2]=str(li[2]); li[3]=str(li[3])\r\n# ab= ''.join(li)\r\n# print(str(j)+' ' 'Kornopuli'+ab); j+=1\r\n\r\n\r\n\r\n#n= int(input()); li1= list(map(int, input().split())); li3=[]; baal_falan=0\r\n#if n==1:\r\n# if li1[0]==0:\r\n# print(0); exit(0)\r\n# else:\r\n# print(1); exit(0)\r\n#\r\n#for i in range(n):\r\n# if li1[i]==1:\r\n# li3.append(1)\r\n# else:\r\n# if i==0:\r\n# baal_falan=1\r\n# elif i==n-1:\r\n# baal_falan=1\r\n# else:\r\n# if li1[i+1]==0 or li1[i-1]==0:\r\n# baal_falan=1\r\n# else:\r\n# li3.append(1)\r\n# \r\n#print(len(li3))\r\n\r\n#n= int(input()); s= input(); s= s+'0'; li= list(s); baal_falan=0; cn=0; sv=['R','G','B']\r\n#for i in range(n):\r\n# if li[i]!=li[i+1]:\r\n# baal_falan=1\r\n# else:\r\n# cn+=1\r\n# if sv[0]!=li[i] and sv[0]!=li[i+2]:\r\n# li[i+1]= sv[0]\r\n# elif sv[1]!=li[i] and sv[1]!=li[i+2]:\r\n# li[i+1]= sv[1]\r\n# elif sv[2]!=li[i] and sv[2]!=li[i+2]:\r\n# li[i+1]= sv[2]\r\n#print(cn); print(''.join(li[0:n]))\r\n\r\n\r\n#li=[1,5,8,7,4,6,8,2,3,4]\r\n#print(li.index(8))\r\n\r\n# print(ord('z')-ord('a'))\r\n\r\n#n= int(input()); s= input(); li1=[]; li2=[]; li3=[0]*26; cn=0; bl_falan=0\r\n#for i in s:\r\n# if i>='A' and i<='Z':\r\n# li1.append(i)\r\n# else:\r\n# li2.append(i)\r\n# \r\n#for i in range(n-1):\r\n# if li1[i].lower()==li2[i]:\r\n# bl_falan=1\r\n# else:\r\n# ab= li1[i].lower()\r\n# #li3.append(li2[i])\r\n# li3[ord(li2[i])-ord('a')]+=1\r\n# if li3[ord(ab)-ord('a')]==0 and li1 in : #ab not in li3:\r\n# cn+=1\r\n# else:\r\n# li3[ord(ab)-ord('a')]-=1 \r\n# \r\n#print(cn)\r\n\r\n\r\n\r\nn= int(input()); li= list(map(int, input().split())); od=0; ev=0; sm=0\r\nfor i in li:\r\n if i%2==0:\r\n ev+=1\r\n else:\r\n od+=1\r\n sm+= i\r\n \r\nif sm%2==0:\r\n print(ev)\r\nelse:\r\n print(od)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''\r\nAbdul Hamid Shaodagor High School Joni Kanti Pal 01306261062 Redwan Haque Ratul 01846509454\r\nHasne Hena Girls High School Saiyeda Shahinur Parveen 01819858004 Habibur Rahman 01825374474\r\n ''' \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \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\nm=list(map(int,input().split()))\r\ns=sum(m)\r\nc=0\r\nfor i in m:\r\n if (s-i)%2==0:\r\n c+=1\r\nprint(c) ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsum =0\r\nfor x in arr:\r\n sum += x\r\ncount = 0\r\nfor x in arr:\r\n if (sum-x)%2==0:\r\n count+=1\r\nprint(count)", "t=int(input())\r\na=list(map(int,input().split(\" \")))\r\nc=0\r\nd=0\r\nsum=0\r\nfor y in a:\r\n if y%2==0:\r\n c+=1\r\n else:\r\n d+=1\r\n sum+=y\r\nif sum%2==0:\r\n print(c)\r\nelse:\r\n print(d)", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\ns = sum(l)\r\n\r\nans = 0\r\n\r\nfor i in l:\r\n if (s-i)%2 == 0:\r\n ans += 1\r\nprint(ans)\r\n", "number = int(input())\r\nelements = [int(el) for el in input().split(\" \")]\r\nnew_sum = 0\r\ncount = 0\r\nfor i in range(number):\r\n new_sum += elements[i]\r\nfor i in range(number):\r\n if (new_sum - elements[i]) % 2 == 0:\r\n count += 1\r\nprint(count)", "i = int(input())\nbags = [int(x) for x in input().split()]\ntotal = sum(bags)\nans = 0\nfor bag in bags:\n if (total-bag) % 2 == 0:\n ans += 1\nprint(ans)\n\t \t \t \t \t \t \t\t \t \t\t\t\t\t", "input()\r\na = list(map(int, input().split()))\r\nprint(sum([x%2==sum(a)%2 for x in a]))", "l=lambda n: int(n)%2\r\nn=int(input())\r\nb=map(l,input().split())\r\ns=sum(b)\r\nprint([s,n-s][s%2==0])", "\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n ans = 0\r\n sm = sum(arr)\r\n\r\n for i in arr:\r\n if (sm - i) % 2 == 0:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "def g(i):\n return int(i)%2\na=input();a=list(map(g,input().split()));print(a.count(sum(a)%2))", "q=int(input())\r\nw=[int(e)for e in input().split()]\r\nn=0\r\nfor r in w:\r\n if (sum(w)-r)%2==0:\r\n n+=1\r\nprint(n)", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\nb=sum(a)\r\ns=0\r\ntoBeSteal=0\r\nfor i in range(len(a)):\r\n if (b-a[i])%2==0:\r\n toBeSteal=toBeSteal+1\r\nprint(toBeSteal)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nodds = []\r\nevens = []\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n evens.append(a[i])\r\n else:\r\n odds.append(a[i])\r\nif s % 2 == 0:\r\n print(len(evens))\r\nelse:\r\n print(len(odds))", "_ = int(input())\nbags = [int(x) for x in input().split()]\n\npairs = [x for x in bags if x % 2 == 0]\nimpairs = [x for x in bags if x % 2 == 1]\n\nif sum(bags) % 2 == 0:\n print(len(pairs))\nelse:\n print(len(impairs))\n", "n=int(input())\r\nz=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in z:\r\n\tif(i%2==0):\r\n\t\teven+=1\r\n\telse:\r\n\t\todd+=1\r\nif(odd==1):\r\n\tprint(1)\r\nelif(odd%2==1):\r\n\tprint(odd)\r\nelif(odd%2==0):\r\n\tprint(even)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = 0\r\ng = 0\r\nc = 0\r\nn = 0\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n c += l[i]\r\n g += 1\r\n else:\r\n n += l[i]\r\n s += 1\r\nif n % 2 == 0:\r\n print(g)\r\nelse:\r\n print(s)", "n=int(input())\r\nnum=list(map(int,input().split()))\r\ntypes=0\r\nnum.sort()\r\nsum=sum(num)\r\nif sum%2==0:\r\n for i in num:\r\n if i%2==0:\r\n types+=1\r\nelse:\r\n for i in num:\r\n if i%2==1:\r\n types+=1\r\nprint(types)", "n=int(input())\na=list(map(int,input().split()))\ns=sum(a)\n\nans=0\n\nfor i in range(n):\n\tif (s-a[i])%2==0:\n\t\tans+=1\n\nprint(ans)\n", "from collections import Counter\n\nn = int(input())\na = list(map(int , input().split()))\nb = Counter(a)\n\nsum = 0\nfor i in range(n):\n sum += a[i]\n\nans = 0\nfor i in b:\n if sum % 2 == 0:\n if i % 2 == 0:\n ans += b[i]\n else:\n if i % 2 == 1:\n ans += b[i]\nprint(ans)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output4.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)%2==0:\r\n\tp=0\r\n\tfor i in a:\r\n\t\tif i%2==0:\r\n\t\t\tp+=1\r\nelse:\r\n\tp=0\r\n\tfor i in a:\r\n\t\tif i%2!=0:\r\n\t\t\tp+=1\r\nprint(p)\t\t\t\t\t\t", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\neven = 0\r\nodd = 0\r\n\r\nfor i in a:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif sum(a) % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)\r\n", "\r\n\r\nn = int(input())\r\nc = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nsu = 0\r\nfor i in c:\r\n even += int(i % 2 == 0)\r\n odd += int(i % 2 == 1)\r\n su += i\r\n\r\nresult = int(su % 2 == 0) * even + int(su % 2 == 1) * odd\r\nprint (result)", "input();a=list(map(int,input().split()));print(sum([1 if i%2==0 else 0 for i in a]) if sum(a)%2==0 else sum([1 if i%2!=0 else 0 for i in a]))", "n=int(input())\r\nlista=list(map(int,input().split()))\r\ntotal=0\r\nimpar=0\r\npar=0\r\nfor i in lista:\r\n total+=i\r\n if i%2:\r\n impar+=1\r\n else:\r\n par+=1\r\nif total%2:\r\n print(impar)\r\nelse:\r\n print(par)\r\n", "def main(n):\r\n s = [int(i) for i in input().split()]\r\n even = 0\r\n odd = 0\r\n for el in s:\r\n if el%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if odd%2==1:\r\n return odd\r\n return even\r\n\r\nprint(main(int(input())))", "n = int(input())\r\na = [int(x) for x in input().split(' ')]\r\no = [y % 2 for y in a]\r\nif sum(o) % 2 == 0:\r\n ans = n - sum(o)\r\nelse:\r\n ans = sum(o)\r\nprint(ans)", "n = input()\r\nsomething = [int(x) for x in input().split()]\r\nk = sum(something)\r\ntrue = k % 2\r\nanswer = 0\r\nfor i in something:\r\n if i % 2 == 0 and true == 0:\r\n answer += 1\r\n if i % 2== 1 and true ==1:\r\n answer += 1\r\nprint(answer)\r\n ", "n=int(input())\r\narray=list(map(int,input().split()))\r\ne=0\r\nfor i in range(n):\r\n if (sum(array)-array[i])%2==0:\r\n e+=1\r\nprint(e)\r\n", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nsu = sum(l)\r\n\r\nco = 0\r\nfor i in l:\r\n\tif (su - i) % 2 == 0:\r\n\t\tco += 1\r\n\r\nprint(co)", "n = int(input())\r\na = list(map(int, input().split()))\r\ne,o,s=0,0,0\r\nfor i in a:\r\n\tif i%2 == 0:\r\n\t\te+=1\r\n\telse:\r\n\t\to+=1\r\n\ts += i\r\n\r\nif s%2 == 0:\r\n\tprint(e)\r\nelse:\r\n\tprint(o)\r\n\r\n\r\n", "\r\ninput()\r\na = list(map(int, input().split()))\r\ncounter = 0\r\nif sum(a) % 2 == 0:\r\n for i in a:\r\n if i % 2 == 0:\r\n counter += 1\r\nelse:\r\n for i in a:\r\n if i % 2 != 0:\r\n counter += 1\r\nprint(counter)\r\n# CodeForcesian\r\n# ♥\r\n# Thanks God\r\n", "def testcase():\n input()\n a = list(map(int, input().strip().split()))\n even, odd, total = 0, 0, 0\n \n for x in a:\n if x % 2 == 0:\n even += 1\n else:\n odd += 1\n total += x\n\n print(even if total % 2 == 0 else odd)\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "_ = input()\nL = list(map(int, input().split()))\nans = 0\nif sum (L) % 2 == 0 :\n for i in L :\n if i % 2 == 0 :\n ans += 1\nelse :\n for i in L :\n if i % 2 != 0 :\n ans += 1\nprint (ans)", "n=int(input())\r\nce=0\r\nco=0\r\nsteal=0\r\nl=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n ce+=1\r\n else:\r\n co+=1\r\nif ce==n:\r\n print(n)\r\nelif co==n and sum(l)%2==0:\r\n print(0)\r\nelif co==n and sum(l)%2!=0:\r\n print(n)\r\nelif sum(l)%2==0:\r\n print(ce)\r\nelif sum(l)%2!=0:\r\n print(co)", "n = int(input())\r\n\r\narray = list(map(int, input().split()))\r\narray.append(0)\r\narray.reverse()\r\n\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n exclude = array[i]\r\n del array[i]\r\n if sum(array) % 2 == 0:\r\n count += 1\r\n array.insert(i, exclude)\r\nprint(count)\r\n", "n=int(input())\r\nA=[int(x) for x in input().split()]\r\nS=sum(A)\r\ncnt=0\r\nfor i in A:\r\n if (S-i)%2==0:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nbiscuits = list(map(int,input().split()))\r\ncount = 0\r\nfor i in biscuits:\r\n if (sum(biscuits) - i) % 2 == 0:\r\n count+=1\r\nprint(count)", "a = int(input())\r\nx = []\r\nx = list(map(int, input().split()))\r\nans = 0\r\ncookies = 0\r\nfor i in x:\r\n cookies += i\r\nfor i in x:\r\n if (a>1):\r\n if (cookies % 2 == 0):\r\n if (i%2==0):\r\n ans += 1 \r\n elif (cookies % 2 == 1):\r\n if (i%2==1):\r\n ans+=1\r\n else:\r\n ans = 1\r\nprint(ans)", "n = int(input())\r\nbags = list(map(int,input().split()))\r\nbagsSum = sum(bags)\r\nres = 0\r\nfor i in bags:\r\n if((bagsSum-i)%2==0):\r\n res+=1\r\nprint(res)", "cookies_bags = int(input())\ncookie_in_bag = list(map(int, input().split(' ')))\n\nbag_with_odd_cookies = 0\nbag_with_even_cookies = 0\n\nfor cookie in cookie_in_bag:\n if cookie % 2 == 0:\n bag_with_even_cookies += 1\n else:\n bag_with_odd_cookies += 1\n\nif bag_with_odd_cookies % 2 == 1:\n print(bag_with_odd_cookies)\nelse:\n print(bag_with_even_cookies)", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\ntotal = 0\r\nways = 0\r\nfor i in range(len(b)):\r\n total = total + b[i] \r\nif total % 2 == 0:\r\n for i in range (len(b)):\r\n if b[i] % 2 == 0:\r\n ways = ways + 1\r\nelse:\r\n for i in range (len(b)):\r\n if b[i] % 2 != 0:\r\n ways = ways + 1\r\nprint(ways)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\n\r\nfor i in range(len(l)):\r\n if (sum(l)-l[i])%2==0:\r\n c1+=1\r\n else:\r\n c2+=1\r\n if c1+c2==n:\r\n print(c1)\r\n break\r\n ", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nvariants = 0\r\nsummary = sum(b)\r\nfor i in range(a):\r\n if (summary - b[i]) % 2 == 0:\r\n variants += 1\r\nprint(variants)", "from sys import stdin\r\nn=int(stdin.readline().rstrip())\r\nl=list(map(int,stdin.readline().split()))\r\ns=0\r\nfor i in l:\r\n s+=i\r\nif n==1:\r\n print(1)\r\nelse:\r\n if s%2==0:\r\n c=0\r\n for i in l:\r\n if i%2==0:\r\n c+=1\r\n print(c)\r\n else:\r\n c=0\r\n for i in l:\r\n if i%2!=0:\r\n c+=1\r\n print(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\nc = 0\r\nfor i in range(n):\r\n if (s - a[i]) % 2 == 0:\r\n c += 1\r\nprint(c)\n# Mon Dec 13 2021 21:21:24 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\naa=sum(a)\r\nc=0\r\nfor i in a:\r\n if (aa-i)%2==0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\ncount = 0\r\nif sum(a) % 2 == 0:\r\n for i in a:\r\n if i % 2 == 0:\r\n count += 1\r\nelse:\r\n for i in a:\r\n if i % 2 != 0:\r\n count += 1\r\nprint(count)\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 = int(input())\r\nai = list(map(int,input().split()))\r\nnum = sum(ai)\r\nans = 0\r\nfor i in range(n):\r\n if num % 2 == ai[i] % 2:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nanswer = 0\r\nsumma = 0\r\nfor i in a:\r\n summa += i\r\nif summa % 2 == 0:\r\n for j in a:\r\n if j % 2 == 0:\r\n answer += 1\r\nif summa % 2 == 1:\r\n for j in a:\r\n if j % 2 != 0:\r\n answer += 1\r\nprint(answer)\r\n ", "input()\r\nl=list(map(int,input().split()))\r\ns=0\r\ne=0\r\no=0\r\nfor i in l:\r\n s+=i\r\n if i%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\nif s%2==0:\r\n print(e)\r\nelse:\r\n print(o)", "n = int(input());\na = [int(x) for x in input().split()]\n\ntotal = sum(a)\n\np = 0\n\nfor b in a:\n if ((total - b) % 2 == 0):\n p += 1\n\nprint(p)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nz,v =0,0\r\nfor i in a:\r\n\tif i%2 !=0:\r\n\t\tz+=1\r\n\telse:\r\n\t\tv+=1\r\nif sum(a)%2!=0:\r\n\tprint(z)\r\nelse:\r\n\tprint(v)\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\ns = sum(li)\r\nif s % 2 == 0:\r\n c = 0\r\n for i in li:\r\n if i % 2 == 0:\r\n c += 1\r\n print(c)\r\nelse:\r\n c = 0\r\n for i in li:\r\n if i % 2 != 0:\r\n c += 1\r\n print(c)", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nall_c = sum(nums)\r\ncnt = 0\r\nfor c in nums:\r\n if (all_c - c) % 2 == 0:\r\n cnt += 1\r\nprint(cnt)", "n = input()\nm = list(map(int,input().split()))\neven = 0\nodd = 0\nfor i in m:\n\tif(i%2==0):\n\t\teven = even+1\n\telse:\n\t\todd = odd+1\ns = sum(m)\nif(s%2==0):\n\tprint(even)\nelse:\n\tprint(odd)\n", "n=int(input())\r\ns=input().split()\r\na=[]\r\nfor u in s:\r\n a.append(int(u))\r\nr=sum(a)\r\nkol=0\r\nfor y in range(len(a)):\r\n if (r-a[y])%2==0:\r\n kol+=1\r\nprint(kol)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nodd=even=0\r\nfor i in range(n):\r\n if lst[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif odd%2!=0:\r\n print(odd)\r\nelse:\r\n print(even)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\ntotal=sum(nums)\r\n\r\n# ans=0\r\nodd,even=0,0\r\nfor item in nums:\r\n if item%2:\r\n odd+=1\r\n else:\r\n even+=1 \r\nif total%2==0:\r\n print(even) \r\nelse:\r\n print(odd) ", "import sys\r\nn=int(input())\r\nlista=[int(x) for x in input().strip().split()]\r\nif(sum(lista)%2==0):\r\n print(len(list(filter(lambda x: x%2==0, lista))))\r\nelse:\r\n print(len(list(filter(lambda x: x%2==1, lista))))", "#!/usr/bin/env python3\n\ndef main():\n n, ans = int(input()), 0\n arr = [int(ai) for ai in input().split()]\n summ = sum(arr) & 1\n \n ans = sum(ai & 1 == summ for ai in arr)\n \n print(ans)\n\nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\ns = sum(nums)\r\n\r\nc = 0\r\nif s % 2 == 0:\r\n for elem in nums:\r\n if elem % 2 == 0:\r\n c += 1\r\nelse:\r\n for elem in nums:\r\n if elem % 2 != 0:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ns=sum(l)\r\nc=0\r\nfor x in range(len(l)):\r\n if (s-l[x])%2==0:\r\n c+=1\r\nprint(c)", "t = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum(l)\r\nans = 0\r\nfor i in set(l):\r\n \r\n if (s-i)%2 == 0:\r\n \r\n ans += l.count(i)\r\nprint(ans) \r\n \r\n ", "t=int(input())\r\nx=[int(q) for q in input().split()]\r\nans=0\r\nif len(x)==1:\r\n ans=1\r\nelse:\r\n if sum(x)%2==0:\r\n for i in range(len(x)):\r\n if x[i]%2==0:\r\n ans+=1\r\n else:\r\n for i in range(len(x)):\r\n if x[i]%2==1:\r\n ans+=1\r\nprint(ans)", "#link : https://codeforces.com/problemset/problem/129/A\r\n#author : Mohamed Ibrahim\r\n\r\ninput()\r\na=[int(x)%2 for x in input().split()]\r\nprint(a.count(sum(a)%2))\r\n", "n=int(input())\r\nlist=list(map(int,input().split()))\r\ns=sum(list)\r\ncount=0\r\nfor i in list:\r\n if(s-i)%2==0:\r\n count+=1\r\nprint(count)", "n=int(input()) \r\nbaglist=[int(x) for x in input().split()]\r\nsum=sum(baglist)\r\ncnt=0\r\nbagset=set(baglist)\r\nfor bag in bagset:\r\n c=baglist.count(bag)\r\n s=sum-bag\r\n if(s%2==0):\r\n cnt+=c\r\nprint(str(cnt))", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nd = [i for i in s if i%2!=0]\r\n\r\nif len(d)%2==0:\r\n\tprint(len(s)-len(d))\r\nelse:\r\n\tprint(len(d))", "n=int(input())\r\nA=list(map(int,input().split()))\r\nc=0\r\nif sum(A)%2==0:\r\n for i in A:\r\n if i%2==0:\r\n c+=1\r\nelse:\r\n for i in A:\r\n if i%2 !=0:\r\n c+=1\r\nprint(c)\r\n ", "n=int(input())\r\na=input().split()\r\nl=[]\r\nfor i in a:\r\n l.append(int(i))\r\nans=0\r\nfor i in l:\r\n if i%2==0 and sum(l)%2==0:\r\n ans+=1\r\n else:\r\n if (sum(l)-i)%2==0:\r\n ans+=1\r\nprint(ans)", "n = int(input())\n\nn = list(map(int, input().split()))\n\n\nsum_all = 0\nfor i in n:\n sum_all += i\n\nanswer = 0\nfor i in n:\n if(sum_all - i) % 2 == 0:\n answer+= 1\n\nprint(answer)", "n = int(input())\r\nnumb = list(map(int, input().split()))\r\nodd = 0\r\nnot_odd = 0\r\nfor i in numb:\r\n\tif i % 2:\r\n\t\todd += 1\r\n\telse:\r\n\t\tnot_odd += 1\r\nsm = sum(numb)\r\nif sm % 2:\r\n\tprint(odd)\r\nelse:\r\n\tprint(not_odd)", "counter = 0\nlargo = input()\nlenght = int(largo)\nbolsas = input().split(\" \")\nif len(bolsas) != lenght:\n print(0)\nelse:\n bolsas = [int(x) for x in bolsas]\n for element in bolsas:\n par = sum(bolsas) - element\n if par%2 == 0:\n counter += 1\nprint(counter)\n", "n = int(input())\r\nbags = input().split(' ')\r\ncounter = 0\r\nsumm = 0\r\nfor bag in bags:\r\n summ += int(bag)\r\ndiv = 0 if summ % 2 == 0 else 1\r\nfor bag in bags:\r\n if int(bag) % 2 == div:\r\n counter += 1\r\nprint(counter)", "# cook your dish here\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\ns = sum(a)\r\nfor i in a:\r\n if s%2==0 and i%2==0:\r\n cnt = cnt + 1\r\n elif s%2!=0 and i%2!=0:\r\n cnt = cnt + 1\r\nprint(cnt)", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\ns = 0\r\nodd = 0\r\neven = 0\r\nfor i in a:\r\n s+=i\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n \r\nif s%2==0:\r\n print(even)\r\nelse:\r\n print(odd)", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn = int(input())\r\nL = [int(x) for x in input().split()] # read multiple integers into a list\r\ns = sum(L)\r\nct = 0\r\nfor x in L :\r\n if (x % 2 == s % 2) : ct += 1\r\nprint(ct)\r\n\r\n\r\n", "number_of_bags = int(input())\r\ncookies_in_each_bag = list(map(int, input().split()))\r\ncounter = 0\r\nnumber_of_cookies = 0\r\neven_numbers = 0\r\nodd_numbers = 0\r\nwhile counter < number_of_bags:\r\n number_of_cookies = number_of_cookies + cookies_in_each_bag[counter]\r\n if cookies_in_each_bag[counter] % 2 == 0:\r\n even_numbers = even_numbers + 1\r\n else:\r\n odd_numbers = odd_numbers + 1\r\n counter = counter + 1\r\nif number_of_cookies % 2 == 0:\r\n print(even_numbers)\r\nelse:\r\n print(odd_numbers)", "from functools import reduce\r\n\r\n\r\ndef main():\r\n _ = int(input())\r\n cs = list(map(int, input().split()))\r\n s = reduce(lambda x, y: x + y, cs)\r\n\r\n w = 0\r\n for c in cs:\r\n if (s - c) % 2 == 0:\r\n w += 1\r\n\r\n print(w)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input()\nl=[*map(int,input().split())]\nAns=0\nif sum(l)%2==0:\n for i in l:\n if i%2==0:\n Ans+=1\nelse:\n for i in l:\n if i%2!=0:\n Ans+=1\nprint(Ans)", "n = int(input())\r\nc = 0\r\nbags = [int(x) for x in input().split(' ')]\r\n\r\nways = 0\r\n\r\nwhile c < n:\r\n if (sum(bags) - bags[c]) % 2 == 0:\r\n ways += 1\r\n c += 1\r\n\r\nprint(ways)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 8 16:20:24 2020\n\n@author: anirudhasarmatumuluri\n\"\"\"\ndef main():\n n = int(input())\n arr = [int(x) for x in input().split()]\n total = 0\n odd = 0\n even = 0\n for x in arr:\n if x%2==0:\n even+=1\n else:\n odd+=1\n total+=x\n \n if total%2==0:\n print(even)\n return\n else:\n print(odd)\n return\n \nmain()", "n = int(input())\r\nbag = [int(x) for x in input().split()]\r\ne = 0\r\no = 0\r\nfor i in range (n):\r\n if bag[i] % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\nif o % 2 == 0:\r\n print(e)\r\nelse:\r\n print(o)", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\neven, odd = 0, 0\r\n\r\nfor i in a:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif odd % 2 == 1:\r\n print(odd)\r\nelse:\r\n print(even)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif sum(l)%2==0:\r\n s=[l[i]%2==0 for i in range(n)]\r\nelse:\r\n s=[l[i]%2!=0 for i in range(n)]\r\nprint(sum(s))", "n = int(input())\na = list(map(int, input().split()))\nec = 0\noc = 0\nfor ele in a:\n if ele % 2 == 0:\n ec += 1\n else:\n oc += 1\n\nif oc%2==1:\n print(oc)\nelse:\n print(ec)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\ns=sum(a)\r\nc=0\r\nfor x in range(len(a)):\r\n\tif((s-a[x])%2==0):\r\n\t\tc+=1\r\nprint(c)", "n = int(input())\r\ncookies = list(map(int, input().split()))\r\ns = sum(cookies) % 2\r\nans = 0\r\nfor p in cookies:\r\n if (s + p % 2) % 2 == 0:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\ncookies = list(map(int, input().split()))\r\ntotal = sum(cookies)\r\nans = 0\r\nfor c in cookies:\r\n if not (total - c) & 1:\r\n ans += 1\r\nprint(ans)\r\n", "n= int(input())\r\ncoo= list(map(int, input().split()))\r\ncookie= [int(0) if int(i)%2==0 else int(1) for i in coo]\r\nif sum(coo)%2==0:\r\n ans= cookie.count(0)\r\n print(ans)\r\nelse:\r\n ans= cookie.count(1)\r\n print(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncount1=0\r\nif(n>0):\r\n if(sum(l)%2==0):\r\n for i in l:\r\n if(i%2==0):\r\n count1=count1+1\r\n else:\r\n for i in l:\r\n if(i%2!=0):\r\n count1=count1+1\r\n print(count1)\r\nelse:\r\n print(0)", "n = int(input())\r\nbags = list(map(int, input().split()))\r\n\r\neven_count = sum(1 for cookies in bags if (sum(bags) - cookies)%2==0)\r\nprint(even_count)", "n= int(input())\r\nlst = [int (x) for x in input().split()]\r\ns=0\r\nodd=0\r\neven=0\r\nfor i in lst:\r\n s=s+i\r\n if(i%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nif(s%2==0):\r\n print(even)\r\nelse:\r\n print(odd)", "\"\"\"For testing snippets.\"\"\"\ninput()\ncookies = list(map(int, input().split()))\neven = 0\nodd = 0\nfor i in cookies:\n if i % 2 == 0:\n even += 1\n else:\n odd += 1\nif odd % 2 == 0:\n print(even)\nelse:\n print(odd)\n", "n=int(input())\r\na=list((map(int,input().split())))\r\nans=0\r\ns=sum(a)\r\nfor i in range(len(a)):\r\n if (s-a[i])%2==0:\r\n ans+=1\r\nprint(ans)\r\n \r\n ", "n = int(input())\r\na = list(input().split(' '))\r\na = list(int(x) for x in a)\r\nres = 0\r\nsumma = 0\r\nfor i in range(n):\r\n summa += a[i]\r\nfor i in range(n):\r\n if (summa - a[i]) % 2 == 0:\r\n res += 1\r\nprint(res)\r\n", "input()\r\nA = list(map(int, input().split()))\r\n\r\nprint(sum(a % 2 for a in A) if sum(A) % 2 else sum(a % 2 == 0 for a in A))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nse=so=0\r\nfor i in l:\r\n if i%2==0:\r\n se+=1\r\n else:\r\n so+=1\r\nif sum(l)%2==0:\r\n print(se)\r\nelse:\r\n print(so)", "n = int(input())\r\nl = len(list(filter(lambda x: x%2, map(int,input().split()))))\r\nprint ((n-l, l)[l%2])", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=sum(b)\r\nd=0\r\nif c%2==0:\r\n for i in b:\r\n if i%2==0:\r\n d+=1\r\nelse:\r\n for l in b:\r\n if l%2!=0:\r\n d+=1\r\nprint(d)", "a=input()\r\nx=int(a);\r\nimport array;\r\narr=array.array('l',[])\r\nap=array.array('l',[])\r\nar=[int(i)for i in input().split()]\r\noo=0\r\nee=0\r\nfor k in range (0,x,1):\r\n if((ar[k])%2==0):\r\n ee=ee+1;\r\n else:\r\n oo=oo+1;\r\nif(oo%2==0):\r\n print(ee);\r\nelse:\r\n print(oo);\r\n ", "n = int(input()) \ncookies = list(map(int, input().split()))\n\nx = sum(cookies)%2\nk = 0\nfor c in cookies:\n if c%2 == x: k += 1\nprint(k)", "\r\nn = int(input())\r\n\r\nk= list(map(int, input().split()))\r\ns = sum(k)\r\nt = 0\r\n\r\nfor b in k:\r\n if (s - b) % 2 == 0:\r\n t += 1\r\n\r\nprint(t)", "from collections import Counter\nn = int(input())\ncookies = list(map(int, input().split()))\ntotal = sum(cookies)\n# print(total)\ncnt = dict(Counter(cookies))\nways = 0\nfor key in cnt:\n if (total - key) % 2 == 0:\n ways += cnt[key]\nprint(ways)\n", "N = int(input())\r\nP = [int(i) for i in input().split()]\r\nc0=0\r\nc1=0\r\nfor i in P:\r\n if i%2==0:\r\n c0+=1\r\n else:\r\n c1+=1\r\nif c1%2 == 0:\r\n print(c0)\r\nelse:\r\n print(c1)\r\n", "n=int(input())\r\nli=list(filter(lambda x: x%2!=0,map(int,input().split())))\r\nj=len(li)\r\nif len(li)%2==0:\r\n\tprint(n-j)\r\nelse:\r\n\tprint(j)", "n=int(input())\r\nvar=[int(x) for x in input().split()]\r\nsumOfNum=sum(var)\r\ncount=0\r\nif(sumOfNum%2==0):\r\n\tfor i in var:\r\n\t\tif(i%2==0):\r\n\t\t\tcount+=1\r\nif(sumOfNum%2==1):\r\n\tfor i in var:\r\n\t\tif(i%2==1):\r\n\t\t\tcount+=1\r\nprint(count)", "n = int(input())\r\n\r\ncookies = list(map(int, input().split(\" \")))\r\n\r\nodds = 0\r\n\r\nfor cookie in cookies:\r\n if cookie % 2:\r\n odds += 1\r\n\r\nif odds % 2:\r\n print(odds)\r\nelse:\r\n print(n - odds)", "# You\r\n# Dont read my code\r\na = input()\r\neven = odd = ans = 0 \r\nfor i in map(int,input().split()):\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n ans += i\r\nif ans % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)", "input()\r\na=list(map(int,input().split()))\r\nq,r=sum(a)%2,0\r\nfor i in a:\r\n if i%2==q:r+=1\r\nprint(r)", "bagnum = int(input())\r\ncookienums = input().split()\r\nnewlist = [int(s) for s in cookienums]\r\ntotalnum = 0\r\nfor i in range(len(cookienums)):\r\n totalnum += newlist[i]\r\npossibleways = 0\r\n\r\nfor i in range(len(newlist)):\r\n if (totalnum - newlist[i]) % 2 == 0:\r\n possibleways += 1\r\n else:\r\n continue\r\n\r\nprint(possibleways)\r\n", "n=int(input())\r\ns=input()\r\ns = s.split()\r\nsum=0\r\nco=0\r\nce=0\r\nfor i in range(n):\r\n sum = sum + int(s[i])\r\n if(int(s[i])%2==0):\r\n ce=ce+1\r\n else:\r\n co=co+1\r\nif(sum%2==0):\r\n print(ce)\r\nelse:\r\n print(co)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nans=0\r\nfor i in range(n):\r\n if (s-l[i])%2==0:\r\n ans+=1\r\nprint(ans)", "input()\nvals = list(map(int,input().split()))\nsum = sum(vals)\nres = 1\nif sum%2==0:\n\tres = 0\nsol = 0\nfor bag in vals:\n\tif bag%2==res:\n\t\tsol += 1\nprint(sol)\n \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\ns = sum(a)\r\nh = \"нечётно\"\r\nc = 0\r\nif s % 2 == 0:\r\n h = \"чётно\"\r\nfor ai in a:\r\n if (ai % 2 == 1 and h == \"нечётно\") or (ai % 2 == 0 and h == \"чётно\"):\r\n c = c + 1\r\n \r\nprint(c)\r\n\r\n\r\n ", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nodds = len([x for x in l if x%2])\r\nevens = n-odds\r\nif evens:\r\n if odds%2:\r\n print(odds)\r\n else:\r\n print(evens)\r\nelse:\r\n if n%2:\r\n print(odds)\r\n else:\r\n print(0)", "n = int(input())\r\neven,odd=0,0\r\nx=[int(i) for i in input().split()]\r\nfor i in x:\r\n if i%2==0:\r\n even+=1\r\n else :\r\n odd+=1\r\nprint(odd if odd%2==1 else even)", "n = int(input ())\r\nbags = [int(x) for x in input().split()]\r\ncookies = sum(bags)\r\nways = 0\r\n\r\nfor i in range(n):\r\n if not (cookies - bags[i]) % 2 :\r\n ways += 1\r\n\r\nprint(ways)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na_sum = sum(a)\r\nif a_sum % 2 == 0:\r\n counter = 0\r\n for elem in a:\r\n if elem % 2 == 0:\r\n counter+=1\r\n print(counter)\r\nelse:\r\n counter = 0\r\n for elem in a:\r\n if elem % 2 != 0:\r\n counter+=1\r\n print(counter)\r\n", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ns=0\r\nx=sum(arr)\r\nfor i in range(n):\r\n\tif (x-arr[i])%2==0:\r\n\t\ts=s+1\r\nprint(s)\r\n\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nc = 0\r\nb = 0\r\nfor i in range(len(l)):\r\n\tif l[i] % 2 == 0:\r\n\t\tc+=1\r\n\telse:\r\n\t\tb+=1\r\nif sum(l) % 2 == 0:\r\n\tprint(c)\r\nelse:\r\n\tprint(b)", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=sum(l)\r\nk=0\r\nif p%2==0 :\r\n for i in range(n) :\r\n if l[i]%2==0 :\r\n k=k+1\r\nelse :\r\n for i in range(n) :\r\n if l[i]%2!=0 :\r\n k=k+1\r\nprint(k)\r\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nfor i in d:\r\n s+=i\r\nfor i in d:\r\n if s%2==i%2:\r\n c+=1\r\nprint(c)", "n = int(input()) #Number of Bags\r\nbags = list(map(int, input().split())) #Content of Bags\r\n\r\ntotal = 0 #Total of Cookies\r\noutput = 0 #Number of Possibilities\r\n\r\nfor i in range(n):\r\n total += bags[i]\r\n\r\nfor i in range(n):\r\n if (total - bags[i]) % 2 == 0:\r\n output += 1\r\n\r\nprint(output)", "from sys import stdin as sin\r\ndef aint():return int(sin.readline())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return str(sin.readline().split())\r\n\r\nn = int(input())\r\nl = alist()\r\n\r\ns = sum(l)\r\no=0\r\ne=0\r\nfor i in l:\r\n if i%2==0:e+=1\r\n else:o+=1\r\nif s%2==0:\r\n print(e)\r\nelse:\r\n print(o)", "n = int(input())\r\na = list(map(int, input().split()))\r\nsm = sum(a)\r\nans = 0\r\nfor x in a:\r\n if (sm-x)%2 == 0:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nways=0\r\nfor i in range(n):\r\n\tsum+=a[i]\r\nfor i in range(n):\r\n\tif((sum-a[i])%2==0):\r\n\t ways+=1\r\nprint(ways)\t", "n = int(input())\ns = [int(i) for i in input().split()]\nk = 0\nd = 0\nfor i in range(n):\n\tk += s[i]\n\tif s[i] % 2 == 0:\n\t\t\td += 1\nif k % 2 == 0:\n\tprint(d)\nelse:\n\tprint(n - d)\n\n# Sat Sep 25 2021 12:11:07 GMT+0300 (Москва, стандартное время)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n):\r\n temp = a[i]\r\n a[i] = 0\r\n if sum(a) % 2 == 0:\r\n res += 1\r\n a[i] = temp\r\nprint(res)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nc=0\r\nfor i in l:\r\n if(i%2 == 0):\r\n c+=1\r\nif(sum(l)%2 == 0):\r\n print(c)\r\nelse:\r\n print(len(l)-c)", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\ns,ans = sum(arr),0\r\n\r\nfor i,item in enumerate(arr):\r\n \r\n if (s - item) % 2 == 0:\r\n \r\n ans += 1\r\n \r\nprint(ans)", "n = int(input())\r\nsList = list(map(int,input().split()))\r\na = sum(sList)\r\ncount = 0\r\nfor i in sList:\r\n if (a-i)%2 == 0:\r\n count += 1\r\nprint(count)\r\n", "n, a = int(input()), list(map(lambda x: int(x) % 2, input().split(\" \")))\nc = a.count(1)\nif c % 2 == 1:\n print(c)\nelse:\n print(n-c)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=0\r\nfor i in l:\r\n if (sum(l)-i)%2==0:\r\n t +=1\r\nelse:\r\n print(t)\r\n", "x = int(input())\ny = list(map(int, input().split()))\ncookies = sum(y)\ncounter = 0\nfor i in y:\n if ((cookies - i) % 2 == 0):\n counter += 1\n\nprint(counter)", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=0\r\nfor i in m:\r\n\tif sum(m)%2==0:\r\n\t\tif i%2==0:\r\n\t\t\ta+=1\r\n\telse:\r\n\t\tif i%2==1:\r\n\t\t\ta+=1\r\nprint(a)", "import traceback\r\n\r\ndef solve(b,n):\r\n count=0\r\n for i in b:\r\n if (n-i)%2==0:\r\n count+=1\r\n return count\r\n\r\ndef dataInput():\r\n sumN=0\r\n n=int(input())\r\n b=[]\r\n a=input().split(\" \")\r\n for i in a:\r\n b.append(int(i))\r\n sumN+=int(i)\r\n print(solve(b,sumN)) \r\n\r\n\r\ndef main():\r\n dataInput()\r\n\r\nif __name__=='__main__':\r\n try:\r\n main()\r\n except:\r\n traceback.print_exc()", "n = int(input())\nz = list(map(int,input().split()))\nc = sum(z)\ne=o=0\nfor i in z :\n if i%2 == 0:\n e+=1\n else:\n o+=1\n\nans = 0 \nif(c%2==0):\n ans+=e\nelse:\n ans+=o\nprint(ans)\n\n", "bag_num = input()\r\n\r\ncookie_num = input().split()\r\n\r\nremoved_bags = 0\r\ntotal_cookies = 0\r\n\r\n\r\nfor i in cookie_num:\r\n\r\n\ttotal_cookies = total_cookies + int(i)\r\nfor i in cookie_num:\r\n\r\n\tif (total_cookies-int(i))%2 == 0:\r\n\r\n\t\tremoved_bags = removed_bags + 1\r\n\r\nprint(removed_bags)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nk=0\r\nm=0\r\nfor i in l:\r\n s=s+i\r\n if i%2==0:\r\n k+=1\r\n else:\r\n m+=1\r\n\r\nif s%2==0:\r\n print(k)\r\nelse:\r\n print(m)", "n=int(input())\r\nc=0\r\na=list(map(int,input().split()))\r\nt=sum(a)\r\nz=t%2\r\nfor i in a:\r\n if i%2==z:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nodds = sum(1 for x in lst if x % 2 == 1)\r\nif odds % 2 == 1:\r\n print(odds)\r\nelse:\r\n print(n - odds)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nres, res1, res2 = 0, 0, 0\r\nfor i in a:\r\n res += i\r\n if i % 2 == 0:\r\n res1 += 1\r\n else:\r\n res2 += 1\r\nif res % 2 == 0:\r\n print(res1)\r\nelse:\r\n print(res2)", "n,a=int(input()),list(map(int,input().split()))\r\neven=list(filter(lambda x:x%2==0,a))\r\nodd=n-len(even)\r\nif odd%2!=0:\r\n\tprint(odd)\r\nelse:\r\n\tprint(len(even))", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(n):\r\n if lst[i] % 2 == 0:\r\n k += 1\r\n\r\nif sum(lst) % 2 == 0:\r\n print(k)\r\nelse:\r\n print(len(lst) - k)\r\n", "integer = int\r\nstring = str\r\nlength = len\r\n\r\n\r\ndef main():\r\n n=int(input())\r\n l=list(map(integer,input().split()))\r\n add=0\r\n odd=0\r\n even=0\r\n for i in l:\r\n add+=i\r\n if i%2:\r\n odd+=1\r\n else:\r\n even+=1\r\n if add%2:\r\n print(odd)\r\n else:\r\n print(even)\r\nmain()", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nc=sum(w)%2\r\nres=0\r\nfor j in w:\r\n if j%2==c:\r\n res+=1\r\nprint(res)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ng = 0\r\nb = 0\r\n\r\nfor i in a:\r\n g += i\r\n\r\nif g%2 == 0:\r\n for i in a:\r\n if i%2 == 0:\r\n b += 1\r\nelse:\r\n for i in a:\r\n if i%2 == 1:\r\n b += 1\r\nprint(b)", "n = int(input())\r\nli = [int(num) for num in input().split(' ')]\r\n\r\ntotal, ans = 0, 0\r\nfor num in li: total += num\r\n\r\nfor num in li:\r\n if (total-num) % 2 == 0: ans += 1\r\n\r\nprint(ans)", "bags = int(input())\r\ncookies = input().split()\r\nsumma = 0\r\nodd = 0\r\neven = 0\r\nfor i in range(bags):\r\n summa += int(cookies[i])\r\n if int(cookies[i]) % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif summa % 2 == 0:\r\n print(even)\r\nelse:\r\n print(odd)", "n=int(input())\r\nlis=list(map(int,input().strip().split()))\r\ns=sum(lis)\r\nif n==1:\r\n print(1)\r\nelse:\r\n c=0\r\n nl=[]\r\n if s%2==0:\r\n for i in lis:\r\n if i not in nl:\r\n if i%2==0:\r\n c=c+lis.count(i)\r\n nl.append(i)\r\n else:\r\n for i in lis:\r\n if i not in nl:\r\n if i%2!=0:\r\n c=c+lis.count(i)\r\n nl.append(i)\r\n print(c)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sum(a);ans=0\r\nif b%2==0:\r\n for x in a:\r\n if x%2==0:ans+=1\r\nelse:\r\n for x in a:\r\n if x%2==1:ans+=1\r\nprint(ans)", "pack = int(input())\r\ncookies = list(map(int, input(). split()))\r\nkol = 0\r\nsumma = sum(cookies)\r\n\r\nfor i in cookies:\r\n if (summa - i) % 2 == 0:\r\n kol += 1\r\nprint(kol)", "n=int(input())\na=list(map(int,input().split()))\nk=sum(a)%2\nc=0\nfor i in range(n):\n if a[i]%2==k:\n c+=1\nprint(c)\n ", "n = int(input())\r\nl = [int(x) for x in input().split(\" \")]\r\nflag = 1\r\ncount = 0\r\nif(sum(l)%2==0):\r\n flag = 0\r\nfor i in l:\r\n if(flag == 0 and i%2 == 0):\r\n count +=1\r\n elif(flag == 1 and i%2!=0):\r\n count+=1\r\n\r\nprint(count)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(a)):\r\n if sum(a)-a[i]&1==0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nodd = even = 0\r\nfor i in range(len(l)):\r\n if(l[i]%2!=0):\r\n odd+=1\r\n else:\r\n even+=1\r\nif(odd%2==0):\r\n print(even)\r\nelse:\r\n print(odd)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ncount = 0\r\n\r\nfor i in arr:\r\n if (sum(arr) - i) % 2 == 0:\r\n count += 1\r\nprint(count)", "import collections\n\ndef main():\n num=int(input())\n arrnum=[int(i) for i in input().split(\" \")]\n aux2=collections.Counter(arrnum)\n\n if sum(arrnum)%2==0:\n print(sum([valor for clave,valor in aux2.items() if clave%2==0]))\n else:\n print(sum([valor for clave,valor in aux2.items() if clave % 2 != 0]))\n\n\nif __name__ == '__main__':\n main()", "def main():\n\tbags = int(input())\n\tif bags < 1 or bags > 100:\n\t\treturn 0\n\t\n\tstring = input()\n\tstring = string.split(\" \")\n\tif len(string) < 1 or len(string) != bags:\n\t\treturn 0\n\t\n\timp = 0\n\tpar = 0\n\tsoma = 0\n\tfor i in range(bags):\n\t\tsoma += int(string[i])\n\t\tif int(string[i]) % 2 == 0:\n\t\t\tpar += 1\n\t\telse:\n\t\t\timp += 1\n\n\tif soma % 2 == 0:\n\t\tprint(par)\n\telse:\n\t\tprint(imp)\n\t\t\n\treturn\nmain()", "n = int(input())\ns = list(map(int,input().split()))\nnum = 0\nfor i in range(n):\n if i==0:\n m = sum(s[1:])\n elif i==n-1:\n m = sum(s[:n-1])\n else:\n m = sum(s[:i])+sum(s[i+1:])\n if m%2 == 0:\n num += 1\nprint(num)\n", "n = int(input())\r\na= list(map(int,input().split()))\r\neven=0\r\nodd = 0\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n even+=1\r\n\r\n else:\r\n odd +=1\r\nif odd%2!=0:\r\n print(odd)\r\nelif odd%2==0:\r\n print(even)\r\nelse:\r\n print(0)\r\n", "v=0\r\nc=0\r\nz=int(input()) \r\nx=list(map(int,input().split()))\r\nc=sum(x)\r\nfor i in range(z):\r\n if (c-x[i])%2==0:\r\n v+=1\r\nif v==0:\r\n print(0)\r\nelse:\r\n print(v)", "n = int(input())\r\ncookies = list(map(int, input().split()))\r\n\r\ns = sum(cookies)\r\ncnt = 0\r\nfor i in range(len(cookies)):\r\n if ((s - cookies[i]) % 2) == 0:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n \r\n", "def process():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n even = 0\r\n total = 0\r\n \r\n for a in arr:\r\n even += a % 2 == 0\r\n total += a\r\n \r\n odd = n - even\r\n \r\n if total % 2 == 0:\r\n print(even)\r\n else:\r\n print(odd)\r\n \r\nprocess()", "n = int(input())\nbags = [*map(int, input().split())]\ntotal = sum(bags)\ne = len([i for i in bags if i&1 == 0]) \no = len([i for i in bags if i&1 == 1]) \n\nprint(o if total&1 else e)\n", "n=input()\r\nL=list(map(int,input().split(\" \")))\r\ncont=0\r\na=sum(L)%2\r\nfor k in L:\r\n if(k%2==a):\r\n cont+=1\r\nprint(cont)\r\n", "def main():\n input()\n l = [0, 0]\n for x in map(int, input().split()):\n l[x & 1] += 1\n print(l[l[1] & 1])\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\ns=sum(A)\r\nc=0\r\nfor a in A:\r\n if not (s-a)%2:\r\n c+=1\r\nprint(c) \r\n", "n=int(input())\r\nels=list(map(int,input().split()))\r\nco=0\r\nfor u in range(n):\r\n el=els.copy()\r\n el.pop(u)\r\n if sum(el)%2==0:\r\n co+=1\r\nprint(co)\r\n", "a = int(input())\r\ns = list(map(int, input().split()))\r\nn = 0\r\nfor i in range(a):\r\n if (sum(s) - s[i]) % 2 == 0:\r\n n += 1\r\nprint(n)\r\n", "n = int(input())\r\narray = [i for i in map(int, input().split())]\r\nodd_cookies_bag = 0\r\neven_cookies_bag = 0\r\nsum_cookies = 0\r\n\r\nfor bag in array: \r\n sum_cookies += bag\r\n if bag % 2 == 0: \r\n even_cookies_bag += 1\r\n else:\r\n odd_cookies_bag += 1\r\n\r\nif sum_cookies % 2 == 0:\r\n print(even_cookies_bag)\r\nelse:\r\n print(odd_cookies_bag)\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = sum(a)\r\nc = 0\r\nfor i in a:\r\n if (s-i)%2==0:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nkol=0\r\nls=list(map(int,input().split()))\r\na=sum(ls)\r\nfor i in range(len(ls)):\r\n if a%2:\r\n if ls[i]%2:\r\n kol+=1\r\n else:\r\n if ls[i]%2==0:\r\n kol+=1\r\nprint(kol)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\ns=sum(a)\r\nfor x in range(n):\r\n if (s-a[x])%2==0:\r\n ans+=1\r\nprint(ans)\r\n", "n=int(input())\r\nc=list(map(int,input().split(' ')))\r\nodd=0\r\nres=0\r\nfor i in c:\r\n if i%2==1:\r\n odd+=1\r\nif odd%2==0:\r\n print(n-odd)\r\nelse:\r\n print(odd)", "a=int(input())\nn=input().split()\nfor i in range(len(n)):\n n[i]=int(n[i])\ncount=0\nx=0\nl=[]\nfor i in n:\n l.append(i)\nfor i in l:\n n.remove(n[x])\n x+=1\n if sum(n)%2==0:\n count+=1\n n.insert(x-1,i)\nprint(count)\n ", "totalBags = int(input().strip())\nbags = list(map(int, input().strip().split()))\n\nif sum(bags) % 2 == 0:\n print(len([x for x in bags if x % 2 == 0]))\nelse:\n print(len([x for x in bags if x % 2 == 1]))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nnum=0\r\nnum1=0\r\n\r\nsum=0\r\n\r\nfor i in a:\r\n sum+=i\r\n if(i%2==0):\r\n num+=1\r\n else:\r\n num1+=1\r\n\r\nif(sum%2==0):\r\n print(num)\r\nelse:\r\n print(num1)", "n = int(input())\r\ncookies = [int(i) for i in input().split()]\r\nres = 0\r\n\r\nfor i in range(n):\r\n if (sum(cookies) - cookies[i]) % 2 == 0:\r\n res += 1\r\n\r\nprint(res)", "# a = int(input())\n# b = int(input())\n# if a % 2 != 0 and b % 2 == 0:\n# a = a + 1\n# elif a % 2 == 0 and b % 2 != 0:\n# a = a - 1\n# if a + 1 == b:\n# print(0)\n# else:\n# print(abs((b-a)//2))\n\n# a = int(input())\n# b = int(input())\n# c = int(input())\n# d = [a, b, c]\n# e = 0\n# for i in d:\n# counter = 0\n# for j in d:\n# if i <= j:\n# counter = counter + 1\n# if counter >= 2:\n# if i > e:\n# e = i\n# print(e)\n\n# m = int(input())\n# j = 1\n# g = 0\n# while j**2 < m:\n# if m % (j**2) == 0:\n# g = j**2\n# j = j + 1\n# print(g)\n\n# n = int(input())\n# f = '+--+'\n# result = ''\n# if n % 4 != 0:\n# n = n - 3\n# result = result + '--+'\n# if n % 4 == 0:\n# result = result + f*(n//4)\n# if n % 4 != 0:\n# result = 'IMPOSSIBLE'\n# print(result)\n\n# k = input().lower()\n# x = 0\n# y = 0\n# a = ''\n# b = ''\n# s = 0\n# for i in k:\n# if i.isalpha():\n# if i == 'n':\n# y = y + s\n# elif i == 's':\n# y = y - s\n# elif i == 'e':\n# x = x + s\n# elif i == 'w':\n# x = x - s\n# s = 0\n# else:\n# s = s*10 + int(i)\n# if x < 0:\n# a = f'{-x}w'\n# elif x > 0:\n# a = f'{x}e'\n# if y < 0:\n# b = f'{-y}s'\n# elif y > 0:\n# b = f'{y}n'\n# print(a+b)\n\n# n = int(input())\n# m = n//7\n# f = n%7\n# if f == 0:\n# print(m*2, m*2)\n# elif f == 1:\n# print(m*2, (m*2)+1)\n# elif f == 6:\n# print((m*2)+1, (m*2)+2)\n# else:\n# print(m * 2, (m * 2) + 2)\n\n# s = input()\n# t = input()\n# g = 'aeiou'\n# verdict = False\n# if len(s) != len(t):\n# print('No')\n# quit()\n# for i in range(len(s)):\n# if s[i] in g and t[i] in g:\n# verdict = True\n# elif s[i] not in g and t[i] not in g:\n# verdict = True\n# else:\n# verdict = False\n# print('No')\n# break\n# if verdict == True:\n# print('Yes')\n\n# a = int(input())\n# a1 = sorted([int(t) for t in input().split()])\n# if a%2 != 0:\n# print(a1[a//2])\n# else:\n# print(a1[a//2-1])\n\nn = int(input())\na = [int(t) for t in input().split()]\ns = sum(a)\nv = 0\nfor i in range(len(a)):\n if (s - a[i]) % 2 == 0:\n v = v + 1\nprint(v)", "R = lambda:map(int,input().split())\r\n\r\n\r\nn, = R()\r\narr = [int(i) % 2 for i in input().split()]\r\nprint(arr.count(sum(arr)%2))", "n=int(input())\r\nl=list(map(int,input().rstrip().split()))\r\ne=0\r\no=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\nif o%2==0:\r\n print(e)\r\nelif o%2!=0:\r\n print(o)\r\n\r\n\r\n", "inp,_ = int(input()),0\r\nls = list(map(int, input().split()))\r\nif sum(ls)%2==0:\r\n for i in ls:\r\n if i%2==0:\r\n _+=1\r\n else:\r\n print(_)\r\nelse:\r\n for i in ls:\r\n if i%2!=0:\r\n _+=1\r\n else:\r\n print(_)", "n = int(input())\na = list(map(int, input().split()))\nb = 0\nfor i in range(len(a)):\n if a[i]%2 != 0:\n b +=1 \nif sum(a)%2!=0:\n print(b)\nelse:\n print(n-b)\n \n \n \n \n", "\r\n\r\ndef tong(array):\r\n S = 0\r\n for j in range(len(array)):\r\n S += array[j]\r\n return S\r\n\r\n\r\nn = int(input())\r\n\r\narr = []\r\narr = input().split()\r\narr = list(map(int, arr))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n tmp = arr[i]\r\n if (tong(arr) - tmp) % 2 == 0:\r\n count += 1\r\n\r\nprint(count)", "n= int(input())\r\narr = list(map(int,input().split()))\r\ncnt_odd=0\r\ncnt_even=0\r\nfor item in arr:\r\n if item%2==1:\r\n cnt_odd+=1\r\n if item%2==0:\r\n cnt_even+=1\r\nif cnt_odd%2==1:\r\n print(cnt_odd)\r\nelse:\r\n print(cnt_even)\r\n ", "x = int(input())\r\nt = 0\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n\tif a[i]%2 == 1:\r\n\t\tt = t + 1\r\ns = len(a) - t\r\nif t%2 == 0:\r\n\tprint(s)\r\nelse:\r\n\tprint(t)", "n = int(input())\r\nl= [int(i) for i in input().split()]\r\nprint(sum(1 for i in l if i % 2 == sum(l) % 2))", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nif sum(num) % 2 == 0 and num != 0:\r\n print(len([item for item in num if item % 2 == 0]))\r\nelif sum(num) == 0:\r\n print(0)\r\nelif sum(num) % 2 != 0:\r\n print(len([item for item in num if item % 2 != 0]))\r\n", "n = int(input())\r\nalist = [*map(int, input().split())]\r\neven = 0\r\nasum = 0\r\nfor i in range(n):\r\n if alist[i] %2 == 0:\r\n even += 1\r\n asum += alist[i]\r\n \r\nprint(even if asum%2 == 0 else n - even)", "def main():\r\n n = int(input())\r\n cookies = [int(c) for c in input().split()]\r\n\r\n odd = even = 0\r\n for e in cookies:\r\n odd += e % 2 != 0\r\n even += e % 2 == 0\r\n\r\n print(odd if odd % 2 else even)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = input()\r\nnums = [int(m) for m in input().split()]\r\n\r\n\r\ndef is_even(number):\r\n if number % 2 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nways_to_steal_bag = 0\r\nif is_even(sum(nums)):\r\n for bag in nums:\r\n if is_even(bag):\r\n ways_to_steal_bag += 1\r\n\r\nelse:\r\n for bag in nums:\r\n if not is_even(bag):\r\n ways_to_steal_bag += 1\r\n\r\nprint(ways_to_steal_bag)", "input()\r\neven, odd, probabilty = 0,0,0\r\nfor e in map(int,input().split()):\r\n if e % 2 == 0:\r\n even += 1\r\n else :\r\n odd += 1\r\nif odd % 2 == 0 :\r\n probabilty = even\r\nelse :\r\n probabilty = odd\r\nprint(probabilty) \r\n", "#codeforces cookies problem\r\nn = int(input())\r\nb = input()\r\nc = b.split()\r\nfor i in range(0,len(c)) :\r\n c[i] = int(c[i])\r\ns = sum(c)\r\nif s%2==0 :\r\n ne = 0\r\n for i in c :\r\n if i%2==0 :\r\n ne = ne + 1\r\n print(ne)\r\nelse :\r\n no = 0\r\n for i in c :\r\n if i%2!=0 :\r\n no = no + 1\r\n print(no)\r\n", "n = int(input())\n\nentrada_a = input()\narr_a = entrada_a.split(\" \")\n\narr_a_int = [int(i) for i in arr_a] \n\nsum_arr_a = sum(arr_a_int)\n\nresult = 0\nif sum_arr_a % 2 == 0:\n for bag in arr_a_int:\n if (bag % 2 == 0):\n result = result + 1\nelse:\n for bag in arr_a_int:\n if (bag % 2 != 0):\n result = result + 1\n\nprint(result)\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()\r\na = a.split()\r\nsum = 0\r\nfor i in range(n):\r\n sum += int(a[i])\r\nsum %= 2\r\nans = 0\r\nfor i in range(n):\r\n if(int(a[i]) % 2 == sum):\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nlis=input().split()\r\nmylis=[int(x) for x in lis]\r\nc=0\r\nd=0\r\nfor x in mylis :\r\n\tif(x%2==0):\r\n\t\tc+=1\r\n\telse :\r\n\t\td+=1\r\nif d%2==0 :\r\n\tprint(c)\r\nelse :\r\n\tprint(d)\r\n", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\ns=sum(l)\r\nfor i in l:\r\n if ((s-i)&1)==0:\r\n ans+=1\r\nprint(ans)", "# 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(map(int,input().split()))\r\nSum,countE,countO=0,0,0\r\nfor i in range(N):\r\n\tif L[i]%2==0:\r\n\t\tcountE+=1\r\n\telse:\r\n\t\tcountO+=1\r\n\tSum+=L[i]\r\nif Sum%2==0:\r\n\tprint(countE)\r\nelse:\r\n\tprint(countO)", "n=int(input())\r\neven=0\r\nodd=0\r\nl=list(map(int,input().split(' ')))\r\ni=0\r\nwhile i<n:\r\n if l[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n i+=1\r\nprint(odd if odd%2==1 else even)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n==1:\r\n print(1)\r\nelse:\r\n c=0\r\n for i in range (n):\r\n l1=l[:i]+l[(i+1):]\r\n if sum(l1)%2==0:\r\n c+=1\r\n print(c)", "n=int(input())\r\na=list(map(int,list(input().split())))\r\nb=[0]*(n)\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n b[i]=2\r\n else:\r\n b[i]=1\r\nif n==1:\r\n print(1)\r\nelif (sum(a))%2==0:\r\n print(b.count(2))\r\nelse:\r\n print(b.count(1))\r\n", "n = int(input())\r\na_l = list(map(int, input().split()))\r\na_s = sum(a_l)\r\nw = 0\r\nfor a in a_l:\r\n if (a_s - a) % 2 == 0:\r\n w += 1\r\nprint(w)\r\n", "n = int(input())\r\nblist = list(map(int, input().split()))\r\nsum = 0\r\nans = 0\r\neven = \"\"\r\n\r\nfor i in range(len(blist)):\r\n sum += blist[i]\r\n\r\nif sum % 2 == 0:\r\n even = True\r\n\r\nfor i in range(len(blist)):\r\n if blist[i] % 2 == 0:\r\n if even == True:\r\n ans += 1\r\n elif blist[i] % 2 != 0:\r\n if even != True:\r\n ans += 1\r\n\r\n\r\nprint (str(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def count_even(l):\r\n count=0\r\n for i in l:\r\n if i%2==0:\r\n count+=1\r\n return count\r\ndef count_odd(l):\r\n count=0\r\n for i in l:\r\n if i%2!=0:\r\n count+=1\r\n return count\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif sum(l)%2==0:\r\n print(count_even(l))\r\nelse:\r\n print(count_odd(l))", "# A. Cookies\r\nn = int(input())\r\na = [int(val) for val in input().split()]\r\neven_count = 0\r\nodd_count = 0\r\nfor ai in a:\r\n if ai % 2 == 0:\r\n even_count += 1\r\n else:\r\n odd_count += 1\r\n\r\nif odd_count % 2 == 0:\r\n print(even_count)\r\nelse:\r\n print(odd_count)", "t=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nc=0\r\nfor i in b:\r\n if i%2==sum(b)%2:\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nprint(sum(1 for x in a if x % 2 == sum(a) % 2))", "n=int(input())\r\nar=list(map(int,input().split()))\r\nsm=sum(ar)%2\r\nprint(sum([x%2==sm for x in ar]))\r\n", "class CodeforcesTask129ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.bags = []\n\n def read_input(self):\n self.n = int(input())\n self.bags = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n ways = 0\n for x in range(self.n):\n if not (sum(self.bags[:x]) + sum(self.bags[x + 1:])) % 2:\n ways += 1\n self.result = str(ways)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask129ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "bob=int(input())\r\nl=input()\r\nl=l.split()\r\namount=0\r\nways=0\r\neven=0\r\nodd=0\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\n if l[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n amount+=l[i]\r\n \r\nif amount%2==0:\r\n ways=even\r\nelse:\r\n ways=odd\r\nprint(ways)\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\ns = sum(lst)\r\np = s % 2\r\ncounter = 0\r\nfor i in lst:\r\n if i % 2 == p:\r\n counter += 1\r\nprint(counter)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n\tif (sum(l)-l[i])%2==0:\r\n\t\tc+=1\r\nprint(c)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nh=k=0\r\nfor i in a:\r\n if(i%2):\r\n h+=1\r\n else:\r\n k+=1\r\nif(h%2):\r\n print(h)\r\nelse:\r\n print(k)", "n = int(input())\r\n# vals = input() # read in the whole line\r\n# you have to convert it into list\r\n# list_a = vals.split() # split is to convert the input into list\r\n# 1 2 3 4\r\n# print(list_a)\r\n# list_b = []\r\n# for a in list_a:\r\n# b = int(a)\r\n# list_b.append(b)\r\n# print(list_b)\r\n# you can use list comprehension!!!\r\n# list comprehension can convert one list to another list\r\n# list_b = [int(a) for a in list_a] \r\n# print(list_b)\r\n\r\nlist_a = [int(val) for val in input().split()]\r\ncount_even = 0 # initialize the counts\r\ncount_odd = 0\r\nfor a in list_a:\r\n if a % 2 == 0: # a is even\r\n count_even += 1 # increase count_even\r\n else:\r\n count_odd += 1 # increase count_odd\r\n\r\nif count_odd % 2 == 0: # do you have even count of odd bags\r\n print(count_even)\r\nelse:\r\n print(count_odd)", "\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input())\r\n bags = list(map(int , input().rstrip().split()))\r\n total = sum(bags)\r\n if total % 2 == 0: #even\r\n bags = [i % 2 for i in bags]\r\n count = n - sum(bags)\r\n else:\r\n bags = [i % 2 for i in bags]\r\n count = sum(bags)\r\n print (count)", "from collections import defaultdict as dd\r\nhp = dd(lambda:4)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nsumm = sum(arr)\r\nfor x in arr:\r\n if (summ - x) % 2 == 0:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ne=0\r\no=0\r\nfor i in l:\r\n if i%2==0:\r\n e=e+1 #10 1 2 2 3 4 4 4 2 2 2#\r\n else:\r\n o=o+1\r\nif o%2==0:\r\n print(e)\r\nelif o%2!=0:\r\n print(o)", "_ =int(input())\r\nbags = [int(i) for i in input().split()]\r\na = [x if (x%2 != 0) else 0 for x in bags]\r\n\r\ncount = 0\r\n\t\r\nfor i in bags:\r\n\tif (i % 2 == 0):\r\n\t\tcount += 1\r\n\t\t\r\nif sum(a) % 2 != 0:\r\n\tcount = len(bags)- count\r\n\t\r\nprint(count)", "number = input()\r\nbags = [int(i) for i in input().split()]\r\ntotal = 0\r\n\r\nif sum(bags) % 2:\r\n for bag in bags:\r\n if bag % 2:\r\n total += 1\r\nelse:\r\n for bag in bags:\r\n if not bag % 2:\r\n total += 1\r\n\r\nprint(total)\r\n ", "garbage = input()\r\ncookies = list(map(int, input().rstrip().split(\" \")))\r\na1 = [i for i in cookies if i%2 ]\r\na2 = [i for i in cookies if not i%2 ]\r\nl1 = len(a1)\r\nl2 = len(a2)\r\n\r\nif l1%2:\r\n print(l1)\r\nelse:\r\n print(l2)" ]

[ "a='abcdefghijklmnopqrstuvwxyz'\r\nn,k=map(int,input().split( ))\r\ns=list(input())\r\ns.sort()\r\ng=(a.index(s[0])+1)\r\nk-=1\r\np=1\r\nm=''\r\nm+=s[0]\r\nwhile k!=0:\r\n if a.index(s[p])-a.index(m[len(m)-1])>=2:\r\n m+=s[p]\r\n g+=(a.index(s[p])+1)\r\n k-=1\r\n p+=1\r\n if p==n and k!=0:\r\n print(-1)\r\n exit()\r\nprint(g)\r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\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 cint(c):\r\n return ord(c) - 96\r\n####################################################\r\n\r\ndef find_min_weight(n, k, stages):\r\n n = len(stages)\r\n min_weight = float('inf')\r\n\r\n def backtrack(s, w, t):\r\n nonlocal min_weight \r\n\r\n if t >= k:\r\n min_weight = min(min_weight, w)\r\n return\r\n\r\n if s >= n - 1:\r\n return\r\n\r\n for i in range(s+1, n, 1):\r\n if stages[i] - stages[s] > 1:\r\n backtrack(i, w+stages[i], t+1)\r\n\r\n backtrack(0, stages[0], 1)\r\n\r\n if min_weight == float('inf'):\r\n return -1\r\n\r\n return min_weight \r\n\r\n\r\nn, k = inlt()\r\nstages = list(set(map(cint, insr())))\r\nstages.sort()\r\nprint(find_min_weight(n, k, stages))\r\n", "n,k=map(int,input().split())\r\na=list(input())\r\na.sort()\r\nx=1\r\nt=ord(a[0])-96\r\ns=a[0]\r\nfor i in range(1,n):\r\n if x==k:\r\n break\r\n if ord(a[i])-ord(s)>=2:\r\n s=a[i]\r\n t+=ord(a[i])-96\r\n x+=1\r\nif x<k:\r\n print(-1)\r\nelse:\r\n print(t)\r\n \r\n \r\n ", "n,k=list(map(int,input().split()))\r\na=sorted(input())\r\ntemp,count=-1,0\r\nfor i in range(n):\r\n\tif k==0:\r\n\t\tbreak\r\n\tif ord(a[i])>=temp+2:\r\n\t\tcount+=ord(a[i])-97+1\r\n\t\ttemp=ord(a[i])\r\n\t\tk-=1\r\n \r\nif k==0:\r\n\tprint(count)\r\nelse:\r\n\tprint(-1)", "from sys import stdin\r\n\r\ndef func(arr):\r\n return sum(list(map(lambda x:ord(x)-96,arr))) \r\nn,k=map(int,stdin.readline().split())\r\ns=stdin.readline().strip()\r\nans=[]\r\ns=sorted(s)\r\nfor i in range(n-k+1):\r\n arr=[s[i]]\r\n total=ord(s[i])-ord('a')+1\r\n count=1\r\n m=i\r\n j=m+1\r\n while(j<n and count<k):\r\n if ord(s[j])-ord(s[m])>=2:\r\n arr.append(s[j])\r\n count+=1\r\n total+=(ord(s[j])+1-ord('a'))\r\n m=j\r\n j=m+1\r\n else:\r\n j+=1\r\n if len(arr)==k:\r\n ans.append(total)\r\n else:\r\n pass \r\nif len(ans)==0:\r\n print(-1)\r\nelse:\r\n print(min(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", "def main():\r\n n, k = list(map(int, input().split()))\r\n string = \"\".join(sorted(input()))\r\n\r\n answer_string = \"\"\r\n previous_ord = -1\r\n for i in range(n):\r\n if previous_ord == -1:\r\n answer_string += string[i]\r\n previous_ord = ord(string[i])\r\n else:\r\n if ord(string[i]) - previous_ord > 1:\r\n answer_string += string[i]\r\n previous_ord = ord(string[i])\r\n\r\n if len(answer_string) == k:\r\n s = 0\r\n for character in answer_string:\r\n s += ord(character) - ord(\"a\") + 1\r\n print(s)\r\n return\r\n\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t=[0]*30\nn,k=map(int,input().split())\ns=input()\nl=len(s)\nfor i in s:\n t[ord(i)-ord('a')]=1\nans=0;mat=0\ncnt=0\nwhile cnt<26:\n if t[cnt]==1:\n ans+=cnt+1\n cnt+=1\n mat+=1\n if mat==k:\n break;\n cnt+=1\nif mat<k:\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", "I = lambda : map(int,input().split())\n\nn, k = I()\na = sorted(input())\np=[a[0]];b=ord(a[0]);y=b-ord('a')\nfor i in range(1,n):\n if len(p)==k:\n break\n if ord(a[i])-b>=2:\n y+=ord(a[i])-ord('a')\n b=ord(a[i])\n p.append(a[i])\nif len(p)<k:\n print(-1)\nelse:\n print(y+k)\n\t \t\t\t\t \t \t\t \t\t \t\t \t \t\t\t \t\t \t", "s, n = map(int,input().split())\r\na=list(input())\r\na.sort()\r\nu=1\r\ns1=ord(a[0])-ord('a')+1\r\nn-=1\r\ni=0\r\nwhile u<s and n>0:\r\n if ord(a[u])-ord(a[i])>1:\r\n s1+=ord(a[u])-ord('a')+1\r\n n-=1\r\n i=u\r\n u+=1\r\nif n==0:\r\n print(s1)\r\nelse:\r\n print(-1)\r\n \r\n", "L = [int(i) for i in input().strip().split()]\r\nn = L[0]\r\nk = L[1]\r\n\r\n\r\nstr = input()\r\nc = [(ord(i)-96) for i in str]\r\n\r\ncount = 0\r\np = -1\r\ncount2 = 0\r\nflag = 0\r\nwhile(True):\r\n if(c == []):\r\n flag = 1\r\n break\r\n x = min(c)\r\n c.remove(x)\r\n if(x <= p+1):\r\n continue\r\n count2 += 1\r\n count += x\r\n if(count2 == k):\r\n break\r\n p = x\r\n\r\nif(flag != 1):\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Aug 29 19:16:56 2020\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\n\r\ns = sorted(list(set(input())))\r\n\r\nstages = []\r\n\r\nfor i in range(len(s)):\r\n if i == 0:\r\n stages.append(s[i])\r\n else:\r\n if ord(s[i]) - ord(stages[-1]) >= 2:\r\n stages.append(s[i])\r\n if len(stages) == k:\r\n break\r\n\r\nif len(stages) == k:\r\n minsum = 0\r\n for i in range(k):\r\n minsum += ord(stages[i]) - 96\r\n print(minsum)\r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\r\ns = sorted(input())\r\n \r\nt = ''\r\np = ' '\r\nfor c in s:\r\n if ord(c) > ord(p) + 1:\r\n t += c\r\n p = c\r\n \r\nans = -1\r\nif len(t) >= k:\r\n ans = sum(map(lambda x: ord(x) - 96, t[:k]))\r\n \r\nprint (ans)", "n,k=map(int,input().split())\r\nw=p=0\r\nfor c in map(ord,sorted((input()))):\r\n if c-p>1:w+=c-96;p=c;k-=1\r\n if k==0:break\r\nprint((w,-1)[k>0])", "#!/usr/bin/env python3\n\nimport sys\n\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\n\nweights = {}\nfor i in range(26):\n weights[alphabet[i]]=i+1\n\nn,k = sys.stdin.readline().split(\" \")\nn,k = int(n),int(k)\n\ns = sys.stdin.readline().strip('\\n')\n\nrs = []\nfor i in s:\n if weights[i] not in rs:\n rs.append(weights[i])\n\nif len(rs) < k:\n print(-1)\n sys.exit(0)\nelse:\n rs = sorted(rs)\n used = 0\n weight = 0\n last = -1\n for i in rs:\n if i-last > 1:\n last = i\n weight += i\n used += 1\n if used == k:\n print(weight)\n sys.exit(0)\nprint(-1)\n\n \n", "n, k = map(int, input().split())\r\ns = sorted(str(input()))\r\nl = []\r\nk -= 1\r\nfor i in s:\r\n l.append(ord(i)-96)\r\nans = l[0]\r\n\r\nwhile k != 0:\r\n try:\r\n if l[1] - l[0] >= 2:\r\n ans += l[1]\r\n l.pop(0)\r\n k -= 1\r\n else:\r\n l.pop(1)\r\n except:\r\n if k > 0:\r\n print(-1)\r\n quit()\r\nprint(ans)\r\n", "entrada = input()\nn = int(entrada.split(\" \")[0]) # number of available stages\nk = int(entrada.split(\" \")[1]) # number of stages to use in the rocket\n\nstages = input()\n\nalphabet = {\"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}\n\nstages = list(stages)\nstages.sort()\n\ncnt = alphabet[stages[0]]\nk = k - 1\nj = 0\ni = 1\nwhile (i < n):\n if (k <= 0):\n break\n\n if (alphabet[stages[i]]-alphabet[stages[j]] >= 2):\n cnt += (alphabet[stages[i]])\n k = k - 1\n j = i\n i = i + 1\n\nif (k <= 0):\n print(cnt)\nelse:\n print(\"-1\")\n\t\t \t \t\t \t \t \t\t \t\t\t\t\t \t", "n,k=map(int,input().split())\r\ns=sorted(input());t=s[0];size=1\r\nfor i in s[1:]:\r\n if size==k:break\r\n if ord(i)-ord(t[-1])>1:t+=i;size+=1\r\nprint([-1,sum(ord(j)-96 for j in t)][size==k])\r\n\r\n", "#t = int(input())\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n s = sorted(input())\r\n s_ans = s[0]\r\n ans = ord(s[0]) - ord('a') + 1\r\n \r\n for i in range(1, n):\r\n if len(s_ans) >= k:\r\n break\r\n if (ord(s[i]) - ord(s_ans[-1])) >= 2:\r\n s_ans += s[i]\r\n ans += ord(s[i]) - ord('a') + 1\r\n #print(s_ans)\r\n if len(s_ans) < k:\r\n print(-1)\r\n return\r\n\r\n print(ans)\r\n\r\n#for _ in range(t):\r\nsolve()\r\n", "'''n=int(input())\r\nm=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans1=1-(1/a[0])\r\nfor i in range(1,n):\r\n ans1*=(1-(1/b[i]))\r\n ans1*=(1-(1/a[i]))\r\nans1*=(1-(1/b[0]))\r\nans=1-ans1\r\nans*=m\r\nif(ans1<=0):\r\n print(-1)\r\nelse:\r\n ans=ans/ans1\r\n if(ans>1000000000):\r\n print(-1)\r\n else:\r\n print(ans)'''\r\nn,k=map(int,input().split())\r\ns=str(input())\r\narr=[]\r\nfor i in range(n):\r\n if(s[i] not in arr):\r\n arr.append(s[i])\r\narr.sort()\r\nans1=arr[0]\r\nans=ord(arr[0])-96\r\nz=1\r\nflag1=0\r\nfor i in range(1,len(arr)):\r\n if(z==k):\r\n break\r\n if(flag1==0):\r\n if(ord(arr[i])-ord(arr[i-1])>1):\r\n ans1+=arr[i]\r\n ans+=ord(arr[i])-96\r\n z+=1\r\n flag1=0\r\n else:\r\n flag1=1\r\n else:\r\n ans1+=arr[i]\r\n ans+=ord(arr[i])-96\r\n z+=1\r\n flag1=0\r\n \r\nif(z==k):\r\n print(ans)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\ns=input()\r\ns=sorted(s)\r\nans=0;value=0\r\nfor i in s:\r\n if ord(i)>value+1:\r\n ans+=ord(i)-97+1\r\n k-=1\r\n value=ord(i)\r\n if k==0:\r\n break\r\n\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(ans)", "n,k=map(int,input().split())\r\na=input()\r\ns=list(a)\r\ns.sort()\r\nx=ord(s[0])-ord('a')+1\r\nw=x\r\ny=1\r\nfor i in range(n-1):\r\n if (ord(s[i+1])-ord('a')+1-x>=2 )and y<=k-1:\r\n x=ord(s[i+1])-ord('a')+1\r\n w+=x\r\n y+=1\r\nif y==k :\r\n print(w)\r\nelse:\r\n print(-1)\r\n ", "n , m = map(int , input().split())\r\ns = list(sorted(map(ord, input())))\r\njog = 0 ; x = 0\r\nfor i in s:\r\n if i - x > 1:\r\n jog += i - 96\r\n x = i\r\n m -= 1\r\n if m==0: break\r\nif m > 0 : print(-1)\r\nelse : print(jog)", "\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=[]\r\n\r\ns=sorted(s)\r\nfor i in range(n):\r\n\tif len(l)>=k:\r\n\t\tbreak\r\n\tif len(l)==0:\r\n\t\tl.append(s[i])\r\n\telse:\r\n\t\tif ord(s[i])-ord(l[-1])>1:\r\n\t\t\tl.append(s[i])\r\nif len(l)==k:\r\n\tp=0\r\n\tfor i in range(k):\r\n\t\tp+=ord(l[i])-97+1\r\n\tprint(p)\r\nelse:\r\n\tprint(-1)\r\n\r\n", "n,k=map(int,input().split())\r\ns=sorted(map(ord,input()))\r\nr=s[:1]\r\nfor c in s[1:]:\r\n if c>r[-1]+1:r.append(c)\r\nprint(-1 if len(r)<k else sum(r[:k])-96*k)", "#codeforces_1011A_live\r\nn,m = [int(e) for e in input().split(\" \")]\r\nline = list(input())\r\nline.sort();\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\nans = alph.index(line[0]) + 1;\r\ntemp = line[0]\r\nm -= 1\r\nfor k in range(1,n):\r\n\tif not m:\r\n\t\tbreak;\r\n\tif alph.index(line[k]) > alph.index(temp)+1:\r\n\t\tans += alph.index(line[k]) + 1;\r\n\t\ttemp = line[k]\r\n\t\tm -= 1\r\nif m:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "n, k = map(int, input().split())\r\ns = sorted(set(input()))\r\nt = s[0]\r\nfor i in range(1, len(s)):\r\n if ord(s[i]) - ord(t[-1]) > 1:\r\n t += s[i]\r\nif len(t) < k:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n for i in range(k):\r\n ans += ord(t[i]) - ord('a') + 1\r\n print(ans)", "n, k = list(map(int, input().split()))\r\na = input()\r\n\r\nres = [0] * 26\r\ncnt = 0\r\nf = 0\r\nans = 0\r\n\r\nfor i in range(n):\r\n res[ord(a[i]) - ord('a')] = 1\r\n\r\nfor u in range(26):\r\n if res[u] == 1 and f == 0:\r\n cnt += 1\r\n f = 1\r\n ans += (u + 1)\r\n if cnt == k:\r\n break\r\n else:\r\n f = 0\r\n\r\nif cnt < k:\r\n print(-1)\r\nelse:\r\n print(ans)", "n,k=map(int,input().split())\r\ns=input()\r\nans=0\r\ns=sorted(s)\r\nprev=-10\r\ntotal=0\r\nfor el in s:\r\n if ord(el)>prev+1 and total<k:\r\n prev=ord(el)\r\n ans+=ord(el)-ord(\"a\")+1\r\n total+=1\r\nprint(ans if total>=k else -1)", "n, k = map(int, input().split())\r\ns = [ord(x) - ord('a') + 1 for x in sorted(set(input()))]\r\nstages = []\r\nprev = -1\r\nfor x in s:\r\n if x - prev >= 2:\r\n stages.append(x)\r\n prev = x\r\nif len(stages) < k:\r\n print(-1)\r\nelse:\r\n print(sum(stages[:k]))\r\n\r\n", "n,k=list(map(int,input().split()))\r\nL=[]\r\nstr1=input()\r\nfor j in str1:\r\n L.append(ord(j)-96)\r\nL.sort()\r\ns=L[0]\r\ns1=L[0]\r\np=1\r\nq=1\r\nwhile q<n and p<k:\r\n if L[q]-s1>1:\r\n s+=L[q]\r\n p+=1\r\n s1=L[q]\r\n q+=1\r\nif p==k:\r\n print(s)\r\nelse:\r\n print(-1)", "n,k = list(map(int,input().split()))\ns = [i for i in input()]\ns = sorted(set(s))\nlast = s[0]\nminz=ord(s[0]) - 96\nk-=1\nfor i in range(1,len(s)):\n\tif k == 0:\n\t\tbreak\n\tif (ord(s[i]) - ord(last)) > 1:\n\t\tlast = s[i]\n\t\tminz+=(ord(s[i]) - 96)\n\t\tk-=1\nprint(minz if k==0 else -1)\n", "n,k=map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\nans=0\r\nused=0\r\npos=0\r\nfor i in range(n):\r\n if(used==k):\r\n break\r\n if(i==0):\r\n ans+=ord(s[i])-96\r\n used+=1\r\n pos=0\r\n elif(ord(s[i])-ord(s[pos])>1):\r\n ans+=ord(s[i])-96\r\n pos=i\r\n used+=1 \r\nif(used<k):print(-1)\r\nelse:print(ans)", "_, k = map(int, input().split())\r\ns = sorted(set(input()))\r\nstages = s[0]\r\n\r\nfor ch in s[1:]:\r\n if ord(ch) - ord(stages[-1]) > 1:\r\n stages += ch\r\n\r\nprint(-1 if len(stages) < k else sum(ord(ch) - 96 for ch in stages[:k]))", "n, k = list(map(int, input().split()))\r\ns = input()\r\n\r\nalpha = 'abcdefghijklmnopqrstuvwxyz'\r\nl = sorted(set(s))\r\nnot_possible = False\r\n\r\nif k > len(l):\r\n not_possible = True\r\nelse:\r\n total_weight = 0\r\n index = 0\r\n prev_weight = -2\r\n\r\n while k > 0 and index < len(l):\r\n char = l[index]\r\n weight = alpha.index(char)\r\n if weight > prev_weight+1:\r\n total_weight += weight+1\r\n prev_weight = weight\r\n k -= 1\r\n\r\n index += 1\r\n\r\nif not_possible or k > 0:\r\n print(-1)\r\nelse:\r\n print(total_weight)\r\n", "import itertools\r\nimport collections\r\nimport sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\nread = lambda: input().rstrip()\r\nputs = sys.stdout.write\r\n\r\n\r\ndef read_ints():\r\n\tyield from map(int, read().split())\r\n\r\n\r\ndef main():\r\n\tn, k = read_ints()\r\n\ts = sorted(read())\r\n\tcnt = 0\r\n\tans = 0\r\n\tlast_taken = -1\r\n\tfor i, c in enumerate(s):\r\n\t\tif cnt == k: break\r\n\t\tif not i or ord(c) - ord(s[last_taken]) >= 2:\r\n\t\t\tcnt += 1\r\n\t\t\tlast_taken = i\r\n\t\t\tans += ord(c) - ord('a') + 1\r\n\tprint(-1 if cnt < k else ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "x,y = map(int,input().split())\r\nt = list(input())\r\nt.sort()\r\nr = t[0]\r\ni = 1\r\ns = ord(t[0])-96\r\nwhile len(r) != y:\r\n\tif i >= x:\r\n\t\tbreak\r\n\tif ord(t[i]) - ord(r[-1]) <= 1:\r\n\t\tpass\r\n\telse:\r\n\t\tr = r + t[i]\r\n\t\ts = s + ord(t[i]) - 96\r\n\ti = i + 1\r\nif len(r) < y:\r\n\tprint(-1)\r\nelse:\r\n\tprint(s)\r\n\r\n", "# your code goes here\r\nn,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ns = input()\r\na = []\r\nfor c in s:\r\n\ta.append(ord(c)-ord('a')+1)\r\na = list(set(a))\r\na.sort()\r\ncount=1\r\nans=a[0]\r\nchoose=a[0]\r\nn = len(a)\r\nfor i in range(1,n):\r\n\tif count == k:\r\n\t\tbreak\r\n\tif(a[i]-choose > 1):\r\n\t\tchoose = a[i]\r\n\t\tans += a[i]\r\n\t\tcount+=1\r\nif count < k:\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "n,k = map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\nSum = ord(s[0])-96\r\ne = ord(s[0])-96\r\nc=1\r\nd=0\r\nfor i in range(1,n):\r\n if(c==k):\r\n break\r\n d=ord(s[i])-96\r\n if(d-e>=2):\r\n Sum+=d\r\n c+=1\r\n e=d\r\nif(c<k):\r\n print(-1)\r\nelse:\r\n print(Sum)\r\n\r\n", "n, k = map(int, input().split())\r\ns = input()\r\na = [0] * 26\r\nfor i in s:\r\n a[ord(i) - ord('a')] = 1\r\nans = 0\r\ni = 0\r\nwhile i < 26:\r\n if a[i] > 0:\r\n ans += i + 1\r\n k -= 1\r\n i += 1\r\n if k == 0:\r\n print(ans)\r\n break\r\n i += 1\r\nelse:\r\n print(-1)", "import string\r\nn, k = map(int, input().split())\r\ns = sorted(set(input()))\r\n\r\nletters = {'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\n\r\narr = []\r\n\r\nfor char in s:\r\n arr.append(letters[char]+1)\r\n\r\n# ln = len(s)\r\n\r\nvalid_nums = [arr[0]]\r\nfor i in range(len(arr)-1):\r\n # if arr[i+1] - arr[i] < 2:\r\n # ln -= 1\r\n if arr[i+1] -valid_nums[-1] > 1:\r\n valid_nums.append(arr[i+1])\r\nif len(valid_nums) < k:\r\n print(-1)\r\nelse:\r\n print(sum(valid_nums[:k]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "'''input\n12 1\nabaabbaaabbb\n'''\nn, k = map(int, input().split())\ns = sorted(input())\nw = 0\np = '_'\nfor i in range(n):\n\tif ord(s[i]) - ord(p) > 1:\n\t\tp = s[i]\n\t\tw += ord(s[i]) - 96\n\t\tk -= 1\n\t\tif k == 0:\n\t\t\tprint(w)\n\t\t\tbreak\nelse:\n\tprint(-1)", "n,k=map(int,input().split())\r\nc=l=r=0\r\nfor x in sorted(map(ord,input())):\r\n if x>l+1:c+=1;l=x;r+=x-ord('a')+1\r\n if c==k:break\r\nprint([r,-1][c<k])", "n,k = map(int, input().split())\r\n\r\nstages = list (set(input()))\r\nstages.sort()\r\nn = len(stages)\r\n\r\nans = [stages[0]]\r\n\r\ncurrent_element = stages[0]\r\n\r\nref = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nfor i in range (1,n):\r\n if len(ans) == k:\r\n break\r\n else:\r\n if ref.index(stages[i]) - ref.index(current_element) >= 2:\r\n ans.append(stages[i])\r\n current_element = stages[i]\r\n\r\nif len(ans) == k:\r\n cost = 0\r\n for i in ans:\r\n cost+= (ref.index(i) + 1)\r\n print (cost)\r\nelse:\r\n print (-1)", "d = 'abcdefghijklmnopqrstuvwxyz'\r\nn, k = map(int, input().split())\r\ns = sorted(input())\r\nc = [d.find(str(i))+1 for i in s]\r\n\r\nsumma, x, i, step = c[0], 1, 0, 1\r\nwhile x < k and i+step < n:\r\n if c[i+step]-c[i] > 1:\r\n summa += c[i+step]\r\n i += step\r\n step = 1\r\n x += 1\r\n else:\r\n step += 1\r\nif x < k:\r\n print(-1)\r\nelse:\r\n print(summa)", "def convert_text_to_array(text):\n result_array = []\n for char in text:\n result_array.append(char)\n return result_array\n\n\ndef get_char_weight(char):\n return ord(char) - 96\n\n\ndef main():\n first_input = input()\n second_input = input()\n max_quantity = int(first_input.split(\" \")[1])\n array = convert_text_to_array(second_input)\n array.sort()\n last_stage = \" \"\n weight_sum = 0\n stage_flow = \"\"\n stages_number = 0\n for index, stage in enumerate(array):\n if get_char_weight(stage) - get_char_weight(last_stage) > 1:\n last_stage = stage\n weight_sum += get_char_weight(stage)\n stages_number += 1\n stage_flow += stage\n if stages_number >= max_quantity:\n break\n if index == len(array) - 1 and stages_number != max_quantity:\n weight_sum = -1\n print(weight_sum)\n return\n\n\nif __name__ == '__main__':\n main()", "n,k = map(int,input().split())\r\ns = input()\r\nl=[]\r\nfor i in s:\r\n l.append(ord(i)-96)\r\nl = sorted(l)\r\ndef removal(l):\r\n for i in range(len(l)):\r\n if l[i+1]-l[i]<=1:\r\n l.remove(l[i+1])\r\n removal(l)\r\ntry:\r\n removal(l)\r\nexcept:\r\n pass\r\n\r\nsums = 0\r\nif len(l)>=k:\r\n for i in range(k):\r\n sums += l[i]\r\n print(sums)\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n", "n, k = (int(i) for i in input().split())\ns = sorted(input())\nres, n, prev = 0, len(s), None\nfor i, c in enumerate(s):\n if i > 0 and ord(c) - ord(prev) <= 1:\n continue\n res += ord(c) - ord(\"a\") + 1\n prev = c\n k -= 1\n if k == 0:\n break\nres = res if k == 0 else -1\nprint(res)\n", "if 1:\n n,k=map(int,input().split())\n s=[i for i in input()]\n s.sort()\n c=ord(s[0])-96\n k-=1\n x=s[0]\n for i in range(n):\n \tif k==0:\n \t\tbreak\n \tif ord(s[i])>=ord(x[-1])+2:\n \t\tx+=s[i]\n \t\tc+=ord(s[i])-96\n \t\tk-=1\n if k:\n \tprint(-1)\n else:\n \t\tprint(c)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip())\r\ns.sort()\r\nans = 0\r\nla = 0\r\nfor i in s:\r\n if la + 1 < i:\r\n la = i\r\n ans += i - 96\r\n k -= 1\r\n if not k:\r\n break\r\nif k:\r\n ans = -1\r\nprint(ans)", "import bisect\r\nimport os\r\nfrom collections import Counter\r\nimport bisect\r\nfrom collections import defaultdict\r\nimport math\r\nimport random\r\nimport heapq as hq\r\nfrom math import sqrt\r\nimport sys\r\nfrom functools import reduce, cmp_to_key\r\nfrom collections import deque\r\nimport threading\r\nfrom itertools import combinations\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate\r\n\r\n# sys.setrecursionlimit(200000)\r\n# mod = 10**9+7\r\n\r\ndef sort_dict(key_value):\r\n return sorted(key_value.items(), key = lambda kv:(kv[1], kv[0]))\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\n \r\ndef num_input():\r\n return map(int,input().split())\r\n \r\ndef string_list():\r\n return list(input())\r\n \r\nn,k = num_input()\r\ns = list(input())\r\ns.sort()\r\ncost = (ord(s[0])-ord('a')+1)\r\nprev = s[0]\r\nk -= 1\r\nfor i in range(1,n):\r\n if k == 0:\r\n break\r\n if ord(s[i])-ord(prev) > 1:\r\n cost += (ord(s[i])-ord('a')+1)\r\n prev = s[i]\r\n k -= 1 \r\n \r\nif k == 0:\r\n print(cost)\r\nelse:\r\n print(-1)\r\n\r\n \r\n \r\n \r\n \r\n", "n,m=map(int,input().split())\r\ns=input()\r\ns=\"\".join(sorted(s))\r\nc=0\r\nl=[s[0]]\r\nfor i in range(1,len(s)):\r\n if(len(l)==m):\r\n break\r\n if ord(s[i])-ord(l[-1])>1:\r\n l.append(s[i])\r\nif(len(l)==m):\r\n print(sum([ord(i)-96 for i in l]))\r\nelse:\r\n print(-1)\r\n\r\n \r\n", "n,k=map(int,input().split())\r\ns=sorted(input()) \r\nar = []\r\n\r\nfor i in range (26):\r\n ar.append(0)\r\n\r\nfor i in range(len(s)):\r\n ar[ord(s[i])-97] += 1\r\n\r\nlast = ord(s[0])-97\r\nans = ord(s[0])-96\r\nt = 1\r\nfor i in range(last+2,26):\r\n if ar[i]==0 or t==k or i-last<2:\r\n continue\r\n last = i\r\n ans+=i+1\r\n t+=1\r\n\r\nif t==k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n\r\n", "n,k=map(int,input().split())\r\nl=[]\r\ns=input()\r\nl[:0]=s\r\n# print(l)\r\n# print(s)\r\nl.sort()\r\n# print(l)\r\n\r\nlast=chr(ord('a')-2)\r\n# print(last)\r\nans=len=0\r\n# z=chr(ord(last)+2)\r\n# print(z)\r\nfor i in range(n):\r\n z=chr(ord(last)+2)\r\n if l[i]>=z:\r\n last=l[i]\r\n ans+=ord(l[i])-ord('a')+1\r\n len+=1\r\n if len>=k:\r\n print(ans)\r\n exit()\r\n\r\nprint(-1)", "n, m = map(int, input().split())\r\nd = [0] * 26\r\nfor c in input():\r\n d[ord(c) - ord('a')] += 1\r\n\r\ni = 0\r\nans = 0\r\nwhile i < 26 and m:\r\n while i < 26 and not d[i]:\r\n i += 1\r\n if i == 26:\r\n break\r\n ans += i + 1\r\n i += 2\r\n m -= 1\r\nprint(-1 if m else ans)", "n,k=map(int,input().split())\r\nl=list(input())\r\nl.sort()\r\n\r\nres=ord(l[0])-ord('a')+1\r\n#print(res)\r\nprev=l[0]\r\nk=k-1\r\ni=1\r\nwhile(i<n and k>0):\r\n if ord(l[i])-ord(prev)>1 and k>0:\r\n res+=ord(l[i])-ord('a')+1\r\n prev=l[i]\r\n #print(res)\r\n k-=1\r\n i+=1\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(res)\r\n ", "n,k=map(int,input().split())\r\nb=[]\r\ns=input()\r\nfor j in s:\r\n b.append(j)\r\nb.sort()\r\nr=ord(b[0])-96\r\np=1\r\nj=1\r\nq=0\r\nwhile(j<n):\r\n if p==k:\r\n break\r\n if (ord(b[j])-ord(b[q]))>1:\r\n p+=1\r\n r+=ord(b[j])-96\r\n q=j\r\n j+=1\r\nif p==k:\r\n print(r)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "\r\nn, k = map(int, input().split())\r\nli = list(input())\r\nl = list(set(li))\r\nl.sort()\r\ntest = list('abcdefghijklmnopqrstuvwxyz')\r\npos = test.index(l[0])\r\nlp = [l[0]]\r\nfor i in range(len(l)):\r\n\tif test.index(l[i]) - pos > 1:\r\n\t\tlp.append(l[i])\r\n\t\tpos = test.index(l[i])\r\n\tif len(lp) == k:\r\n\t\tbreak\r\n\r\nif len(lp) < k:\r\n\tprint(-1)\r\nelse:\r\n\tco = 0\r\n\tfor i in lp:\r\n\t\tco += test.index(i) + 1\r\n\r\n\tprint(co)", "n, k = [int(x) for x in input().split()]\ns = sorted(input())\nans = []\nss = 0\nfor a in s:\n num = ord(a) - ord('a') + 1\n if len(ans) == 0:\n ans.append(num)\n ss = ss + num\n elif len(ans) >= k:\n break\n else:\n if num - ans[-1] > 1:\n ans.append(num)\n ss = ss + num\nif len(ans) < k:\n print(\"-1\")\nelse:\n print(ss)", "n,k = [int(x) for x in input().split()]\r\nst=input()\r\nst=sorted(st)\r\nfin=[]\r\nsize=-1\r\ni=-1\r\nfor j in range(n):\r\n if i==-1:\r\n fin.append(st[j])\r\n i+=1\r\n elif(ord(st[j])- ord(fin[i])) not in range(-1,2):\r\n fin.append(st[j])\r\n i+=1\r\n if(i==k-1):\r\n size=0\r\n for w in range(k):\r\n size+=(ord(fin[w])-96)\r\n break\r\n \r\nprint(size)", "n, k = map(int, input().split())\ns = input()\na = []\nfor i in s:\n a.append(ord(i) - ord('a') + 1)\na.sort()\nans = 0\ntmp = -1\nfor i in a:\n if tmp == -1 or i >= tmp:\n ans += i\n tmp = i + 2\n k -= 1\n if k == 0:\n break\nif k == 0:\n print(ans)\nelse:\n print(-1)\n\n\t\t \t \t \t \t \t \t \t\t\t\t\t \t \t \t\t\t", "n,k = list(map(int,input().split()))\r\nro = list(input())\r\nr = list(set(ro))\r\nr.sort()\r\nsize = len(r)\r\nr1 = []\r\ncount = 0\r\ni = 0\r\nwhile count<k and i<size:\r\n if i==0:\r\n r1.append(r[i])\r\n i+=1 \r\n count+=1 \r\n else:\r\n if ord(r[i])-ord(r[i-1])>=2:\r\n r1.append(r[i])\r\n i+=1 \r\n count+=1 \r\n else:\r\n if i<size-1:\r\n r1.append(r[i+1])\r\n i+=2\r\n count+=1\r\n else:\r\n i+=1 \r\nif len(r1)<k:\r\n print(\"-1\")\r\nelse:\r\n total = 0\r\n for i in r1:\r\n total+= ord(i)\r\n print(total-k*96)\r\n \r\n", "a,b=map(int,input().split())\r\np=input()\r\nc=sorted(p)\r\nk=ord(c[0])-ord('a')+1\r\nb-=1\r\nj=0\r\nl=0\r\nfor i in range(1,len(c)):\r\n if (ord(c[i])-ord('a'))-(ord(c[j])-ord('a'))>1 and b>0:\r\n k+=ord(c[i])-ord('a')+1\r\n j=i\r\n b-=1\r\nif b==0:\r\n print(k)\r\nelse:\r\n print(-1)", "m, n = map(int, input().split())\r\nnum , pre = 0, 0\r\ns = list(input())\r\ns = sorted(s)\r\nj = 0\r\nfor i in s:\r\n if ord(i) - pre > 1:\r\n num += ord(i) - 96\r\n pre = ord(i)\r\n j += 1\r\n if j == n:\r\n break\r\n\r\nif j == n:\r\n print(num)\r\nelse:\r\n print(-1)", "n,k=list(map(int,input().split()))\r\ns=sorted(list(set(input().strip())))\r\na,g,p=0,0,0\r\nfor c in s:\r\n xx=ord(c)\r\n if xx>=p+2:a,g,p=a+xx-96,g+1,xx\r\n if g==k:break\r\nprint(-1 if g<k else a)", "n, k = map(int, input().split())\r\ns, res, pre, dem = list(input()), 0, -100, 0\r\ns.sort()\r\nfor x in range(n):\r\n if ord(s[x]) - pre > 1: \r\n dem, res, pre = dem + 1, res + ord(s[x]) - 96, ord(s[x])\r\n if dem == k: break\r\nprint(-1) if dem < k else print(res)", "import sys\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\n\r\n\r\nn,k,=map(int,input().split())\r\ns=IS()\r\nd=[False]*26\r\nfor i in s:\r\n d[ord(i)-ord('a')]=True\r\nw=0\r\nl=0\r\ni=0\r\nwhile i<26 and l<k:\r\n if d[i]:\r\n w+=i+1\r\n l+=1\r\n i+=2\r\n else:i+=1\r\nprint(w if l==k else -1)", "ch = \"abcdefghijklmnopqrstuvwxyz\"\r\nn,k = map(int,input().split())\r\ns = sorted(list(input()))\r\nans = s[0]\r\nfor i in range(1,n):\r\n\tif ch.index(s[i])-ch.index(ans[-1])>1:\r\n\t\tans += s[i]\r\nprint(sum(map(lambda i : ord(i)-ord('a')+1,ans[:k])) if len(ans)>=k else -1)", "n, k = map(int, input().split())\ns = [ord(c)-96 for c in list(input())]\ns.sort()\n\ni = 1\nans = s[0]\nc = 1\nlast = s[0]\n\nwhile i < n and c < k:\n if s[i] - last > 1:\n ans += s[i]\n last = s[i]\n c += 1\n i += 1\n if c == k:\n break\nprint(-1 if c < k else ans)\n ", "n, k = list(map(int,input().strip().split(' ')))\r\nstages = list(input())\r\nstages.sort()\r\ni = 1\r\nprev = stages[0]\r\nw = ord(prev) - 96\r\nfor s in stages[1:]:\r\n if i >= k:\r\n break\r\n if ord(s) - ord(prev) >= 2:\r\n i += 1\r\n w += ord(s) - 96\r\n prev = s\r\nif i != k:\r\n print(-1)\r\nelse:\r\n print(w)", "n,k = map(int,input().split())\r\ns = sorted(input())\r\nlast = ord('a')-2\r\nans,len = 0,0\r\nfor i in range(0,n):\r\n if ord(s[i])>=last+2:\r\n last = ord(s[i])\r\n ans += ord(s[i]) - ord('a') + 1\r\n len += 1\r\n if (len >= k):\r\n print(ans)\r\n exit()\r\n\r\n\r\nprint(-1)", "l1 = [int(x) for x in input().split()]\r\nn,k=l1[0],l1[1]\r\nalfie=\"abcdefghijklmnopqrstuvwxyz\"\r\nl2 = list(input())\r\ncools = 0\r\ni=0\r\nweight=0\r\ncool=0\r\nwhile i<26 and cools<k:\r\n #print(alfie[i])\r\n if alfie[i] in l2:\r\n cools+=1\r\n weight+=i+1\r\n i+=1\r\n i+=1\r\n\r\nif cools>=k:\r\n print(weight)\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\nstring = sorted(list(set(input())))\nstep = []\nfor i in range(len(string)) :\n if i == 0 :\n step.append(string[i])\n else :\n if ord(string[i]) - ord(step[-1]) >= 2 :\n step.append(string[i])\n \n if len(step) == k :\n break\n\nif len(step) == k :\n ans = 0\n for i in range(k) :\n ans += ord(step[i]) - 96\n print(ans)\n\nelse :\n print(-1)\n \t \t\t \t\t\t\t \t\t \t\t", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn,k=map(int,input().split())\r\na=list(input())\r\nl=list(map(ord,a))\r\nl.sort()\r\ni=0\r\np=0\r\nx=[]\r\nwhile i<n and len(x)<k:\r\n\tif l[i]-p>1:\r\n\t\tx.append(l[i])\r\n\t\tp=l[i]\r\n\ti+=1\r\nif len(x)==k:\r\n\tprint(sum(x)-96*k)\r\nelse:\r\n\tprint(-1)", "n, k = map(int,input().split())\r\ns = input()\r\ns = sorted(s)\r\nstart = ord('a')\r\norda = ord('a')\r\nres = 0\r\ncnt = 0\r\nfor i in range(n):\r\n if ord(s[i]) >= start and cnt < k:\r\n res += (ord(s[i]) - orda)\r\n start = ord(s[i]) + 2\r\n cnt += 1\r\nif cnt < k:\r\n print(-1)\r\nelse:\r\n print(res + k)", "def main():\r\n n, k = map(int, input().split())\r\n s = input().strip()\r\n s = sorted(s)\r\n\r\n sum_val = ord(s[0]) - ord('a') + 1\r\n k -= 1\r\n prev = s[0]\r\n for i in range(1, n):\r\n if not k:\r\n break\r\n if ord(s[i]) - ord(prev) >= 2:\r\n prev = s[i]\r\n sum_val += ord(s[i]) - ord('a') + 1\r\n k -= 1\r\n\r\n if not k:\r\n print(sum_val)\r\n else:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import os\r\n\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n n, k = invr()\r\n a = list(insr())\r\n a.sort()\r\n ans = 0\r\n last = -1\r\n for i in range(n):\r\n x = ord(a[i])\r\n if x > last + 1:\r\n ans += x - ord(\"a\") + 1\r\n k -= 1\r\n last = x\r\n if k == 0:\r\n break\r\n if k != 0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n", "a, b = map(int, input().split())\r\nc = input()\r\nsorted(c)\r\nsumma = 0\r\ncount = 0\r\nj = -2\r\ni = 0\r\nabc = \"abcdefghijklmnopqrstuvwxyz\"\r\nwhile i < 26 and count < b:\r\n if abc[i] in c and i-2 >= j:\r\n summa += i+1\r\n count += 1\r\n j = i\r\n i += 1\r\nif count < b:\r\n print(-1)\r\nelse:\r\n print(summa)", "n,k=map(int,input().split())\r\na=sorted(list(map(lambda x:ord(x)-96,list(input()))))\r\nb=[a[0]]\r\na=a[1:]\r\nfor i in a:\r\n\tif i-b[-1]>1:b.append(i)\r\nif len(b)>=k:\r\n\tprint(sum(b[:k]))\r\nelse:print(-1)", "def scanf(obj=list, type=int, sep=' '):\r\n return obj(map(type, input().split(sep)))\r\nn, m = scanf()\r\ns = input()\r\ns = list(map(ord, s))\r\ns.sort()\r\nans, p = 0, 0\r\nfor i in range(n):\r\n if not m: break\r\n if s[i] - p > 1:\r\n ans += s[i] - ord('a') + 1\r\n m -= 1\r\n p = s[i]\r\nif not m:\r\n print(ans)\r\nelse:\r\n print(-1)", "def part_weight(part_name):\n return ord(part_name) - ord('a') + 1\n\ndef can_part_be_used(part_before, part_after):\n if part_before is None:\n return True # There's nothing before, so it's okay.\n \n if ord(part_before) > ord(part_after): # Part after must weight more.\n return False\n \n if ord(part_after) - ord(part_before) < 2: # And at least two letters of \"distance\"\n return False\n\n return True\n\ndef solve(available_parts, k):\n weight = 0\n last_part = None\n while k > 0:\n next_part = next((part for part in available_parts if can_part_be_used(last_part, part)), None)\n \n if next_part is None:\n print(\"-1\") # Impossible.\n return\n \n weight += part_weight(next_part)\n available_parts.remove(next_part)\n k -= 1\n last_part = next_part\n\n print(weight)\n\nn, k = [int(x) for x in input().split(\" \")]\navailable_parts = sorted(char for char in input())\nsolve(available_parts, k)\n \t\t\t\t \t\t\t\t \t \t\t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 30 11:06:23 2018\r\n\r\n@author: a_aboalella\r\n\"\"\"\r\n\r\n\r\ndef Plus3(Sum ,A , B ):\r\n return Sum+(ord(A)-96)+(ord(B)-96)\r\ndef Plus2(Sum ,A ):\r\n return Sum+(ord(A)-96)\r\n\r\nn ,k =map(int, input().split())\r\nString = input()\r\nString = list(String)\r\nif k > n :\r\n print('-1')\r\nelse:\r\n String.sort()\r\n #print(String)\r\n Sum = ord(String[0])-96\r\n LIndx = 0\r\n Ki = 1\r\n flag = False\r\n flagskip = False\r\n for j in range(0,n):\r\n \r\n if Ki == k:\r\n break\r\n if ord(String[LIndx]) - ord(String[j]) != -1 and ord(String[LIndx]) - ord(String[j]) != 0:\r\n Sum = Plus2(Sum , String[j])\r\n LIndx = j\r\n Ki +=1\r\n if(Ki == k):\r\n print(Sum)\r\n else:\r\n print(\"-1\")", "from string import ascii_lowercase\n\nalfabeto = ascii_lowercase\n\nn, k = input().split()\nn, k = int(n), int(k)\nword = input().strip()\n\ncounter = 0\ntotal = 0\ni = 0\nwhile i < len(alfabeto):\n\tif total == k:\n\t\tbreak\n\tif alfabeto[i] in word:\n\t\ttotal +=1\n\t\tcounter+=i+1\n\t\ti+=1\n\ti+=1\n\nif total != k:\n\tprint('-1')\nelse:\n\tprint(counter)\n", "a = list(input().split(' '))\r\nn, k = int(a[0]), int(a[1])\r\ns = input()\r\ns = sorted(s)\r\nres_s = s[0]\r\nfor i in range(1, n):\r\n if ord(s[i]) - ord(res_s[-1]) > 1:\r\n res_s += s[i]\r\n if len(res_s) == k:\r\n break\r\nif len(res_s) < k:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n for i in range(k):\r\n ans += ord(res_s[i]) - ord('a') + 1\r\n print(ans)\r\n", "[n, k], s = map(int, input().split()), input()\r\ns = sorted([ord(c) - ord('a') + 1 for c in set(s)])\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] - s[i - 1] < 2:\r\n s[i] = 0\r\n\r\ns = sorted(set(s))\r\nif s[0] == 0:\r\n s.remove(0)\r\nprint(sum(s[:k]) if len(s) >= k else -1)\r\n", "#k = int(input())\r\nimport sys\r\nn, m = map(int, input().split())\r\n#a = list(map(int, input().split()))\r\na = input()\r\na = list(map(lambda x: ord(x) - ord('a') + 1, a))\r\na.sort()\r\ncnt = -1\r\nans = 0\r\nind = 0\r\nflag = True\r\nwhile(m > 0):\r\n if( ind == len(a) ):\r\n print(-1)\r\n flag = False\r\n break\r\n if( a[ind] > cnt + 1 ):\r\n ans += a[ind]\r\n cnt = a[ind]\r\n m -= 1\r\n ind += 1\r\nif flag:\r\n print(ans)\r\n ", "n,k=map(int,input().split())\nw=p=0\nfor c in map(ord,sorted((input()))):\n if c-p>1:w+=c-96;p=c;k-=1\n if k==0:break\nprint((w,-1)[k>0])\n \t\t \t \t\t \t \t\t \t \t \t\t \t \t", "n, k = list(map(int, input().split()))\r\nsol = 1\r\ns = input()\r\nss = sorted(s)\r\nlast = ord('a') - 2\r\nans = 0\r\nlength = 0\r\nfor i in range(n):\r\n if ord(ss[i]) >= last + 2:\r\n last = ord(ss[i])\r\n ans += ord(ss[i]) - ord('a') + 1\r\n length += 1\r\n if length >= k:\r\n if sol == 1:\r\n print(ans)\r\n sol = 0\r\nif sol == 1:\r\n print(-1)", "n, k = map(int, input().split())\r\ns = input()\r\nli = []\r\nfor i in s:\r\n li.append(ord(i) - 96)\r\nli.sort()\r\n\r\nres = li[0]\r\nans = li[0]\r\ncnt = 1\r\nif k != 1:\r\n for i in range(1, n):\r\n if li[i] - res >= 2:\r\n cnt += 1\r\n ans += li[i]\r\n res = li[i]\r\n if cnt == k:\r\n print(ans)\r\n break\r\n else:\r\n print(-1)\r\nelse:\r\n print(ans)", "from collections import Set\n\nparam = input().split()\nstages = input()\n\nstage_set = set()\nfor char in stages:\n if char not in stage_set:\n stage_set.add(char)\n\nstage_li = []\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\ncounter = 0\nwhile len(stage_li) < int(param[1]) and counter < 26:\n if alphabet[counter] in stage_set:\n stage_li.append(alphabet[counter])\n counter += 2\n else:\n counter += 1\n\nif len(stage_li) < int(param[1]):\n print(-1)\nelse:\n sum = 0\n for stage in stage_li:\n sum += alphabet.find(stage) + 1\n print(sum)\n\n \t\t \t\t \t\t\t\t\t \t\t \t \t\t \t\t\t \t", "n,k = list(map(int,input().split()))\r\narr = list(map(str,input()))\r\narr.sort()\r\nweight = 0\r\nf = 0\r\nnum = 0\r\nind = 0\r\nwhile True:\r\n if ind==0:\r\n weight+=(ord(arr[ind])+1-97)\r\n prev = arr[0]\r\n num+=1\r\n if num==k:\r\n break\r\n else:\r\n if ord(arr[ind])-ord(prev)>1:\r\n weight+=(ord(arr[ind])+1-97)\r\n prev = arr[ind]\r\n num+=1\r\n if num==k:\r\n break\r\n ind+=1\r\n if ind==n:\r\n f = 1\r\n break\r\nif num!=k:\r\n print(-1)\r\nelse:\r\n print(weight)", "def get_order(x):\r\n return ord(x)-ord('a')+1\r\n\r\nn, k = list(map(int, input().split()))\r\ns = input()\r\ns = list(s)\r\ns = sorted(s)\r\ncounts = 1\r\nidx = 1\r\nprev = s[0]\r\ntotal = get_order(s[0])\r\n\r\nwhile idx < len(s) and counts < k:\r\n if ord(s[idx]) - ord(prev) >= 2:\r\n prev = s[idx]\r\n counts += 1\r\n total += get_order(s[idx])\r\n \r\n idx += 1\r\n \r\nif counts < k:\r\n print(-1)\r\nelse:\r\n print(total)", "n,k=map(int,input().split())\r\ns=input()\r\nl=list((ord(i)-96) for i in s)\r\nl.sort()\r\nl=list(set(l))\r\nsu=0\r\nfor i in range(len(l)-1):\r\n\tif l[i]+1==l[i+1]:\r\n\t\tl[i+1]=0\r\n\t\t# print(l[i])\r\nl.sort()\r\nwhile True:\r\n\tif l[0]==0:\r\n\t\tl.pop(0)\r\n\telse:\r\n\t\tbreak\r\nif len(l[:k])==k:\r\n\tprint(sum(l[:k]))\r\nelse:\r\n\tprint(-1)\r\n# print(*l)", "import sys\r\nn, k = map(int, input().split())\r\ns = input()\r\ns = sorted(s)\r\nsum = ord(s[0]) - ord('a') + 1\r\nk -= 1\r\nprev = s[0]\r\nfor i in range(1, n):\r\n if not k:\r\n break\r\n if ord(s[i]) - ord(prev) >= 2:\r\n prev = s[i]\r\n sum += ord(s[i]) - ord('a') + 1\r\n k -= 1\r\nif not k:\r\n print(sum)\r\n sys.exit()\r\nprint(-1)", "n,k = map(int,input().split())\r\ns = input()\r\nmat = [ord(i)-96 for i in s]\r\nmat = sorted(mat)\r\nres,step = 0,-1\r\nfor i in mat:\r\n\tif i - step > 1:\r\n\t\tk-=1\r\n\t\tres+=i\r\n\t\tstep = i\r\n\tif k==0:\r\n\t\tbreak\r\nprint(res if k == 0 else -1)", "n, k = [int(i) for i in input().split()]\r\ns = sorted(input())\r\nsumma, i, z = ord(s[0]) - 97 + 1, 1, s[0]\r\nwhile i < n:\r\n if k <= 1:\r\n break\r\n if (ord(s[i]) - 97 + 1) - (ord(z) - 97 + 1) >= 2:\r\n summa += ord(s[i]) - 97 + 1\r\n z, k = s[i], k - 1\r\n i += 1\r\nprint(summa if k <= 1 else -1)\r\n", "n,k = map(int,input().split())\r\ns = input()\r\nans = 0\r\npre = -2\r\nfor x in range(26):\r\n if chr(ord('a')+x) in s and x-pre >= 2:\r\n ans += x+1\r\n pre = x\r\n k -= 1\r\n if k is 0:\r\n break\r\nprint(-1 if k>0 else ans)", "n, k = map(int, input().split())\r\ns = input()\r\ncnt = {}\r\nfor i in range(n):\r\n cnt[ord(s[i]) - ord('a')] = cnt.get(ord(s[i]) - ord('a'), 0) + 1\r\nres = \"\"\r\nans = 0\r\ni = 0\r\nwhile i < 26:\r\n if cnt.get(i, 0) > 0:\r\n ans += i + 1\r\n res += chr(i + ord('a'))\r\n i += 1\r\n i += 1\r\n if len(res) == k:\r\n break\r\nif len(res) == k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, k=map(int,input().split())\r\ns=list(input())\r\n\r\ntemp=[]\r\nwhile len(temp)!=k and len(s)!=0:\r\n x=min(s)\r\n s.remove(x)\r\n if len(temp)==0:\r\n temp.append(x)\r\n \r\n else:\r\n l=len(temp)\r\n c=ord(x)-ord(temp[l-1])\r\n if c>=2:\r\n temp.append(x)\r\n \r\nif len(temp)==k:\r\n total=0\r\n for i in temp:\r\n total+=(ord(i)-96)\r\n \r\n print(total)\r\n\r\nelse:\r\n print(-1) \r\n ", "n,k=map(int,input().split(' '))\r\ns=map(ord,sorted(input()))\r\nans=cur=0\r\n#rint(s)\r\nfor c in s:\r\n if c-cur>1:\r\n ans+=c-96\r\n cur=c\r\n k-=1\r\n if k==0:\r\n break\r\nif(k>0):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n\r\n", "import sys\r\n\r\nn , k = map(int, input().split())\r\ns = input()\r\n\r\nl = [x for x in s]\r\n\r\nl.sort()\r\n\r\nif k==1:\r\n print(ord(l[0]) - ord('a') + 1)\r\n sys.exit()\r\n\r\nans = l[0]\r\nt = ord(l[0])\r\n\r\ni = 1\r\nc = t-ord('a')+1\r\n\r\nfor x in range(1,len(l)):\r\n if ord(l[x])>t+1:\r\n ans += l[x]\r\n i+=1\r\n t = ord(l[x])\r\n c+=t-ord('a')+1\r\n\r\n if i==k:\r\n break\r\n\r\nif len(ans) < k:\r\n print(-1)\r\n\r\nelse:\r\n print(c)", "a, b = map(int, input().split())\nc = input()\nsu = 0\ncnt = 0\nj = -2\ni = 0\nlis = \"abcdefghijklmnopqrstuvwxyz\"\nwhile i < 26 and cnt < b:\n if lis[i] in c and i-2 >= j:\n su += i+1\n cnt += 1\n j = i\n i += 1\nif cnt < b:\n print(-1)\nelse:\n print(su)\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\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\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\ns = sorted(set(S()))\r\nres = []\r\ni = 0\r\nwhile i < len(s) and len(res) < k:\r\n if not res:\r\n res.append(s[i])\r\n else:\r\n if ord(s[i]) - ord(res[-1]) > 1:\r\n res.append(s[i])\r\n i += 1\r\nif len(res) < k:\r\n p(-1)\r\nelse:\r\n z = 0\r\n for x in res:\r\n z += ord(x) - ord('a') + 1\r\n p(z)", "n,k=map(int,input().split())\r\nl=sorted(input())\r\ns=ord(l[0])-96\r\nif k==1:print(s)\r\nelse:\r\n\tc,d,f=0,1,0\r\n\tfor x in range(1,n):\r\n\t\tif ord(l[x])-ord(l[c])>1:\r\n\t\t\ts+=ord(l[x])-96\r\n\t\t\tc=x \r\n\t\t\td+=1\r\n\t\tif d==k:f=1;break\r\n\tif f==1:print(s)\r\n\telse:print(-1)", "nol, maxs = [int(x) for x in input().split()]\r\nins = sorted([ord(x) for x in input()])\r\nlast = 0\r\nans = 0\r\nfor i in ins:\r\n if i - last > 1:\r\n ans += (i - 96)\r\n maxs -= 1\r\n last = i\r\n if maxs ==0:break\r\n#print(maxs)\r\nprint([-1, ans][maxs<=0])", "n, k = [int(x) for x in input().split()]\r\ns = input()\r\np = sorted(s)\r\nd = [ord(p[0])]\r\ncount = 0\r\nfor i in range(1, n):\r\n if ord(p[i]) > ord(p[count])+1 and k>1:\r\n d.append(ord(p[i]))\r\n count = i\r\n if len(d) == k:\r\n break\r\nif len(d) == k:\r\n print(sum(d)-(k * 96))\r\nelse:\r\n print('-1')", "def main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n s = sorted(s)\r\n\r\n sum = ord(s[0]) - ord('a') + 1\r\n k -= 1\r\n prev = s[0]\r\n for i in range(1, n):\r\n if k == 0:\r\n break\r\n if ord(s[i]) - ord(prev) >= 2:\r\n prev = s[i]\r\n sum += ord(s[i]) - ord('a') + 1\r\n k -= 1\r\n\r\n if k == 0:\r\n print(sum)\r\n return\r\n print(-1)\r\n\r\nmain()\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nc=[0]*26\r\nfor i in s:\r\n\tc[ord(i)-97]+=1\r\nans=0\r\np=0\r\nwhile(p<26 and k>0):\r\n\tif(c[p]!=0):\r\n\t\tans+=p+1\r\n\t\tp+=2\r\n\t\tk-=1\r\n\telse:\r\n\t\tp+=1\r\nif(k>0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)", "anz_stages, anz_stages_in_rocket = input().strip().split()\navailable_stages = list(input().strip())\navailable_stages = list(map(lambda x : ord(x)-96, available_stages))\navailable_stages.sort()\n\nanswer_list = []\nanswer_list.append(available_stages[0])\ni = 0\nwhile len(answer_list) < int(anz_stages_in_rocket):\n i += 1\n if len(available_stages)<=i:\n print(-1)\n break\n if (available_stages[i] - answer_list[-1])<=1:\n continue\n else:\n answer_list.append(available_stages[i])\nelse:\n print(sum(answer_list))", "n,k=list(map(int,input().split()))\r\ns,l=sorted(input()),[]\r\n\r\nfor i in range(len(s)):\r\n\tif i==0:\r\n\t\tl.append(ord(s[i])-96)\r\n\telif ord(s[i])-96-l[-1]>1:\r\n\t\tl.append(ord(s[i])-96)\r\n\tif len(l)==k:\r\n\t\tprint(sum(l))\r\n\t\tbreak\r\nelse:\r\n\tprint(-1)", "n,k=map(int,input().split())\r\ns=input()\r\nls=[s[i] for i in range(n)]\r\nls.sort()\r\nnew_ls=[]\r\nfor i in range(n):\r\n if(i==0):\r\n new_ls.append(ls[i])\r\n else:\r\n if(ord(ls[i])-ord(new_ls[-1])>1):\r\n new_ls.append(ls[i])\r\n if(len(new_ls)==k):\r\n break\r\nif(len(new_ls)==k):\r\n ans=0\r\n for i in range(k):\r\n ans+=ord(new_ls[i])-97+1\r\n print(ans) \r\nelse:print(-1)", "n, k = map(int, input().split())\r\nu = list(input())\r\nc = 96\r\nfor i in range(n):\r\n u[i] = ord(u[i]) - 96\r\nu.sort()\r\nans = 0\r\nd = -3\r\ncnt = 0\r\nfor i in range(n):\r\n if u[i] > d + 1:\r\n ans += u[i]\r\n d = u[i]\r\n cnt += 1\r\n if cnt == k:\r\n break\r\nif cnt == k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n,k=map(int,input().split());s=sorted(map(ord,input()));r=[s[0]]\r\nfor x in s[1:]:\r\n if x>r[-1]+1:r.append(x)\r\nprint('-1' if len(r)<k else sum(r[:k])-96*k)", "n, k = map(int, input().split())\r\ns = sorted(list(input()))\r\nselected = 1\r\na = ord('a') - 1\r\ncur = ord(s[0])\r\nweight = cur - a\r\ni = 1\r\nwhile i < n and selected < k:\r\n if ord(s[i]) - cur > 1:\r\n selected += 1\r\n cur = ord(s[i])\r\n weight += cur - a\r\n i += 1\r\nif selected == k:\r\n print(weight)\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\ns = sorted(set(input()))\r\nx=s[0]\r\nst = ord('a') - 1\r\nans = ord(x) - st\r\ncnt = 1\r\nfor i in range(1,len(s)):\r\n if cnt == k:\r\n break\r\n if ord(s[i]) - ord(x) > 1:\r\n x = s[i]\r\n ans += ord(x) - st\r\n cnt += 1\r\n\r\nif cnt == k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\nans = 0\r\ns = input()\r\nb = sorted(s)\r\npr = -1\r\nsumm = 0\r\nfor i in range(len(b)):\r\n\tif (ord(b[i]) > pr + 1):\r\n\t\tsumm += ord(b[i]) - ord('a') + 1\r\n\t\tans += 1\r\n\t\tif (ans == k):\r\n\t\t\tbreak\r\n\t\tpr = ord(b[i])\r\nif (ans >= k):\r\n\tprint(summ)\r\nelse:\r\n\tprint(-1)\r\n\t\r\n", "# your code goes here\r\nn, m = map(int, input().split())\r\ns = input()\r\nl = []\r\nfor e in s:\r\n\tl.append(e)\r\n\t\r\nl.sort()\r\na = []\r\na.append(l[0])\r\ndel l[0]\r\nsu = ord(a[0])-ord('a')+1\r\nflag = 0\r\nwhile len(a) < m:\r\n\ti = 0\r\n\twhile ord(l[i])-ord('a')+1 < ord(a[-1])-ord('a')+3:\r\n\t\tif i == len(l)-1:\r\n\t\t\tprint(-1)\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\t\ti+=1\r\n\tif flag == 1:\r\n\t\tbreak\r\n\ta.append(l[i])\r\n\tdel l[i]\r\n\tsu += ord(a[-1])-ord('a')+1\r\nif not flag:\r\n\tprint(su)\r\n\r\n\t\r\n\t\t\r\n\r\n", "a,b=map(int,input().strip().split()[:2])\r\nl=list(input()[:a])\r\nc=-1\r\np=[]\r\nfor x in range(a):\r\n\tk=min(l)\r\n\tif abs(c-ord(k))>=2:\r\n\t\tc=ord(k)\r\n\t\tp.append(ord(k))\r\n\t\tl.remove(k)\r\n\telse:\r\n\t\tl.remove(k )\r\nif len(p)>=b:\r\n\tp=p[:b]\r\n\tprint(sum(p)-(96*len(p)))\r\nelse:\r\n\tprint(-1)", "n,k=map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\ni=0\r\nj=1\r\nt=0\r\nz=[]\r\nwhile t<k and i<len(s) and j<len(s):\r\n\tif abs(ord(s[i])-ord(s[j]))>=2:\r\n\t\tz.append(s[i])\r\n\t\tz.append(s[j])\r\n\t\ti=j\r\n\t\tj+=1\r\n\telse:\r\n\t\tj+=1\r\nz=list(set(z))\r\nz.sort()\r\nif k==1:\r\n\tprint(ord(s[0])-96)\r\nelif len(z)<k:\r\n\tprint(-1)\r\nelse:\t\r\n\tfor i in range(k):\r\n\t\tt+=ord(z[i])-96\r\n\tprint(t)", "from collections import Counter,defaultdict,deque\r\n\r\nread = lambda : list(map(int,input().split()))\r\ngetinfo = lambda grid: print(list(map(print,grid)))\r\np = lambda x: print(x,end=\" \")\r\n\r\nmod = 10**9 + 7\r\ninf = float('inf')\r\n\r\nn,k = read()\r\ns = list(input())\r\ns.sort()\r\nres = s[0]\r\nfor i in range(1, len(s)):\r\n\tif len(res) == k: break\r\n\tif ord(s[i]) - ord(res[-1]) >= 2: res += s[i]\r\nif len(res) < k:\r\n\tprint(-1)\r\nelse:\r\n\tcost = 0\r\n\tfor e in res:\r\n\t\tcost += ord(e) - ord('a') + 1\r\n\tprint(cost)", "n,k=map(int,input().split())\ns=input()\nw=0\ncount1=0\ncount2=0\nx=[]\nfor i in range(int(n)):\n\tx.append(ord(s[i])-96)\nx.sort()\nj=x[0]\nw+=x[0]\nfor l in range(int(n)):\n\tif x[l]-j>=2 and x[l]<=26:\n\t\tj=x[l]\n\t\tcount1+=1\n\t\tif count1<=k-1:\n\t\t\tw+=x[l]\n\t\t\tcount2+=1\nif count2==k-1:\n\tprint(w)\nelse:\n\tprint(-1)\n\n", "n,k=map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\nc=0\r\nka=0\r\nl=ord('a')-2\r\nfor i in range(n):\r\n if(ord(s[i])>=(l+2)):\r\n c=c+1\r\n l=ord(s[i])\r\n ka=ka+(ord(s[i])-96)\r\n if(c==k):\r\n break\r\nif(c==k):\r\n print(ka)\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\nlst = sorted(input())\r\nsm = ord(lst[0]) - 96\r\nif k == 1:\r\n print(sm)\r\nelse:\r\n c = 0\r\n cnt = 1\r\n flag = 0\r\n for i in range(1, n):\r\n if ord(lst[i]) - ord(lst[c]) >= 2:\r\n sm += ord(lst[i]) - 96\r\n c = i \r\n cnt += 1\r\n if cnt == k:\r\n flag = flag + 1\r\n break\r\n if flag == 1:\r\n print(sm)\r\n else:\r\n print(-1)\r\n", "n, k = [int(i) for i in input().split()]\r\ns = [i for i in input()]\r\ns.sort()\r\nmass = 0\r\nlast = -2\r\nfor i in range(n):\r\n if ord(s[i]) - ord('a') - 2 >= last:\r\n mass += ord(s[i]) - ord('a') + 1\r\n k -= 1\r\n last = ord(s[i]) - ord('a')\r\n if k <= 0:\r\n break\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(mass)\r\n \r\n", "n,k=map(int,input().split())\r\nc=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=input()\r\na=list(s)\r\na.sort()\r\nabcd=1\r\nb=a[0]\r\nd=c.index(b[-1])+1\r\nfor i in range(1,k):\r\n for j in range(abcd,len(a)):\r\n g=c.index(a[j])\r\n h=c.index(b[-1])\r\n if g-h>=2:\r\n d=d+c.index(a[j])+1\r\n abcd=j+1\r\n b=b+a[j]\r\n break\r\nif len(b)==k:\r\n print(d)\r\nelse:\r\n print(-1)\r\n ", "n,k = map(int,input().split())\ns = input()\nmat = [ord(i)-96 for i in s]\nmat = sorted(mat)\nres,step = 0,-1\nfor i in mat:\n\tif i - step > 1:\n\t\tk-=1\n\t\tres+=i\n\t\tstep = i\n\tif k==0:\n\t\tbreak\nprint(res if k == 0 else -1)\n", "import sys\n\nchar_map = dict([(i, 0) for i in range(1, 27)])\n\ndef main():\n\tline = sys.stdin.readline()\n\tnumbers = [int(s) for s in line.split() if s.isdigit()]\n\tstage_number = numbers[0]\n\tneedled_stages = numbers[1]\n\n\tavailable_stages = sys.stdin.readline().replace(\"\\n\", '')\n\n\tfor c in available_stages:\n\t\tchar_map[ord(c) - ord('a') + 1] += 1\n\n\tweight = 0\n\n\tkey = 1\n\tused = 0\n\twhile key <= 26 and used < needled_stages:\n\t\tif char_map[key] > 0:\n\t\t\tweight += key\n\t\t\tkey += 1\n\t\t\tused += 1\n\t\tkey += 1\n\n\tif weight == 0 or used < needled_stages:\n\t\tsys.stdout.write('-1')\n\telse:\n\t\tsys.stdout.write(str(weight))\n\nif __name__ == '__main__':\n\tmain()", "def f(s, k):\r\n prev_ch = -1\r\n w = 0\r\n\r\n for item in s:\r\n if item - 1 > prev_ch:\r\n w += item\r\n k -= 1\r\n prev_ch = item\r\n if k == 0:\r\n return w\r\n return -1\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = sorted([ord(item) - ord('a') + 1 for item in set(input())])\r\nprint(f(s, k))", "n,k=map(int,input().split())\r\ns=input()\r\ns=''.join(sorted(s))\r\nl=s[0]\r\ni=0\r\nflag=True\r\nwhile len(l)!=k:\r\n if i>=n:\r\n flag=False\r\n break\r\n if ord(l[-1])+1<ord(s[i]):\r\n l=l+s[i]\r\n i+=1\r\nif flag:\r\n print(sum(ord(x) for x in l)-96*k)\r\nelse:\r\n print(-1)\r\n\r\n", "n,k=map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\nl=[s[0]]\r\nw=ord(s[0])-96\r\ni=1\r\nj=len(l)\r\nwhile(j<k and i<n):\r\n if((ord(s[i])-ord(l[j-1]))>1):\r\n l.append(s[i])\r\n j+=1\r\n w+=ord(s[i])-96\r\n i+=1\r\nif(len(l)==k):\r\n print(w)\r\nelse:\r\n print(-1)", "from string import ascii_lowercase\r\nx=list(ascii_lowercase)\r\nx.insert(0,0)\r\nn,k=map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\np=[]\r\np.append(s[0])\r\nfor i in range(len(s)):\r\n if ord(s[i]) - ord(p[-1]) > 1:\r\n p.append(s[i])\r\n if len(p)==k:\r\n break\r\n\r\nif len(p)==k:\r\n summ=0\r\n for i in p:\r\n summ+=x.index(i)\r\n print(summ)\r\nelse:\r\n print(-1)\r\n", "arr = input()\r\narr = arr.split(' ')\r\nn = int(arr[0])\r\nk = int(arr[1])\r\nletters = input()\r\nletters = list(letters)\r\nweight = []\r\ntotal = 0\r\n\r\nfor i in range(0,n):\r\n weight.append(ord(letters[i]) - 96)\r\n\r\nweight = sorted(weight)\r\nx=0\r\nwhile (x<n-1):\r\n if (x<len(weight)-1):\r\n if (weight[x+1]-weight[x]<2):\r\n weight.pop(x+1)\r\n x=x-1\r\n x = x + 1\r\nfor y in range(0,len(weight)-k):\r\n weight.pop()\r\nfor x in range(0,len(weight)):\r\n total = total + weight[x]\r\nif len(weight)<k:\r\n total = -1\r\nprint(total)", "n, k = map(int, input().split())\r\ns = list(input())\r\ns.sort()\r\nkeka = ord(s[0])\r\nj = 1\r\ncnt = ord(s[0]) - 96\r\nfor i in range(1, n):\r\n if j < k and ord(s[i]) - keka >= 2:\r\n j += 1\r\n keka = ord(s[i])\r\n cnt += ord(s[i]) - 96\r\nif j == k:\r\n print(cnt)\r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\nw = p = 0\nfor c in map(ord, sorted(input())):\n if c - p > 1: w += c - 96; p = c; k -= 1\n if k == 0: break\nprint((w, -1)[k != 0])\n\t \t \t\t \t \t \t\t \t \t \t \t \t \t \t", "\r\nstages,length = list(map(int,input().split()))\r\n\r\ns = list(input())\r\ns = list(set(s))\r\n\r\ns.sort()\r\nweight = 0\r\nflag = 1\r\nnext_stage = s[0]\r\nstart = 0\r\nend = len(s)\r\n\r\nwhile length > 0:\r\n length -= 1\r\n if (next_stage in s and flag==1):\r\n \r\n weight += ord(next_stage)-96\r\n flag=1\r\n \r\n if(length>0):\r\n for each in range(start,end):\r\n flag=0\r\n if(ord(s[each]) - ord(next_stage)>1):\r\n start=each\r\n flag=1\r\n next_stage = s[each]\r\n break\r\n else:\r\n flag=0\r\n break\r\n\r\n \r\n \r\nif(flag==1):\r\n print(weight)\r\nelse:\r\n print(-1)\r\n", "n,k=map(int,input().split())\r\ns=input()\r\ndp=[0]*26\r\nfor i in s:\r\n dp[ord(i)-97]=1\r\n ans=0\r\n c=-2\r\n ct=0\r\n tf=False\r\n for i in range(len(dp)):\r\n if i-c>=2 and dp[i]==1:\r\n c=i\r\n ans+=i+1\r\n ct+=1\r\n if ct==k:\r\n tf=True\r\n break\r\nif tf:\r\n print(ans)\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nl=list(input())\r\nl.sort()\r\nr=ord(\"a\")-2\r\nk=0\r\na=0\r\nfor i in l:\r\n if ord(i)>=r+2:\r\n r=ord(i)\r\n a=a+ord(i)-ord(\"a\")+1\r\n k=k+1\r\n if k>=m:\r\n print(a)\r\n break\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n ", "n,k=map(int,input().split())\r\nw=p=0\r\nfor c in map(ord,sorted((input()))):\r\n if c-p>1:\r\n w+=c-96 \r\n p=c\r\n k-=1\r\n if k==0:\r\n break\r\nprint([w,-1][k>0])", "n, k = map(int,input().split())\r\na = list(input())\r\nb = []\r\nc = []\r\nd = []\r\nfor i in a:\r\n b.append(ord(i) - 96)\r\n\r\ncount = 1\r\ncount2 = 0\r\ncount3 = 0\r\n\r\nm = min(b)\r\nmi = b.index(m)\r\nd.append(a[mi])\r\ncount2 += m\r\na.pop(mi)\r\nb.pop(mi)\r\nm += 2\r\n\r\n\r\nwhile count < k:\r\n try:\r\n mi = b.index(m)\r\n d.append(a[mi])\r\n count += 1\r\n count2 += m\r\n count3 = 0\r\n a.pop(mi)\r\n b.pop(mi)\r\n m += 2\r\n except:\r\n m += 1\r\n count3 += 1\r\n if count3 > 26:\r\n break\r\n\r\n\r\nif count == k and count3 <= 26:\r\n print(count2)\r\nelse:\r\n print(-1)", "import sys\r\nimport 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_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,k = get_list()\r\ns = sorted(get_string())\r\ni = 0\r\nflag = True\r\nres = '' \r\nwhile k>0 and i < n:\r\n if i == 0:\r\n res += s[i]\r\n k -= 1\r\n if ord( res[-1] ) + 1 < ord( s[i] ):\r\n res += s[i]\r\n k -= 1\r\n if k>0 and i==n-1:\r\n flag = False\r\n break\r\n i += 1\r\nif flag:\r\n count = 0\r\n for i in res:\r\n count += ord(i)-96\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nb=\"\".join(sorted(s))\r\nm=\"\"\r\na=b[0]\r\nm=b[0]\r\nfor i in range(k-1):\r\n for j in b:\r\n if ord(j)-ord(a)>1:\r\n m+=j\r\n a=j\r\n break\r\nif len(m)!=k:\r\n print(\"-1\")\r\nelse:\r\n o=0\r\n for h in m:\r\n o+=ord(h)-96\r\n print(o)\r\n ", "n, k = map(int, input().split())\ns = sorted(set(input()))\nn = len(s)\ni = 1\nc = 1\nv = [s[0]]\nwhile i < n and c != k:\n if ord(s[i]) - ord(v[-1]) > 1:\n v.append(s[i])\n c += 1\n i += 1\nprint([sum(ord(i) - 96 for i in v), - 1][c != k])\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\nfind max of each column * a\r\n'''\r\n\r\ndef solve():\r\n n, k = MII()\r\n a = [c for c in I().strip()]\r\n a.sort()\r\n\r\n base = ord('a')\r\n last = -1\r\n i = 0\r\n ans = 0\r\n while i < len(a) and k > 0:\r\n if ord(a[i]) - last <= 1:\r\n #print(\"skip\", a[i])\r\n i += 1\r\n continue\r\n else:\r\n #print(\"add\", a[i])\r\n ans += ord(a[i]) - base + 1\r\n last = ord(a[i])\r\n k -= 1\r\n i += 1\r\n\r\n if k > 0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\nsolve()", "n,k=map(int,input().split())\r\nx=list(input())\r\nx.sort()\r\nlastCh=x[0]\r\ncnt=1\r\nval=ord(x[0])-ord('a')+1\r\nfor i in range(1,len(x)):\r\n if cnt==k: break\r\n if ord(x[i])-ord(lastCh)>1:\r\n lastCh=x[i]\r\n cnt+=1\r\n val+=ord(x[i])-ord('a')+1\r\nif cnt==k: print(val)\r\nelse: print(-1)", "n, k = map(int, input().split())\r\ns = input()\r\n\r\ns = list(s)\r\ns.sort()\r\n\r\nf = lambda x: ord(x) - ord('a') + 1\r\n\r\ntot = 10 ** 9\r\nfor i in range(n):\r\n ans = [s[i]]\r\n if len(ans) < k:\r\n for j in range(i + 1, n):\r\n if ord(s[j]) - ord(ans[-1]) > 1:\r\n ans.append(s[j])\r\n if len(ans) >= k:\r\n break\r\n if len(ans) >= k:\r\n tot = min(tot, sum(map(f, ans)))\r\n\r\nif tot < 10 ** 9:\r\n print(tot)\r\nelse:\r\n print(-1)\r\n", "\r\nR = lambda:map(int,input().split())\r\n\r\nn, m = R()\r\ns = sorted(map(ord,input()))\r\nval = s[:1]\r\nfor c in s[1:]:\r\n if c > val[-1] + 1:\r\n val.append(c)\r\n\r\nprint(-1 if len(val) < m else sum(val[:m])-96*m)", "from sys import stdin\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\n\r\nn, k = minput()\r\ns = input()\r\ns = sorted(s)\r\nw = ord(s[0])-96\r\np = s[0]\r\ni = 1\r\nk-=1\r\nwhile k and i<n:\r\n if ord(s[i]) - ord(p) >=2:\r\n w += ord(s[i])-96\r\n p = s[i]\r\n k-=1\r\n i+=1\r\n\r\nif k: print(-1)\r\nelse: print(w)\r\n", "nk = input().split()\nn = int(nk[0])\nk = int(nk[1])\nmod = input()\nmodulos = [m for m in mod]\nmodUnico = list(set(modulos))\nmodulos = sorted(modUnico)\n\ndef constroiFoguete(k,modulos):\n soma = 0\n ultimo = -1\n faltam = k\n for m in modulos:\n num = ord(m)-96\n if num > ultimo+1:\n soma += num\n faltam -=1\n ultimo = num\n if faltam == 0:\n return soma\n return (-1)\n\nprint(constroiFoguete(k,modulos))\n", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n, k = input_ints()\r\n s = input()\r\n ans = 0\r\n i = 0\r\n while i < 26 and k:\r\n if chr(i + ord('a')) in s:\r\n ans += i + 1\r\n i += 1\r\n k -= 1\r\n i += 1\r\n if k:\r\n ans = -1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys\r\nn, k = map(int, input().split())\r\ns = input()\r\nL = [''] * len(s)\r\nfor i in range(len(s)):\r\n L[i] = s[i]\r\nL.sort()\r\ns = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(L)):\r\n ind = s.find(L[i])\r\n cur = k - 1\r\n sm = ind + 1\r\n for j in range(i, len(L)):\r\n if s.find(L[j]) > ind + 1:\r\n ind = s.find(L[j])\r\n cur -= 1\r\n sm += ind + 1\r\n if cur == 0:\r\n print(sm)\r\n sys.exit()\r\nprint(-1)", "n,k=map(int,input().split())\r\ns=input()\r\ns=sorted(s)\r\nwt=ord(s[0])-96\r\nk1=1\r\nprev=s[0]\r\nfor i in range(1,n):\r\n if(k==1):\r\n break\r\n if(ord(s[i])-ord(prev)>1):\r\n prev=s[i]\r\n wt+=ord(s[i])-96\r\n k1+=1\r\n if(k1==k):\r\n break\r\nif(not(k1==k)):\r\n print(-1)\r\nelse:\r\n print(wt)", "n,k=input().split()\r\ns=input()\r\nd={}\r\nfor i in range(26):\r\n d[chr(97+i)]=i+1\r\ndp={} \r\nfor j in s:\r\n dp[j]=d[j]\r\nx=list(dp.values())\r\nx.sort()\r\nsu=x[0]\r\nt=x[0]\r\ncount=1\r\nfor i in range(1,len(x)):\r\n if count<int(k):\r\n if x[i]-t>=2:\r\n su=su+x[i]\r\n count=count+1\r\n t=x[i]\r\n else:\r\n break\r\nprint(su if count==int(k) else -1) ", "n,m=map(int,input().split())\r\nx=input()\r\nl=[]\r\nfor i in range(len(x)):\r\n l.append(ord(x[i]))\r\nl.sort()\r\n# print(l)\r\nj=1\r\ncount=1\r\nsumi=[l[0]]\r\n\r\n\r\nwhile j<len(x) and count<m:\r\n # print(\"checking against=\",sumi[-1])\r\n # print(\"item being checked=\",l[j])\r\n # print(\"diff=\",l[j]-sumi[-1])\r\n if l[j]-sumi[-1]>=2:\r\n count+=1\r\n sumi.append(l[j])\r\n j+=1\r\n \r\n # print(\"after appending=\",sumi)\r\n else:\r\n j+=1\r\n# print(sumi)\r\nif count<m:\r\n print(-1)\r\nelse:\r\n print(sum(sumi)-96*m)", "\r\n# codeforces\r\n# 1011A\r\n\r\n# INSEA Mashup #5\r\n# B\r\n# by advq\r\n\r\nn, k = map(int, input().split())\r\ns = [ord(c)-96 for c in input()]\r\ns.sort()\r\n\r\nlast = -1\r\ncost = num = i = 0\r\nif k == 1:\r\n\tprint(s[i])\r\nelse:\r\n\twhile i < n:\r\n\t\tif s[i] >= last+2:\r\n\t\t\tlast = s[i]\r\n\t\t\tcost+=s[i]\r\n\t\t\tnum+=1\r\n\t\t\tif num >= k:\r\n\t\t\t\tprint(cost)\r\n\t\t\t\tbreak\r\n\t\ti+=1\r\n\telse:\r\n\t\tprint(-1)\r\n", "#-96\r\nn,m = map(int,input().split())\r\nm-=1\r\na=list(input())\r\na.sort()\r\nlast=ord(a[0])-96\r\nves=last\r\nif m!=0:\r\n for i in range(1,n):\r\n if (ord(a[i])-96)-last>=2:\r\n m-=1\r\n last=ord(a[i])-96\r\n ves+=last\r\n if m==0:\r\n break\r\nif m!=0:\r\n print('-1')\r\nelse:\r\n print(ves)\r\n", "n,k =map(int,input().split())\r\ns =input()\r\nli =list(i for i in s)\r\nli.sort()\r\nalphabets=[\"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\nans=li[0]\r\nind=alphabets.index(ans)\r\nif (n>1):\r\n for i in range(1,n):\r\n ind1 =alphabets.index(li[i])\r\n if ind1-ind>=2:\r\n ans+=li[i]\r\n ind=ind1\r\n else:\r\n pass\r\nif(len(ans)>=k):\r\n sum=0\r\n for i in ans[0:k]:\r\n sum+=alphabets.index(i)+1\r\n print(sum)\r\nelse:\r\n print(-1)\r\n ", "import string\r\nn,k = map(int,input().split())\r\ns = input()\r\nalph = string.ascii_lowercase\r\ndp = [[100000]*26 for i in range(k)]\r\nfor i in range(26):\r\n if s.find(alph[i]) != -1:\r\n dp[0][i] = i + 1\r\nfor i in range(1,k):\r\n for j in range(26):\r\n for z in range(j-1):\r\n dp[i][j] = min(dp[i][j],dp[i-1][z] + dp[0][j])\r\nif min(dp[-1]) == 100000:\r\n print(-1)\r\nelse:\r\n print(min(dp[-1]))\r\n", "n,k = map(int,input().split())\r\n\r\ndef tonny(i) :\r\n\treturn (ord(i)-96)\r\na= sorted(input())\r\na=list(map(tonny,a))\r\na=sorted(list(set(a)))\r\nans=[a.pop(0)]\r\nk-=1\r\nfor j in a :\r\n\tif j-ans[-1] >1 and k>0 :\r\n\t\tk-=1\r\n\t\tans.append(j)\r\n\tif k==0 :\r\n\t\tbreak\r\nif k!=0 :\r\n\tprint(-1)\r\nelse:\r\n\tprint(sum(ans))\r\n", "\r\ndef solve():\r\n n,k=map(int,input().split());s=list(input());ans=0;curr=-1;st=-1\r\n for i in range(n):s[i]=ord(s[i])-96\r\n s.sort()\r\n for segment in range(k):\r\n if segment==0:\r\n ans+=s[0];curr=0;continue\r\n for i in range(curr+1,n):\r\n if s[i]-s[curr]>=2:ans+=s[i];curr=i;break\r\n else:print(-1);return\r\n print(ans)\r\nsolve()\r\n ", "\n# MasterKali\n\nfrom sys import stdin\nfrom collections import Counter, defaultdict, deque\nfrom math import sqrt, factorial, log10, log, floor, ceil\nfrom itertools import permutations, combinations, combinations_with_replacement, product\nimport string\n\ninput = stdin.readline\ndef li(): return list(map(int, input().split()))\ndef lis(): return list(map(str, input().split()))\ndef mp(): return map(int, input().split())\ndef inp(): return int(input())\ndef inps(): return str(input().strip())\ndef pr(n): return stdout.write(str(n)+\"\\n\")\n\ndef primes(pmax):\n\tD = {}\n\tq = 2\n\twhile q <= pmax:\n\t\tif q not in D:\n\t\t\tyield q\n\t\t\tD[q*q] = [q]\n\t\telse:\n\t\t\tfor p in D[q]:\n\t\t\t\tD.setdefault(p+q, []).append(p)\n\t\t\tdel D[q]\n\t\tq+=1\n\ndef gcd(i, j):\n\twhile j > 0:\n\t\ti, j = j, i%j\n\treturn i\n\n\nINF = float('inf')\n\ndef ind(x):\n\tlow = string.ascii_lowercase\n\treturn low.index(x)+1\n\t\n\ndef solve():\n\tn, k = mp()\n\ts = inps()\n\ts = list(s)\t\n\ts.sort()\n\n\tcnt, prv, res = 0, -2, 0\n\tfor i in s:\n\t\tx = ind(i)\n\t\tif x-1 > prv and cnt < k:\n\t\t\tcnt+=1\n\t\t\tres+=x\n\t\t\tprv = x\n\t\n\tif cnt < k: print(-1)\n\telse: print(res)\n\nt = 1\nfor i in range(t):\n\t\n\tsolve()\n\n", "def getWeight(a):\r\n return(ord(a) - ord('a')+1)\r\n\r\nn,k = input().strip().split(\" \")\r\nn = int(n)\r\nk = int(k)\r\nif (k <= 0):\r\n print(\"0\")\r\n exit(0)\r\nif (n <= 0):\r\n print(\"-1\")\r\n exit(0)\r\nif (k > 14):\r\n print(\"-1\")\r\n exit(0)\r\n\r\ns = set()\r\nst = input().strip()\r\nfor x in st:\r\n s.add(x)\r\ncount = 0\r\nskip = False\r\nret = 0\r\nprev = -2\r\nfor x in sorted(s):\r\n if count == k:\r\n break\r\n if skip == True:\r\n if getWeight(x) == prev + 1:\r\n skip = False\r\n continue\r\n skip = True\r\n\r\n prev = getWeight(x)\r\n ret += prev\r\n count += 1\r\nif count < k:\r\n print (-1)\r\n exit(0)\r\nprint(ret)", "for _ in range(1):\r\n n,k=map(int,input().split())\r\n s=list(input())\r\n s.sort()\r\n prev=ord(s[0])\r\n cur=ord(s[0])-ord('a')+1\r\n ini=k\r\n k-=1\r\n for i in range(1,n):\r\n if ord(s[i])-prev>=2 and k>0:\r\n cur+=ord(s[i])-ord('a')+1\r\n prev=ord(s[i])\r\n k-=1\r\n if k==0:\r\n break\r\n if ini==0:\r\n print(0)\r\n elif k>0:\r\n print(-1)\r\n else:\r\n print(cur)", "n,k=map(int,input().split())\r\nans=x=0\r\nfor i in sorted(map(ord,input())):\r\n if i-x>1:\r\n ans+=i-96\r\n x=i\r\n k-=1\r\n if k==0: break\r\nif k>0: print(-1)\r\nelse: print(ans)", "m,n=map(int,input().split())\r\n#s = list(map(ord,sorted(input())))\r\ns1= 0\r\np = 0\r\nfor c in map(ord,sorted(input())):\r\n if c-p>1:s1+=c-96;p=c;n=n-1\r\n if n==0:break\r\nprint((s1,-1)[n>0])\r\n", "import string\nref = {b:a for a,b in enumerate(string.ascii_lowercase,1)}\nn,k = list(map(int,input().split()))\ns = input()\nnum = []\nfor x in sorted(s):\n num.append(ref[x])\n\nbase = [num[0]]\nfor y in num:\n if y - base[-1] > 1 and len(base) < k :\n base.append(y)\n if len(base) == k :\n break\n\nif len(base) < k :\n print (-1)\nelse:\n print (sum(base))\n \n \n", "\n\navailable, needed = map(int, input().split())\nstages = sorted(list(input()), key=lambda x: ord(x))\n# print(stages)\nresult = 0\nrocket_stages = 'A'\nfor current_stage in stages:\n if ord(current_stage) - ord(rocket_stages[-1]) > 1:\n rocket_stages += current_stage\n result += ord(current_stage)-96\n # print(current_stage + \" : \" + str(ord(current_stage)-96))\n\n if len(rocket_stages[1:]) == needed:\n break\n\nif result == 0 or len(rocket_stages[1:]) < needed:\n print(-1)\nelse:\n print(result) # , rocket_stages[1:])\n", "n, k = map(int, input().split())\na = input()\nt = [0 for _ in range(30)]\nfor x in a:\n t[ord(x) - ord('a')] = 1\nans = tmp = i = 0\nwhile i < 26:\n if t[i]:\n i += 1\n tmp += 1\n ans += i\n if tmp == k:\n break\n i += 1\nif tmp < k:\n print(-1)\nelse:\n print(ans)\n\n \t \t \t\t\t\t \t\t\t\t\t \t \t\t\t", "def main():\n alph = 'abcdefghijklmnopqrstuvwxyz'\n n, k = [int(i) for i in input().split()]\n s = sorted(list(set(input())))\n rocket_w = 0\n left = k\n last_w = -1\n for item in s:\n stage_w = alph.find(item) + 1\n if stage_w - last_w >= 2 and left > 0:\n rocket_w += stage_w\n last_w = stage_w\n left -= 1\n if left > 0:\n print(-1)\n else:\n print(rocket_w)\n\n\nmain()\n", "n,k=map(int,input().split())\r\nl=list(input())\r\nl.sort()\r\nans,d=ord(l[0])-96,0\r\ni,j=0,0\r\nwhile i<n:\r\n if abs(ord(l[i])-ord(l[j]))>=2:\r\n ans+=int(ord(l[i]))-96\r\n j=i\r\n d+=1\r\n if d==k-1:\r\n print(ans)\r\n exit()\r\n i+=1\r\nprint(-1)", "n , k = map(int, input().split())\ns = list(map(ord, sorted(input())))\ns = list(map(lambda x : x - 96, s))\n\ntotalwgt = 0\ntotalnum = 0\nlast = -1\n\nfor i in s:\n if totalnum < k:\n if i > last + 1:\n totalnum += 1\n totalwgt += i\n last = i\n else:\n break\nif totalnum == k:\n print(totalwgt)\nelse:\n print(-1)\n\n \t \t \t \t \t \t\t \t \t\t", "n,k = map(int, input().split())\r\ns = input()\r\ns = ''.join(sorted(s))\r\n\r\nwynik = s[0]\r\nindex = 1\r\nwhile index < n:\r\n if ord(s[index]) - ord(wynik[-1]) >= 2:\r\n wynik += s[index]\r\n index += 1\r\n\r\nif len(wynik) < k:\r\n print(-1)\r\n exit()\r\nsuma = 0\r\nfor i in range(k):\r\n suma += ord(wynik[i]) - 96\r\n\r\n#print(s)\r\n#print(wynik)\r\nprint(suma)", "n,k=map(int,input().split())\r\na=p=0\r\nfor i in map(ord,sorted(input())):\r\n if i-a>1:p+=i-96;a=i;k-=1\r\n if k==0:break\r\nprint((p,-1)[k>0]) \r\n", "a,b = [int(i) for i in input().split()]\r\nmystr = input()\r\nstrarr = [ord(i)-96 for i in sorted(mystr)]\r\n\r\nminv = 50*26\r\nfor i in range(a):\r\n count = 1\r\n current = i\r\n c= [strarr[i]]\r\n for o in range(i+1,a):\r\n if strarr[o] - strarr[current] >= 2:\r\n count+=1\r\n current = o\r\n c.append(strarr[current])\r\n if count >= b:\r\n if sum(c[:b]) < minv:\r\n minv = sum(c[:b])\r\n\r\nif minv == 50*26:\r\n print(-1)\r\nelse:\r\n print(minv)", "n, k = list(map(int, input().split()))\ns = list(set(input()))\ns.sort()\nbad = \"\"\nam = 0\nans = 0\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\nfor i in s:\n if i == bad:\n continue\n else:\n am += 1\n ans += alpha.index(i) + 1\n if i != 'z':\n bad = alpha[alpha.index(i)+1]\n if am == k:\n print(ans)\n exit()\nprint(-1)\n", "nk=input().split(\" \")\r\nk=int(nk[1])\r\nrow=input()\r\nseti=[]\r\nfor i in range(len(row)):\r\n seti.append(ord(row[i])-96)\r\nseti.sort()\r\nsum1=seti[0]\r\nlast=seti[0]\r\ncout=1\r\nfor i in range(1,len(seti)):\r\n if (seti[i]>last+1)and(cout<k):\r\n last=seti[i]\r\n sum1=sum1+int(seti[i])\r\n cout=cout+1 \r\nif cout<k:\r\n print(-1)\r\nelse:\r\n print (sum1)\r\n", "import sys\r\nn,k=map(int,input().split())\r\ns=list(input())\r\ns.sort()\r\nlast=ord('a')-2\r\nln=0\r\nans=0\r\nfor i in range(n):\r\n if ord(s[i])>=last+2:\r\n last=ord(s[i])\r\n ans+=last-96\r\n ln+=1\r\n if ln==k:\r\n break\r\nif ln==k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n \r\n", "### A. Stages\r\nimport string\r\narr=[0]\r\nlet=string.ascii_lowercase\r\nfor i in let:\r\n arr.append(i)\r\nn,k=map(int, input().split())\r\ns=sorted(set(input()))\r\ncur=-1\r\nnew=[]\r\nfor i in s: \r\n if arr.index(i) > cur+1:\r\n cur=arr.index(i)\r\n new.append(cur)\r\n if len(new)==k:\r\n print(sum(new))\r\n break\r\nelse:\r\n print(-1)", "from string import ascii_lowercase\r\n\r\nn, k = map(int, input().split())\r\ns = sorted(input())\r\nt = s[0]\r\nfor i in s[1:]:\r\n if ord(i) - ord(t[-1]) > 1:\r\n t += i\r\nif len(t) < k:\r\n print(-1)\r\nelse:\r\n x = 0\r\n for i in t[:k]:\r\n x += ascii_lowercase.index(i) + 1\r\n print(x)\r\n", "n,k = map(int,input().split())\r\ns = input()\r\ne = set()\r\nfor i in s:\r\n e.add(i)\r\n\r\nans = 10**18\r\nfor i in range(97,123):\r\n if chr(i) in e:\r\n cnt = 0\r\n j = i\r\n c = 0\r\n prev = -1\r\n while j < 123 and c < k:\r\n if j-prev <= 1:\r\n j += 1\r\n continue\r\n\r\n if chr(j) in e:\r\n cnt += (j-97+1)\r\n c += 1\r\n prev = j\r\n\r\n j += 1\r\n\r\n if c == k:\r\n ans = min(cnt,ans)\r\n\r\nif ans == 10**18:\r\n ans = -1\r\n\r\nprint(ans)", "#n, k = map(int, input().split(\" \"))\r\n#LA = [int(x) for x in input().split()]\r\n\r\nn, k = map(int, input().split(\" \"))\r\nL = list(input())\r\nL.sort()\r\ns = 0\r\nlast = -10\r\nfor ch in L :\r\n c = ord(ch[0]) - ord('a')\r\n if (c > last + 1) :\r\n if k > 0 :\r\n k -= 1\r\n s += c + 1\r\n last = c\r\n\r\nif (k > 0) : print(\"-1\")\r\nelse : print(s)\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(ord,input().strip()))\r\ncount=0\r\na.sort()\r\nfor i in range(n):\r\n a[i]-=96\r\nb=[a[0]]\r\nfor i in range(1,n):\r\n if len(b)==k:\r\n break\r\n if a[i]>b[-1]+1:\r\n b.append(a[i])\r\nif len(b)!=k:\r\n print(-1)\r\nelse:\r\n print(sum(b))\r\n", "n, k = map(int, input().split())\nstages = input()\n\nalphabet = [0] * 26\n\nfor i in range(n):\n\tch = stages[i]\n\tindex = ord(ch)-97\n\talphabet[index] = 1\n\ntotal = 0\ncount = 0\ni = -1\nwhile count < k:\n\ti += 1\n\tif i >= 26:\n\t\tbreak\n\tif alphabet[i] > 0:\n\t\tcount += 1\n\t\ttotal += (i+1)\n\t\ti += 1\n\nif count < k:\n\ttotal = -1\n\nprint(total)", "import string\r\n\r\nn,m = map(int,input().split())\r\na = input()\r\nk = 0\r\nj = 1\r\nq = 0\r\nb = string.ascii_lowercase\r\nfor i in b:\r\n p = ord(i)\r\n if i in a and p-q>1:\r\n if j-1==m:\r\n break\r\n k+=p+1-97\r\n q = p\r\n j+=1\r\nif j-1<m:\r\n print(-1)\r\nelse:\r\n print(k)", "\r\nmod=10**9+7\r\nimport math\r\nfor _ in range(1):\r\n n,m=map(int,input().split())\r\n s=input()\r\n arr=[0 for i in range(26)]\r\n for i in s:\r\n arr[ord(i)-97]=1\r\n i=0\r\n ans=0\r\n while(i<26 and m>0):\r\n if(arr[i]==1):\r\n ans+=(i+1)\r\n i+=1\r\n m-=1\r\n i+=1\r\n if(m==0):\r\n print(ans)\r\n else:\r\n print(-1)\r\n #print(m)\r\n \r\n \r\n\r\n\r\n", "n, k = map(int, input().split())\r\nlst = input()\r\na = b = 0\r\nfor i in map(ord,sorted(lst)):\r\n if i - b > 1:\r\n a += i - 96\r\n b = i\r\n k -= 1\r\n if k == 0:\r\n break\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(a)", "# cook your dish here\r\n# from math import * \r\n#for _ in range(int(input().strip())):\r\n\r\nn,k = map(int,input().split())\r\ns = input()\r\ns = ''.join(sorted(s))\r\nk-=1\r\nprev = s[0]\r\nans = ord(s[0]) - ord('a') + 1\r\nfor i in range(n):\r\n if k==0:\r\n break\r\n if ord(s[i]) - ord(prev) > 1 : \r\n k-=1 \r\n ans+= ( ord(s[i]) - ord('a') + 1)\r\n prev = s[i]\r\nif k:\r\n ans = -1 \r\nprint(ans)", "from sys import stdin\nn, k = [int(i) for i in stdin.readline().split(' ')]\ntrim = lambda s: s[:-1] if s[-1] == \"\\n\" else s\nstages = ''.join(sorted(trim(stdin.readline())))\n\nweight = 0\nj = 0\nlastStage = \"_\"\nfor i in range(0, k):\n while (j < n) and (ord(stages[j]) <= ord(lastStage)+1):\n j += 1\n if j >= n:\n weight = -1\n break\n lastStage = stages[j]\n weight += ord(stages[j])-96\n\nprint(weight)\n\n \t\t \t\t \t\t \t \t\t \t \t \t\t \t", "d = [False for i in range(26)]\r\n\r\nn, k = map(int,input().split())\r\n\r\nfor el in str(input()):\r\n d[ord(el) - ord(\"a\")] = True\r\n\r\n\r\nans = 100000000000000\r\n\r\ndef get_ans(i):\r\n if not d[i]:\r\n return 100000000000000\r\n last = i + 2\r\n ret = i +1\r\n gett = 1\r\n for j in range(i + 2, 26):\r\n if j >= last and d[j] and gett < k:\r\n last = j + 2\r\n ret += j +1\r\n gett += 1\r\n\r\n if gett != k:\r\n return 100000000000000\r\n \r\n return ret\r\n\r\n\r\nfor i in range(26):\r\n ans = min(ans, get_ans(i))\r\n\r\n\r\nprint(- 1 if ans == 100000000000000 else ans)\r\n", "n,k=map(int,input().split())\ns=list(map(ord,sorted(input())))\nlast=0\ntotal=0\ni=0\nwhile i<n:\n if s[i]>last+1:\n total += s[i]-96\n last = s[i]\n k -= 1\n if k==0:\n break\n i+=1\nif i<n:\n print(total)\nelse:\n print(-1)\n\n \t \t \t \t \t\t\t\t \t \t \t \t\t\t\t", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\nn, k = map(int, rd().split())\r\ns = list(rd().strip())\r\n\r\ns.sort()\r\nprev = ' '\r\nres = 0\r\n\r\nfor i in range(n):\r\n\r\n if s[i] >= chr(ord(prev) + 2) and k > 0:\r\n\r\n prev = s[i]\r\n res += ord(s[i]) - ord('a') + 1\r\n \r\n k -= 1\r\n\r\nif k > 0: print(-1)\r\nelse:\r\n\r\n print(res)\r\n\r\n\r\n \r\n \r\n", "n, k = map(int, input().split())\r\ns = input()\r\nalph = 'abcdefghijklmnopqrstuvwxyz'\r\ns = sorted(s)\r\nmin_count = float('inf')\r\nfor i in range(n):\r\n c = 1\r\n j = 0\r\n count = alph.find(s[i]) + 1\r\n x = alph.find(s[i])\r\n while c != k and j != n:\r\n if i != j and alph.find(s[j]) > x + 1:\r\n c += 1\r\n count += alph.find(s[j]) + 1\r\n x = alph.find(s[j])\r\n j += 1\r\n if c == k and count < min_count:\r\n min_count = count\r\nprint(-1 if min_count == float('inf') else min_count)", "from sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9 + 7)\r\nimport sys\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return input().strip()\r\ndef grid(r, c): return [lint() for i in range(r)]\r\nfrom collections import defaultdict, Counter\r\nimport math\r\nimport heapq\r\nfrom heapq import heappop , heappush\r\nimport bisect\r\nfrom itertools import groupby\r\ndef gcd(a,b): \r\n while b:\r\n a %= b\r\n tmp = a\r\n a = b\r\n b = tmp\r\n \r\n return a\r\n \r\ndef lcm(a,b): \r\n return a / gcd(a, b) * b\r\n \r\ndef check_prime(n):\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n if not n % i:\r\n return False\r\n return True\r\ndef Bs(a, x):\r\n i=0\r\n j=0\r\n left = 0\r\n right = len(a)\r\n flag=False\r\n while left<right:\r\n \r\n mi = (left+right)//2\r\n #print(smi,a[mi],x)\r\n \r\n if a[mi]<=x:\r\n left = mi+1\r\n i+=1\r\n \r\n else:\r\n \r\n right = mi\r\n j+=1\r\n #print(left,right,\"----\")\r\n #print(i-1,j)\r\n if left>0 and a[left-1]==x:\r\n return i-1, j\r\n else:\r\n return -1, -1\r\ndef nCr(n, r):\r\n \r\n return (fact(n) // (fact(r)\r\n * fact(n - r)))\r\n \r\n# Returns factorial of n\r\ndef fact(n):\r\n \r\n res = 1\r\n \r\n for i in range(2, n+1):\r\n res = res * i\r\n \r\n return res\r\ndef primefactors(n):\r\n num=0\r\n \r\n while n % 2 == 0:\r\n num+=1\r\n n = n / 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n num+=1\r\n n = n // i\r\n \r\n \r\n if n > 2:\r\n num+=1\r\n return num\r\n'''\r\ndef iter_ds(src):\r\n store=[src]\r\n while len(store):\r\n tmp=store.pop()\r\n if not vis[tmp]:\r\n vis[tmp]=True\r\n for j in ar[tmp]:\r\n store.append(j)\r\n'''\r\ndef ask(a):\r\n print('? {}'.format(a),flush=True)\r\n n=lint()\r\n \r\n return n\r\n\r\n\r\n \r\ndef dfs(i,p):\r\n \r\n a,tmp=0,0\r\n for j in d[i]:\r\n if j!=p:\r\n a+=1\r\n tmp+=dfs(j,i)\r\n \r\n if a==0:\r\n return 0\r\n \r\n return tmp/a + 1 \r\n\r\n\r\n \r\n\r\nn,k=lint()\r\ns = [ord(i) for i in input().strip()]\r\ns.sort()\r\n\r\nans=s[0]-96\r\nl=s[0]\r\nk-=1\r\nfor i in range(1,n):\r\n if k==0:\r\n break\r\n if s[i]-l>=2:\r\n ans+=s[i]-96\r\n l=s[i]\r\n k-=1\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n \r\n\r\n\r\n", "n, k = map(int, input().split())\ns = sorted(input())\nthreshold = ord('`')\nweight = 0\nlength = 0\nlast = chr(ord('a') - 2)\npossible = False\nfor i in range(n):\n if ord(s[i]) >= ord(last) + 2:\n last = s[i]\n weight += ord(s[i]) - threshold\n length += 1\n if length == k:\n print(weight)\n possible = True\nif not possible:\n print(-1)", "n,k = map(int,input().split())\r\ns = input().rstrip()\r\nl = list(s)\r\nsum1 = 0\r\n\r\nd = {}\r\nfor i in range(26):\r\n\td[chr(97 + i)] = i + 1\r\n\r\nl.sort()\r\nsum1 += d[l[0]]\r\ncount = 1\r\ni,j = 1,0\r\n\r\nwhile (i < len(l)) and (j < i) and count < k:\r\n\tif d[l[i]] < d[l[j]] + 2:\r\n\t\ti += 1\r\n\t\tcontinue\r\n\telse:\r\n\t\tsum1 += d[l[i]]\r\n\t\tcount += 1\r\n\t\tj = i\r\n\t\ti += 1\r\n\r\nif count < k:\r\n\tprint(-1)\r\nelse:\r\n\tprint(sum1)", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\ndef inList():\r\n return(list(map(int,input().split())))\r\ndef inVar():\r\n return map(int,input().split()) \r\n\r\ndef main():\r\n n , k = inVar()\r\n s = list(input())\r\n s.pop()\r\n mp = {}\r\n for i in range(0 , 27):\r\n mp[i] = 0\r\n for char in s:\r\n mp[ord(char) - ord('a') + 1] = 1\r\n ans = 0\r\n cur = -2\r\n while k:\r\n flag = 0\r\n for i in range(27):\r\n if mp[i] == 1 and cur + 1 < i:\r\n mp[i] = 0\r\n cur = i\r\n ans += i\r\n flag = 1\r\n break\r\n if flag == 0:\r\n break\r\n k -= 1\r\n if k != 0:\r\n ans = -1\r\n print(ans)\r\nmain()", "def main():\n n, m = map(int, input().split())\n l = sorted(map(ord, input()), reverse=True)\n r = [l.pop() - 96]\n try:\n while len(r) < m:\n while r[-1] > l[-1] - 98:\n del l[-1]\n r.append(l.pop() - 96)\n print(sum(r))\n except IndexError:\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\na = sorted(map(ord, input()))\nr = a[:1]\nfor x in a[1:]:\n if x - r[-1] > 1:\n r.append(x) \nprint([sum(r[:k]) - 96 * k, -1][len(r) < k])\n", "n, k = map(int, input().split())\ns = list(input())\ns.sort()\nkeka = ord(s[0])\nj = 1\ncnt = ord(s[0]) - 96\nfor i in range(1, n):\n if j < k and ord(s[i]) - keka >= 2:\n j += 1\n keka = ord(s[i])\n cnt += ord(s[i]) - 96\nif j == k:\n print(cnt)\nelse:\n print(-1)", "def solve(s, k):\r\n s = [ord(x) - ord('a') + 1 for x in sorted(set(s))]\r\n n = len(s)\r\n\r\n if n < k:\r\n return -1\r\n\r\n min_so_far = float('inf')\r\n for comb in combinations(s, k, -1, []):\r\n min_so_far = min(min_so_far, comb)\r\n\r\n if min_so_far == float('inf'):\r\n return -1\r\n return min_so_far\r\n\r\n\r\ndef combinations(s, k, idx, current):\r\n if len(current) == k:\r\n total = sum(current)\r\n # yield total, current\r\n yield total\r\n else:\r\n for i in range(idx + 1, len(s)):\r\n if len(current) and s[i] - current[-1] < 2:\r\n continue\r\n\r\n current.append(s[i])\r\n yield from combinations(s, k, i, current)\r\n current.pop() # Backtrack\r\n\r\n\r\ndef main():\r\n n, k = [int(x) for x in input().strip().split()]\r\n s = input().strip()\r\n print(solve(s, k))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\nimport itertools\ngetInputList = lambda : list(input().split())\ngetInputIntList = lambda : list(map(int,input().split()))\n\nd = [\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\"\n ,\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"]\n\ndset = {}\nfor i in range(1,27):\n dset[d[i-1]] = i\n\n\nn, k = getInputIntList()\narr = list(input())\n\narr.sort()\nnewarr = []\nnewarr.append(dset[arr[0]])\nfor i in arr[1:]:\n if len(newarr) == k:\n break\n if newarr[len(newarr)-1] + 1 < dset[i]:\n newarr.append(dset[i])\n\nif len(newarr) < k:\n print(-1)\nelse:\n print(sum(newarr))\n", "alph = \"abcdefghijklmnopqrstuvwxyz\"\r\nn, k = map(int, input().split())\r\n\r\ns = list(input())\r\n\r\ns.sort()\r\n\r\nlast = ord(s[0])\r\nk -= 1\r\nc = (last - 96)\r\nfor i in range(1, n):\r\n if k == 0:\r\n break\r\n if ord(s[i])-last > 1:\r\n last = ord(s[i])\r\n k -= 1\r\n c += (last-96)\r\nif k == 0:\r\n print(c)\r\nelse:\r\n print(-1)\r\n", "n,k=map(int,input().split())\ns=list(input())\ns.sort()\nfreq=[0 for i in range(26)]\nfor i in range(n):\n freq[ord(s[i])-97]+=1\nc=0\nans= 0\npr=-2\nfor i in range(26):\n if(freq[i]!=0 and i-pr>=2):\n c+=1\n ans+=i\n pr = i\n if(c==k):\n break\nif(c==k):\n print(ans+k)\nelse:\n print(-1)\n \n \t \t\t\t\t\t \t \t\t \t\t\t\t\t\t\t \t", "from functools import reduce\r\nn, k = map(int, input().split())\r\ns = input()\r\nfilte = sorted(set(s))\r\nres = list('0')\r\nfor i in range(len(filte)):\r\n\tif(ord(res[-1]) != ord(filte[i]) -1):\r\n\t\tres += filte[i]\r\n\t\tk -=1\r\n\tif(k==0): \r\n\t\tbreak\r\nif(k==0):\r\n\tprint(reduce(lambda x, y: x + ord(y) -96, res[1:],0))\r\nelse:\r\n\tprint(-1)", "in1 = input()\r\nin2 = input()\r\nn, k = in1.strip('\\n').split(' ')\r\ns = in2.strip('\\n')\r\n\r\nk = int(k)\r\nx = []\r\nfor i in range(26):\r\n temp = chr(ord('a')+i)\r\n if s.find(temp) != -1:\r\n x.append((temp, 1))\r\n else:\r\n x.append((temp, 0))\r\n\r\n\r\npre = -2\r\ncount = 0\r\nend = 0\r\nfor i in range(1, k+1):\r\n for j in range(26):\r\n ch, tg = x[j]\r\n if tg == 0 and j != 25:\r\n continue\r\n elif tg == 1:\r\n if j - pre < 2 and j != 25:\r\n continue\r\n elif j - pre >= 2:\r\n x[j] = (ch, 0)\r\n count += j + 1\r\n pre = j\r\n break\r\n end = 1\r\n if end == 1:\r\n count = -1\r\n break\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\ns = input()\r\ns = sorted(s)\r\n\r\nsum = ord(s[0]) - ord('a') + 1\r\nk -= 1\r\nprev = s[0]\r\nfor i in range(1, n):\r\n if k == 0:\r\n break\r\n if ord(s[i]) - ord(prev) >= 2:\r\n prev = s[i]\r\n sum += ord(s[i]) - ord('a') + 1\r\n k -= 1\r\n\r\nif k == 0:\r\n print(sum)\r\nelse:\r\n print(-1)\r\n", "n,k = map(int,input().split())\r\ns=input()\r\nl=[]\r\nfor i in s:\r\n l.append(ord(i)-96)\r\nl.sort()\r\nans=chosen=min(l)\r\nk-=1\r\n#print(l)\r\nfor i in l:\r\n if(i>=chosen+2):\r\n chosen=i\r\n ans+=i\r\n k-=1\r\n if(k==0):\r\n print(ans)\r\n exit(0)\r\nprint(\"-1\")", "n, m = map(int, input().split())\r\ns = input().strip()\r\n\r\ns = ''.join(sorted(s))\r\n\r\nch = ord('a')-2\r\nans = 0\r\nl = 0\r\nf = False\r\nfor i in range(n):\r\n if ord(s[i]) >= ch+2:\r\n ch = ord(s[i])\r\n ans += ord(s[i])-ord('a')+1\r\n l+=1\r\n if l>=m:\r\n f = True\r\n break\r\nif f:\r\n print(ans)\r\nelse :\r\n print(-1)", "(n, k) = input().split()\nn = int(n)\nk = int(k)\ns = [ord(c) - ord('a') + 1 for c in sorted(input())]\nif k == 0:\n print(0)\nelif s == []:\n print(-1)\nelse:\n (i, result, j, last) = (1, s[0], 1, 0)\n while j < k and i < len(s):\n if s[i] - s[last] > 1:\n last = i\n result += s[i]\n j += 1\n i += 1\n if j < k:\n print(-1)\n else:\n print(result)", "n,l = map(int,input().split())\r\ns = set(input())\r\nchars = sorted([ord(c)-96 for c in s])\r\n\r\ntotal = 0\r\nlast = -1\r\nfor c in chars:\r\n if c >= last+2:\r\n total+=c\r\n last=c\r\n l-=1\r\n if l==0:break\r\n\r\nif l==0:\r\n print (total)\r\nelse:\r\n print (-1)", "n,k=list(map(int,input().split()))\r\npo=list(input())\r\npo.sort()\r\nl=[]\r\ntom=list(range(1,27))\r\nsa=list(\"abcdefghijklmnopqrstuvwxyz\")\r\nl.append(tom[sa.index(po[0])])\r\nx=1\r\nfor item in po[x:]:\r\n if sa.index(po[po.index(item)])-sa.index(sa[tom.index(l[-1])])>1:\r\n l.append(tom[sa.index(po[po.index(item)])])\r\n else:\r\n pass\r\nif len(l)==k:\r\n print(sum(l))\r\nelif len(l)>k:\r\n print(sum(l[0:k]))\r\nelse:\r\n print(\"-1\")", "n,k = map(int, input().split())\ns = str(input())\ns = list(s)\ns.sort()\ns = [ord(c)-ord('a')+1 for c in s]\nans = []\nfor c in s:\n if not ans:\n ans.append(c)\n else:\n if c-ans[-1] >= 2:\n ans.append(c)\n if len(ans) == k:\n break\nif len(ans) == k:\n print(sum(ans))\nelse:\n print(-1)\n", "n,k = list(map(int, input().split()))\r\ns = list(input())\r\ns.sort()\r\nl = ord('a')-2\r\nlen,ans,flag = 0,0,0\r\n\r\nfor i in range(n):\r\n if ord(s[i])>=l+2:\r\n l = ord(s[i])\r\n ans += ord(s[i])-ord('a')+1\r\n len+=1\r\n \r\n if len>=k:\r\n print(ans)\r\n flag=1\r\n break\r\n \r\nif flag==0:\r\n print(-1)", "from sys import stdin, stdout\r\nfrom functools import reduce\r\n\r\ndef main():\r\n n = [int(x) for x in stdin.readline().strip().split(\" \")]\r\n s=list(set([x for x in stdin.readline().strip()]))\r\n s.sort()\r\n arr=[s[0]]\r\n cur=s[0]\r\n for x in s:\r\n if not ord(x) <= ord(cur)+1 and len(arr)<n[1]:\r\n cur=x\r\n arr.append(x)\r\n\r\n arr=list(map(lambda x: ord(x)-96, arr))\r\n return str(reduce(lambda a, b: a+b, arr)) if len(arr)==n[1] else '-1'\r\n\r\nstdout.write(main())\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\n\r\nif __name__ == '__main__':\r\n n, k = list(map(int, input().strip().split()))\r\n s = sorted(list(map(ord, input().strip())))\r\n a, p = list(), 0\r\n\r\n a.append(s[p])\r\n\r\n for i in range(1, n):\r\n if s[i] - s[p] >= 2:\r\n a.append(s[i])\r\n p = i\r\n s = list(map(lambda x: x - ord('a') + 1, a))\r\n p = -1 if len(s) < k else functools.reduce(lambda a, b: a + b, s[:k])\r\n print(\"{}\".format(p))" ]

[ "import os\r\nimport sys\r\nimport time\r\nfrom io import BytesIO, IOBase\r\n\r\n# region fastio\r\n\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\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregionS\r\n\r\n\r\ndef inv():\r\n pass\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n mod = 10**9 + 7\r\n\r\n pref = [1] * (k + 4)\r\n suff = [1] * (k + 4)\r\n f = [1] * (k+4)\r\n\r\n pref[1] = n-1\r\n f[1] = 1\r\n\r\n for i in range(2, k+4):\r\n pref[i] = pref[i-1] * (n-i) % mod\r\n f[i] = f[i-1] + pow(i, k, mod)\r\n\r\n suff[k+2] = n-k-2\r\n for i in range(k+1, -1, -1):\r\n suff[i] = suff[i+1] * (n-i) % mod\r\n\r\n fact = [0] * (k+4)\r\n inv = [0] * (k+4)\r\n invfact = [0] * (k+4)\r\n\r\n inv[1] = invfact[1] = invfact[0] = fact[1] = fact[0] = 1\r\n for i in range(2, k+4):\r\n fact[i] = fact[i-1] * i % mod\r\n inv[i] = mod - (mod // i) * inv[mod % i] % mod\r\n invfact[i] = invfact[i-1] * inv[i] % mod\r\n\r\n ret = 0\r\n for i in range(1, k+3):\r\n numerator = pref[i-1] * suff[i+1] % mod\r\n denominator = invfact[k+2-i] * invfact[i-1]\r\n if (k+2-i) % 2 == 1:\r\n denominator = -denominator\r\n frac = numerator * denominator % mod\r\n ret = (ret + frac * f[i] % mod) % mod\r\n\r\n print(ret)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n start_time = time.time()\r\n main()\r\n print(f'Execution time: {time.time() - start_time} s', file=sys.stderr)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef pow(x, y, mod):\r\n if x == -1:\r\n return 1 - y % 2 * 2\r\n ans, u = 1, x\r\n while y:\r\n if y & 1:\r\n ans = ans * u % mod\r\n y >>= 1\r\n u = u * u % mod\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\nk += 1\r\nf = [0]\r\nfor i in range(1, k + 1):\r\n f.append((f[-1] + pow(i, k - 1, mod)) % mod)\r\nif n <= k:\r\n ans = f[n]\r\nelse:\r\n v = 1\r\n for i in range(k + 1):\r\n v = v * (n - i) % mod\r\n fact = [1]\r\n for i in range(1, k + 1):\r\n fact.append(i * fact[-1] % mod)\r\n ans = 0\r\n for i in range(1, k + 2):\r\n u = fact[i - 1] * fact[k - i + 1] % mod * pow(-1, k - i + 1, mod) % mod\r\n ans += f[i - 1] * v % mod * pow(n - i + 1, mod - 2, mod) % mod * pow(u, mod - 2, mod) % mod\r\n ans %= mod\r\nprint(ans)", "def lagrangeInterpolation(f, x, mod=1 << 61):\n d = len(f)-1\n fact = [1] * (d+1)\n finv = [1] * (d+1)\n for i in range(1, d+1):\n fact[i] = fact[i-1] * i % mod\n finv[d] = pow(fact[d], mod-2, mod)\n for i in range(d-1, 0, -1):\n finv[i] = finv[i+1] * (i+1) % mod\n x %= mod\n L = [1] * (d+2)\n for i in range(d+1):\n L[i+1] = L[i] * (x-d+i) % mod\n res = 0\n c = 1\n for i in range(d+1):\n tmp = c * L[d-i] % mod * finv[i] % mod * finv[d-i] % mod * f[i] % mod\n if (d+i) & 1:\n res -= tmp\n else:\n res += tmp\n c = c * (x-i) % mod\n return res % mod\n\n\nmod = 10 ** 9 + 7\nn, k = map(int, input().split())\n\nf = [0] * (k+2)\nfor i in range(1, k+2):\n f[i] = (f[i-1] + pow(i, k, mod)) % mod\n\nprint(lagrangeInterpolation(f, n, mod))\n", "n, k = [int(i) for i in input().split()]\r\nN = 10 ** 9 + 7\r\n\r\ny = [0]\r\nfor i in range(1, k + 2):\r\n y.append((y[-1] + pow(i, k, N)) % N)\r\n\r\nif n < k + 2:\r\n print(y[n] % N)\r\nelse:\r\n F = [1] * (k + 2)\r\n for i in range(1, k+2):\r\n F[i] = (F[i - 1] * i) % N\r\n\r\n I = [1] * (k+1) + [pow(F[k+1], N - 2, N)]\r\n for i in range(k, 0, -1):\r\n I[i] = I[i + 1] * (i + 1) % N\r\n\r\n invneg_fac = [I[i] * (1 - 2 * (i & 1)) for i in range(k+2)]\r\n\r\n xfac_down = [1]\r\n for j in reversed(range(n - k - 1, n + 1)):\r\n xfac_down.append((xfac_down[-1] * j) % N)\r\n\r\n xfac_up = [1]\r\n for j in range(n - k - 1, n + 1):\r\n xfac_up.append((xfac_up[-1] * j) % N)\r\n\r\n s = 0\r\n for i, pr in enumerate(y):\r\n pr = (pr * xfac_down[i]) % N\r\n pr = (pr * xfac_up[k + 1 - i]) % N\r\n pr = (pr * I[i]) % N\r\n pr = (pr * invneg_fac[k - i + 1]) % N\r\n s = (s + pr) % N\r\n\r\n print(s)", "import os, sys\r\nfrom io import BytesIO, IOBase\r\nfrom array import array\r\nfrom itertools import accumulate\r\nimport bisect\r\nimport math\r\nfrom collections import deque\r\nfrom functools import cache\r\nfrom copy import deepcopy\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, 8192))\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, 8192))\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\ninput = lambda: sys.stdin.readline().strip()\r\nints = lambda: list(map(int, input().split()))\r\nInt = lambda: int(input())\r\n\r\n\r\ndef queryInteractive(a, b, c):\r\n print('? {} {} {}'.format(a, b, c))\r\n sys.stdout.flush()\r\n return int(input())\r\n\r\n\r\ndef answerInteractive(x1, x2):\r\n print('! {} {}'.format(x1, x2))\r\n sys.stdout.flush()\r\n\r\n\r\ninf = float('inf')\r\nn,k = ints()\r\nMOD = int(1e9+7)\r\n\r\ndef exp(x, i):\r\n ans = 1\r\n tmp = x\r\n while i:\r\n if i & 1:\r\n ans = (ans * tmp) % MOD\r\n i >>= 1\r\n tmp = (tmp * tmp) % MOD\r\n return ans\r\n\r\n\r\ny = [0]\r\nfor i in range(1,k+2):\r\n y.append(y[-1] + exp(i,k))\r\n\r\ndef lagrange_interpolation(n,y,T,mod):\r\n #f(i)=y_i (i=0,1,...,n) 求 f(T)，复杂度 O(n)\r\n \r\n finv=[0]*(n+1)\r\n fac=1\r\n for i in range(1,n+1):\r\n fac=fac*i%mod\r\n finv[n]=pow(fac,mod-2,mod)\r\n for i in range(n-1,-1,-1):\r\n finv[i]=finv[i+1]*(i+1)%mod\r\n \r\n T%=mod\r\n \r\n L=[1]*(n+1)\r\n for i in range(n):\r\n L[i+1]=L[i]*(T-i)%mod\r\n \r\n R=[1]*(n+1)\r\n for i in range(n,0,-1):\r\n R[i-1]=R[i]*(T-i)%mod\r\n \r\n res=0\r\n for i in range(n+1):\r\n tmp=y[i]*L[i]%mod*R[i]%mod*finv[i]%mod*finv[n-i]%mod\r\n if (n-i)%2==0:\r\n res+=tmp\r\n else:\r\n res-=tmp\r\n \r\n return res%mod\r\n\r\n\r\nans = lagrange_interpolation(k+1,y,n,MOD)\r\nprint(ans)" ]

[ "# LUOGU_RID: 116314114\nn, s = int(input()), 0\r\nmix = miy = float('inf')\r\nmaxx = maxy = -1\r\nfor i in range(n):\r\n a, b, c, d = *map(int, input().split()),\r\n s += (c-a)*(d-b)\r\n mix, miy = min(mix, a), min(miy, b)\r\n maxx, maxy = max(maxx, c), max(maxy, d)\r\nif maxx-mix == maxy-miy:\r\n if (maxx-mix)*(maxy-miy) == s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "# LUOGU_RID: 116313732\nn, s = int(input()), 0\r\nmix = miy = float('inf')\r\nmaxx = maxy = -1\r\nfor i in range(n):\r\n a, b, c, d = *map(int, input().split()),\r\n s+=(c-a)*(d-b)\r\n mix=min(mix,a)\r\n miy=min(miy,b)\r\n maxx=max(maxx,c)\r\n maxy=max(maxy,d)\r\nif maxx-mix==maxy-miy:\r\n if (maxx-mix)*(maxy-miy)==s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ns = 0\nINF = 10**9\nminx = miny = INF\nmaxx = maxy = -INF\n\nfor i in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n s += abs(x1 - x2) * abs(y1 - y2)\n minx = min(minx, x1, x2)\n maxx = max(maxx, x1, x2)\n miny = min(miny, y1, y2)\n maxy = max(maxy, y1, y2)\n\nif (maxx - minx) == (maxy - miny) and s == (maxx - minx) ** 2:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "n = eval(input())\n\narea = 0\np1 = []\np2 = []\nps = []\nxl, xu, yl, yu = 1 << 28, 0, 1 << 28, 0\nfor i in range(n):\n in_ = input().split()\n p1.append(tuple(map(int, in_[0:2])))\n p2.append(tuple(map(int, in_[2:4])))\n ps.append(tuple(map(int, in_[0:2])))\n ps.append(tuple(map(int, in_[2:4])))\n xl = min(xl, p1[-1][0], p2[-1][0])\n xu = max(xu, p1[-1][0], p2[-1][0])\n yl = min(yl, p1[-1][1], p2[-1][1])\n yu = max(yu, p1[-1][1], p2[-1][1])\n\nok = True\nfor p in ps:\n for dx in (-0.5, 0, 0.5):\n for dy in (-0.5, 0, 0.5):\n q = (p[0] + dx, p[1] + dy)\n if not (xl < q[0] < xu and yl < q[1] < yu):\n continue\n c = False\n for i in range(n):\n if p1[i][0] <= q[0] <= p2[i][0] and p1[i][1] <= q[1] <= p2[i][1]:\n c = True\n if not c:\n ok = False\n\nprint('YES' if ok and (xu - xl) == (yu - yl) else 'NO')\n", "n = int(input())\r\nsq = [None] * 51\r\nsqsum = 0\r\nfor i in range(n):\r\n sq[i]= list(map(int,input().split()))\r\n sqsum+=(sq[i][3]-sq[i][1])*(sq[i][2]-sq[i][0])\r\nmaxx = max(map(lambda x:x[2],sq[:n]))\r\nminx = min(map(lambda x:x[0],sq[:n]))\r\nmaxy = max(map(lambda x:x[3],sq[:n]))\r\nminy = min(map(lambda x:x[1],sq[:n]))\r\narea = (maxy-miny)*(maxx-minx)\r\n\r\nif maxx-minx!=maxy-miny or area!=sqsum:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\narea = 0\r\nminx = miny = 999999\r\nmaxx = maxy = 0\r\nfor _ in range(n):\r\n x1, y1, x2, y2 = list(map(int, input().split()))\r\n minx = min(minx, min(x1, x2))\r\n miny = min(miny, min(y1, y2))\r\n maxx = max(maxx, max(x1, x2))\r\n maxy = max(maxy, max(y1, y2))\r\n a = abs(x1 - x2) * abs(y1 - y2)\r\n area += a\r\n\r\nh = maxy - miny\r\nw = maxx - minx\r\n\r\nif h != w or h*h != area:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\narea = 0\r\nmaxx, maxy, minx, miny = 0, 0, 10**5, 10**5\r\nfor i in range(0, n):\r\n a,b,c,d = map(int, input().split())\r\n \r\n area += (c - a) * (d - b)\r\n maxx = max(maxx, c)\r\n minx = min(minx, a)\r\n maxy = max(maxy, d)\r\n miny = min(miny, b)\r\n\r\nn = maxx - minx\r\nif n == maxy - miny and n * n == area: print('YES')\r\nelse: print('NO')\r\n", "x0=[]; x1=[]; y0=[]; y1=[]\r\nn=int(input())\r\ns=0 # Variable to add rects. areas together\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n x0.extend([l[0]])\r\n x1.extend([l[2]])\r\n y0.extend([l[1]])\r\n y1.extend([l[3]])\r\n s+=(l[3]-l[1])*(l[2]-l[0])\r\n\r\nlx=max(x1)-min(x0)\r\nly=max(y1)-min(y0)\r\nif lx==ly and lx*ly==s:\r\n print('YES')\r\nelse:\r\n print('NO')", "pl = 0\r\netpl = 0\r\nmax_x = 0\r\nmin_x = 40000\r\nmax_y = 0\r\nmin_y = 40000\r\nn = int(input())\r\nfor i in range(0,n,1):\r\n crd = input().split()\r\n if(int(crd[0]) >= int(crd[2])):\r\n st1 = int(crd[0]) - int(crd[2])\r\n else:\r\n st1 = int(crd[2]) - int(crd[0])\r\n if(int(crd[1]) >= int(crd[3])):\r\n st2 = int(crd[1]) - int(crd[3])\r\n else:\r\n st2 = int(crd[3]) - int(crd[1])\r\n if(int(crd[0]) < min_x):\r\n min_x = int(crd[0])\r\n if(int(crd[1]) < min_y):\r\n min_y = int(crd[1])\r\n if(int(crd[2]) > max_x):\r\n max_x = int(crd[2])\r\n if(int(crd[3]) > max_y):\r\n max_y = int(crd[3])\r\n pl += st1*st2\r\n etpl = (max_y-min_y)*(max_x-min_x)\r\nif max_y-min_y == max_x-min_x and etpl == pl:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "xmin, ymin, xmax, ymax, a = 31400, 31400, 0, 0, 0\r\nfor i in range(int(input())):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n xmin = min(xmin, x1)\r\n ymin = min(ymin, y1)\r\n xmax = max(xmax, x2)\r\n ymax = max(ymax, y2)\r\n a += (x2 - x1) * (y2 - y1)\r\nprint('YES' if xmax - xmin == ymax - ymin and a == (xmax - xmin) ** 2 else 'NO')" ]

[ "n, P = map(int, input().split())\r\na = list(map(lambda x: int(x) % P, input().split()))\r\npre = a[0]\r\nsuf = sum(a[1:]) % P\r\nnum = pre + suf\r\nfor i in range(1, n - 1):\r\n pre += a[i]\r\n pre %= P\r\n suf -= a[i]\r\n if suf < 0:\r\n suf += P\r\n\r\n num = max(num, pre + suf)\r\n\r\nprint(num)", "n , p = map(int , input().split())\r\ndata = list(map(int , input().split()))\r\ntotal = sum(data)\r\ncur = data[0]\r\nm = (cur % p) + (total - cur)%p\r\nfor i in range(1,n-1):\r\n cur += data[i]\r\n m = max(m , (cur % p) + (total - cur)%p)\r\nprint(m)", "n,k=map(int,input().split())\r\nlist1=list(map(int,input().rstrip().split()))\r\n\r\nprexum=[]\r\nsuxum=[]\r\nsum1=0\r\nfor i in range(len(list1)):\r\n sum1+=list1[i]\r\n prexum.append(sum1)\r\nfor i in range(len(list1)):\r\n suxum.append(sum1)\r\n sum1-=list1[i]\r\n\r\nmax1=0\r\nfor i in range(len(list1)-1):\r\n t=prexum[i]%k+suxum[i+1]%k\r\n if(t>max1):\r\n max1=t\r\nprint(max1)\r\n ", "a,b=map(int,input().split());z=[];p=0\r\nfor i in map(int,input().split()):p=(p+i)%b;z+=[p]\r\np+=b\r\nprint(max(z[i]+(p-z[i])%b for i in range(a-1)))", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nminimum = 0\r\nsuma=0\r\nsumb=sum(l)\r\nfor j in range(0,n):\r\n suma+=l[j]\r\n sumb-=l[j]\r\n value = suma%k+sumb%k\r\n if(value>minimum):\r\n minimum = value\r\nprint(minimum)\r\n ", "n, p = map(int, input().split())\na = list(map(int, input().split()))\na = [c % p for c in a]\ns = sum(a)\nsp = s % p\nif sp == s or sp + 1 == p:\n print(sp)\nelse:\n print(sp + p)\n \t \t \t\t\t \t \t \t \t\t", "n,p = map(int,input().split())\r\na = list(map(int,input().split()))\r\nforward = [a[0]]\r\nfor i in range(1,n):\r\n forward.append(forward[-1] + a[i])\r\nsm = sum(a)\r\nmx = -float('inf')\r\nfor i in range(n-1):\r\n mx = max(mx,(forward[i]%p) + ((sm -forward[i] )%p))\r\nprint(mx)", "n,p = map(int,input().split())\r\nlistA = list(map(int,input().split()))\r\nsumA = sum(listA)\r\nans = []\r\nv = 0\r\nfor i in range(n-1):\r\n v+=listA[i]\r\n sumA-=listA[i]\r\n ans.append((v%p)+sumA%p)\r\nprint(max(ans))", "n,p=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\npref=[l[0]%p]\r\nsuff=[l[n-1]%p]\r\nfor i in range(1,n-1):\r\n pref.append((pref[i-1]+(l[i]%p))%p)\r\nfor i in range(1,n-1):\r\n suff.append((suff[i-1]+(l[n-i-1]%p))%p)\r\nm=0\r\nsuff=suff[::-1]\r\nfor i in range(n-1):\r\n m=max(pref[i]+suff[i],m)\r\nprint(m)", "n,p=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nma=0\r\nt=0\r\nfor i in range(n-1):\r\n t+=a[i]\r\n x=(t%p)+(s-t)%p\r\n ma=max(ma,x)\r\nprint(ma)", "n,p = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nx = a[0] % p\ny = sum(a[1:]) % p\ns = x+y\nfor i in range(1, n-1):\n\tx = (x+a[i]) % p\n\ty = (y-a[i]) % p\n\ts = max(s, x+y)\nprint(s)\n", "n, p = [int(a) for a in input().strip().split(' ')]\r\ne = [int(a) for a in input().strip().split(' ')]\r\nmax_sum = 0\r\ns = sum(e)\r\ncurrent_s = 0\r\nfor i in e:\r\n current_s += (i % p)\r\n current_s %= p\r\n max_sum = max(max_sum,current_s + (s - current_s) % p)\r\nprint(max_sum)", "n,p=map(int,input().split())\r\nar=[int(x) for x in input().split()]\r\nres=0\r\nfor i in(ar):\r\n res+=i\r\nfirst=0\r\nmx=0\r\nfor i in(ar):\r\n first+=i\r\n res-=i\r\n mx=max(mx,(first%p)+(res%p))\r\nprint(mx)\r\n", "from functools import reduce\r\nfrom itertools import accumulate\r\n\r\nn, p = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprefix_sum = list(accumulate(l, lambda x, y: (x + y) % p))\r\nprefix_sum[0] = prefix_sum[0] % p\r\nsuffix_sum = list(accumulate(l[::-1], lambda x, y: (x + y) % p))[::-1]\r\nsuffix_sum[-1] = suffix_sum[-1] % p\r\n\r\n#print(prefix_sum)\r\n#print(suffix_sum)\r\n\r\n#print(sum(l[1::]) % p)\r\n\r\nans = 0\r\nfor i in range(n):\r\n actual_suffix_sum = (suffix_sum[i + 1] if i + 1 < n else 0)\r\n actual_sum = (prefix_sum[i] + actual_suffix_sum)\r\n #print('{} + {} = {}'.format(prefix_sum[i], actual_suffix_sum, actual_sum))\r\n ans = max(ans, actual_sum)\r\n\r\nprint(ans)", "\r\n\r\nn,p=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nsum1=0\r\npre=[]\r\nfor i in range(n):\r\n sum1+=a[i]\r\n sum1=sum1%p\r\n pre.append(sum1)\r\npost=[0 for i in range(n)] #ii is not included\r\nsum1=0\r\nfor i in range(n-1,-1,-1):\r\n post[i]=sum1\r\n sum1+=a[i]\r\n sum1=sum1%p\r\ns=0\r\nfor i in range(n):\r\n s=max(pre[i]+post[i],s)\r\nprint(s)\r\n", "n, p = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ns1, s2 = a[0], sum(a) - a[0]\r\nans = s1 % p + s2 % p\r\nfor i in range(n - 1):\r\n s1 = (s1 + a[i]) % p\r\n s2 = (s2 - a[i]) % p\r\n ans = max(ans, s1 + s2)\r\nprint(ans)\r\n", "n,p=map(int,input().split())\r\nl=[x%p for x in map(int,input().split())]\r\nt=0;s=sum(l)\r\nm=t%p+s%p\r\nfor x in range(n):\r\n t+=l[x];s-=l[x]\r\n m=max(m,t%p+s%p)\r\nprint(m)", "import math\r\ndef func(n,k,a):\r\n s=sum(a)\r\n ms=0\r\n x=0\r\n for i in range(n):\r\n cs=(x%k)+(s%k)\r\n x+=a[i]\r\n s-=a[i]\r\n ms=max(ms,cs)\r\n return ms\r\n\r\nfor _ in range(1):\r\n n,k=list(map(int,input().split()))\r\n a=list(map(int,input().split()))\r\n print(func(n,k,a))", "N, p = map(int, input().split(' '))\r\nA = [(int(el) % p) for el in input().split(' ')]\r\nS1, S2 = A[0], sum(A[1:])%p\r\nmx = S1+S2\r\nfor i in range(1, N):\r\n S1 = (S1+A[i])%p\r\n S2 = (S2-A[i])%p\r\n if S1+S2 > mx: mx = S1+S2\r\nprint(mx)", "n,p = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = [a[0]]\r\nfor i in range(1,len(a)):\r\n c.append(c[-1]+a[i])\r\n\r\nsums = []\r\nfor i in range(len(c)-1):\r\n sums.append(c[i]%p+(c[-1]-c[i])%p)\r\nprint(max(sums))\r\n", "n, p = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\n\r\ndel1 = 0\r\ndel2 = 0\r\nrecord = 0\r\nseqSum = sum(seq)\r\nlst = []\r\n\r\nlst = []\r\nfor i in range(n):\r\n\tdel1 += seq[i]\r\n\tdel2 = seqSum - del1\r\n\tlst.append((del1%p)+(del2%p))\r\n\r\n\r\nprint(max(lst))", "from itertools import accumulate\r\n\r\nN, p = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nleft = [0] + list(accumulate(A))\r\nright = list(accumulate(A[::-1]))[::-1] + [0]\r\n\r\nans = [(left[i] % p) + (right[i] % p) for i in range(N + 1)]\r\n\r\nprint(max(ans))\r\n", "n, p = map(int, input().split())\na = list(map(int, input().split()))\nt = 0\nk = 0\nfor i in range(n):\n k += a[i]\ns = 0\nfor i in range(0, n-1):\n s += a[i]\n t = max(t, s%p + (k - s)%p)\nprint(t)\n", "n, p = map(int, input().split())\npre = [0] * 100100\nA = list(map(int, input().split()))\nfor i in range(n):\n pre[i + 1] = (pre[i] + A[i]) % p\nprint(max((pre[i] - pre[0]) % p + (pre[n] - pre[i]) % p for i in range(1, n)))\n \n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns1=arr[0]\r\ns2=sum(arr)-arr[0]\r\nans=[s1%m+s2%m]\r\nfor i in range(1,n-1):\r\n s1+=arr[i]\r\n s2-=arr[i]\r\n ans.append(s1%m+s2%m)\r\nprint(max(ans))", "N, p = map(int, input().split())\nA = list(map(int, input().split()))\nsa = sum(A)\ncursum = 0\nans = 0\nfor i, a in enumerate(A[:-1]):\n cursum += a\n score = (cursum % p) + ((sa - cursum) % p)\n ans = max(ans, score)\n\nprint(ans)\n", "n, p = [int(i) for i in input().split()]\r\nsoma = [0 for i in range(n + 1)]\r\nfor idx, i in enumerate(input().split()):\r\n soma[idx + 1] = soma[idx] + int(i)%p\r\n \r\nr = -float(\"inf\")\r\nfor i in range(1, n):\r\n r = max(r, soma[i]%p + (soma[n] - soma[i])%p)\r\n\r\nprint(r)", "def main():\n n,p = map(int,input().split())\n a = [int(x) for x in input().split()]\n prefix = [a[0]]\n for i in range(1,n):\n prefix.append((prefix[-1] + a[i]))\n max_sum = -1\n for i in range(n-1):\n temp = ((prefix[i])%p + (prefix[n-1]-prefix[i])%p)\n if max_sum == -1:\n max_sum = temp\n elif max_sum < temp:\n max_sum = temp\n print(max_sum)\n\nif __name__ == '__main__':\n main()\n", "n, p = map(int, input().split())\n\na = list(map(int, input().split()))\n\nresp = -1\naux = 0\ntot = sum(a)\n\nfor x in a:\n\taux += x\n\tresp = max(resp, aux%p + (tot - aux) % p)\n\nprint(resp)\n\n# 1534609590348\n", "n, mod = map(int, input().split())\r\nli = [int(i) for i in input().split()]\r\n\r\nfor i in range(1, n):\r\n li[i] += li[i-1]\r\n\r\nma = 0\r\nfor i in range(n-1):\r\n ma = max(ma, li[i]%mod + (li[n-1] - li[i])%mod)\r\nprint(ma)\r\n", "n, p = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nhighScore = 0\r\nind = 0\r\nlSum = A[0]\r\nrSum = sum(A[1::])\r\nfor i in range(len(A)-1):\r\n score = (lSum % p) + (rSum % p)\r\n if score > highScore:\r\n highScore = score\r\n ind += 1\r\n lSum += A[ind]\r\n rSum -= A[ind]\r\n\r\nprint(highScore)\r\n", "n,p = map(int,input().split())\r\na = 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\ntot = pref[-1]\r\nans = 0\r\nfor i in range(n-1):\r\n ans = max(ans,(pref[i]%p)+((pref[-1]-pref[i])%p))\r\nprint(ans)", "n,p=map(int,input().split())\r\na=input().split()\r\nb=[]\r\nsum1=0\r\nfor i in range(n):\r\n sum1+=int(a[i])\r\n b.append(sum1)\r\nc=[]\r\nfor i in range(n):\r\n c.append(b[i]%p+(sum1-b[i])%p)\r\nprint(max(c)) ", "n, x = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\n\r\nprefix_sums = []\r\nfor ind, a_i in enumerate(a):\r\n if ind != 0:\r\n prefix_sums.append(prefix_sums[ind - 1] + a_i)\r\n else:\r\n prefix_sums.append(a_i)\r\n\r\nmax_sum = 0\r\nfor prefix_sum in prefix_sums:\r\n max_sum = max(max_sum, prefix_sum % x + (prefix_sums[-1] - prefix_sum) % x)\r\n\r\nprint(max_sum)\r\n", "N,P = map(int,input().split())\nsrc = list(map(int,input().split()))\nK = sum(src)%P\nans = tmp = 0\nfor a in src:\n tmp += a\n tmp %= P\n ans = max(ans, tmp + (K-tmp)%P)\nprint(ans)\n", "n, p = map(int, input().split())\na = [int(x) for x in input().split()]\ns = sum(a)\nans = -1; psum = 0\nfor i in a:\n psum += i\n ans = max(ans, psum % p + (s - psum) % p)\nprint(ans)\n\t\t\t\t\t \t\t\t\t \t \t \t \t \t\t \t", "n, p = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = [c % p for c in a]\r\ns = sum(a)\r\nsp = s % p\r\nif sp == s or sp + 1 == p:\r\n print(sp)\r\nelse:\r\n print(sp + p)", "n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=sum(lst)\r\ns2=0\r\nm=0\r\nfor i in range(n-1):\r\n s2+=lst[i]\r\n s-=lst[i]\r\n if (s2%k)+(s%k)>m:\r\n m=(s2%k)+(s%k)\r\nprint(m)\r\n \r\n \r\n \r\n", "N,p = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nsum1 = 0\r\nsum2 = sum(a)\r\nans = 0\r\nfor i in range(N-1):\r\n sum1 += a[i]\r\n sum2 -= a[i]\r\n ans = max(ans,sum1%p+sum2%p)\r\nprint(ans)", "n, p = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\n\r\nsum1 = int(0)\r\nsum2 = int(0)\r\n\r\nfor i in range(0, n):\r\n sum2 = sum2 + a[i]\r\nk = n-1\r\nb = [0]\r\nfor i in range(0, k):\r\n sum1 = sum1 + a[i]\r\n sum2 = sum2 - a[i]\r\n b.append((sum1 % p) + (sum2 % p))\r\nprint(max(b))\r\n \r\n", "n,p=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nf,s=ll[0],sum(ll)-ll[0]\r\nr=f%p+s%p\r\nfor i in range(1,n-1):\r\n f+=ll[i]\r\n s-=ll[i]\r\n if f%p+s%p>r:\r\n r=f%p+s%p\r\nprint(r)", "n, m = [int(x) for x in input().split(' ')]\nnumbers = [int(x) for x in input().split(' ')]\n\nmax_res = 0\ntotal_sum = sum(numbers)\nsum_thus_far = 0\nfor i in range(n-1):\n\ttmp_a = sum_thus_far + numbers[i]\n\ttmp_b = total_sum - tmp_a\n\ttmp_sum = (tmp_a % m) + (tmp_b % m)\n\tif tmp_sum > max_res:\n\t\tmax_res = tmp_sum\n\nprint(max_res)", "n, m = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i + 1] = (a[i + 1] + a[i]) % m\r\nans = 0\r\nfor i in range(1, n):\r\n x = a[i] + ((a[n] - a[i]) % m + m) % m\r\n ans = max(ans, x)\r\nprint(ans)\r\n", "n,p=map(int,input().split())\r\ns1=0\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n s1+=a[i]\r\n b.append(s1)\r\nc=[]\r\nfor i in range(n):\r\n c.append((b[i]%p)+(s1-b[i])%p)\r\nprint(max(c))", "n,p = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\nt1= 0\r\nt2 = sum(a)\r\nres = sum(a)%p\r\nfor i in range(n):\r\n t1 += a[i]\r\n t2 -= a[i]\r\n t3 = t1%p + t2%p\r\n if res < t3:\r\n res = t3\r\nprint(res)", "n, p = map(int, input().split())\narr = list(map(int, input().split()))\nsum_ = sum(arr)\nres = 0\ntemp = 0\nfor i in arr:\n temp += i\n sum_ -= i\n res = max(res, temp % p + sum_ % p)\n\nprint(res)\n", "n, p = map(int, input().split())\r\nseq = list(map(int, input().split()))\r\n\r\np1 = 0\r\np2 = 0\r\nseqSum = sum(seq)\r\nSums = []\r\n\r\nfor i in range(n):\r\n\tp1 += seq[i]\r\n\tp2 = seqSum - p1\r\n\tSums.append((p1%p)+(p2%p))\r\n\r\nprint(max(Sums))", "n,p = list(map(int,input().split()))\r\n\r\narr= list(map(int,input().split()))\r\n\r\nright=sum(arr)\r\nleft=0\r\nmax_score=0\r\n\r\nfor i in range(n-1):\r\n left+=arr[i]\r\n right-=arr[i]\r\n score= left%p + right%p\r\n max_score= score if score>max_score else max_score\r\n \r\nprint(max_score)", "n, p=map(int, input().split())\r\narr=list(map(int, input().split()))\r\nsu=0\r\nfor i in range(n):\r\n\tsu+=arr[i]\r\nmaxi, f=0, 0\r\nfor i in range(n-1):\r\n\tf+=arr[i]\r\n\tmaxi=max(maxi, f%p+(su-f)%p)\r\nprint(maxi)", "N,p =map(int,input().split())\r\nA = list(map(int,input().split()))\r\nR = 0\r\nB=[]\r\nSx = 0\r\nSy=sum(A)\r\nfor i in range(0,N-1):\r\n Sx+=A[i]\r\n Sy-=A[i]\r\n Sx=Sx%p\r\n Sy=Sy%p\r\n if R<Sx+Sy:\r\n R=Sx+Sy\r\nprint(R)\r\n", "s = input().split()\r\nn, p = int(s[0]), int(s[1])\r\ncl = list(map(int, input().split()))\r\nmx = 0\r\nsm = sum(cl)\r\nqs = cl[0]\r\nfor i in range(1, n):\r\n y = qs%p + (sm-qs)%p\r\n if y>mx:\r\n mx = y\r\n qs+=cl[i]\r\n\r\nprint(mx)", "n, p = map(int, input().split())\r\nlist1 = list(map(int, input().split()))\r\nmx = 0\r\ncurr = 0\r\nnxt = sum(list1)\r\nfor i in range(n - 1):\r\n curr += list1[i]\r\n nxt -= list1[i]\r\n mx = max(mx, curr % p + nxt % p)\r\nprint(mx)" ]

[ "import math\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\nr=a[0]%k;t=0\r\nfor i in range(1,n):\r\n if a[i]%k!=r:\r\n print(-1)\r\n break\r\n else:\r\n t+=(a[i]-a[0])//k\r\nelse:\r\n print(t)\r\n", "n, k=map(int, input().split())\na=list(map(int, input().split()))\nm=min(a)\nif any((p-m)%k!=0 for p in a):\n\tprint(-1)\nelse:\n\tprint(sum((p-m)//k for p in a))\n", "\r\nn,k=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\ncount=0\r\nfor item in l:\r\n x=item-m\r\n if x%k!=0:\r\n print(-1)\r\n exit()\r\n else:\r\n count+=x/k\r\n\r\nprint(int(count))\r\n\r\n \r\n", "\nx=input().split(\" \")\nN=int(x[0])\nK=int(x[1])\nmi=10**10\nres=0\ny=[int(a) for a in input().split(\" \")]\nfor i in range (len(y)):\n if y[i]<mi:\n mi=y[i]\n temp=y[0]\n y[0]=y[i]\n y[i]=temp\nfor elem in y:\n temp=(elem-mi)%K\n if temp==0:\n res+=(elem-mi)//K\n else:\n res=-1\n break\n\nprint(res)", "n, k = map(int, input().split())\n\nl = list(map(int, input().split()))\n\n\ncur = l[0]\ncnt = 0\nfor i in range(1, n):\n\tif cur % k != l[i] % k:\n\t\tprint(-1)\n\t\texit()\n\tif cur < l[i]:\n\t\tcnt += abs(l[i] - cur) // k\n\telse:\n\t\tcnt += (abs(l[i] - cur) // k) * i\n\t\tcur = l[i]\nprint(cnt)\n\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nvr=-1\r\nl1=min(l)//m\r\nfor x in l :\r\n if vr==-1 :\r\n vr=x%m\r\n else :\r\n if vr!=x%m :\r\n print(-1)\r\n exit()\r\nk=0\r\nfor x in l :\r\n k+=x//m-l1\r\nprint(k)\r\n\r\n\r\n \r\n", "n, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nb = [y % k for y in a]\r\nif max(b) == min(b):\r\n m = min(a)\r\n ans = sum([(z - m) // k for z in a])\r\nelse:\r\n ans = -1\r\nprint(ans)", "n, k = input().split()\r\ns = input().split()\r\ns = list(map(int, s))\r\ns.sort()\r\nans = 0\r\ncount = 0\r\n\r\nfor i in range(1, int(n)):\r\n ans += s[i]-s[0]\r\n if((s[i]-s[0])%int(k)!=0):\r\n count+=1\r\n\r\nif(count == 0):\r\n print(int(ans/int(k)))\r\nelse:\r\n print(-1)", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nt = min(l)\r\nm = 0\r\nn = 0\r\nt1 = 0\r\nfor i in range(a):\r\n\t# k = l[i] - t\r\n\t# m = k//b\r\n\t# t = t + m\r\n\tk = l[i] - t\r\n\tif k%b == 0:\r\n\t\tm = k//b\r\n\t\tt1 = t1 + m\r\n\t\tcontinue\r\n\telse:\r\n\t\tn = 1\r\n\t\tprint(-1)\r\n\t\tbreak\r\nif n == 0:\r\n\tprint(t1)\r\n\r\n", "n, k = map(int, input().split())\na = sorted(map(int, input().split()))\na = [i - a[0] for i in a]\nprint((sum(a)// k, -1)[any(i % k for i in a)])", "n, k = map(int, input().split())\r\na = sorted ( list(map(int, input().split())))\r\n\r\nans = 0\r\ncheck = True\r\nfor i in range(n):\r\n if (a[i]-a[0])%k != 0:\r\n check = False\r\n else:\r\n ans += int((a[i]-a[0])/k)\r\nif check:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n numbers = tuple(map(int, input().split()))\r\n minimum = min(numbers)\r\n result = 0\r\n \r\n for number in numbers:\r\n if not ((number - minimum) % k):\r\n result += (number - minimum) // k\r\n else:\r\n print(-1)\r\n \r\n return\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "#!/usr/bin/env python3\nimport sys\nfrom functools import reduce\n\ndef main():\n num_shares, decrement = map(int, sys.stdin.readline().split())\n initial_price = [None] * num_shares\n initial_price = list(map(int, sys.stdin.readline().split()))\n min_price = min(initial_price)\n calc = list(map(lambda price: divmod(price - min_price, decrement), initial_price))\n result = reduce(lambda acc, tup: (acc[0] + tup[0], (tup[1] == 0) and acc[1]), calc, (0, True))\n if not result[1]:\n sys.stdout.write(\"-1\")\n else:\n sys.stdout.write(str(result[0]))\n\nif __name__ == '__main__':\n main()\n", "# -*- coding: utf-8 -*-\r\nn,k = map(int,input().split(' '))\r\nl = list(map(int, input().split(' ')))\r\nl.sort()\r\nmin_ = l[0]\r\nc = 0\r\nb = True\r\nfor i in range(1,n):\r\n if (l[i]-min_)%k==0:\r\n c += (l[i]-min_)//k\r\n else:\r\n c = -1\r\n break\r\nprint(c)\r\n", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nhead = min(a)\r\ndef run():\r\n ans = 0\r\n for i in range(n):\r\n if (a[i]-head)%k > 0:\r\n print(-1)\r\n return\r\n else:\r\n ans += (a[i]-head)//k \r\n print(ans)\r\n\r\nrun()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nret = 0\r\ntarget = min(a)\r\nok = True\r\nfor x in a:\r\n\tdiff = x - target\r\n\tif diff % k != 0:\r\n\t\tok = False\r\n\t\tbreak\r\n\tret += (diff//k)\r\n\t\r\nif ok:\r\n\tprint(ret)\r\nelse:\r\n\tprint(-1)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmin_a = min(a)\r\ncount = 0\r\nfor i in range(n):\r\n if (a[i] - min_a) % k != 0:\r\n print(-1)\r\n exit()\r\n else:\r\n count += (a[i] - min_a) // k\r\nprint(count)", "\nInput=lambda:map(int,input().split())\n\nn, k = Input()\nl = list(Input())\nm = min(l)\nans = 0\nfor i in range(n):\n y = l[i] - m\n if y % k == 0:\n ans+=y//k\n else:\n print(-1)\n exit()\nprint(ans)\n\n\n \n \n\n\n\n", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb.sort()\r\nh = 1\r\nu = 0\r\nfor i in range(1, len(b)):\r\n y = b[i]-b[0]\r\n if y%a[1]!=0:\r\n h = 0\r\n break\r\n u += y//a[1]\r\nif h==0:\r\n print(\"-1\")\r\nelse:\r\n print(u)\r\n", "x,y = map(int,input().split())\r\nT = list(map(int,input().split()))\r\nn = min(T)\r\nT.remove(n)\r\na = n%y\r\ntest = True\r\nseconds = 0\r\ni = 0\r\nwhile test==True and i<x-1:\r\n if T[i]%y==a:\r\n seconds += ((T[i]-n)/y)\r\n else:\r\n test=False\r\n i += 1\r\nif test==True:\r\n print(int(seconds))\r\nelse:\r\n print('-1')", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nmods = [A[i]%k for i in range(n)]\r\nalright = True\r\nfor i in range(1, n):\r\n if mods[i] != mods[0]:\r\n alright = False\r\n break\r\nif not alright:\r\n print(-1)\r\nelse:\r\n s = 0\r\n minA = min(A)\r\n for i in range(n):\r\n s += (A[i] - minA) // k\r\n print(s)", "n, k = map(int, input().split())\r\na = list(map(int,input().split()))\r\nminn = 10**9 + 1\r\nfor i in a:\r\n minn = min(minn,i)\r\nrs = 0\r\nfor i in a:\r\n if (i - minn)%k !=0:\r\n print(-1)\r\n exit()\r\n rs+= int((i-minn)/k)\r\nprint(rs)", "n, k = map(int, input().split())\nprices = list(map(int, input().split()))\n\nost = prices[0] % k\n\nfor price in prices:\n if ost != price % k:\n print(-1)\n exit(0)\n\nprint((sum(prices) - n * min(prices)) // k)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nflag = False\r\nif n == 1:\r\n print(0)\r\nelse:\r\n ans = 0\r\n b = min(a)\r\n for i in range(n):\r\n if (a[i] - b) % k == 0:\r\n ans += (a[i] - b) // k\r\n else:\r\n flag = True\r\n break\r\n if flag:\r\n print(-1)\r\n else:\r\n print(ans)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=min(a)\r\nb=True\r\nans=0\r\nfor i in range(n):\r\n temp=a[i]-t\r\n x=temp//k\r\n y=temp/k\r\n if x!=y:\r\n b=False\r\n break\r\n else:\r\n ans+=x\r\nif b:\r\n print(ans)\r\nelse:\r\n print(\"-1\")\r\n \r\n", "n,k = map(int,input().split())\ns=list(map(int, input().split()))\n#s=list(input().split())\n#a=[]\ns.sort()\nans=0\nfor i in range(n-1):\n\tif (s[i+1]-s[0])%k!=0:\n\t\tans=-1\n\t\tbreak\n\telse:\n\t\tans+=(s[i+1]-s[0])//k\n#l=min(s)\n\nprint(ans)\n# your code goes here", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nf=0\r\nl.sort()\r\nfor i in range(1,n):\r\n z=l[i]-l[0]\r\n if(z%d==0):\r\n c=c+(z//d)\r\n else:\r\n f=1\r\n break\r\nif(f==1):\r\n print(-1)\r\nelse:\r\n print(c)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\n\r\nfor i in range(1, n):\r\n if (w[i] - w[0]) % k != 0:\r\n print(-1)\r\n break\r\nelse:\r\n print((sum(w)-w[0]*n) // k)", "n, k = map(int, input().split())\na = tuple(map(int, input().split()))\nm = min(a)\na = [(x - m) // k for x in a if (x - m) % k == 0]\nprint(-1 if len(a) != n else sum(a))\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\ncheck = True\r\nfor i in range(1, n):\r\n check = check and (a[i] % k == a[0] % k)\r\n \r\nif not check:\r\n print(-1)\r\nelse:\r\n m = min(a)\r\n ans = 0\r\n for i in range(n):\r\n ans += a[i] - m\r\n \r\n print(ans // k)", "import sys\r\nread=lambda:sys.stdin.readline().rstrip()\r\nreadi=lambda:int(sys.stdin.readline())\r\nwriteln=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\nwrite=lambda x:sys.stdout.write(x)\r\n\r\nN,K=map(int, read().split())\r\nps=list(map(int, read().split()))\r\nps.sort()\r\nmn = ps[0]\r\nanswer = 0\r\nfor i in range(1,N):\r\n q,r = divmod(ps[i] - mn, K)\r\n if r:\r\n answer = -1\r\n break\r\n else:\r\n answer += q\r\nwriteln(answer)", "num = list(map(int, input().split()))\r\npri = list(map(int, input().split()))\r\nless = min(pri)\r\nres = 0\r\nfor i in range(num[0]):\r\n a = (pri[i] - less) / num[1]\r\n if a == int(a):\r\n res += a\r\n else:\r\n res = -1\r\n break\r\nprint(int(res))\r\n", "n, k = [int(s) for s in input().split()]\r\nprice = [int(s) for s in input().split()]\r\nminimum = min(s for s in price)\r\nres = [s - minimum for s in price]\r\nr = sum([int(s%k) for s in res])\r\nif r == 0:\r\n print(int(sum(res) / k))\r\nelse:\r\n print(-1)", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\ndef ri():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn, k = ri()\n\na = list(ri())\n\na.sort(reverse=True)\n\nminv = a[-1]\ncount = 0\nfor v in a:\n diff = v - minv\n if diff%k:\n print(-1)\n exit()\n count += diff//k\n\nprint(count)", "def is_possible(a,k):\r\n\tb = a[0] % k\r\n\treturn all(i%k == b for i in a)\r\n\t\r\nx = input().split()\r\nn,k = int(x[0]),int(x[1])\r\na = input().split()\r\nb = []\r\nfor i in a:\r\n\tb.append(int(i))\r\nif is_possible(b, k) == False:\r\n\tprint(-1)\r\nelse:\r\n\tlowest = min(b)\r\n\tans = 0\r\n\tfor i in b:\r\n\t\tans += (i-lowest)//k\r\n\tprint(ans)", "from fractions import gcd\r\nfrom functools import reduce\r\n\r\nN, K = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nma = min(ar)\r\n\r\nok = True\r\ncnt = 0\r\nfor x in ar:\r\n if (x - ma) % K != 0:\r\n ok = False\r\n break\r\n else:\r\n cnt += (x-ma)//K\r\nprint(cnt if ok else -1)\r\n", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n r = A[i] - A[0]\r\n if r % k == 0:\r\n ans += r // k\r\n else:\r\n ans = -1\r\n break\r\nprint(ans)", "n, k = [int(el) for el in input().split()]\ncosts = [int(el) for el in input().split()]\n\nmin_const = min(costs)\nans = 0\nfor cost in costs:\n if (cost - min_const) % k == 0:\n ans += (cost - min_const) // k\n else:\n ans = -1\n break\n\nprint(ans)\n", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn,k=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\nm=min(a)\r\nneed=0\r\ngood=1\r\nfor i in range(len(a)):\r\n a[i]-=m\r\n if a[i]%k:\r\n good=0\r\n need+=a[i]//k\r\n\r\nif good: print(need)\r\nelse: print(-1)\r\n", "n,k=map(int,input().strip().split())\r\nl=list(map(int,input().split()))\r\nk1=min(l)\r\ncount=0\r\nfor x in l:\r\n\tp=x-k1\r\n\tif p%k!=0:\r\n\t\tprint('-1')\r\n\t\tbreak\r\n\tif p%k==0:count+=p//k\r\nelse:print(count)", "import sys\r\nn, k = (map(int, input().split()))\r\n\r\nls = list(map(int, input().split()))\r\ntotal = 0\r\nmin_pr = min(ls)\r\n\r\nfor x in range(len(ls)):\r\n\r\n ls[x] -= min_pr\r\n\r\n if ls[x]%k != 0:\r\n print (\"-1\")\r\n sys.exit()\r\n else:\r\n ls[x] /= k\r\n\r\nprint ('{:.0f}'.format(sum(ls)))", "def akcii_oleg(lst, k):\r\n m, c = 1 << 30, 0\r\n for i in range(len(lst)):\r\n m = min(m, lst[i])\r\n for i in range(len(lst)):\r\n if abs(m - lst[i]) % k != 0:\r\n return -1\r\n else:\r\n c += (lst[i] - m) // k\r\n return c\r\n\r\n\r\nN, K = [int(j) for j in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(akcii_oleg(a, K))\r\n", "n,k=map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\nm = min(a)\r\nans=0\r\nfor i in a:\r\n if (i-m)%k==0:\r\n ans+=(i-m)//k\r\n else:\r\n ans=-1\r\n break\r\nprint(ans)", "n, k = map(int, input().split())\nlst = list(map(int, input().split()))\ncost = 0\nr = lst[0]%k\nMIN = 1000000000\n\nfor i in range(len(lst)):\n MIN = min(MIN, lst[i])\n if r != lst[i]%k:\n r = -1\n break\nif r == -1:\n print(-1)\nelse:\n for i in range(len(lst)):\n cost += int((lst[i] - MIN)/k)\n print(cost)\n\n", "def convert(arr):\r\n arr = arr.split(\" \")\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n return arr\r\n\r\n\r\nnk = input()\r\ns = input()\r\ndecre = convert(nk)\r\nshares = convert(s)\r\nshares.sort()\r\ni = 1\r\nanswer = 0\r\nrunLoop = True\r\nwhile i in range(len(shares)) and runLoop:\r\n difference = shares[i] - shares[0]\r\n if (difference % decre[1]) != 0:\r\n answer = -1\r\n runLoop = False\r\n else:\r\n answer += int(difference / decre[1])\r\n i += 1\r\n\r\nprint(answer)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nminn = min(a)\na_new = list(map(lambda x: x - minn, a))\nif any(map(lambda x: x % k, a_new)):\n print(-1)\nelse:\n print(sum(a_new) // k)\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=-1\r\nfor i in range(n-1):\r\n if l[i]%k!=l[i+1]%k:\r\n a=1\r\nif a==1:\r\n print(-1)\r\nelse:\r\n print((sum(l)-min(l)*n)//k)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nflag = True\r\nfor i in range(1, n):\r\n flag = flag and (arr[0] % k == arr[i] % k)\r\nif not flag:\r\n print(-1)\r\nelse:\r\n min_ = min(arr)\r\n tot = 0\r\n for ele in arr:\r\n tot += ele - min_\r\n print(tot // k)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n\tprint(0)\r\nelse:\r\n\tmin = min(a)\r\n\timpossible = False\r\n\tfor i in range(n):\r\n\t\tif (a[i] - min) % k != 0:\r\n\t\t\timpossible = True\r\n\t\t\tbreak\r\n\t\t\t\r\n\tif impossible:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tj = 0\r\n\t\tfor i in range(n):\r\n\t\t\tj += (a[i] - min) // k\r\n\t\tprint(j)", "def main():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n target = min(a)\n mods = set([x % k for x in a])\n if len(mods) != 1:\n print(-1)\n return\n\n ans = sum((x - target) // k for x in a)\n print(ans)\n\nmain()\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nmemo = min(data)\r\n\r\nans = True\r\ncnt = 0\r\nfor i in range(n):\r\n if (data[i] - memo) % k != 0:\r\n ans = False\r\n else:\r\n cnt += (data[i] - memo) // k\r\n\r\nprint(cnt if ans else -1)", "#!/usr/bin/env python3\n\nimport sys\ndata = sys.stdin.readlines()\nn,k = map(int,data[0].split())\nvalues = list(map(int,data[1].split()))\ntarget = min(values)\nif not all((target-x)%k==0 for x in values):\n print(-1)\nelse:\n print(sum((x-target)//k for x in values))\n\n", "N, K= tuple(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\nm = min(nums)\r\nprint(-1 if [0 for x in nums] != [(x-m) % K for x in nums] else sum([(x-m) // K for x in nums]), end='')\r\n\"\"\"s = 0\r\ncorr = True\r\nfor a in nums:\r\n if (a - m) % K == 0:\r\n s += (a-m) // K\r\n else:\r\n corr = False\r\nprint(s if corr else -1, end='')\"\"\"", "import sys\r\nn,k=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())))\r\ncount=0\r\nfor x in range(1,n):\r\n if (a[x]-a[0])%k==0:\r\n count+=(a[x]-a[0])//k\r\n else:\r\n print(-1)\r\n sys.exit()\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\nprices = sorted(int(price) for price in input().split())\r\nif n == 1:\r\n answer = 0\r\nelse:\r\n i = 1\r\n answer = 0\r\n while i < n and (prices[i]-prices[0])%k == 0:\r\n answer += (prices[i]-prices[0])//k\r\n i += 1\r\n if i < n:\r\n i = 0\r\n answer = 0\r\n while i < n and prices[i]%k == 0:\r\n answer += prices[i]//k\r\n i += 1\r\n if i < n:\r\n answer = 0\r\n for i in range(n):\r\n div, mod = divmod(prices[i], k)\r\n prices[i] = mod - k\r\n answer += div + 1\r\n i = n - 2\r\n while i >= 0 and abs(prices[i]-prices[n-1])%k == 0:\r\n answer += abs(prices[i]-prices[n-1])//k\r\n i -= 1\r\n if i > -1:\r\n answer = -1\r\nprint(answer)\r\n", "(n,k) = (int(i) for i in input().split())\r\na = [int(i) for i in input().split()]\r\nmn = min(a)\r\ncnt = 0\r\nbr = 0\r\nfor i in a:\r\n\tcc = (i-mn)/k\r\n\tif cc%1!=0:\r\n\t\tbr = 1\r\n\t\tbreak\r\n\tcnt+=cc\r\nif br:\r\n\tprint(-1)\r\nelse:\r\n\tprint(int(cnt))", "I = lambda: map(int, input().split())\r\n\r\nn, k = I()\r\nA = list(I())\r\n\r\nif any((A[i+1]-A[i])%k for i in range(n-1)):\r\n print(-1)\r\nelse:\r\n x = min(A)\r\n print(sum(a-x for a in A) // k)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\natest = [(i-a[0])%k for i in a]\nif any(atest):\n print(-1)\nelse:\n amin = min(a)\n print(sum([(i-amin)//k for i in a]))\n", "def f(l,m,n):\r\n\tc=0\r\n\tk=min(l)\r\n\tfor i in l:\r\n\t\td=i-k\r\n\t\tif d%m!=0:\r\n\t\t\treturn -1\r\n\t\tc+=d//m\r\n\treturn c\r\n\t\t\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(f(l,m,n))", "n, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nm = min(data)\r\nif any(map(lambda x: (x-m)%k, data)):\r\n print(-1)\r\nelse:\r\n print(sum(map(lambda x: (x-m)//k, data))) \r\n", "n,k = list(map(int, input().split(\" \")))\r\nx = list(map(int, input().split(\" \")))\r\na=[i%k for i in x]\r\nif len(set(a))!=1:\r\n print(-1)\r\n exit()\r\nMin=min(x)\r\nprint(sum((i-Min)//k for i in x))", "n, k = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nnum = [ai[i] % k for i in range(n)]\r\nif max(num) != min(num):\r\n print(-1)\r\nelse:\r\n num = [ai[i] // k for i in range(n)]\r\n minn = min(num)\r\n num3 = [num[i] - minn for i in range(n)]\r\n print(sum(num3))\r\n", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\ns = 0\r\nfor i in a:\r\n if (i-m)%k == 0:\r\n s += (i-m)//k\r\n else:\r\n print(-1)\r\n exit()\r\nprint(s)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nmn = min(arr)\r\n\r\nans = 0\r\n\r\nfor n in arr:\r\n if (n - mn) % k != 0:\r\n print(-1)\r\n exit()\r\n else:\r\n ans += (n-mn)//k\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/793/A\n# 900\n\nn, k = map(int, input().split())\n\nmn = float(\"inf\")\nl = []\nfor i in input().split():\n i = int(i)\n mn = min(i, mn)\n l.append(i)\n\no = 0\nfor n in l:\n diff = n - mn\n \n if diff > 0:\n if diff % k == 0:\n o += diff / k\n else:\n o = -1\n break\n\nprint(int(o))", "import sys\r\nn,k = [int(i) for i in sys.stdin.readline().strip().split()]\r\nA = [int(i) for i in sys.stdin.readline().strip().split()]\r\nr = A[0]%k\r\nR = [A[i]%k for i in range(n)]\r\nm = min(A)\r\nfor i in R:\r\n if i != r:\r\n print ('-1')\r\n break\r\nelse:\r\n s = 0\r\n for i in A:\r\n s = s+((i-m)/k)\r\n print (int(s))", "#!/usr/bin/env python3\n# 793A_shares.py - Codeforces.com/problemset/problem/793/A by Sergey 2017\n\nimport unittest\nimport sys\n\n###############################################################################\n# Shares Class (Main Program)\n###############################################################################\n\n\nclass Shares:\n \"\"\" Shares 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, self.k] = map(int, uinput().split())\n\n # Reading a single line of multiple elements\n self.numa = list(map(int, uinput().split()))\n\n self.price_min = min(self.numa)\n\n self.price_diffs = [price - self.price_min for price in self.numa]\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = 0\n\n for diff in self.price_diffs:\n if diff % self.k:\n result = -1\n break\n result += diff // self.k\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 \"\"\" Shares class testing \"\"\"\n\n # Constructor test\n test = \"3 3\\n12 9 15\"\n d = Shares(test)\n self.assertEqual(d.n, 3)\n self.assertEqual(d.k, 3)\n self.assertEqual(d.numa, [12, 9, 15])\n self.assertEqual(d.price_min, 9)\n\n # Sample test\n self.assertEqual(Shares(test).calculate(), \"3\")\n\n # Sample test\n test = \"2 2\\n10 9\"\n self.assertEqual(Shares(test).calculate(), \"-1\")\n\n # Sample test\n test = \"4 1\\n1 1000000000 1000000000 1000000000\"\n self.assertEqual(Shares(test).calculate(), \"2999999997\")\n\n # My tests\n test = \"2 2\\n-2 -2\"\n self.assertEqual(Shares(test).calculate(), \"0\")\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 = Shares(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(Shares().calculate())\n", "n,k = map(int,input().split())\r\nM = list(map(int,input().split()))\r\nl = 0\r\nfor i in range(0,n):\r\n if abs(M[i]-M[i-1])%k != 0:\r\n l += 1\r\n break\r\np = (sum(M)-(n*min(M)))//k\r\nprint(p if l == 0 else '-1' )\r\n", "n, k = map(int, input().split())\r\nmn = 1000 * 1000 * 1000 + 2\r\nspl = input().split()\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = int(spl[i])\r\nfor i in range(n):\r\n mn = min(mn, a[i])\r\nans = 0\r\nbad = 0\r\nfor i in range(n):\r\n c = a[i] - mn\r\n if c % k != 0:\r\n bad = 1\r\n ans += c // k\r\nif (bad):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\namin = min(a)\nfor ai in a:\n if 0 < (ai - amin) % k:\n ans = -1\n break\n else:\n ans += (ai - amin) // k\n\nprint(ans)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif len({ai % k for ai in a}) > 1:\r\n print(-1)\r\nelse:\r\n m = min(a)\r\n print(sum((ai - m) // k for ai in a))", "class CodeforcesTask793ASolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n self.shares = []\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n self.shares = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n rests = [x % self.n_k[1] for x in self.shares]\n if len(set(rests)) > 1:\n self.result = \"-1\"\n else:\n adj_shares = [(x - rests[0]) // self.n_k[1] for x in self.shares]\n base_share = min(adj_shares)\n times = [x - base_share for x in adj_shares]\n self.result = str(sum(times))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask793ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from sys import stdin\nimport math\n\nn,k = map(int, stdin.readline().split(' '))\narr = list(map(int, stdin.readline().split(' ')))\narr = [-1 * i for i in arr]\nmx = max(arr)\nsum = 0\nfor i in arr:\n\tif (mx - i) % k != 0:\n\t\tprint(-1)\n\t\texit(0)\n\tsum += (mx - i) // k\nprint(sum)", "import math\n\nn, k = input().split()\nn = int(n)\nk = int(k)\na = []\nfor s in input().split():\n a.append(int(s))\n\n# print(n)\n# print(k)\n# print(a)\n\nmin = math.inf\nfor i in a:\n if i<min:\n min = i\n\nsum = 0\nimp = False\nfor i in a:\n if (i-min) % k == 0:\n sum += (i-min) // k\n else:\n imp = True\n break\n \n# print(sum)\n# print(imp)\n\nif (imp):\n print(-1)\nelse:\n print(sum)\n\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nmi = min(a)\nans = 0\nfor i in a:\n\tans += (i - mi) // m\n\tif (i - mi) % m:\n\t\tprint(-1)\n\t\tbreak\nelse:\n\tprint(ans)", "n,k=[int(x) for x in input().split()]\r\np=[int(x) for x in input().split()]\r\n\r\nm=min(p)\r\nt=0\r\n\r\nfor x in p:\r\n if (x-m)%k:\r\n print(-1)\r\n break\r\n else:\r\n t+=(x-m)//k\r\nelse:\r\n print(t)", "n, k = map(int, input().split())\nv = list(map(int, input().split()))\n\nminimum = min(v)\nsol = 0\n\nfor x in v:\n if (x - minimum) % k != 0:\n print('-1')\n exit(0)\n\n sol += int((x - minimum) // k)\n\nprint(sol)\n", "l1 = [int(x) for x in input().split()]\r\nn,k = l1[0],l1[1]\r\nl2 = [int(x) for x in input().split()]\r\nt = min(l2)\r\nruined=0\r\nans=0\r\nfor x in l2:\r\n if (x-t)%k:\r\n ruined=1\r\n break\r\n else:\r\n ans+= (x-t)//k\r\nif not ruined:\r\n print(ans)\r\nelse:\r\n print(-1)", "import sys\r\n\r\nn, k = map(int, sys.stdin.readline().strip().split(\" \"))\r\nprices = list(map(int, sys.stdin.readline().strip().split(\" \")))\r\n\r\nminimo = float('Inf')\r\n\r\nfor i in range(n):\r\n if prices[i] < minimo:\r\n minimo = prices[i]\r\n\r\nflag = True\r\ncount = 0\r\nfor price in prices:\r\n aux = price - minimo\r\n if aux % k == 0:\r\n count += aux // k\r\n else:\r\n flag = False\r\n break\r\n \r\nif flag:\r\n print(count)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\nprices=list(map(int,input().split()))\nsmallest=1000000000\nfor x in prices:\n if x<smallest:\n smallest=x\nans=0\nfor y in prices:\n if (y-smallest)%k!=0:\n ans=-1\n break\n else:\n ans=ans+(y-smallest)//k\nprint(ans)", "L = input()\r\nL = L.split()\r\nn = int(L[0])\r\nk = int(L[1])\r\nP = input()\r\nP = P.split()\r\nfor j in range (len(P)):\r\n P[j] = int(P[j])\r\nMin = min(P)\r\nA = [0]*n\r\nAux = 1\r\nfor i in range (n):\r\n if (int(P[i])-Min)%k==0:\r\n A[i] = (int(P[i])-Min)//k\r\n else:\r\n Aux = 0\r\n break\r\nS = 0\r\nif Aux ==1:\r\n for k in range (n):\r\n S += A[k]\r\n print(S)\r\nelse:\r\n print('-1')", "n,k = list(map(int,input().split())) #1e5, 1e9\r\nal = list(map(int,input().split()))\r\nrl = [a%k for a in al]\r\nif max(rl)>min(rl):\r\n print(-1)\r\nelse:\r\n ma = min(al)\r\n jl = [(a-ma)//k for a in al]\r\n print(sum(jl))\r\n", "n, k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nt=min(a)\r\ni=0\r\nfor m in a:\r\n if (m-t)%k==0:\r\n i+=int((m-t)/k)\r\n else:\r\n i=-1\r\n break\r\nif i==-1:\r\n print(-1)\r\nelse:\r\n print(i)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nmi=min(c)\r\nfor i in c:\r\n if (i-mi)%b:print(-1);exit()\r\nprint((sum(c)-a*mi )//b)", "n, k = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\ns = {x % k for x in a}\r\nif len(s) > 1:\r\n print(-1)\r\nelse:\r\n print((sum(a) - n * min(a)) // k)\r\n", "import sys\r\n\r\ndef main():\r\n n,k=list(map(int,sys.stdin.readline().split()))\r\n a=list(map(int,sys.stdin.readline().split()))\r\n \r\n amin=min(a)\r\n \r\n result=0\r\n for i in range(n):\r\n delta=a[i]-amin\r\n if delta%k!=0:\r\n result=-1\r\n break\r\n result+=delta//k\r\n \r\n sys.stdout.write(str(result)+'\\n')\r\n \r\nmain()\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\nst = True\r\nres = 0\r\nfor i in a:\r\n if (i - m) % k != 0:\r\n st = False\r\n else:\r\n res += (i - m) // k\r\nif st:\r\n print(res)\r\nelse:\r\n print(-1)\r\n", "def main(a, k):\r\n if len(set(x % k for x in a)) > 1:\r\n return -1\r\n\r\n m = min(a)\r\n return sum((x - m) // k for x in a)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n print(main(a, k))\r\n", "n, k = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nm = L[0]%k\r\nans = 0\r\nfor i in L:\r\n if i % k != m:\r\n ans = -1\r\nif ans != -1:\r\n r = min(L)\r\n for i in L:\r\n ans += (i - r)//k\r\nprint(ans)\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nans=0\r\nf=0\r\nfor i in range(n):\r\n\tdif=(a[i]-m)\r\n\tif dif%k!=0:\r\n\t\tf=1\r\n\t\tbreak\r\n\telse:\r\n\t\tans+=dif\r\nif f==0:\r\n\tprint(ans//k)\r\nelse:\r\n\tprint(\"-1\")", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\nm = min(l)\nfor i in l:\n\tif (i - m) % k:\n\t\tprint(-1)\n\t\tbreak \nelse:\n\tprint((sum(l) - n * m) // k)", "def main():\n n, k = map(int, input().split())\n prices = list(map(int, input().split()))\n\n min_price = min(prices)\n\n for price in prices:\n diff = price - min_price\n if diff % k != 0:\n print(-1)\n break\n else:\n print(sum((price - min_price) // k for price in prices))\n\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t \t \t\t \t\t \t\t\t \t \t \t\t", "\r\nn, k = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nans = 0\r\nr = min(s)\r\nfor i in s:\r\n if (i-r)%k:\r\n print(-1)\r\n break\r\n else:\r\n ans+=(i-r)//k\r\nelse:\r\n print(ans)\r\n", "n,k = map(int,input().split())\r\nL = list(map(int,input().split()))\r\nl1 = []\r\nb = min(L)\r\nfor i in range(0,len(L)):\r\n l1.append(abs(L[i]-b))\r\nt = 0\r\nfor i in range(0,len(l1)):\r\n if l1[i]%k != 0:\r\n print(-1)\r\n exit()\r\n else:\r\n t = t + l1[i]//k\r\nprint(t)", "import sys\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n amin = min(a)\r\n\r\n ans = 0\r\n\r\n for ai in a:\r\n d = ai - amin\r\n\r\n if d % k != 0:\r\n print(-1)\r\n return\r\n\r\n ans += d // k\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm,s,f=l[0],0,0\r\nfor x in range(1,a):\r\n\td=l[x]-m\r\n\tif d%b==0:s+=d//b\r\n\telse:\r\n\t\tf=1\r\n\t\tbreak\r\nif f==0:print(s)\r\nelse:print(-1)", "\r\ninputnum,tk=list(map(int,input().split()))\r\nara=list(map(int,input().split()))\r\nmaxi=ara[0]\r\n\r\nans=0\r\nara=sorted(ara)\r\nmini=ara[0]\r\nfor i in ara:\r\n if (i-mini)%tk==0:\r\n ans+=(i-mini)//tk\r\n else:\r\n print(-1)\r\n exit()\r\nprint(ans)\r\n\r\n", "\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\ntarget = min(l)\r\nans = 0\r\nfor i in range(n):\r\n\tif (target - l[i]) % k == 0:\r\n\t\tans += abs((target - l[i]) // k)\r\n\telse:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\nd= min(a)\r\nr=0\r\nfor i in a:\r\n if (i-d)%k==0:\r\n r+=(i-d)//k\r\n else:\r\n r=-1\r\n break\r\nprint(r)", "I=lambda:map(int,input().split())\r\nn,k=I()\r\na=*I(),\r\nx=min(a)\r\nprint([sum((y-x)//k for y in a),-1][any(y%k!=x%k for y in a)])", "a = int(input().split()[1])\r\ns = input().split()\r\nd = []\r\nfor i in s:\r\n d.append(int(i))\r\nm = min(d)\r\nt = 0\r\nfor i in d:\r\n c = i - m\r\n if c % a == 0:\r\n t += c // a \r\n else:\r\n print(-1)\r\n exit()\r\nprint(t)\r\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nmn = min(a)\r\nprint(-1 if any([(i - mn) % k for i in a]) else sum([(i - mn) // k for i in a]))\r\n", "b=0\r\nsum=0\r\na=[]\r\nn,k=map(int,input().split())\r\nv=[int(x) for x in input().split()]\r\nv.sort()\r\nfor i in range (1,n):\r\n m=v[i]-v[0]\r\n a.append(m)\r\n if m%k!=0:\r\n b=1\r\n break\r\n else:\r\n sum=sum+m//k\r\nif b==0:\r\n print(sum)\r\nelse:\r\n print('-1')", "n, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nmi = min(a)\nres = 0\nfor i in a:\n d, r = divmod(i - mi, k)\n if r == 0:\n res += d\n else:\n res = -1\n break\nprint(res)\n", "import sys\r\nn, k = map(int, input().split())\r\ng, a = 0, list(map(int, input().split()))\r\nmi, dem = min(a), 0\r\nfor x in a:\r\n if (x - mi) % k != 0:\r\n print(-1)\r\n sys.exit()\r\n else: dem += (x - mi) // k\r\nprint(dem)", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nh,check,res=min(a),0,0\r\nfor i in a:\r\n if (i-h)%k==0:\r\n res+=(i-h)//k\r\n else:\r\n check=1\r\n break\r\nif check==1:\r\n print(-1)\r\nelse:\r\n print(res)", "rawa = str(input()).split()\r\nn = int(rawa[0])\r\nk = int(rawa[1])\r\n\r\nrawb = str(input()).split()\r\n\r\n\r\nnums = [int(x) for x in rawb]\r\n\r\nsmallest = nums[0]\r\n\r\nfor x in nums:\r\n if (x < smallest):\r\n smallest = x\r\n\r\nanswer = 0\r\nfor x in nums:\r\n if (((x - smallest) % k) != 0):\r\n answer = -1\r\n break\r\n else:\r\n answer += int((x - smallest) / k)\r\nprint(answer)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq=True\r\nmi=a[0]\r\nfor i in a:\r\n if i<mi:\r\n mi=i\r\nfor i in range(n):\r\n a[i]-=mi\r\n if a[i]%k!=0:\r\n q=False\r\n break\r\nans=0\r\nif q:\r\n for i in a:\r\n ans+=i//k\r\nelif n==1: ans=0\r\nelse: ans=-1\r\nprint(ans)\r\n", "import math\r\nn,kk=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=min(a)\r\no=[]\r\nd=[]\r\ncount=0\r\nfor i in a:\r\n if len(a)==1:\r\n print(0)\r\n break\r\n \r\n elif (i-k)%kk==0:\r\n continue\r\n else:\r\n print(-1)\r\n break\r\n \r\n \r\nelse:\r\n while True:\r\n try:\r\n a.remove(k)\r\n count+=1\r\n except:\r\n for u in range(n-count):\r\n o.append(a[u]-k)\r\n \r\n if sum(o)%kk==0:\r\n print(sum(o)//kk)\r\n break\r\n else:\r\n print(-1)\r\n break", "n,k=input().strip().split(' ')\r\nn,k=(int(n),int(k))\r\nl=list(map(int,input().strip().split(' ')))\r\nm=10**10\r\nfor i in range(n):\r\n if m>l[i]:\r\n m=l[i]\r\nans=0\r\nfor i in range(n):\r\n if (l[i]-m)%k==0:\r\n ans+=(l[i]-m)//k\r\n else:\r\n print(-1)\r\n exit()\r\nprint(ans)", "n ,k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nm = min(A)\r\nAns=0\r\nfor i in A:\r\n## print(i)\r\n if ((i-m)%k)!=0:\r\n Ans=-1\r\n break\r\n else:\r\n Ans += ((i-m)//k)\r\nprint(Ans)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef solve(A, m):\r\n n = len(A)\r\n ans = 0\r\n for i in range(n):\r\n if A[i] % m:\r\n return -1\r\n ans += A[i] // m\r\n return ans\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n min_val = min(A)\r\n for i in range(n):\r\n A[i] -= min_val\r\n print(solve(A, m))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-23 12:44:17\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\n\r\nnb_shares, drops = read_ints()\r\nprices = read_ints()\r\nmins = min(prices)\r\nans = 0\r\nfor i in prices:\r\n if (i - mins) % drops == 0:\r\n ans += (i - mins)// drops\r\n else:\r\n ans = -1\r\n break\r\nprint(ans)\r\n", "n,k=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nc=min(l)\r\nok=True\r\nans=0\r\nfor i in range(n):l[i]+=c\r\nc=min(l)\r\ni=0\r\nwhile i<n and ok:\r\n\tif (l[i]-c)%k==0:\r\n\t\tans+=(l[i]-c)//k\r\n\telse:ok=False\r\n\ti+=1\r\nprint(ans if ok else \"-1\")\t\t", "import sys\r\nimport math\r\n\r\n\r\nn,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmn = min(a)\r\nans = 0\r\nfor i in range(n):\r\n if (a[i] - mn) % k != 0:\r\n print(-1)\r\n sys.exit()\r\n ans += (a[i] - mn)//k\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\n*a, = map(int, input().split())\r\na.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n if (a[i] - a[0]) % k:\r\n print(-1)\r\n exit(0)\r\n ans += (a[i] - a[0]) // k\r\nprint(ans)\r\n", "from sys import stdin, stdout\r\n\r\nn, k = map(int, stdin.readline().split())\r\nvalues = list(map(int, stdin.readline().split()))\r\nvalue = min(values)\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if (values[i] - value) % k:\r\n stdout.write('-1')\r\n break\r\n else:\r\n cnt += (values[i] - value) // k \r\nelse:\r\n stdout.write(str(cnt))", "str = input().split()\nn, k = int(str[0]), int(str[1])\na = input().split()\nfor i in range(n):\n a[i] = int(a[i])\nmymin = 1000000001\nfor elem in a:\n if elem < mymin:\n mymin = elem\nmysum = 0\nok = 1\nfor elem in a:\n if (mymin - elem) % k == 0:\n mysum += (elem - mymin) // k\n else:\n print(-1)\n ok = 0\n break\nif ok:\n print(mysum)\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=min(l)\r\nj,b=0,0\r\nflag=0\r\nfor i in range(n-1):\r\n\tif abs(l[i+1]-l[i])%k!=0:\r\n\t\t# print(l[i+1]-l[i])\r\n\t\tflag=1\r\n# print(flag)\r\n\t# else:\r\n\t# \tj=(l[i]-a)\r\n\t# \tb+=j//k\r\n\t# \tflag=9\r\n\r\n\r\nfor i in range(n):\r\n\tj=(l[i]-a)\r\n\tb+=j//k\r\n\t# flag=9\r\n\r\n\r\nif flag==1:\r\n\tprint('-1')\r\nelse:\r\n\tprint(b)", "n,k=map(int,input().split())\r\na=input().split()\r\nl=[]\r\nmi=10000000000\r\nzb=0\r\np=True\r\nfor x in a:\r\n b=int(x)\r\n if b<mi:\r\n mi=b\r\n l.append(b)\r\nfor x in l:\r\n if (x-mi)%k!=0:\r\n p=False\r\n break\r\n else:\r\n zb+=(x-mi)/k\r\nif p:\r\n print(round(zb))\r\nelse:\r\n print(-1)\r\n \r\n", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ndef f(n,k):\r\n z=n[0]\r\n for i in range(1,len(n)):\r\n if (n[i]-n[0])%k!=0:\r\n return 0\r\n return 1\r\nif f(a,k)==0:\r\n print(-1)\r\nelse:\r\n a.sort()\r\n t=0\r\n for i in range(1,n):\r\n t=t+((a[i]-a[0])//k)\r\n print(t)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nans=0\r\nfor i in range(n):\r\n\tdif=(a[i]-m)\r\n\tif dif%k!=0:\r\n\t\tprint('-1')\r\n\t\texit()\r\n\telse:\r\n\t\tans+=dif\r\nprint(ans//k)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndef f(l,k,n):\r\n\tc=0\r\n\tm=min(l)\r\n\tfor i in l:\r\n\t\td=i-m\r\n\t\tif d%k!=0:\r\n\t\t\treturn -1\r\n\t\tc+=d//k\r\n\treturn c\r\nprint(f(l,k,n))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nmn = min(a)\r\n\r\na_ = [el - mn for el in a]\r\n\r\nif any(el % k != 0 for el in a_):\r\n print(-1)\r\n exit()\r\n\r\nprint(sum([el // k for el in a_]))\r\n", "n, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nif all((a[i]-a[0]) % k == 0 for i in range(1, n)):\r\n print(sum([(a[i]-a[0])//k for i in range(1, n)]))\r\nelse:\r\n print(-1)", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\na = [int(i) for i in input().split()]\r\nm = a[0]\r\nans = 0\r\nfor i in range(n):\r\n if m > a[i]:\r\n m = a[i]\r\nfor i in range(n):\r\n if (a[i] - m) % k != 0:\r\n ans = -1\r\n break\r\n else:\r\n ans += (a[i] - m) // k\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nh = 1\r\n'''\r\nfor i in range(n):\r\n if(v[i] % k != 0):\r\n h = 0\r\n break\r\nif(h == 0):\r\n print(-1)\r\nelse:\r\n'''\r\nh = 0\r\nminimum = 0\r\nfor i in range(n):\r\n if(v[minimum] > v[i]):\r\n minimum = i\r\nmiin = v[minimum]\r\nv.pop(minimum)\r\nfor i in range(n - 1):\r\n if((v[i] - miin) % k == 0):\r\n h += (v[i] - miin) // k\r\n else:\r\n h = -1\r\n break\r\nprint(h)", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nl=min(s)\r\nk=0\r\nf=True\r\nfor i in range(n):\r\n if (s[i]-l)%m==0:\r\n k+=(s[i]-l)//m\r\n else:\r\n f=False\r\n break\r\nif f==False:\r\n print(-1)\r\nelse:\r\n print(k)\r\n", "R=lambda:list(map(int,input().split()))\r\nn,m = R(); l = sorted(R()); k = list(filter(lambda x: (x-l[0])%m==0,l))\r\nprint(-1) if len(k)!=n else print(sum(list(map(lambda x: (x-l[0])//m,l))))", "n, k = map(int, input().split())\nangka = list(map(int, input().split()))\nterkecil = min(angka)\n\ntotal = 0\nfor i in range(len(angka)):\n if ((angka[i] - terkecil) % k != 0):\n total = -1\n break\n \n detik = (angka[i] - terkecil)//k\n total += detik\n\nprint(total)\n\n\t \t\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\nfor i in range(n - 1):\r\n if a[i] % k != a[i + 1] % k:\r\n print(-1)\r\n exit(0)\r\nk1 = min(a)\r\nans= 0\r\nfor i in range(n):\r\n ans += (a[i] - k1) // k\r\nprint(ans)\r\n", "def main():\n [n, k] = [int(_) for _ in input().split()]\n prices = [int(_) for _ in input().split()]\n prices.sort()\n\n try:\n next(i for i in range(1, n) if (prices[i] - prices[0]) % k != 0)\n print(-1)\n except StopIteration:\n result = sum((prices[i] - prices[0]) // k for i in range(1, n))\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n,k=[int(x) for x in input().split(\" \")]\r\nakcii=[int(x) for x in input().split(\" \")]\r\nresp=0\r\nrem=akcii[0]%k\r\nminimo=min(akcii)\r\nfor i in akcii:\r\n\tif (i%k!=rem):\r\n\t\tresp=-1\r\n\t\tbreak\r\n\telse:\r\n\t\tresp+=(i-minimo)//k\r\nprint(resp)", "###################################################1\r\nimport sys\r\na, k = [int(i) for i in input().split()]\r\nin2 = [int(i) for i in input().split()]\r\nm = min(in2)\r\nin2.remove(m)\r\nres = 0\r\nfor r in in2:\r\n if (r - m)%k == 0:\r\n res += (r - m)//k\r\n else:\r\n print(-1)\r\n sys.exit(0)\r\nprint(res)\r\nsys.exit(0)\r\n###################################################1", "import math\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmininl=min(l)\r\nmin=0\r\nfor i in range(n):\r\n curr=l[i]-mininl\r\n if curr%k!=0:\r\n print('-1')\r\n break\r\n else:\r\n min+=curr//k\r\nelse:\r\n print(min)\r\n\r\n\r\n\r\n \r\n \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nmina = min(a)\r\n\r\nfor i in range(n):\r\n a[i] -= mina\r\n\r\nr = 0\r\n\r\nfor i in range(n):\r\n if a[i] % k != 0:\r\n print('-1')\r\n exit()\r\n r += a[i] // k\r\n\r\nprint(r)\r\n", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nmi = min(lst)\r\ntmp = [x - mi for x in lst]\r\nc = Counter(tmp)\r\nif any(ki % k != 0 for ki in c.keys()):\r\n print(-1)\r\nelse:\r\n res = sum(ki * v for ki, v in c.items()) // k\r\n print(res)", "n,m = map(int,input().split())\r\nl1 = list(map(int,input().split()) )\r\nl1.sort()\r\n#print(l1)\r\ncnt=0\r\nflag=True\r\nfor i in range(1,len(l1)):\r\n diff = l1[i]-l1[0]\r\n if(diff%m==0):\r\n cnt = cnt+diff//m\r\n else:\r\n print(-1)\r\n flag=False\r\n break\r\nif(flag):\r\n print(cnt)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nmn = min(arr)\r\n\r\ncnt = 0\r\n\r\nfor v in arr:\r\n if (v - mn) % k != 0:\r\n print(-1)\r\n exit(0)\r\n cnt += (v - mn) // k\r\n\r\nprint(cnt)\r\n", "n,k= (input()).split()\nn= int(n)\nk=int(k)\nl = (input().split(' '))\n\nj=[]\nfor i in l:\n j.append(int(i))\nm =( min(j))\n\nt=0\nflag=1\nfor i in l:\n \n i = int(i)\n '''\n if i==m:\n \n continue\n else:\n while(i>m):\n print('**',i)\n i-=k\n t+=1\n print(t)\n if(i<m):\n print('***',i)\n flag=0\n break;'''\n x= (i-m)/k\n x1=int(x)\n if(x==x1):\n t+=x\n else:\n print(-1)\n flag=0\n break\n \n \n \nif(flag==1):\n \n\n print(int(t))\n\n\n", "def f(l):\r\n if (l[-1] - l[0]) % k != 0:\r\n return False\r\n for i in range(len(l) -1):\r\n if (l[i+1] - l[i]) % k != 0:\r\n return False\r\n return True\r\nn,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nif f(l) == False:\r\n print('-1')\r\nelse:\r\n cnt = 0\r\n for i in reversed(range(len(l))):\r\n cnt += (l[i] - l[0]) // k\r\n print(cnt)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans,m=0,min(a)\r\nfor x in a:\r\n if (x-m)%k != 0:\r\n print(-1)\r\n exit(0)\r\n ans+=((x-m)//k)\r\nprint(ans)\r\n", "def main():\n n, k = map(int, input().split())\n aa = list(map(int, input().split()))\n b, t = min(aa), 0\n for a in aa:\n a -= b\n if a % k:\n print(-1)\n break\n else:\n t += a\n else:\n print(t // k)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmod = arr[0] % k\r\nflag = 1\r\nfor elem in arr:\r\n if elem % k != mod:\r\n flag = -1\r\n break\r\nif flag == -1:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n need = min(arr)\r\n for elem in arr:\r\n ans += (elem - need) // k\r\n print(ans)", "n, k = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nans = 0\r\nif len(arr) == 1:\r\n ans = 0\r\nelse:\r\n for i in range(1, len(arr)):\r\n diff = arr[i] - arr[0]\r\n if diff % k != 0:\r\n ans = -1\r\n break\r\n else:\r\n for i in range(1, len(arr)):\r\n ans += (arr[i] - arr[0]) // k\r\nprint(ans)\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nq=min(a)\r\nfor i in range(n):\r\n\tif(a[i]==q):\r\n\t\tcontinue\r\n\tif(abs(a[i]-q)%k!=0):\r\n\t\tprint(-1)\r\n\t\tbreak\r\n\telse:\r\n\t\tc+=abs(a[i]-q)//k\r\nelse:\r\n\tprint(c)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nm=min(a)\r\nif any((i-m)%k for i in a):print(-1)\r\nelse:print(sum((i-m)//k for i in a))", "def solve():\r\n n, k = map(int, input().split())\r\n a = sorted(list(map(int, input().split())))\r\n ans = 0\r\n for i in range(1, n):\r\n if (a[i] - a[0]) % k != 0:\r\n return -1\r\n else:\r\n ans += (a[i] - a[0]) // k\r\n return ans\r\n\r\nprint(solve())\r\n", "n,k = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nm = min(a)\r\nif any([(i - m) % k for i in a]):\r\n print('-1')\r\nelse:\r\n print(sum(((i - m) // k for i in a)))", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n if (a[i] - a[0]) % k:\r\n print(-1)\r\n break\r\n else:\r\n ans += (a[i] - a[0]) // k\r\nelse:\r\n print(ans)", "n, k = map(int, input().split())\r\na = input().split()\r\nf, j, m = 0, 0, int(a[0])\r\nfor i in range(n):\r\n if abs(int(a[i])-int(a[i-1]))%k==0:\r\n f += 1\r\n \r\n if int(a[i]) < m:\r\n j += ((m - int(a[i]))*i)//k\r\n m = int(a[i])\r\n else:\r\n j += (int(a[i])-m)//k\r\nif f == n:\r\n print(int(j))\r\nelse: print(-1)", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nresult = 0\r\nfor i in a:\r\n\tif (i-a[0])%k!=0:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\telse:\r\n\t\tresult+=(i-a[0])//k\r\nprint(result)", "n, k = map(int, input().split())\r\na = [int(elem) for elem in input().split()]\r\nmi = min(a)\r\ncou = 0\r\nb = []\r\nst = 0\r\nfor i in a:\r\n if st != 0:\r\n continue\r\n if i != mi:\r\n if (i - mi) % k == 0:\r\n cou += (i - mi) // k\r\n else:\r\n st = 1\r\n cou = -1\r\n\r\nprint(cou)", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=min(a)\r\nans=0\r\nc=True\r\nfor i in a:\r\n if (i-x)%k!=0:\r\n c=False\r\n break\r\n else:\r\n ans=ans+(i-x)//k\r\nif c==False:\r\n print(-1)\r\nelse:\r\n print(ans)", "n , k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nst = set(l)\r\ncnt = 0\r\nif len(st) == 1 :\r\n print(0)\r\n exit()\r\n\r\nelse:\r\n x = min(l)\r\n for i in l :\r\n c = i - x\r\n if c % k == 0 :\r\n cnt += c // k\r\n else:\r\n print(-1)\r\n exit()\r\n\r\n print(cnt)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nz,c=min(l),0\r\nfor i in range(n):\r\n\tif (l[i]-z)%k==0:\r\n\t\tc+=(l[i]-z)//k\r\n\telse:\r\n\t\tprint('-1')\r\n\t\texit()\r\nprint(c)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm = min(a)\r\ns, f = 0, 0\r\nfor i in range(n):\r\n if a[i]==m:\r\n pass\r\n else:\r\n if (a[i]-m)%k==0:\r\n s+=((a[i]-m)//k)\r\n else:\r\n f = 1\r\n break\r\nif f==1:\r\n print(-1)\r\nelse:\r\n print(s)", "_, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\nm = min(a)\r\nif not all([(i - m)%k == 0 for i in a]):\r\n print(-1)\r\nelse:\r\n print(sum([(i - m)//k for i in a]))", "n , k = map(int , input().split())\r\nl = list(map(int, input().split()))\r\nminimum = min(l)\r\nans = 0\r\nfor i in l:\r\n if (i-minimum)%k!=0:\r\n ans = -1\r\n break\r\n else:\r\n ans = ans + (i-minimum)//k\r\nprint(ans)", "inp1 = [int(x) for x in input().split()]\nn = inp1[0]\nk = inp1[1]\n\na = [int(x) for x in input().split()]\nr = [x % k for x in a]\nm = [x // k for x in a]\n\nif any([x != r[0] for x in r]):\n print(\"-1\")\nelse:\n mmin = min(m)\n print(sum([x - mmin for x in m]))\n", "n,k=[int(s) for s in input().split()]\r\na=[int(s) for s in input().split()]\r\nm=min(a)\r\nc=0\r\nfor i in a:\r\n if (i-m)%k!=0:\r\n print(-1)\r\n break\r\n c+=(i-m)//k\r\nelse:\r\n print(c)", "str_in = [int(x) for x in input().split()]\r\nn = str_in[0]\r\nk = str_in[1]\r\npr = []\r\nstr_in = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n pr.append(str_in[i])\r\nm = min(pr)\r\nt = 0\r\nfor i in range(n):\r\n if (pr[i]-m)%k == 0:\r\n t += (pr[i]-m)/k \r\n else:\r\n print(-1)\r\n exit()\r\nprint(int(t))", "n,k = list(map(int,input().split()))\na = list(map(int,input().split()))\ns = 0\nd = 0\nm = min(a)\n\nfor x in range(len(a)):\n if abs(a[x] - m) % k != 0:\n d = 1\n break\n else:\n s += (a[x]-m)//k\n\n\nif d == 1:\n print (-1)\nelse:\n print (s)\n \n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nr = 0\r\nm = min(l)\r\nfor x in l:\r\n\tif (x-m)%k == 0:\r\n\t\tr += (x-m)//k\r\n\telse:\r\n\t\tr = -1\r\n\t\tbreak\r\nprint(r)", "countOfNumbers, rubles = map(int, input().split())\n\nnumbers = list(map(int, input().split()))\n\n#\n\ndef Solution():\n \n preResult = 0\n minimalNumber = min(numbers)\n \n for element in numbers:\n \n check = (element - minimalNumber) % rubles\n if check != 0:\n return -1\n \n preResult += (element - minimalNumber) // rubles\n \n\n return preResult\n\n\nprint(Solution())\n\n\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nminA = a[0]\r\nfor i in range(len(a)):\r\n if a[i] < minA:\r\n minA = a[i]\r\n\r\ncount = 0\r\nok = True\r\nfor i in range(len(a)):\r\n a[i] -= minA\r\n if a[i] % k != 0:\r\n ok = False\r\n break\r\n count += int(a[i] / k)\r\n\r\nif ok:\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "n,k = map(int,input().split() )\r\na = []\r\na = list(map(int,input().split() ) )\r\n\r\nmini = min(a)\r\ncan=True\r\nans=0\r\nfor i in range(n):\r\n if( (a[i]-mini)%k != 0):\r\n can=False\r\n break\r\n else:\r\n ans+= (a[i]-mini)//k\r\n\r\nif can:\r\n print(ans)\r\nelse:\r\n print(\"-1\")\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nif k == 1:\r\n tot = sum(daf) - min(daf) * n\r\n print(tot)\r\nelse:\r\n tot = 0\r\n min_daf = min(daf)\r\n for x in daf:\r\n cek = x - min_daf\r\n if cek%k != 0:\r\n print(-1)\r\n break\r\n else:\r\n tot += cek//k\r\n else:\r\n print(tot)\r\n \r\n", "a,n=list(map(int,input().split()))\r\n\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\nh=min(t)\r\nv,p=0,0\r\nfor k in range(a):\r\n if (t[k]-h)%n!=0:\r\n print(-1)\r\n v+=1\r\n break\r\n else:\r\n p+=(t[k]-h)//n\r\n\r\n\r\nif v==0:\r\n print(p)\r\n \r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans1 = min(a); ans = 0\r\nfor i in range(n):\r\n if (a[i]-ans1) % k != 0: print(-1); exit()\r\n else: ans += (a[i]-ans1)//k\r\nprint(ans)", "n,m = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nz,x =0,0\r\nfor i in range(1,len(a)):\r\n\tif (a[i]-a[0])%m!=0:\r\n\t\tz =1\r\n\t\tbreak\r\n\telse:\r\n\t\tx+=(a[i]-a[0])//m\r\nif z ==0:print(x)\r\nelse:print(-1)" ]

[ "n = int(input())\r\nt = [list(map(int, input().split())) for q in range(n)]\r\nn += 1\r\nu = [-1e7] * n\r\nv = [0] * n\r\nfor i, (j, a) in list(enumerate(t, 1))[::-1]:\r\n u[i] = max(u[i], v[i] + a)\r\n v[j], u[j] = max(v[j] + v[i], u[j] + u[i]), max(v[j] + u[i], u[j] + v[i])\r\nprint(u[1])" ]

[ "n=int(input())\r\nj=1\r\nk=n\r\nfor i in range(n):\r\n if i%2 ==0:\r\n print(j,end=\" \")\r\n j +=1\r\n else:\r\n print(k,end=\" \")\r\n k-=1\r\nprint(\"\")", "n = int(input())\r\n# print(n//2+1)\r\nif n & 1:\r\n for i in range(1, n//2+2):\r\n # print(i, n-i+1, end=' ')\r\n if (i == n-i+1):\r\n print(i, end=' ')\r\n else:\r\n print(i, n-i+1, end=' ')\r\nelse:\r\n for i in range(1, n//2+1):\r\n print(i, n-i+1, end=' ')\r\n", "def solve():\r\n n = int(input())\r\n j=0\r\n i=1\r\n k=n\r\n # print(\"k\")\r\n s = \"\"\r\n if n%2==0:\r\n while j<n:\r\n s = s + str(k)+\" \"+str(i)+\" \"\r\n k-=1\r\n i+=1\r\n j+=2\r\n else:\r\n while j<n-1:\r\n s = s + str(k)+\" \"+str(i)+\" \"\r\n i+=1\r\n k-=1\r\n j+=2\r\n s+=str(i)\r\n print(s)\r\n return\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "# link: https://codeforces.com/problemset/problem/53/C\r\n\r\ndef solve(n):\r\n if n==2:\r\n print(1,2)\r\n elif n==1:\r\n print(1) \r\n else:\r\n count = 0\r\n for i in range(n//2):\r\n temp = count\r\n count += 1\r\n print(count, n-temp, end=\" \")\r\n if n%2 != 0:\r\n print(n//2 + 1) \r\n\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n solve(n)", "n=int(input())\r\nlo=1 \r\nhi=n \r\ncnt=0 \r\nans=[]\r\nwhile lo<=hi:\r\n if cnt%2==0:\r\n ans.append(lo)\r\n lo+=1 \r\n else:\r\n ans.append(hi)\r\n hi-=1 \r\n cnt+=1\r\nprint(*ans)", "n = int(input())\r\na = [0] * n\r\nx = 0\r\ny = n\r\nfor i in range(0, n, 2):\r\n a[i] = x + 1\r\n x += 1\r\n if i + 1 < n:\r\n a[i + 1] = y\r\n y -= 1\r\n\r\nprint(*a)\r\n", "n = int(input())\r\nk1 = 1\r\nk2 = n\r\nans = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ans.append(k1)\r\n k1 += 1\r\n else:\r\n ans.append(k2)\r\n k2 -= 1\r\nprint(*ans)\r\n", "n = int(input())\r\n#n = input()\r\n#m = input(); m = m.split()\r\n#n = [int(x) for x in n]\r\n#m = [int(x) for x in m]\r\nb = n // 2+1\r\nk = -1\r\nfor i in range(1, n+1):\r\n print(b, end=' ')\r\n b = b + (i * k)\r\n k *= -1", "n=int(input())\r\np=[1]\r\na=n-1\r\nb=1\r\nfor i in range(n-1):\r\n b+=a\r\n p.append(b)\r\n if a<0:\r\n a=-a-1\r\n else:\r\n a=-a+1\r\nprint(*p)", "n = int(input())\r\nl, r = 1, n\r\nwhile l < r:\r\n print(l,end=\" \")\r\n print(r,end=\" \")\r\n l+=1\r\n r-=1\r\nif l==r:\r\n print(l, end=\"\")", "# frog\r\nn = int(input())\r\nk = 1\r\nz = n\r\nf = 1\r\nwhile n:\r\n n -= 1\r\n if f == 1:\r\n print(k, end=' ')\r\n k += 1\r\n f = 0\r\n else:\r\n print(z, end=' ')\r\n z -= 1\r\n f = 1\r\n", "n=int(input())\r\nl=[i for i in range(1,n+1)]\r\nlow=0\r\nhi=n-1\r\nres=[]\r\nwhile hi-low>1:\r\n res.append(l[low])\r\n res.append(l[hi])\r\n low+=1\r\n hi-=1\r\nif low==hi:\r\n res.append(l[low])\r\nelse:\r\n res.append(l[low])\r\n res.append(l[hi])\r\nfor i in res:\r\n print(i,end=\" \")", "n=int(input())\na=[]\ns=0\nif n%2==0:\n for i in range(0,n//2):\n a.append(1+i)\n a.append(n-i)\nelse:\n for i in range(0,n//2):\n a.append(1+i)\n a.append(n-i)\n a.append(1+n//2)\nfor i in range(len(a)-1):\n print(a[i],end=\" \")\nprint(a[len(a)-1])\n\n\t \t\t\t \t \t \t\t \t \t\t\t \t \t \t", "n = int(input())\r\ni = 1\r\ns = 1\r\nnd = n\r\nwhile(i <= n):\r\n print(s,end = \" \")\r\n s+= 1\r\n i += 1\r\n if(i < n):\r\n print(nd,end = \" \")\r\n nd -= 1\r\n i += 1", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\nn = int(input())\r\n\r\nres = []\r\n\r\nisLeft = True\r\n\r\nfor _ in range(n):\r\n if isLeft:\r\n res.append(_ // 2 + 1)\r\n isLeft = False\r\n else:\r\n res.append(n - _ // 2)\r\n isLeft = True\r\n\r\nprint(*res)\r\n", "# LUOGU_RID: 121012636\na=int(input());ls=[]\nfor i in range(1,a+1):\n ls.append(i)\nif len(ls)%2==0:\n b=0\n for i in range(int(len(ls)/2)):\n print(ls[b],ls[-(b+1)],end=\" \")\n b+=1\nelse:\n b=0\n for i in range(int((len(ls)-1)/2)):\n print(ls[b],ls[-(b+1)],end=\" \")\n b+=1\n print(ls[b])", "n = int(input())\r\nstrs = \"1 \"\r\nprev = 1 \r\ncurdiff = n - 1 \r\ndicts = {}\r\ndicts[1] = 1 \r\nfor i in range(n):\r\n if i == 0 :\r\n continue \r\n newnum = prev + curdiff \r\n if newnum > n or newnum in dicts :\r\n newnum = prev - curdiff \r\n dicts[newnum] = 1\r\n prev = newnum \r\n curdiff -= 1 \r\n strs += str(newnum)\r\n strs += \" \"\r\n\r\nprint(strs[:-1])", "import math\r\nn=int(input())\r\nk=1\r\nr=n\r\nprint(k,end=\" \")\r\nfor i in range(1,n):\r\n r-=1\r\n if(i%2==0):\r\n k-=r\r\n print(k,end=\" \")\r\n else:\r\n k+=r\r\n print(k,end=\" \")", "\r\nn = int(input())\r\n\r\nl = 1\r\nh = n\r\n\r\nfor i in range(n):\r\n if i%2==0:\r\n print(l,end=\" \")\r\n l = l + 1\r\n else:\r\n print(h,end=\" \")\r\n h = h - 1\r\nprint(\"\")", "n = int(input())\r\nindex1 = 1\r\nindex2 = n\r\nans = []\r\nfor i in range(0, n):\r\n if i % 2 == 0:\r\n ans.append(index1)\r\n index1 += 1\r\n else:\r\n ans.append(index2)\r\n index2 -= 1\r\nstack = []\r\nfor i in ans:\r\n stack.append(str(i))\r\nprint(\" \".join(stack))", "n = int(input())\r\nl=1\r\nr=n\r\nfirst = True\r\nwhile l<=r:\r\n if first:\r\n print(l,end=' ')\r\n l+=1\r\n else:\r\n print(r,end=' ')\r\n r-=1\r\n first = not(first)\r\n \r\n \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\nif n == 1:\r\n print(1)\r\n exit()\r\n\r\na = [1, n]\r\nans = [1]\r\n\r\nwhile abs(a[0] - a[1]) > 0:\r\n ans.append(a[1])\r\n if a[0] < a[1]:\r\n a[0] += 1\r\n else:\r\n a[0] -= 1\r\n a[0], a[1] = a[1], a[0]\r\n\r\nprint(*ans)\r\n", "n = int(input())\r\nl = 1\r\nr = n\r\nans = []\r\nwhile l < r:\r\n ans.append(str(l))\r\n ans.append(str(r))\r\n l +=1\r\n r-=1\r\nif l==r:\r\n ans.append(str(l))\r\nprint(' '.join(ans))", "n = int(input())\nj = 1\nk = n\nfor i in range(n):\n if i % 2 == 0:\n print(j, end=\" \")\n j += 1;\n else:\n print(k, end=\" \")\n k -= 1\nprint(\"\")\n", "\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n xx = int(n/2)\r\n\r\n \r\n for i in range(1,xx+1):\r\n print(i,n-i+1)\r\n if(n%2==1) :\r\n print(int(n/2)+1)\r\n \r\nmain()\r\n", "n = int(input())\r\nx = 1\r\n\r\nfor i in range(1, n+1):\r\n print(x, end=' ')\r\n x += n-i if i%2 else i-n", "I=lambda :list(map(int,input().split()))\r\nn,=I()\r\nfor i in range(1,n//2+1):\r\n print(i,n-i+1,end=' ')\r\nif n%2:\r\n print(n//2+1)", "n = int(input())\r\nleft, right = 1, n\r\n\r\nwhile left < right:\r\n print(left,end=\" \")\r\n print(right,end=\" \")\r\n left+=1\r\n right-=1\r\n\r\nif left==right:\r\n print(left, end=\"\")", "n = int(input())\r\ni = 1\r\nj = n\r\nwhile i <= j :\r\n print(i,end=\" \")\r\n i += 1\r\n if i <= j :\r\n print(j,end=\" \")\r\n j -= 1", "n = int(input())\r\nt = [0] * n\r\nt[0] = 1\r\nfor i in range(1, n):\r\n t[i] = t[i - 1] + (n - i if i & 1 else i - n)\r\nprint(' '.join(map(str, t)))", "import sys\r\n\r\nn_rocks = int(sys.stdin.readline())\r\nleft, right = 1, n_rocks\r\nn = 0\r\n\r\nwhile left <= right:\r\n if n % 2 == 0:\r\n print(left)\r\n left += 1\r\n else:\r\n print(right)\r\n right -= 1\r\n n += 1\r\n", "from sys import stdin\r\n\r\nlines = stdin.readlines()\r\n\r\nn = int(lines[0])\r\n\r\narr = []\r\n\r\nl, r = 1, n\r\n\r\nfor i in range(n):\r\n if i%2 == 0:\r\n arr.append(l)\r\n l += 1\r\n else:\r\n arr.append(r)\r\n r -= 1\r\n\r\n\r\nprint(' '.join(str(i) for i in arr))", "import math\r\na=int(input())\r\nl=[int(x) for x in range(1,a+1)]\r\nfor i in range(int(math.floor(a/2))):\r\n print(l[i],end=' ')\r\n print(l[a-1-i],end=' ')\r\nif a%2==1:\r\n print(l[math.floor(a/2)])", "n = int(input())\r\nres = []\r\nsign = 1\r\ncurrent = 0\r\nfor i in range(n):\r\n current = current + (n-i) * sign\r\n res.append(str(current))\r\n sign *= -1\r\nprint(' '.join(res))", "import math\r\n\r\nn = int(input())\r\nfor i in range(1, n//2 + 1):\r\n if i == math.floor(n/2):\r\n print(i, n-i+1, end=\"\")\r\n else:\r\n print(i, n-i+1, end=\" \")\r\nif n%2 == 0:\r\n print()\r\nelif n == 1:\r\n print(\"1\")\r\nelse:\r\n print(\"\", n//2+1)", "x=int(input())\r\nptr1=1\r\nptr2=x\r\nsteps=x\r\nturn=0\r\nwhile steps>0:\r\n if(not turn):\r\n print(ptr1,end=\" \",)\r\n ptr1+=1\r\n steps-=1\r\n turn=not turn\r\n else:\r\n print(ptr2,end=\" \")\r\n ptr2-=1\r\n steps-=1\r\n turn=not turn\r\n\r\n\r\n\r\n\r\n", "#mounds = int(input())\r\n#m = list(range(1,mounds+1))\r\n#m1 = [1]\r\n#m.remove(1)\r\n#for i in range(1,len(m)+1):\r\n# if i%2==1:\r\n# m1.append(max(m))\r\n# m.remove(max(m))\r\n# else:\r\n# m1.append(min(m))\r\n# m.remove(min(m))\r\n#print(' '.join(map(str,m1)))\r\n#\r\nmounds = int(input())\r\nif mounds == 1:\r\n print(1)\r\n quit()\r\no = 2\r\nh = mounds//2\r\nt = mounds\r\nm = [1]\r\nfor i in range(0,mounds//2+1):\r\n if t > h:\r\n m.append(t)\r\n t-=1\r\n if o <= h:\r\n m.append(o)\r\n o+=1\r\n\r\n\r\n \r\nprint(' '.join(map(str,m)))", "n=int(input())\r\nfor i in range(1,(n//2+1)):\r\n print(i,n-i+1,end=' ')\r\nif(n%2==1):\r\n print(n//2+1)\r\nprint()", "N = int(input())\r\n\r\nL, R = 1, N\r\nind = 0\r\n\r\nwhile ind < N:\r\n if ind & 1:\r\n print(R, end = ' ')\r\n R -= 1\r\n else:\r\n print(L, end = ' ')\r\n L += 1\r\n ind += 1", "n = int(input())\r\n\r\nres = []\r\n\r\nl = 1\r\nr = n\r\n\r\nwhile l < r:\r\n res.append(l)\r\n res.append(r)\r\n \r\n l += 1\r\n r -= 1\r\nif l == r:\r\n res.append(l)\r\n\r\nprint(*res)", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nv = []\r\n\r\nx = 1\r\ny = n\r\nfor i in range(n):\r\n if(i % 2 == 0):\r\n v.append(str(x))\r\n x += 1\r\n else:\r\n v.append(str(y))\r\n y -= 1\r\n \r\nprint(\" \".join(v))\r\n\r\n ", "n = int(input())\r\nleft = 1;\r\nright = n;\r\ncurrent = 0;\r\narray = []\r\ns = \"\"\r\nfor i in range(n):\r\n if i%2==1:\r\n array.append(right)\r\n right-=1\r\n else:\r\n array.append(left)\r\n left+=1\r\n\r\ns = \"\"\r\nfor i in range(len(array)):\r\n s+=str(array[i])+\" \"\r\n\r\nprint(s)", "n=int(input())\r\ni=1\r\nsol=''\r\nturn=True\r\nwhile i<=n:\r\n if turn:\r\n turn=False\r\n sol+=str(i)+' '\r\n i+=1\r\n else:\r\n turn=True\r\n sol+=str(n)+' '\r\n n-=1\r\n \r\nprint(sol)", "from itertools import zip_longest\r\nn = int(input())\r\nz = (n+1)//2\r\nfor p,q in zip_longest(range(1,z+1),range(n,z,-1)):\r\n\tif q:\r\n\t\tprint(p, q, end=' ')\r\n\telse:\r\n\t\tprint(p)", "n=int(input())\r\ni=1\r\nwhile i<=(n//2):\r\n\tprint(i,n-i+1,end=\" \")\r\n\ti+=1\r\nif n%2==1:\r\n\tprint(i)\r\n", "n=int(input())\r\nl=list(range(1,n+1))\r\na=[]\r\nstart=0\r\nend=len(l)-1\r\nwhile(len(a)<len(l)):\r\n a.append(l[start])\r\n a.append(l[end])\r\n start=start+1\r\n end=end-1\r\nif(len(l)%2!=0):\r\n a=a[0:len(a)-1]\r\nprint(*a)", "n=int(input())\r\nif n<=2:\r\n for i in range(1,n+1):\r\n print(i,end=' ')\r\nelse:\r\n i=1\r\n j=n\r\n while i<=j:\r\n if i!=j:\r\n print(i,j,end=' ')\r\n else:\r\n print(i)\r\n i=i+1\r\n j=j-1", "n = int(input())\r\nx, c, s = (n + 1) // 2, 1, 1\r\nwhile x in range(1, n + 1):\r\n print(x, end=' ')\r\n x, c, s = x + c * s, c + 1, s * -1", "n= int(input())\r\nif n%2==0:\r\n l1= [x for x in range(1,n//2+1)]\r\n l2= list(reversed([x for x in range(n//2+1,n+1)]))\r\n m=[]\r\n for i in range(n//2):\r\n m.append(l2[i])\r\n m.append(l1[i])\r\nelse:\r\n l1= [x for x in range(1,n//2+1)]\r\n l2= list(reversed([x for x in range(n//2+1,n)]))\r\n m=[]\r\n m.append(n)\r\n for i in range(n//2):\r\n m.append(l1[i])\r\n m.append(l2[i])\r\nprint(*m)", "n=int(input())\r\nl=[i for i in range(1,n+1)]\r\ni=0\r\nans=[]\r\nj=len(l)-1\r\nwhile i<=j:\r\n if i==j:\r\n ans.append(l[i])\r\n else:\r\n ans.append(l[i])\r\n ans.append(l[j])\r\n i+=1\r\n j-=1\r\nprint(*ans)", "n = int(input())\r\nl = [i for i in range(1, n+1)]\r\nfor i in range(n//2):\r\n print(str(l[i])+\" \"+str(l[-1-i]), end=\" \")\r\nprint(l[n//2] if n%2 != 0 else \"\")", "import math\r\n#t=int(input())\r\n#for i in range(t):\r\nn=int(input())\r\n#n,k = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print('1 2')\r\nelse:\r\n i=1\r\n j=n\r\n while(True):\r\n if i<=math.ceil(n/2):\r\n print(i,end=\" \")\r\n if j>(n-math.floor(n/2)):\r\n print(j,end=\" \")\r\n i+=1\r\n j-=1\r\n if i>=math.ceil(n/2) and j<(n-math.floor(n/2)):\r\n break", "n=int(input())\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(1,2)\r\nelse:\r\n if n%2==0:\r\n k=int(n/2)\r\n for i in range (1,k+1):\r\n print(i,2*k+1-i,end=\" \")\r\n else:\r\n k=int(n/2)\r\n for i in range (1,k+1):\r\n print(i,2*k+2-i,end=\" \")\r\n print( k+1)", "n=int(input())\r\nindex=[x for x in range(1,n+1)]\r\nans=[0]*n\r\nj=0\r\nk=n-1\r\nfor i in range(n):\r\n if i%2==0:\r\n ans[i]=index[j]\r\n j+=1\r\n else:\r\n ans[i]=index[k]\r\n k-=1\r\nprint(*ans)", "n = int(input())\r\nfor i in range(n//2):\r\n print(i+1, n-i)\r\nif n%2:\r\n print(n//2+1)\r\n", "def main():\r\n n = int(input())\r\n l = 1\r\n r = n\r\n while l < r:\r\n print(f'{l} {r}', end=' ')\r\n l += 1\r\n r -= 1\r\n else:\r\n if l == r:\r\n print(f'{l}')\r\n\r\nmain()", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nq = deque([i for i in range(1, n + 1)])\r\nans = []\r\nc = 0\r\nwhile q:\r\n if c:\r\n ans.append(q.pop())\r\n else:\r\n ans.append(q.popleft())\r\n c ^= 1\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n=int(input())\r\na=[]\r\nlarge=n\r\nsmall=1\r\nfor i in range(n):\r\n if i%2==0:\r\n a.append(large)\r\n large-=1\r\n else:\r\n a.append(small)\r\n small+=1\r\nprint(*a)", "n = int(input())\n\narr = []\nt = 1\nk = 0\nfor i in range(1, n+1):\n if i % 2 == 0:\n arr.append(n-k)\n k += 1\n else:\n arr.append(t)\n t += 1\n\nprint(' '.join(map(str, arr)))", "n=int(input())\r\nx=[]\r\nfor i in range((n+1)//2):\r\n x.append(i+1)\r\n x.append(n-i)\r\nif(n%2==1):\r\n print(*x[:n],sep=' ')\r\nelse:\r\n print(*x,sep=' ')\r\n\r\n ", "l=[]\r\nn=int(input())\r\nfor i in range(1,(n//2)+1):\r\n l.append(i)\r\n l.append(n+1-i)\r\nif n%2:l.append((n//2)+1)\r\nprint(*l)", "n = int(input())\r\ni = 1\r\nj = n\r\nt = True\r\nwhile i <= j:\r\n if t:\r\n print(i, end=' ')\r\n i = i + 1\r\n else:\r\n print(j, end=' ')\r\n j = j - 1\r\n t = not t\r\n\r\n", "n=int(input())\r\n\r\n\r\n\r\n\r\ni=1\r\nj=n\r\nans=[]\r\nwhile i<=j:\r\n\tif i==j:\r\n\t\tans.append(i)\r\n\telse:\r\n\t\tans.append(i)\r\n\t\tans.append(j)\r\n\ti+=1\r\n\tj-=1\r\nprint(*ans)", "l,r=map(int,[1]+input().split())\r\nwhile r-l>0:print(l,r,end=' ');l+=1;r-=1\r\nif l==r:print(l)", "n=int(input())\nls=list(range(1,n+1))\nans=[]\nif n%2==0:\n for i in range(n//2):\n ans.append(ls[i])\n ans.append(ls[-i-1])\nelse:\n for i in range(n//2):\n ans.append(ls[i])\n ans.append(ls[-i - 1])\n ans.append(ls[n//2])\nprint(*ans)\n\n \t\t \t \t \t \t \t\t\t \t \t \t\t\t", "from sys import stdin\ninput = stdin.buffer.readline\n\nn = int(input())\nk, c = (n + 1) >> 1, 0\nwhile k + c > 0 and k + c <= n:\n\tprint(k + c)\n\tk += c\n\tif c > 0:\n\t\tc += 1\n\telse:\n\t\tc -= 1\n\tc *= -1\n\t\n", "import sys\r\n\r\nn = int(input())\r\nans = [0 for _ in range(n)]\r\niter = 0\r\n\r\nfor i in range( 0 , n - 1 ,2 ):\r\n ans[i] = iter + 1\r\n ans[i + 1] = n - iter\r\n iter = iter + 1\r\n\r\nif n % 2:\r\n ans[n - 1] = n // 2 + 1\r\nfor i in ans:\r\n sys.stdout.write(str(i) + ' ')\r\nprint()", "from collections import deque\r\n\r\ndef main():\r\n\tn = int(input())\r\n\r\n\tli = deque([i for i in range(1, n + 1)])\r\n\tans = []\r\n\r\n\tflag = False\r\n\twhile li:\r\n\t\tif not flag:\r\n\t\t\tans.append(li.popleft())\r\n\t\t\tflag = True\r\n\t\telse:\r\n\t\t\tans.append(li.pop())\r\n\t\t\tflag = False\r\n\r\n\tprint(*ans)\r\n\r\n\t\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "# cook your dish here\r\nn=int(input())\r\nx=0\r\nm=n\r\na=n-1;\r\nwhile x!=m:\r\n print(n)\r\n if x%2==0:\r\n n=n-a\r\n a-=1\r\n x+=1\r\n else:\r\n n+=a\r\n a-=1\r\n x+=1\r\n ", "# -*- coding: utf-8 -*-\n\"\"\"Untitled58.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Haek7VxDi0TQbwEcEiGX07TDLQNDP7w6\n\"\"\"\n\nn=int(input())\nimport math\nfor i in range(1,math.ceil((n)/2)+1):\n print(i,end=\" \")\n if n-i+1<=n and n-i+1!=i:\n print(n-i+1,end=\" \")\n else:\n break", "n=int(input())\r\nif n//2==n/2:\r\n for i in range(n//2):\r\n print(i+1,end=\" \")\r\n print(n-i,end=\" \")\r\nelse:\r\n for i in range(n//2):\r\n print(i+1,end=\" \")\r\n print(n-i,end=\" \")\r\n print((n//2)+1)\r\n", "n = int(input())\r\nleft = 1\r\nright = n\r\noutput = []\r\nwhile left < right:\r\n output.append(left)\r\n output.append(right)\r\n left+=1\r\n right-=1\r\n\r\nif left==right:\r\n output.append(left)\r\n\r\nprint(*output)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = list(range(1, n+1))\r\ne = []\r\nfor i in range(n//2 + 1):\r\n e.append(d[i])\r\n e.append(d[-i-1])\r\nprint(' '.join(map(str, e[:n])))", "n=int(input())\r\np=list(range(1,n+1))\r\nlk=[]\r\ns=0\r\nm=-1\r\nif n%2!=0:\r\n for x in range(n//2):\r\n lk.append(p[s])\r\n lk.append(p[m])\r\n s+=1\r\n m-=1\r\n lk.append(p[n//2])\r\nelse:\r\n for x in range(n//2):\r\n lk.append(p[s])\r\n lk.append(p[m])\r\n s+=1\r\n m-=1\r\nprint(*lk)", "n = int(input())\r\n\r\ni,j = 1,n\r\n\r\nwhile i<=j:\r\n\tif i<j: print(i,j,end=' ')\r\n\telse: print(i,end=' ')\r\n\ti+=1\r\n\tj-=1", "n = int(input())\nfor i in range(int(n/2)):\n\tprint(i+1,n-i,end = \" \")\nif n%2 != 0:\n\tprint(int(n/2)+1)", "n=int(input())\narr=[None]*n\nlow=1\ntop=n\nfor i in range(n):\n if i%2==0:\n print(low,end=' ')\n low+=1\n else:\n print(top,end=' ')\n top-=1\n\n\t\t \t\t \t \t \t\t\t\t \t \t\t\t \t \t\t\t", "n=int(input())\r\narr=[]\r\nfor i in range(1,n+1):\r\n arr.append(i)\r\nl=0\r\nr=n-1\r\nt=1\r\nwhile(l<=r):\r\n if t%2==1:\r\n t+=1\r\n print(arr[l],end=\" \")\r\n l+=1\r\n else:\r\n t+=1\r\n print(arr[r],end=\" \")\r\n r-=1\r\n", "n = int(input())\r\nl = 1\r\nif n == 1:print(1)\r\nelse:\r\n i = 0\r\n while l != n:\r\n if i & 1:\r\n print(n,end = ' ')\r\n n -= 1\r\n else :\r\n print(l,end = ' ')\r\n l += 1\r\n i += 1\r\n print(l)", "n = int(input())\nfor i in range(n):\n print(n-i//2 if i%2 else i//2+1, end=' ')\n", "n = int(input())\r\ni = 1\r\nj = 1\r\nwhile i <= n:\r\n if j % 2 == 1:\r\n print(i, end=\" \")\r\n i += 1\r\n else:\r\n print(n, end=\" \")\r\n n -= 1\r\n j += 1#moondance bobfut.near", "n = int(input())\r\n\r\n\r\ni, j = 1, n\r\nroute = []\r\nwhile i <= j:\r\n route.append(i)\r\n if i != j:\r\n route.append(j)\r\n i += 1\r\n j -= 1\r\n\r\n\r\nprint(' '.join(map(str, route)))\r\n\r\n ", "n = int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n i = 1\r\n j = n\r\n c = 0\r\n lst = [] \r\n while i<=j:\r\n if c%2==0:\r\n lst.append(i)\r\n i+=1\r\n else:\r\n lst.append(j)\r\n j-=1\r\n c+=1\r\n \r\n print(*lst)", "n = int(input())\r\n\r\nans = [0] * n\r\nans[::2] = list(range(1, (n + 1) // 2 + 1))\r\nans[1::2] = list(range((n + 1) // 2 + 1, n + 1))[::-1]\r\n\r\nprint(*ans)\r\n", "n = int(input())\r\nfrom collections import deque\r\nq = list(range(1, n+1))\r\nq = deque(q)\r\nans = []\r\nfor i in range(n):\r\n if i%2 == 0:\r\n ans.append(q.popleft())\r\n else:\r\n ans.append(q.pop())\r\nprint(*ans)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(1,n//2+1):l+=[i,n+1-i]\r\nif n%2:l+=[n//2+1]\r\nprint(*l)", "#53C\r\nn = int(input())\r\nfor i in range(n):\r\n print(i//2 + 1 if i%2 == 0 else n - i//2, end= \" \")\r\n", "n = int(input())\ni, j = 1, n\nwhile i < j:\n print(i, j, end=\" \")\n i += 1\n j -= 1\n\nif n % 2 == 1:\n print(i)", "n = int(input())\r\nl=1\r\nr=n\r\nwhile l<r:\r\n print(l,end=' ')\r\n print(r,end=' ')\r\n l+=1\r\n r-=1\r\nif l==r:\r\n print(l)\r\n \r\n \r\n", "def solve():\r\n n=int(input())\r\n nums=[i for i in range(1,n+1)]\r\n nums.sort()\r\n l = 0\r\n r =len(nums) -1 \r\n ans = []\r\n while l<r:\r\n ans.append(nums[l])\r\n ans.append(nums[r])\r\n \r\n l+=1\r\n r-=1\r\n if len(ans) < len(nums):\r\n ans.append(nums[l])\r\n \r\n print(*ans)\r\nsolve()", "n=int(input())\r\nll=[]\r\n\"\"\"if n&1:\r\n t=n//2\r\n i,j=1,n\r\n while t>0:\r\n ll.append(i)\r\n ll.append(j)\r\n i+=1\r\n j-=1\r\n t-=1\r\n ll.append((n//2)+1)\r\nelse:\r\n t=n//2\r\n i,j=1,n\r\n while t>0:\r\n ll.append(i)\r\n ll.append(j)\r\n i+=1\r\n j-=1\r\n t-=1\"\"\"\r\ni,j=1,n\r\nwhile n>0:\r\n ll.append(i)\r\n i+=1\r\n n-=1\r\n if n>0:\r\n ll.append(j)\r\n n-=1\r\n j-=1\r\nprint(*ll)", "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\ndef pos(su,le):\r\n if(su>=0 and su<=(9*le)):\r\n return 1\r\n return 0\r\nwhile(t):\r\n t-=1\r\n n=inp()\r\n i=1\r\n j=n\r\n while(i<=j):\r\n print(i,end=' ')\r\n i+=1\r\n if(i>j):\r\n break\r\n print(j,end=' ')\r\n j-=1\r\n", "n=int(input())\r\nans=[0]*n\r\nl=1\r\nr=n\r\ni=0\r\nwhile i<n:\r\n if i%2==0:\r\n ans[i]=l\r\n l=l+1\r\n else:\r\n ans[i]=r\r\n r=r-1\r\n i=i+1\r\nfor i in ans:\r\n print(i,end=\" \")\r\n", "import sys\r\n\r\nN = int(input())\r\n\r\nid = 0\r\nans = [0 for _ in range(N) ]\r\n\r\nfor i in range(0, N - 1, 2):\r\n ans[i] = id + 1;\r\n ans[i + 1] = N - id\r\n id = id + 1\r\n\r\nif N % 2 == 1:\r\n ans[N - 1] = N // 2 + 1\r\n\r\nfor i in ans:\r\n sys.stdout.write(str(i) + \" \")\r\nprint()", "N = int( input() )\r\nans = [ 1 ]\r\nfor i in range( 1, N, 1 ):\r\n if len( ans ) & 1:\r\n ans.append( ans[ len( ans ) - 1 ] + ( N - i ) )\r\n else:\r\n ans.append( ans[ len( ans ) - 1 ] - ( N - i ) )\r\nprint( * ans )\r\n", "n=int(input())\r\nif n==1:\r\n print(1)\r\n exit()\r\nx1,x2=1,n\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n print(x1,end=\" \")\r\n x1+=1\r\n else:\r\n print(x2,end=\" \")\r\n x2-=1\r\n\r\n", "n = int(input())\r\ntemp = []\r\nfor i in range(0,n):\r\n temp.append(i+1)\r\nl = 0\r\nr = n - 1\r\noutput = [None] * n\r\ncount=0\r\nwhile(l <= r):\r\n if(count+1<n):\r\n output[count] = temp[l]\r\n output[count+1] = temp[r]\r\n else:\r\n output[count] = temp[l]\r\n\r\n count+=2\r\n l+=1\r\n r-=1\r\n \r\nfor x in range(len(output)-1):\r\n print(output[x],end=\" \")\r\nprint(output[len(output)-1])", "n = int(input())\r\n\r\nk = 1\r\nj = n\r\n\r\n\r\nans = [0] * n\r\n\r\nfor i in range(0 , n , 2):\r\n\tans[i] = k\r\n\tk += 1\r\n\r\nfor i in range(1 , n , 2):\r\n\tans[i] = j\r\n\tj -= 1\r\n\r\nprint(*ans)", "import sys\r\nn = int(input())\r\nfor i in range((n- n % 2)// 2 ):\r\n print(i + 1, n - i, end = ' ')\r\nif n % 2: print(n // 2 + 1)", "a=int(input())\r\nl=1\r\nr=a\r\nans=[1]\r\nwhile(len(ans)!=a):\r\n i=len(ans)\r\n if(i%2==1):\r\n ans.append(r)\r\n r-=1\r\n else:\r\n ans.append(l+1)\r\n l+=1\r\nprint(*ans)\r\n", "n = int(input())\r\nx,y,q,s = 1,n,True,[]\r\nwhile x <= y:\r\n if q:\r\n q = False\r\n s.append(x)\r\n x += 1\r\n else:\r\n q = True\r\n s.append(y)\r\n y -= 1\r\nprint(*s)", "import sys\n\ninput = sys.stdin.readline\n\nright = int(input())\nleft = 1\nwhile left < right: # Ratame pokym sa nestretneme v strede\n print(left, right, end = \" \")\n left += 1\n right -= 1\nif left == right:\n print(left)\n", "n = int(input())\r\n\r\nbegin = (n+1) // 2\r\ncurrent = begin\r\nd = 0\r\nsign = -1\r\nplan = []\r\nwhile current > 0 and current <= n:\r\n plan.append(str(current))\r\n d += 1\r\n sign *= -1\r\n current += sign*d\r\n \r\n \r\nprint(\" \".join(plan))", "t=int(input())# testcases\r\nl=1 \r\nr=t\r\nres=[]\r\nwhile l<=r:\r\n if l==r:\r\n res.append(l)\r\n print(*res)\r\n exit(0)\r\n else:\r\n res.append(l)\r\n res.append(r)\r\n l+=1\r\n r-=1\r\nprint(*res)", "# https://codeforces.com/contest/53/problem/C\r\n\r\ndef solve():\r\n n: int = int(input())\r\n jump: int = n - 1\r\n\r\n route: list[int] = [1]\r\n for i in range(1, n):\r\n if i & 1:\r\n route.append(route[i - 1] + jump)\r\n else:\r\n route.append(route[i - 1] - jump)\r\n jump -= 1\r\n\r\n print(*route, sep=' ')\r\n\r\n\r\ndef main():\r\n t: int = 1\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "num =int(input())\r\n\r\nl=1\r\nr=num\r\n\r\nwhile l<r:\r\n print(l,end=\" \")\r\n print(r,end=\" \")\r\n l+=1\r\n r-=1\r\nif num%2==1:\r\n print(l)\r\n\r\n", "n = int(input())\r\nx = 0\r\ny = n + 1\r\nfor i in range(1, n+1):\r\n if i % 2 != 0:\r\n x = x + 1\r\n print(x)\r\n else:\r\n y = y - 1\r\n print(y)", "n=int(input())\r\nl=1\r\nr=n\r\nx=0\r\nans=[]\r\nwhile l<=r:\r\n if x%2!=0:\r\n ans.append(r)\r\n r-=1\r\n else:\r\n ans.append(l)\r\n l+=1\r\n x+=1\r\nprint(*ans)\r\n ", "n = int(input())\r\nl = 1\r\nr = n\r\n\r\nfor i in range(n):\r\n if not(i&1):\r\n print(l, end = \" \")\r\n l += 1\r\n else:\r\n print(r, end = \" \")\r\n r -= 1\r\n", "'''\r\n2 \r\n\r\n1 2\r\n====\r\n3\r\ndiff = 2\r\n1 1\r\n1 + 2 3\r\n\r\n1 + 2 - 1 2\r\n=========\r\n\r\n4\r\ndiff = 3\r\n 1 \r\n1 + 3 = 4\r\n\r\n4 - 2 = 2\r\n\r\n2 + 1 = 3\r\n\r\n1 4 2 3\r\n========\r\n5\r\ndiff = 4\r\n\r\n1 \r\n1 + 4 = 5\r\n5 - 3 = 2\r\n2 + 2 = 4\r\n4 - 1 = 3\r\n\r\n1 5 2 4 3\r\n=========\r\n\r\n\r\n\r\n\r\n\r\n'''\r\n\r\nn = int(input())\r\nroutes = []\r\n\r\nroutes.append(1)\r\n\r\npos = True\r\ndiff = n - 1\r\nfor i in range(1,n):\r\n if pos:\r\n routes.append(routes[i-1] + diff)\r\n pos = False\r\n else:\r\n routes.append(routes[i-1] - diff)\r\n pos = True\r\n diff -= 1\r\n\r\nprint(*routes)", "n=int(input())\r\na=[0]*n\r\ni=1\r\nj=n\r\nfor z in range(n):\r\n print(i,end=' ')\r\n i+=1\r\n if i>j:break\r\n print(j,end=' ')\r\n j-=1\r\n if i>j:break", "l, r = 1, int(input())\r\n\r\nwhile l < r:\r\n print(l, r, end=\" \")\r\n l += 1\r\n r -= 1\r\n\r\nif l == r:\r\n print(l)", "n = int(input())\r\nx = 1\r\ny = n\r\nwhile 1:\r\n if x > n // 2:\r\n if n % 2: print(x)\r\n break\r\n print(x, y, end = \" \")\r\n x += 1\r\n y -= 1", "import sys\r\nn = int(input())\r\nans = [0 for _ in range(n)]\r\niter = 0\r\nfor i in range( 0 , n - 1 ,2 ):\r\n ans[i], ans[i + 1] = iter + 1, n - iter\r\n iter = iter + 1\r\nif n % 2: ans[n - 1] = n // 2 + 1\r\nfor i in range(n):\r\n sys.stdout.write(str(ans[i]) + ' ')\r\nprint()", "import math\r\nn=int(input())\r\nl=[i+1 for i in range(n)]\r\nl2=[]\r\nfor i in range(int(n/2)):\r\n l2.append(l[i])\r\n l2.append(l[-(i+1)])\r\nif n%2==1:\r\n l2.append(math.ceil(n/2))\r\nprint(*l2)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\nd = n - 1 \r\nans = [1] \r\nv = [0] * (n + 1)\r\nfor i in range(n - 1):\r\n if(ans[-1] + d <= n and not v[ans[-1] + d]):\r\n ans.append(ans[-1] + d) \r\n v[ans[-1]] = 1\r\n else:\r\n ans.append(ans[-1] - d) \r\n v[ans[-1]] = 1\r\n d -= 1 \r\nprint(*ans)", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n current_ = 1\r\n direction_plus = True\r\n dif = n - 1\r\n for i in range(n):\r\n if i == 0:\r\n print(1, end=\" \")\r\n elif i != n - 1:\r\n if direction_plus:\r\n print(dif + current_, end=\" \")\r\n current_ += dif\r\n\r\n else:\r\n print(current_ - dif, end=\" \")\r\n current_ -= dif\r\n dif -= 1\r\n direction_plus = not direction_plus\r\n else:\r\n if direction_plus:\r\n print(dif + current_)\r\n current_ += dif\r\n\r\n else:\r\n print(current_ - dif,)\r\n current_ -= dif\r\n dif -= 1\r\n direction_plus = not direction_plus\r\n\r\n\r\n\r\n\r\nmain_function()", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n=int(input())\r\n l,r=1,n\r\n while l<r:\r\n print(l,end=' ')\r\n print(r,end=' ')\r\n l+=1\r\n r-=1\r\n if l==r:\r\n print(l)", "from collections import Counter\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tcurr = 1\r\n\tdirc = 1 \r\n\tprint(curr, end = \" \")\r\n\tfor jump in range(n-1,0,-1):\r\n\t\tcurr = curr+dirc*jump\r\n\t\tprint(curr, end = \" \")\r\n\t\tdirc *= -1\r\n", "\r\nn = int(input())\r\n\r\nstart = 1\r\nend = n\r\nhelp = True\r\n\r\nfor i in range(n):\r\n if help:\r\n print(start, end = \" \")\r\n start += 1\r\n help = False\r\n else:\r\n print(end, end = \" \")\r\n end -= 1\r\n help = True", "n=int(input())\r\nfor i in range(1,n//2+1):\r\n print(i,n-i+1,end=' ')\r\nif n%2:\r\n print((n+1)//2)\r\n", "n=int(input())\r\na=[]\r\nc=n+1\r\nd=n\r\nfor i in range(n):\r\n if i%2==0:\r\n c=c-d\r\n a.append(c)\r\n else:\r\n c=c+d\r\n a.append(c)\r\n d=d-1\r\nfor i in range(n):\r\n print(a[i],end=\" \")\r\n", "#rOkY\r\n\r\nt=int(input())\r\nf=1\r\nm=1\r\nx=t\r\nsum=0\r\ns=\"\"\r\nwhile(m<=x):\r\n if(m==x):\r\n print(m)\r\n break\r\n else:\r\n print(m,end=\" \")\r\n print(x,end=\" \")\r\n m+=1\r\n x-=1\r\n\r\n \r\n" ]

[ "n = int(input())\nt = [0] * n\nout = 0\nfor _ in range(n-1):\n\ta, b = input().split(' ')\n\ta, b = [int(a), int(b)]\n\tt[a-1] += 1\n\tt[b-1] += 1\nfor x in t:\n\tout += x * (x-1) / 2\nprint(int(out))\n", "n = int(input())\r\nd = [0] * (n + 1)\r\nfor _ in range(n - 1):\r\n x, y = map(int, input().split())\r\n d[x] += 1\r\n d[y] += 1\r\ns = 0\r\nfor x in range(1, n + 1):\r\n s += d[x] * (d[x] - 1)\r\nprint(s // 2)\r\n", "n = int(input())\r\na = [0]*(n+1)\r\nfor _ in range(n-1):\r\n x, y = input().split(' ')\r\n x, y = [int(x), int(y)]\r\n a[x] += 1\r\n a[y] += 1\r\nto = 0\r\nfor x in a:\r\n to += (x * (x-1))//2\r\nprint(to)", "n = int(input())\r\ndeg = [0 for _ in range(n)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n deg[a] += 1\r\n deg[b] += 1\r\nans = 0\r\nfor x in deg:\r\n ans += x * (x - 1) // 2\r\nprint(ans)\r\n", "I=input\r\nd=[0]*10010\r\nfor _ in '0'*(int(I())-1):x,y=map(int,I().split());d[x]+=1;d[y]+=1\r\nprint(sum(i*(i-1)for i in d)//2)", "d = {}\r\nfor i in range(int(input()) - 1):\r\n for q in input().split(): d[q] = d.get(q, 0) + 1\r\nprint(sum(k * k - k for k in d.values()) // 2)", "o = {}\r\nn = int(input())\r\nfor _ in range(n-1):\r\n one, two = map(int, input().split())\r\n if o.get(one):\r\n o[one] += 1\r\n else:\r\n o[one] = 1\r\n \r\n if o.get(two):\r\n o[two] += 1\r\n else:\r\n o[two] = 1\r\n\r\n# print(o)\r\n\r\n\r\ntrees = 0\r\nfor key, value in o.items():\r\n trees += int(((value-1)/2)*(1+(value-1)))\r\nprint(trees)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "'''\r\n4\r\n1 2\r\n1 3\r\n1 4\r\n'''\r\n#every edge is goes always from lower --> higher\r\nn = int(input())\r\nadjacencyList = []\r\nfor i in range(n):\r\n adjacencyList.append(set())\r\n\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n a-=1\r\n b-=1\r\n adjacencyList[a].add(b)\r\n adjacencyList[b].add(a)\r\n\r\nlifeLines = []\r\nfor i in range(n):\r\n total = 0\r\n for node in adjacencyList[i]:\r\n total += len(adjacencyList[node])-1\r\n lifeLines.append(total)\r\n\r\nprint(sum(lifeLines)//2)\r\n ", "n=int(input())\r\np=[[]]\r\nt=[0]\r\no=[[]]\r\nfor i in range(n):\r\n p.append([])\r\n t.append(0)\r\n o.append([])\r\nfor i in range(n-1):\r\n a=input().split()\r\n b=int (a[0])\r\n c=int(a[1])\r\n p[b].append(c)\r\n p[c].append(b)\r\n t[b]+=1\r\n t[c]+=1\r\ny=0\r\nfor i in range(1,n+1):\r\n j=p[i]\r\n for k in range(t[i]):\r\n jj=j[k]\r\n y=y+t[jj]-1\r\nprint(int(y/2))\r\n\r\n", "def computeDegrees(n):\n degrees = [0 for vertex in range(n)]\n for edge in range(n-1):\n v1, v2 = map(int, input().split())\n degrees[v1-1] += 1\n degrees[v2-1] += 1\n return degrees\n\ndef computeNumberOfLength2Paths(degrees, n):\n return int(sum(d**2 for d in degrees)/2 - n + 1)\n\n\nif __name__ == '__main__':\n n = int(input())\n degrees = computeDegrees(n)\n print(computeNumberOfLength2Paths(degrees, n))\n", "from collections import defaultdict\r\ndef main():\r\n count = int(input())\r\n tree = defaultdict(list)\r\n for _ in range(count-1):\r\n a,b = map(int,input().split())\r\n tree[a].append(b)\r\n tree[b].append(a)\r\n print(sum([(len(v)*(len(v)-1))//2 for k,v in tree.items()]))\r\n return True\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "def main():\n n = int(input())\n l = [0] * (n + 1)\n for _ in range(n - 1):\n a, b = map(int, input().split())\n l[a] += 1\n l[b] += 1\n res = 0\n for x in l:\n res += x * (x - 1)\n print(res // 2)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [0 for _ in range(n)]\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n d[a-1] += 1\r\n d[b-1] += 1\r\n\r\nprint(sum(i*(i-1)//2 for i in d))", "n = int(input())\nd = dict()\nfor i in range(n):\n d[i+1] = []\nfor i in range(n-1):\n u,v = map(int,input().split())\n d[u].append(v)\n d[v].append(u)\n \ne = dict()\nfor i in range(1,n+1,1):\n u = d[i]\n v = []\n for c in u:\n w = d[c]\n for z in w:\n if z!=i:\n v.append(z)\n e[i] = v \n \ncnt = 0 \nfor c in e.keys():\n cnt += len(e[c])\nprint(cnt//2)", "n = int(input())\nm = n - 1\ncn = {}\nfor i in range(1, n+1):\n cn[i] = set()\nfor _ in range(m):\n a, b = map(int, input().split())\n cn[a].add(b)\n cn[b].add(a)\nans = 0\nfor i in range(1, n+1):\n ans += sum(len(cn[c]) for c in cn[i]) - len(cn[i])\n\nprint(ans // 2)\n", "n = int(input())\nt = [0] * n\nfor _ in range(n-1):\n\ta, b = input().split(' ')\n\ta, b = [int(a), int(b)]\n\tt[a-1] += 1\n\tt[b-1] += 1\nout = [(e * (e-1)) / 2 for e in t]\nprint(int(sum(out)))\n", "n = int(input())\r\nbounds_amount = [-1]*n\r\nfor _ in range(n-1):\r\n for el in map(int, input().split(' ')): bounds_amount[el-1] += 1\r\nprint(sum(map(lambda x: (x*(x+1))//2, bounds_amount)))", "import math\r\nn=int(input())\r\nl=[0]*(n+1)\r\n# print(*l)\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n l[a]+=1\r\n l[b]+=1\r\nans=0\r\nfor i in range(1,n+1):\r\n if l[i]>=2:\r\n ans+=math.comb(l[i],2)\r\nprint(ans)", "n = int(input())\r\na = [0]*(n+1)\r\nfor _ in range(n-1):\r\n x, y = input().split(' ')\r\n x, y = [int(x), int(y)]\r\n a[x] += 1\r\n a[y] += 1\r\ntoo = 0\r\nfor x in a:\r\n too += (x * (x-1))//2\r\nprint(too)\r\n", "def computeDegrees(n):\n degrees = [0 for vertex in range(n)]\n for edge in range(n-1):\n v1, v2 = map(int, input().split())\n degrees[v1-1] += 1\n degrees[v2-1] += 1\n return degrees\n\ndef computeNumberOfLength2Paths(degrees):\n return int( sum(d*(d-1) for d in degrees)/2 )\n\n\nif __name__ == '__main__':\n n = int(input())\n degrees = computeDegrees(n)\n print(computeNumberOfLength2Paths(degrees))\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\ng = [list() for i in range(n + 1)]\r\nfor i in range(n - 1):\r\n a, b = read()\r\n g[a].append(b)\r\n g[b].append(a)\r\n\r\ncnt = 0\r\nfor i in range(n + 1):\r\n k = len(g[i])\r\n cnt += k * (k - 1) // 2\r\nprint(cnt)\r\n", "#from random import randrange\r\n#import time\r\n \r\n#class Profiler(object):\r\n #def __enter__(self):\r\n # self._startTime = time.time()\r\n \r\n #def __exit__(self, type, value, traceback):\r\n # print (\"Elapsed time: {:.10f} sec\".format(time.time() -self._startTime))\r\n\r\n#masa = [randrange(1, 10000) for i in range(10000)]\r\n#masb = [randrange(1, 10000) for i in range(10000)]\r\n\r\n \r\ndef UpperBound(A, key): \r\n left = -1 \r\n right = len(A) \r\n while right > left + 1: \r\n middle = (left + right) // 2 \r\n if A[middle] > key: \r\n right = middle \r\n else: \r\n left = middle\r\n \r\n return right\r\nn=int(input())\r\nmasa=[]\r\nmasb=[]\r\nmas=[]\r\nfor i in range(n-1):\r\n mas.append(input().split())\r\ns=0 \r\n#with Profiler() as p:\r\n # mas= [(100, 67), (1, 2), (4, 5)]\r\nfor i in range(n-1):\r\n masa.append(int(mas[i][0]))\r\n masb.append(int(mas[i][1]))\r\n#with Profiler() as p:\r\n #masa=sorted(masa, key=lambda x: x[:-1])\r\nmasa.sort()\r\nmasb.sort()\r\n#with Profiler() as p:\r\n #for i in range(1000):\r\n # masb[i]\r\n #masa=[1,1,1]\r\n #masb=[3,4,2]\r\n \r\n #print(UpperBound(ma, 2)) #return 4\r\nfor i in range(len(masb)):\r\n foun=UpperBound(masa,masb[i])\r\n xx=masa[i:foun].count(masb[i])\r\n s=s+xx\r\n #print(xx)\r\n #print(s)\r\nfor i in range(len(masa)): \r\n foun=UpperBound(masa,masa[i])\r\n xx=masa[i+1:foun].count(masa[i])\r\n s=s+xx\r\n #print(xx)\r\nfor i in range(len(masa)): \r\n foun=UpperBound(masb,masa[i]) \r\n xx=masb[i+1:foun].count(masa[i]) \r\n s=s+xx\r\nfor i in range(len(masb)): \r\n foun=UpperBound(masb,masb[i])\r\n xx=masb[i+1:foun].count(masb[i])\r\n s=s+xx\r\n\r\nprint(s)", "a=int(input());b=[0]*(a+1)\r\nfor _ in \" \"*(a-1):u,v=map(int,input().split());b[u]+=1;b[v]+=1\r\nprint(sum((i*(i-1))//2 for i in b))", "# Test\r\n#####################################################################################################################\r\n\r\ndef main():\r\n tree_sLength = int(input()) - 1\r\n tree = {}\r\n for i in range(tree_sLength):\r\n v1, v2 = map(int, input().split())\r\n tree[v1] = tree.get(v1, ()) + (v2, )\r\n tree[v2] = tree.get(v2, ()) + (v1, )\r\n\r\n return nLifeLines(tree)\r\n\r\n\r\ndef nLifeLines(tree):\r\n return sum(subTree_snLifeLines(len(tree[x])) for x in tree)//2\r\n\r\n\r\ndef subTree_snLifeLines(nBranches):\r\n return nBranches*(nBranches - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n" ]

[ "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [0]*5\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d[a-1] += 1\r\n d[b-1] += 1\r\nif d.count(2) == 5:\r\n print('FAIL')\r\nelse:\r\n print('WIN')\r\n", "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 = ii1()\r\nc = [0] * 5\r\nfor _ in range(n):\r\n a, b = iia()\r\n c[a - 1] += 1\r\n c[b - 1] += 1\r\nif c.count(2) != 5:\r\n print(\"WIN\")\r\nelse:\r\n print(\"FAIL\")\r\n", "from collections import defaultdict\r\nfrom itertools import combinations\r\nn = int(input())\r\ngraph = defaultdict(set)\r\nrev_graph = defaultdict(set)\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n graph[x].add(y)\r\n graph[y].add(x)\r\n\r\nfor k, v in graph.items():\r\n rev_graph[k] = set(i for i in range(1, 5+1) if i != k and i not in v)\r\n\r\n\r\ndef check(a, b, c, g):\r\n for e in g[a]:\r\n if e == b or e == c:\r\n return False\r\n\r\n for e in g[b]:\r\n if e == a or e == c:\r\n return False\r\n\r\n for e in g[c]:\r\n if e == a or e == b:\r\n return False\r\n\r\n return True\r\n\r\n\r\nfor a, b, c in combinations(range(1, 6), 3):\r\n if check(a, b, c, graph) or check(a, b, c, rev_graph):\r\n print('WIN')\r\n exit()\r\n\r\nprint('FAIL')\r\n\r\n \r\n\r\n \r\n ", "n = int(input())\r\nfriends = {}\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a in friends:\r\n friends[a].append(b)\r\n else:\r\n friends[a] = [b]\r\n if b in friends:\r\n friends[b].append(a)\r\n else:\r\n friends[b] = [a]\r\n'''print(friends)\r\nfor k in friends:\r\n print(friends[k], k)'''\r\nco = False\r\nfor each in friends:\r\n if len(friends[each]) != 2:\r\n co = True\r\nif co or len(friends) < 5:\r\n print(\"WIN\")\r\nelse:\r\n print(\"FAIL\")\r\n", "'''\n\tRohit Kumar Vishwas\n\t13th June 2021\n'''\n\nimport sys, math,os.path\nfrom collections import *\nfrom queue import *\nfrom bisect import *\nfrom heapq import *\n# sys.setrecursionlimit(10 ** 6)\nMOD = int(1e9 + 7)\ninf = float('inf')\nninf = float('-inf')\n\ninput = sys.stdin.buffer.readline\ndef ii(): return list(map(int, input().strip().split()))\ndef deb(a, b=\"Debugging\"): print(b, *a) if os.path.exists('inp.txt') else \"\"\n\nm,= ii()\ngraph=[[]for _ in range(5)]\nfor _ in range(m):\n\tu,v= ii()\n\tgraph[u-1].append(v-1)\n\tgraph[v-1].append(u-1)\nfl= 0\nfor i in range(5):\n\tfor j in range(i+1,5):\n\t\tfor k in range(j+1,5):\n\t\t\tif j in graph[i] and j in graph[k] and k in graph[i]:\n\t\t\t\tfl = 1\n\t\t\telif j not in graph[i] and j not in graph[k] and k not in graph[i]:\n\t\t\t\tfl = 1\n\nprint(\"WIN\") if fl == 1 else print(\"FAIL\")", "from collections import defaultdict, Counter\r\n\r\nn = int(input())\r\nconnections = defaultdict(dict)\r\n\r\n\r\ndef is_true(connections):\r\n for i in range(1,6):\r\n children = connections[i]\r\n # print(\"children : \", children)\r\n for j in range(1, 6):\r\n if j != i:\r\n if j in children:\r\n # print(f\"{j} in children\")\r\n for x in connections[j].keys():\r\n if i in connections[x]:\r\n # print(f\"x is {x}\")\r\n return \"WIN\"\r\n else:\r\n # print(f\"{j} not in children\")\r\n for node in range(1,6):\r\n if node != j and node != i and i not in connections[node] and j not in connections[node]: \r\n # print(f\"node is {node}\")\r\n return \"WIN\"\r\n return \"FAIL\"\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n connections[l][r] = 1\r\n connections[r][l] = 1\r\n\r\nprint(is_true(connections))\r\n\r\n\r\n ", "#Friends https://codeforces.com/problemset/problem/94/B\r\n\r\n\r\ndef problem_d():\r\n relation = int(input())\r\n members = [0]*5\r\n \r\n for i in range(relation):\r\n a, b = map(int, input().split())\r\n members[a-1] += 1\r\n members[b-1] += 1\r\n \r\n if members.count(2) == 5:\r\n print('FAIL')\r\n else:\r\n print('WIN')\r\n\r\nproblem_d()", "\r\n# Problem: B. Friends\r\n# Contest: Codeforces - Codeforces Beta Round #76 (Div. 2 Only)\r\n# URL: https://codeforces.com/contest/94/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\nar = [False]*5\r\nfor i in range(n):\r\n\ta,b = get_ints()\r\n\tar[a-1]+=1\r\n\tar[b-1]+=1\r\n# print(ar)\r\nb = [1,3,0,4]\r\nif any(x in b for x in ar):\r\n\tprint(\"WIN\")\r\nelse:\r\n\tprint(\"FAIL\")", "#https://codeforces.com/problemset/problem/94/B\n\ndef main():\n\t''' if we visualize friends and relations as a graph, \n\tany triangle or any missing triangle would represent a WIN\n\tthe only way that this can not happen is if every node has exactly \n\tto relations. furthermore, in order for this to happen there has to be\n\texactly 5 relations'''\n\n\tn = int(input())\n\tif n != 5:\n\t\tprint(\"WIN\")\n\telse:\n\t\trelations_per_node = [0,0,0,0,0]\n\t\tfor i in range(n):\n\t\t\tfriend1, friend2 = (int(f) for f in input().split())\n\t\t\trelations_per_node[friend1-1] += 1\n\t\t\trelations_per_node[friend2-1] += 1\n\n\t\tfor i in range(5):\n\t\t\tif relations_per_node[i] != 2:\n\t\t\t\tprint(\"WIN\")\n\t\t\t\tbreak\n\t\telse:\n\t\t\tprint(\"FAIL\")\n\n\n\nif __name__ == '__main__':\n\tmain()\n \t\t\t \t\t \t \t\t \t \t \t\t \t \t \t\t", "# Time Complexity: O(n)\n# Space Complexity: O(n)\n# The solution iterates every edge and form an adjacent list in O(m).\n# It checks for a node with outgoing degrees not equal to 2 in O(n).\n# There are only two situations where a graph of 5 nodes do not have 3 pairwise\n# acquainted or 3 pairwise unacquainted people. Those graphs forms either form\n# a pentagon or a star.\nm = int(input())\nadj = [[] for i in range(5)]\nfor _ in range(m):\n u, v =map(lambda x: int(x) - 1, input().split())\n adj[u].append(v)\n adj[v].append(u)\n\nfor i in range(5):\n if len(adj[i]) != 2:\n print(\"WIN\")\n exit()\nprint(\"FAIL\")\n\t\t\t\t\t\t\t\t\t\t \t \t\t \t\t\t\t \t \t\t \t", "m = int(input().strip())\n\narray = [[ False for i in range(1,7)] for j in range(1,7)]\n# print(array)\n\nwhile(m):\n x,y = map(int, input().strip().split())\n array[x][y] = True\n array[y][x] = True\n m-=1\n\nflag = 0\nfor i in range(1,6):\n for j in range(1,i):\n for k in range(1,j):\n if((array[i][j] and array[i][k] and array[j][k]) or (not array[i][j] and not array[j][k] and not array[i][k])):\n print(\"WIN\")\n flag = 1\n break\n if(flag==1):\n break\n if(flag==1):\n break\n\nif(flag==0):\n print(\"FAIL\")", "m = int(input())\r\n\r\na = [[False] * 6 for _ in range(6)]\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n a[x][y] = a[y][x] = True\r\n\r\nfor i in range(1, 4):\r\n for j in range(i+1, 5):\r\n for k in range(j+1, 6):\r\n if ((a[i][j] and a[i][k] and a[j][k]) or \r\n (not a[i][j] and not a[i][k] and not a[j][k])):\r\n print(\"WIN\")\r\n exit()\r\n\r\nprint(\"FAIL\")\r\n", "m=int(input())\r\nn={}\r\nn[5]=0\r\nn[4]=0\r\nn[3]=0\r\nn[2]=0\r\nn[1]=0\r\n\r\nfor i in range(m):\r\n g=input().split()\r\n n[int(g[0])]+=1\r\n n[int(g[1])]+=1\r\nif n[1]==n[2]==n[3]==n[4]==n[5]==2:\r\n print('FAIL')\r\n exit()\r\nprint('WIN') \r\n", "R=lambda:map(int,input().split())\r\nimport math as m\r\nt,=R()\r\na=[]\r\nfor i in range(t):\r\n x,y=R()\r\n a.append(x)\r\n a.append(y)\r\nif(a.count(1)==2 and a.count(2)==2 and a.count(3)==2 and a.count(4)==2 and a.count(5)==2):\r\n print(\"FAIL\")\r\nelse:\r\n print(\"WIN\")", "from collections import defaultdict\r\nm=int(input())\r\ngraph=defaultdict(list)\r\n\r\nfor i in range(m):\r\n a,b=[int(x) for x in input().split()]\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nli=[[1,2,3],[1,2,4],[1,2,5],\r\n [1,3,4],[1,3,5],[1,4,5],\r\n [2,3,4],[2,3,5],[2,4,5],\r\n [3,4,5]]\r\n\r\nf=0\r\nfor l in li:\r\n if l[0] in graph[l[1]] and l[0] in graph[l[2]] and l[1] in graph[l[2]]:\r\n f=1\r\n break\r\n if l[0] not in graph[l[1]] and l[0] not in graph[l[2]] and l[1] not in graph[l[2]]:\r\n f=1\r\n break\r\n\r\nif f==1:\r\n print(\"WIN\")\r\nelse:\r\n print(\"FAIL\")\r\n", "from collections import defaultdict\r\nfrom sys import exit\r\nclass Graph:\r\n def __init__(self):\r\n self.adj=defaultdict(list)\r\n def add_edge(self,x,y):\r\n self.adj[x].append(y)\r\n self.adj[y].append(x)\r\n def check(self):\r\n for i in range(1,6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if j not in self.adj[i] and k not in self.adj[j] and i not in self.adj[k]:\r\n print(\"WIN\")\r\n exit(0)\r\n if j in self.adj[i] and k in self.adj[j] and i in self.adj[k]:\r\n print(\"WIN\")\r\n exit(0)\r\n print(\"FAIL\")\r\ng=Graph()\r\nn=int(input())\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n g.add_edge(x,y)\r\ng.check()", "import itertools\nimport functools\nfrom functools import reduce\ndef is_there_triangle(tuples):\n\t# takes in a tuple list and returns whether there is triangle or not\n\tcombinations = itertools.combinations(tuples, 3)\n\tcombinations_sizes = [len(set(functools.reduce(lambda c, d: c + d, [list(y) for y in list(x)], []))) for x in combinations]\n\tif 3 in combinations_sizes:\n\t\treturn True\n\telse:\n\t\treturn False\n\nall_tuples = {(1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)}\nn = int(input())\ntuples1 = []\nfor _ in range(n):\n\ttuples1.append(tuple(sorted([int(x) for x in input().split()])))\ntuples2 = list(all_tuples - set(tuples1))\nif(is_there_triangle(tuples1) or is_there_triangle(tuples2)):\n\tprint(\"WIN\")\nelse:\n\tprint(\"FAIL\")", "from collections import Counter\r\n\r\nc = Counter()\r\n\r\nfor _ in range(int(input())):\r\n c.update(input().split())\r\n\r\nprint('FAIL' if all(c[x]==2 for x in '12345') else 'WIN')", "import sys\n\ninp = sys.stdin.readlines()\nm = int(inp.pop(0).replace('\\n',''))\n\nhash = [0 for i in range(10)]\n\nfor i in range(m):\n line = inp[i].replace('\\n','').split()\n a = int(line[0])\n b = int(line[1])\n hash[a] += 1\n hash[b] += 1\n\nfor i in range(1,6,1):\n if hash[i] != 2:\n print('WIN')\n sys.exit()\nprint('FAIL')\n\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\nfrom collections import Counter,deque\r\nL=lambda:list(map(int, stdin.readline().strip().split()))\r\nM=lambda:map(int, stdin.readline().strip().split())\r\nI=lambda:int(stdin.readline().strip())\r\nIN=lambda:stdin.readline().strip()\r\nC=lambda:stdin.readline().strip().split()\r\nmod=1000000007\r\n#Keymax = max(Tv, key=Tv.get)\r\ndef s(a):print(\" \".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\n#I_am_pavan\r\ndef solve():\r\n a=[0]*6\r\n n=I()\r\n for i in range(n):\r\n x,y=M()\r\n a[x]+=1;a[y]+=1\r\n #print(a)\r\n if a.count(2)==5:print(\"FAIL\")\r\n else:print(\"WIN\")\r\nt=1\r\nfor i in range(t):\r\n solve()\r\n \r\n", "m=int(input())\r\nn={}\r\nn[1]=0\r\nn[2]=0\r\nn[3]=0\r\nn[4]=0\r\nn[5]=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n n[a]+=1\r\n n[b]+=1\r\nif(n[1]==n[2]==n[3]==n[4]==n[5] and n[1]==2):\r\n print(\"FAIL\")\r\nelse:\r\n print(\"WIN\")", "gh=[[0]*6 for _ in \" \"*6]\r\na=int(input())\r\nfor _ in \" \"*a:u,v=map(int,input().split());gh[u][v]=1;gh[v][u]=1\r\nok1,ok2=0,0\r\nfor i in range(1,6):\r\n for j in range(1,6):\r\n for k in range(1,6):\r\n if i==j or j==k or i==k:continue\r\n if gh[i][j] and gh[j][k] and gh[k][i]:ok1=1\r\n if gh[i][j]==0 and gh[j][k]==0 and gh[k][i]==0:ok2=1\r\nif not(ok1) and not(ok2):print(\"FAIL\")\r\nelse:print(\"WIN\")", "m = int(input())\r\nfriends = [[False] * 5 for _ in range(5)]\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n a-=1\r\n b-=1\r\n friends[a][b] =True\r\n friends[b][a] =True\r\n\r\n# get knowing combination\r\nvis = [False] * 5\r\n# known = []\r\n# unknown = []\r\nres = 'FAIL'\r\ndef choose(n=0,i=0,s =''):\r\n global res\r\n if i ==3:\r\n a,b,c = list(s)\r\n # print(a,b,c)\r\n a = int(a)\r\n b = int(b)\r\n c = int(c)\r\n if friends[a][b] and friends[b][c] and friends[a][c]:\r\n # known.append([a+1,b+1,c+1])\r\n res = \"WIN\"\r\n if not (friends[a][b] or friends[b][c] or friends[a][c]):\r\n res = \"WIN\"\r\n # known.append([a+1,b+1,c+1])\r\n return\r\n for j in range(n,5):\r\n if vis[j]:\r\n continue\r\n vis[j] = True\r\n choose(j+1,i+1,s+str(j))\r\n vis[j] = False\r\n\r\nchoose()\r\n\r\nprint(res)\r\n", "n = int(input())\r\nl = [0] * 5 \r\nfor i in range(n): \r\n a, b = map(int, input().split()) \r\n l[a - 1] += 1\r\n l[b - 1] += 1\r\nif l.count(2) != 5 : \r\n print(\"WIN\")\r\nelse :\r\n print(\"FAIL\")\r\n \r\n", "g = [[False for i in range(6)]for j in range(6)]\r\nfor _ in range(int(input())):\r\n u, v = map(int, input().split())\r\n g[u][v] = True\r\n g[v][u] = True\r\nfor i in range(1, 6):\r\n for j in range(1, 6):\r\n for k in range(1, 6):\r\n if i != j and j != k and i != k:\r\n if g[i][j] == True and g[i][k] == True and g[j][k] == True:\r\n print(\"WIN\")\r\n exit()\r\n if not (g[i][j] == True) and not (g[i][k] == True) and not (g[j][k] == True):\r\n print(\"WIN\")\r\n exit()\r\nprint(\"FAIL\")\r\n", "m=int(input())\r\nadj=[[0 for _ in range(5)] for _ in range(5)]\r\nok=0\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n adj[a-1][b-1]=1\r\n adj[b-1][a-1]=1\r\nfor i in range(5):\r\n for j in range(i+1,5):\r\n for k in range(j+1,5):\r\n tmp=adj[i][j]+adj[j][k]+adj[i][k]\r\n if tmp==3 or not tmp:\r\n ok=1\r\nif ok:\r\n print('WIN')\r\nelse:\r\n print('FAIL')\r\n", "def inp():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef ocycle(x):\r\n if x[0] in g.gdict[x[1]] and x[2] in g.gdict[x[1]] and x[0] in g.gdict[x[2]]:\r\n return True\r\n return False\r\n\r\n\r\ndef ouncycle(x):\r\n if x[0] not in g.gdict[x[1]] and x[2] not in g.gdict[x[1]] and x[0] not in g.gdict[x[2]]:\r\n return True\r\n return False\r\n\r\nclass graph:\r\n # initialize graph\r\n def __init__(self, gdict=None):\r\n if gdict is None:\r\n gdict = defaultdict(list)\r\n self.gdict = gdict\r\n\r\n # get edges\r\n def edges(self):\r\n return self.find_edges()\r\n\r\n # find edges\r\n def find_edges(self):\r\n edges = []\r\n for node in self.gdict:\r\n for nxNode in self.gdict[node]:\r\n if {nxNode, node} not in edges:\r\n edges.append({node, nxNode})\r\n return edges\r\n\r\n # Get verticies\r\n def get_vertices(self):\r\n return list(self.gdict.keys())\r\n\r\n # add vertix\r\n def add_vertix(self, node):\r\n if node not in self.gdict:\r\n self.gdict[node] = []\r\n\r\n # add edge\r\n def add_edge(self, node1, node2):\r\n self.gdict[node1].append(node2)\r\n self.gdict[node2].append(node1)\r\n\r\n\r\nfrom sys import *\r\nfrom collections import *\r\nfrom itertools import *\r\n\r\ng, com = graph(), list(combinations([i for i in range(1, 6)], 3))\r\nfor i in range(int(input())):\r\n u, v = inp()\r\n g.add_edge(u, v)\r\n\r\n# print(g.gdict, com)\r\nfor i in com:\r\n if ocycle(i) or ouncycle(i):\r\n exit(print('WIN'))\r\n\r\nprint('FAIL')\r\n", "class CodeforcesTask94BSolution:\n def __init__(self):\n self.result = ''\n self.m = 0\n self.edges = []\n\n def read_input(self):\n self.m = int(input())\n for x in range(self.m):\n self.edges.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n used = set()\n conngraph = [set() for x in range(5)]\n for edge in self.edges:\n used.add(str(edge))\n conngraph[edge[0] - 1].add(edge[1] - 1)\n conngraph[edge[1] - 1].add(edge[0] - 1)\n full = {1, 2, 3, 4, 0}\n nconngraph = [full - x for x in conngraph]\n has = False\n for a in range(5):\n for b in range(5):\n for c in range(5):\n if len(set([a, b, c])) == 3:\n if b in conngraph[a] and c in conngraph[a] and a in conngraph[b] and c in conngraph[b] and b in conngraph[c] and a in conngraph[c]:\n has = True\n if b in nconngraph[a] and c in nconngraph[a] and a in nconngraph[b] and c in nconngraph[b] and b in nconngraph[c] and a in nconngraph[c]:\n has = True\n self.result = \"WIN\" if has else \"FAIL\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask94BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from sys import stdin ,stdout \r\nfrom collections import defaultdict\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\nvis=[0]*6 ; dic=defaultdict(set) ; cond=False\r\nfor i in range(int(input())) :\r\n a,b=map(int,input().split()) ; vis[a]=1 ; vis[b]=1 ; dic[a].add(b) ; dic[b].add(a)\r\nif sum(vis)<=3 :print(\"WIN\")\r\nelse:\r\n for i in range(1,6):\r\n for j in range(i+1,6):\r\n if len(dic[i]&dic[j])>=1 and i in dic[j] and j in dic[i] :\r\n print(\"WIN\") ; cond =True ; break\r\n if i not in dic[j] and j not in dic[i] and len(dic[i]&dic[j])==0:\r\n print(\"WIN\") ; cond =True ; break\r\n\r\n if cond : break\r\n else:\r\n print(\"FAIL\")", "import sys\r\nn=int(input())\r\nlist1=[[0 for i in range(6)]for i in range(6)]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n list1[a][b]=1\r\n list1[b][a]=1\r\n \r\nfor i in range(1,6):\r\n for j in range(1,6):\r\n for k in range(1,6):\r\n if(i!=j and j!=k and i!=k):\r\n if(list1[i][j]==1 and list1[j][k]==1 and list1[k][i]==1):\r\n # print(i,j,k)\r\n f=1\r\n print(\"WIN\")\r\n sys.exit()\r\n elif(list1[i][j]==0 and list1[j][k]==0 and list1[k][i]==0):\r\n # print(i,j,k)\r\n print(\"WIN\")\r\n sys.exit()\r\n \r\n \r\nprint(\"FAIL\")", "#\n# Joseph Matsushita\n# Problem I\n#\n# Time Complexity:\n# The nature of the problem prevents the time complexity from rising above O(1)\n#\nn = int(input())\nwin = True #assume it's true\nif(n == 5): #the fail scenarios require exactly 5 edges\n adj = [0 for i in range(5)]\n for i in range(n): #create an adjacency list\n edge = list(map(int, input().split()))\n adj[edge[0]-1] += 1\n adj[edge[1]-1] += 1\n if adj.count(2) == 5: #only failure scenario requires everyone has exactly\n win = False # two acquaintances\n \nif(win):\n print(\"WIN\")\nelse:\n print(\"FAIL\")\n \t\t \t\t\t \t\t \t\t\t\t\t \t \t\t \t\t\t", "\r\nm=int(input())\r\nfr=[0]*(5)\r\n\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n fr[u-1]+=1\r\n fr[v-1]+=1\r\n#print(fr)\r\n\r\nif max(fr)==min(fr)==2:print(\"FAIL\")\r\nelse:print(\"WIN\")", "def solve(m, relations):\n # Create a graph to represent the acquaintances\n graph = [[0] * 6 for _ in range(6)]\n for i in range(m):\n a, b = relations[i]\n graph[a][b] = 1\n graph[b][a] = 1\n \n # Check all combinations of three people\n for i in range(1, 6):\n for j in range(i+1, 6):\n for k in range(j+1, 6):\n # Check if the three people know each other or not\n if graph[i][j] == 1 and graph[j][k] == 1 and graph[k][i] == 1:\n return \"WIN\"\n if graph[i][j] == 0 and graph[j][k] == 0 and graph[k][i] == 0:\n return \"WIN\"\n \n return \"FAIL\"\n\n# Read input\nm = int(input())\nrelations = []\nfor _ in range(m):\n a, b = map(int, input().split())\n relations.append((a, b))\n\n# Solve the problem\nresult = solve(m, relations)\n\n# Print the result\nprint(result)\n \t\t \t\t \t\t \t\t\t\t\t\t\t \t \t\t \t\t\t", "\n\n\npcs = [(1,2,3), (1,2,4), (1,2,5),\n (1,3,4), (1,3,5),\n (1,4,5), \n (2,3,4), (2,3,5),\n (2,4,5),\n (3,4,5)]\n\nm = int(input())\n\nrelations = []\n\nfor _ in range(m):\n relations.append(sorted(map(int, input().split())))\n\n\nresult = False\n\nfor pc in pcs:\n a, b, c = pc\n if [a, b] in relations and \\\n [b, c] in relations and \\\n [a, c] in relations:\n result = True\n\n if [a, b] not in relations and \\\n [b, c] not in relations and \\\n [a, c] not in relations:\n result = True\n\nif result:\n print(\"WIN\")\nelse:\n print(\"FAIL\")\n\n\n\n\n\n", "def f(p):\r\n for a in range(1, 6):\r\n for b in range(a + 1, 6):\r\n t = (b in p[a])\r\n for c in range(b + 1, 6): \r\n if t == (c in p[a]) == (c in p[b]): return 'WIN'\r\n return 'FAIL'\r\nn = int(input())\r\np = [[] for i in range(6)]\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b: p[b].append(a)\r\n else: p[a].append(b)\r\nprint(f(p))", "m = int(input())\nD = [[0]*5 for i in range(5)]\nfor i in range(m):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n D[a][b] = 1\n D[b][a] = 1\n\nimport itertools\nfor c in itertools.combinations(range(5), 3):\n u, v, w = c\n if D[u][v] == D[v][w] and D[v][w] == D[w][u]:\n print('WIN')\n exit()\nelse:\n print('FAIL')\n", "n = int(input())\r\ndit = {x:0 for x in range(1,6)}\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n dit[a]+=1\r\n dit[b]+=1\r\narr = list(dit.values())\r\nif arr.count(2)==5:\r\n print(\"FAIL\")\r\nelse:\r\n print('WIN')", "m = int(input())\r\nL = [[False for i in range(5)] for j in range(5)]\r\nfor i in range(m):\r\n relation = [int(s) for s in input().split()]\r\n L[relation[0]-1][relation[1]-1] = True\r\n L[relation[1]-1][relation[0]-1] = True\r\nbool = False\r\nfor i in range(3):\r\n for j in range(i+1,4):\r\n for k in range(j+1,5):\r\n bool = bool or (L[i][j] == L[j][k] and L[j][k] == L[i][k])\r\nif bool == False:\r\n print(\"FAIL\")\r\nelse:\r\n print(\"WIN\")\r\n \r\n ", "m=int(input())\r\nls=[[0 for i in range(6)] for j in range(6)]\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n ls[u][v]=1\r\n ls[v][u]=1\r\nflag=False\r\nfor i in range(1,6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if(ls[i][j]==1 and ls[j][k]==1 and ls[k][i]==1):\r\n flag=True\r\n if(ls[i][j]==0 and ls[j][k]==0 and ls[k][i]==0):\r\n flag=True\r\nif(flag):print(\"WIN\")\r\nelse:print(\"FAIL\")", "m = int(input())\r\nl = [0]*5\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n l[a-1] += 1\r\n l[b-1] += 1\r\nif l.count(2) == 5:\r\n print('FAIL')\r\nelse:\r\n print('WIN')", "m = int(input())\r\nif m != 5:\r\n for k in range(m):\r\n input()\r\n print('WIN')\r\nelse:\r\n t = [0,0,0,0,0]\r\n for k in range(m):\r\n s = input().split(' ')\r\n a,b = list(map(int,s))\r\n t[a-1] += 1\r\n t[b-1] += 1\r\n if t == [2,2,2,2,2]:\r\n print('FAIL')\r\n else:\r\n print('WIN')", "n = int(input())\r\na = [0 for i in range(5)]\r\nfor i in range(n):\r\n\ts = input().split()\r\n\ts = [int(i) for i in s]\r\n\ta[s[0]-1] += 1\r\n\ta[s[1] - 1] += 1\r\nflag = 1\r\nfor i in range(5):\r\n\tif(a[i] >=3 or a[i]<=1):\r\n\t\tflag = 0\r\n\t\tbreak\r\n\r\nif(flag == 0):\r\n\tprint('WIN')\r\nelse:\r\n\tprint('FAIL')", "def s():\r\n m = int(input())\r\n s = set(tuple(sorted(list(map(int,input().split()))))for _ in range(m))\r\n for i in range(1,4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n r = ((i,j)in s) + ((j,k)in s) + ((i,k)in s)\r\n if r%3 == 0:\r\n print('WIN')\r\n return\r\n print('FAIL')\r\ns()\r\n", "\r\nm = int(input())\r\nhash = {}\r\nfor i in range(5):\r\n hash[i+1] = []\r\n\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n hash[a].append(b)\r\n hash[b].append(a)\r\n\r\nfor i in range(1,6):\r\n flag = 0\r\n for j in range(1,6):\r\n if j in hash[i]:\r\n for k in range(1,6):\r\n if k in hash[i] and k in hash[j]:\r\n flag = 1\r\n break\r\n\r\n if flag == 1:\r\n break\r\n if flag == 1:\r\n break\r\n\r\nif flag!=1:\r\n\r\n\r\n for i in range(1,6):\r\n flag = 0\r\n for j in range(1,6):\r\n if j not in hash[i]:\r\n for k in range(1,6):\r\n if k not in hash[i] and k not in hash[j] and i!=j and i!=k and j!=k:\r\n flag = 1\r\n # print(hash[i],hash[j],hash[k])\r\n break\r\n\r\n if flag == 1:\r\n break\r\n if flag == 1:\r\n break\r\n\r\n\r\nif flag == 1:\r\n print('WIN')\r\nelse:\r\n print('FAIL')\r\n\r\n\r\n\r\n", "import itertools\r\nimport math\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 = 5\r\n m = int(input())\r\n\r\n b = [[0 for i in range(n)] for j in range(n)]\r\n\r\n for i in range(m):\r\n v, u = map(int, input().split())\r\n b[v - 1][u - 1] = 1\r\n b[u - 1][v - 1] = 1\r\n\r\n flag = False\r\n for i in range(5):\r\n for j in range(i + 1, 5):\r\n for k in range(j + 1, 5):\r\n if (b[i][j] + b[i][k] + b[j][k]) in [0, 3]:\r\n flag = True\r\n\r\n if flag:\r\n print(\"WIN\")\r\n else:\r\n print(\"FAIL\")\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", "\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nl = []\r\nd = defaultdict(list)\r\nfor i in range(1,6):\r\n\tfor j in range(i+1,6):\r\n\t\tfor k in range(j+1,6):\r\n\t\t\tl.append((i,j,k))\r\n\r\n# print(len(l))\r\nfor i in range(n):\r\n\tu,v = map(int,input().split())\r\n\td[u].append(v)\r\n\td[v].append(u)\r\n\r\nfor i in l:\r\n\r\n\tif i[0] in d[i[1]] and i[0] in d[i[2]] and i[1] in d[i[2]]:\r\n\t\tprint(\"WIN\")\r\n\t\texit()\r\n\telif i[0] not in d[i[1]] and i[0] not in d[i[2]] and i[1] not in d[i[2]]:\r\n\t\tprint(\"WIN\")\r\n\t\texit()\r\nprint(\"FAIL\")", "import itertools\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nm = int(input())\r\nG = [[0] * 6 for _ in range(6)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n G[a][b] = 1\r\n G[b][a] = 1\r\np = [i for i in range(1, 6)]\r\nans = \"FAIL\"\r\nfor p0 in itertools.combinations(p, 3):\r\n s = 0\r\n for i in range(3):\r\n s += G[p0[i]][p0[(i + 1) % 3]]\r\n if not s or not s ^ 3:\r\n ans = \"WIN\"\r\n break\r\nprint(ans)", "m=int(input())\r\ng=[[0]*10 for i in range(10)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n g[a][b]=g[b][a]=1\r\nfor i in range(1,6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if((g[i][j]+g[i][k]+g[j][k])%3==0):\r\n print(\"WIN\")\r\n quit()\r\nprint(\"FAIL\")\r\n", "def check(l, i, j, k):\r\n count = 0\r\n if j in l[i]:\r\n count += 1\r\n if j in l[k]:\r\n count += 1\r\n if k in l[i]:\r\n count += 1\r\n if count == 0 or count == 3:\r\n return 1\r\n return 0\r\n\r\ndef solve(m, l):\r\n for i in range(0, 5):\r\n for j in range(i + 1, 5):\r\n for k in range(j + 1, 5):\r\n if check(l, i, j, k):\r\n return \"WIN\"\r\n return \"FAIL\"\r\n\r\nm = int(input())\r\nl = [[] for i in range(0, 5)]\r\nfor i in range(0, m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n l[a].append(b)\r\n l[b].append(a)\r\nprint(solve(m, l))", "n=int(input())\nadj=[set() for i in range(6)]\nfor _ in range(n):\n a,b=map(int,input().split())\n adj[a].add(b)\n adj[b].add(a)\nfor i in range(1,6):\n for j in adj[i]:\n for k in adj[j]:\n if i in adj[k]:\n print(\"WIN\")\n exit()\nfor i in range(1,6):\n adj[i]={1,2,3,4,5}-adj[i]-{i}\nfor i in range(1,6):\n for j in adj[i]:\n for k in adj[j]:\n if i in adj[k]:\n print(\"WIN\")\n exit()\nprint(\"FAIL\")\n", "m = int(input())\r\nw = [[], [], [], [], []]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n w[a].append(b)\r\n w[b].append(a)\r\nfor x in range(5):\r\n for y in range(5):\r\n for z in range(5):\r\n if x == y or x == z or y == z:\r\n continue\r\n if y not in w[x] and z not in w[x] and x not in w[y] and z not in w[y] and y not in w[z] and x not in w[z]:\r\n print('WIN')\r\n exit()\r\n if y in w[x] and z in w[x] and x in w[y] and z in w[y] and y in w[z] and x in w[z]:\r\n print('WIN')\r\n exit()\r\nprint('FAIL')", "n = int(input())\r\ncounter = [0] * 10\r\nfor i in range(n):\r\n u, v = map(int, input().split())\r\n counter[u] += 1\r\n counter[v] += 1\r\nflag = any(counter[i] <= 1 or counter[i] >= 3 for i in range(1, 6))\r\nprint(\"WIN\" if flag else \"FAIL\")\r\n", "m = int(input())\r\ns = set()\r\nfor i in range(m):\r\n s.add(tuple(sorted(list(map(int, input().split())))))\r\n\r\nfor i in range(1, 6):\r\n for j in range(i+1, 6):\r\n for k in range(j+1, 6):\r\n if ((i, j) in s and (j, k) in s and (i, k) in s) or \\\r\n ((i, j) not in s and (j, k) not in s and (i, k) not in s):\r\n print('WIN')\r\n exit()\r\nprint('FAIL')\r\n", "# for this problem, I just checked whether there are any friend who are not friends with exactly 2 people to figure out whether there are 3 pairwise aquainted or unaquainted people. Reading the input while simultaneously updating number of relations takes O(n) where n is number of relations. Figuring out whether the case is a pass or fail is just 5 iterations. The space complexity is constant\nimport sys\n\ninp = sys.stdin.readlines()\nm = int(inp.pop(0).replace('\\n',''))\n\nrelations = [0 for i in range(10)]\n\nfor i in range(m):\n line = inp[i].replace('\\n','').split()\n a = int(line[0])\n b = int(line[1])\n relations[a] += 1\n relations[b] += 1\n\nfor i in range(1,6,1):\n if relations[i] != 2:\n print('WIN')\n sys.exit()\nprint('FAIL')\n\t\t\t\t\t \t\t \t\t \t \t \t\t \t \t\t\t\t", "#!/urs/bin/python3\n\nm = int(input())\npairs = []\nfor i in range(m):\n a, b = map(int, input().split())\n a = a - 1\n b = b - 1\n pairs.append((a, b))\n\nfor i in range(5):\n for j in range(i + 1, 5):\n for k in range(j + 1, 5):\n ans = 0\n for t in range(m):\n if pairs[t] == (i, j) or pairs[t] == (j, i):\n ans += 1\n elif pairs[t] == (j, k) or pairs[t] == (k, j):\n ans += 1\n elif pairs[t] == (i, k) or pairs[t] == (k, i):\n ans += 1\n if ans == 3 or ans == 0:\n print(\"WIN\")\n exit(0)\n\nprint(\"FAIL\")\n", "a=[]\r\nfor i in range(int(input())):a+=input()\r\na.sort()\r\nprint([\"WIN\",\"FAIL\"][a==list(\" 1122334455\")])\r\n\r\n", "a = [[False] * 5 for i in range(5)]\n\nm = int(input())\n\nfor i in range(m):\n x, y = map(int, input().split(' '))\n x -= 1\n y -= 1\n a[x][y] = a[y][x] = True\n\nfor i in range(5):\n for j in range(5):\n if i == j:\n continue\n for k in range(5):\n if i == k or j == k:\n continue\n if a[i][j] == a[i][k] and a[i][j] == a[j][k]:\n print(\"WIN\")\n exit(0)\n\nprint(\"FAIL\")\n\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nmatrix = []\r\n\r\nfor _ in range(5):\r\n matrix.append([0] * 5)\r\n\r\nfor _ in range(n):\r\n a, b = map(int, sys.stdin.readline().split())\r\n matrix[a - 1][b - 1] = matrix[b - 1][a - 1] = 1\r\n\r\nyes = False\r\nfor i in range(3):\r\n for j in range(i + 1, 4):\r\n for k in range(j + 1, 5):\r\n if matrix[i][j] == matrix[j][k] == matrix[k][i]:\r\n #print(i, j, k)\r\n yes = True\r\n breakpoint\r\n if yes:\r\n break\r\n if yes:\r\n break\r\n\r\nif yes:\r\n print('WIN')\r\nelse:\r\n print('FAIL')\r\n", "e = [[False] * 5 for i in range(5)]\nfor i in range(int(input())):\n a, b = map(int, input().split())\n e[a - 1][b - 1] = e[b - 1][a - 1] = True\nfor a in range(3):\n for b in range(a + 1, 4):\n for c in range(b + 1, 5):\n if len({e[a][b], e[a][c], e[b][c]}) == 1:\n print('WIN')\n exit()\nprint('FAIL')\n", "#\n# Joseph Matsushita\n# Problem I\n#\n# Time Complexity:\n# The nature of the problem prevents the time complexity from rising above O(1).\n# There are always 5 people, and the only scenario that requires any serious\n# testing is when there are 5 pairs of acquaintances, which we can guarantee\n# will run the same amount of time every time.\n#\n# Space Complexity:\n# Once again, due to the problem constraints the space complexity is O(1).\n# We can guarantee that this program will only take a constant amount of memory.\n#\n# Argument:\n# Can't exactly do much better than constant time and space complexity. The\n# small scale nature of the problem and the limited scenarios that need to be\n# checked allow us to quickly figure out the answer without any complex\n# algorithms. There is a loop, but it will run exactly 5 times when it's needed.\n#\n\nn = int(input())\nwin = True #assume it's true\nif(n == 5): #the fail scenarios require exactly 5 edges\n adj = [0 for i in range(5)]\n for i in range(5): #create an adjacency list\n edge = list(map(int, input().split()))\n adj[edge[0]-1] += 1\n adj[edge[1]-1] += 1\n if adj.count(2) == 5: #only failure scenario requires everyone has exactly\n win = False #two acquaintances\n \nif(win):\n print(\"WIN\")\nelse:\n print(\"FAIL\")\n \t\t\t \t\t \t\t \t \t \t\t \t \t \t", "lst = [[False] * 5 for i in range(5)]\r\nfor i in range(int(input())):\r\n a, b = [int(j) for j in input().split()]\r\n lst[a - 1][b - 1] = lst[b - 1][a - 1] = True\r\nfor a in range(3):\r\n for b in range(a + 1, 4):\r\n for c in range(b + 1, 5):\r\n if len({lst[a][b], lst[a][c], lst[b][c]}) == 1:\r\n print('WIN')\r\n exit()\r\nprint('FAIL')\r\n", "n=int(input())\r\na={0:[],1:[False]*6,2:[False]*6,3:[False]*6,4:[False]*6,5:[False]*6}\r\nfor i in range(n):\r\n x,y=map(int, input().split())\r\n a[x][y],a[y][x]=True,True\r\nfor x in range(1,6):\r\n for y in range(1,6):\r\n for z in range(1,6):\r\n if x!=y and y!=z and z!=x:\r\n if a[x][y] and a[y][z] and a[z][x] or not a[x][y] and not a[y][z] and not a[z][x]:\r\n print(\"WIN\")\r\n exit()\r\nprint(\"FAIL\")\r\n", "num = int(input())\r\nval = [[],[],[],[],[]]\r\nfor i in range(num):\r\n a,b = list(map(int,input().split(\" \")))\r\n val[a-1].append(b-1)\r\n val[b-1].append(a-1)\r\n \r\none = False\r\nthree = False\r\nfor i in val:\r\n if len(i) >= 3:\r\n three = True\r\n if len(i) <= 1:\r\n one = True\r\nif(one or three):\r\n print(\"WIN\")\r\nelse:\r\n print('FAIL')", "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 # Write Your Code Here\r\n m = int(input())\r\n adjList = {1:{},2:{},3:{},4:{},5:{}}\r\n for _ in range(0, m):\r\n ai, bi = get_ints_in_variables()\r\n adjList[ai][bi] = bi\r\n adjList[bi][ai] = ai\r\n # print(adjList)\r\n for i in range(1, 6):\r\n for j in range(i+1, 6):\r\n for k in range(j+1, 6):\r\n if (i in adjList[j] and i in adjList[k]) and (j in adjList[i] and j in adjList[k]) and (k in adjList[i] and k in adjList[j]):\r\n print(\"WIN\")\r\n return\r\n if (i not in adjList[j] and i not in adjList[k]) and (j not in adjList[i] and j not in adjList[k]) and (k not in adjList[i] and k not in adjList[j]):\r\n print(\"WIN\")\r\n return\r\n print(\"FAIL\")\r\n return\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "m = int(input())\ndp = {}\nfor i in range(1, 6):\n for j in range(1, 6):\n dp[(i, j)] = False\nfor _ in range(m):\n a, b = map(int, input().split())\n dp[(a, b)] = True\n dp[(b, a)] = True\nfor i in range(1, 6):\n for j in range(1, i):\n for k in range(1, j):\n if dp[(i, j)] == dp[(j, k)] == dp[(i,k)]:\n print(\"WIN\")\n exit()\nprint(\"FAIL\")" ]

[ "a=input()\r\nb=input()\r\nk1=0\r\nk2=0\r\nfor i in range (len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4':\r\n k1+=1\r\n else:\r\n k2+=1\r\nd=max(k1,k2)\r\nprint (d)", "a=input()\r\nb=input()\r\nf=0\r\ns=0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]==\"4\":\r\n f+=1\r\n else:\r\n s+=1\r\nprint(max(s,f))", "\r\n\r\na = input()\r\nb = input()\r\na7,a4 = a.count('7'),a.count('4')\r\nb7,b4 = b.count('7'),b.count('4')\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n c += 1\r\nif a7==b7 and a4==b4:\r\n if c%2:\r\n print(c//2+1)\r\n else:\r\n print(c//2)\r\nelse:\r\n if b7>a7:\r\n d = b7-a7\r\n else:\r\n d = b4-a4\r\n tot = d\r\n c -= d\r\n if c%2:\r\n print(tot+c//2+1)\r\n else:\r\n print(tot+c//2)", "z = list(map(''.join, zip(input(), input())))\r\nf, s = z.count('47'), z.count('74')\r\nprint(f + s - min(f, s))\r\n", "s = input()\nt = input()\ncount_7, count_4, count = 0, 0, 0\nfor i in range(len(s)):\n if s[i] == t[i]:\n continue\n if s[i] == '7':\n count_7 += 1\n else:\n count_4 += 1\nprint(count_7 if count_7>=count_4 else count_4)\n \t\t \t\t \t \t \t \t \t\t\t\t \t\t \t", "a = input()\nb = input()\n\nindex = 0\n\nwrong = {'4': 0,\n '7': 0}\n\nwhile index < len(a):\n if a[index] != b[index]:\n wrong[a[index]] += 1\n index += 1\n\n# c = abs(wrong['4'] - wrong['7'])\nprint(max(wrong['4'], wrong['7']))\n", "a = list(input())\r\nb = list(input())\r\nans = 0\r\nc4 = abs(a.count('4') - b.count('4'))\r\nc7 = abs(a.count('7') - b.count('7'))\r\nans += c4\r\nn =len(a)\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n count += 1\r\nans += ((count - c4)//2)\r\nprint(ans)\r\n", "ch = 0\r\ns = 0\r\na = input()\r\nb = input()\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if b[i] == \"7\":\r\n s += 1\r\n elif b[i] == \"4\":\r\n ch += 1\r\nprint(max(s, ch))", "def happy_preobr(s, t):\r\n count1, count2 = 0, 0\r\n for i in range(len(s)):\r\n if i + 1 <= len(s) and s[i] == '4' and t[i] == '7':\r\n count1 += 1\r\n else:\r\n if i + 1 <= len(s) and s[i] == '7' and t[i] == '4':\r\n count2 += 1\r\n return max(count1, count2)\r\n\r\n\r\na = input()\r\nb = input()\r\nprint(happy_preobr(a, b))\r\n", "a=input();b=input()\r\nc4,c7=0,0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4':c4+=1\r\n else:c7+=1\r\nprint(max(c4,c7))", "a = input()\r\nb = input()\r\nn = len(a)\r\n\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(n):\r\n if a[i] == '4' and b[i] == '7':\r\n x += 1\r\n if a[i] == '7' and b[i] == '4':\r\n y += 1\r\n\r\nprint(max(x, y)) \r\n", "a=input()\r\nb=input()\r\nmismatch=0\r\ncnt4=0\r\ncnt7=0\r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n mismatch+=1\r\n if(a[i]=='4'):\r\n cnt4+=1\r\n if(b[i]=='4'):\r\n cnt4-=1\r\nmismatch-=abs(cnt4)\r\nprint(mismatch//2+(abs(cnt4)))", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n s = list(input())\r\n c = list(input())\r\n counter_7_not_in_position = 0\r\n counter_4_not_in_position = 0\r\n for i in range(len(s)):\r\n if s[i] == c[i]:\r\n pass\r\n else:\r\n if s[i] == \"4\":\r\n counter_4_not_in_position += 1\r\n else:\r\n counter_7_not_in_position += 1\r\n print(max(counter_7_not_in_position, counter_4_not_in_position))\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#main_function()", "a = input()\nb = input()\na_4 = 0\na_7 = 0\nfor i in range(len(a)):\n if a[i] != b[i]:\n if a[i] == \"4\":\n a_4 += 1\n else:\n a_7 += 1\nprint(max(a_4, a_7))\n\n", "c47,c74=0,0\r\na,b=input(),input()\r\nfor i in range(len(a)):\r\n if a[i]==b[i]:continue\r\n if a[i]=='4':\r\n c47+=1\r\n else:\r\n c74+=1\r\nprint(max(c47,c74))\r\n", "a = input()\r\nb = input()\r\ncount47 = 0\r\ncount74 = 0\r\nfor i in range(0, len(a)):\r\n if a[i]+b[i] == \"47\":\r\n count47 += 1\r\n if a[i]+b[i] == \"74\":\r\n count74 += 1\r\nif count47 == count74:\r\n print(count47)\r\nelse:\r\n print(max(count47, count74))", "a=input()\na=list(a)\nb=input()\nb=list(b)\na4=a.count('4')\na7=a.count('7')\nb4=b.count('4')\nb7=b.count('7')\nm4=0\nm7=0\nans=0\nfor i in range(len(a)):\n if a[i]=='4' and a[i]!=b[i]:\n m4+=1\n elif a[i]=='7' and a[i]!=b[i]:\n m7+=1\nif a4>b4:\n m4=m4-(a4-b4)\n ans+=a4-b4\nif a7>b7:\n m7=m7-(a7-b7)\n ans+=a7-b7\nans+=(m4+m7)//2\nprint(ans)\n \n\n \t\t\t\t\t\t \t\t \t \t\t\t\t \t\t\t \t\t\t\t", "s1=input()\r\ns2=input()\r\nn=len(s1)\r\nseven=0 \r\nfour=0 \r\nfor i in range(n):\r\n if s1[i]!=s2[i] and s1[i]=='7':\r\n seven+=1 \r\n if s1[i]!=s2[i] and s1[i]=='4':\r\n four+=1 \r\nprint(max(four,seven))", "ans=(input());t=input()\r\narr=[]\r\nfor i in range(len(ans)):\r\n arr.append(ans[i]+t[i])\r\nprint(max(arr.count(\"47\"),arr.count(\"74\")))", "\r\nn=input()\r\nn1=input()\r\nans=0;ans1=0\r\nfor i,j in zip(n,n1):\r\n if i!=j:\r\n if i==\"4\":\r\n ans+=1\r\n else:\r\n ans1+=1\r\nprint(max(ans,ans1))", "# LUOGU_RID: 126679191\na,b,d=input(),input(),{4:0,7:0}\nfor i in range(len(a)):\n if a[i]!=b[i]:\n d[int(a[i])]+=1\nprint(max(d[4],d[7]))", "s1 = input()\ns2 = input()\nd = {\"4\": 0, \"7\": 0}\n\nfor i in range(len(s1)):\n if s1[i] != s2[i]:\n d[s1[i]] += 1\n \nprint(min(d[\"4\"],d[\"7\"])+max(d[\"4\"],d[\"7\"])-min(d[\"4\"],d[\"7\"]))\n \t \t\t \t\t \t\t\t \t \t \t \t \t \t\t", "a,b=input(),input();l=[a[i]+b[i] for i in range(len(a))];print(max(l.count('47'),l.count('74')))", "x=input()\r\ny=input()\r\nd=abs(x.count(\"4\")-y.count(\"4\"))\r\nc=0\r\nfor i in range(len(x)):\r\n if x[i]!=y[i]:\r\n c+=1\r\nc-=d\r\nprint(c//2+d)", "#------------------------------what is this I don't know....just makes my mess faster--------------------------------------\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n \nBUFSIZE = 8192\n \nclass FastIO(IOBase):\n newlines = 0\n \n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n \n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n \n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n \n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n \n \nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n \n \nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n \n#----------------------------------Real game starts here--------------------------------------\n'''\n \n \n___________________THIS IS AESTROIX CODE________________________\n KARMANYA GUPTA\n \n'''\n#_______________________________________________________________#\ndef fact(x):\n\tif x == 0:\n\t\treturn 1\n\telse:\n\t\treturn x * fact(x-1)\ndef lower_bound(li, num): #return 0 if all are greater or equal to\n\tanswer = -1 \n\tstart = 0\n\tend = len(li)-1\n\n\twhile(start <= end):\n\t\tmiddle = (end+start)//2\n\t\tif li[middle] >= num:\n\t\t\tanswer = middle\n\t\t\tend = middle - 1\n\t\telse:\n\t\t\tstart = middle + 1\n\treturn answer #index where x is not less than num\ndef upper_bound(li, num): #return n-1 if all are small or equal\n\tanswer = -1\n\tstart = 0\n\tend = len(li)-1\n\n\twhile(start <= end):\n\t\tmiddle = (end+start)//2\n\n\t\tif li[middle] <= num:\n\t\t\tanswer = middle\n\t\t\tstart = middle + 1\n\t\t\n\t\telse:\n\t\t\tend = middle - 1\n\treturn answer #index where x is not greater than num\n\ndef abs(x):\n\treturn x if x >=0 else -x\ndef binary_search(li, val, lb, ub):\n\tans = 0\n\twhile(lb <= ub):\n\t\tmid = (lb+ub)//2\n\t\t#print(mid, li[mid])\n\t\tif li[mid] > val:\n\t\t\tub = mid-1\n\t\telif val > li[mid]:\n\t\t\tlb = mid + 1\n\t\telse:\n\t\t\tans = 1\n\t\t\tbreak\n\treturn ans\n#_______________________________________________________________#\n\n\nfor _ in range(1):\n\ta = list(input())\n\tb = list(input())\n\tcnt47, cnt74 = 0,0\n\tfor i in range(len(a)):\n\t\tif a[i] == '4' and b[i] == '7':\n\t\t\tcnt47 += 1\n\t\telif a[i] == '7' and b[i] == '4':\n\t\t\tcnt74 += 1\n\tprint(max(cnt74, cnt47))\n\n\n\n\t\n\n\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n\n\t\t\t\n", "from collections import Counter\r\n\r\nstring1 = input()\r\nstring2 = input()\r\n\r\ncnt = Counter()\r\n\r\nfor i in range(len(string1)):\r\n if string1[i] != string2[i]:\r\n cnt[string1[i]] += 1\r\n\r\ndiffs = cnt['4'] + cnt['7']\r\nmn = min(cnt['4'], cnt['7'])\r\n\r\nans = cnt['4'] + cnt['7'] - mn\r\n\r\nprint(ans)\r\n", "a=input()\r\nb=input()\r\ns=0\r\nf=0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]==\"4\":\r\n f+=1\r\n else:\r\n s+=1\r\nprint(min(f,s)+((max(f,s)-min(f,s))))", "a=input()\nb=input()\ns1=0\ns2=0\nfor i in range(len(a)):\n dup1=int(a[i])\n dup2=int(b[i])\n if(dup1>dup2):\n s1+=1\n elif(dup2>dup1):\n s2+=1\nif(s1>=s2):\n print(s1)\nelse:\n print(s2)\n\n \t\t\t \t \t\t \t\t \t \t\t", "a=list(input())\r\nb=list(input())\r\nfour=0\r\nseven=0\r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n if(b[i]=='4'):\r\n four+=1\r\n else:\r\n seven+=1\r\nprint(min(four,seven)+abs(seven-four))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\n\r\na = input()\r\nb = input()\r\n\r\ndif4 = 0\r\ndif7 = 0\r\nfor i in range(len(a)):\r\n if a[i] == b[i]: continue\r\n if a[i] ==\"4\":\r\n dif4 += 1\r\n else:\r\n dif7 += 1\r\n\r\nmn = min(dif4,dif7)\r\nans = mn + dif4 + dif7 - 2*mn\r\nprint(ans)", "\"\"\"\nBrandt Smith, Peter Haddad and Lemuel Gorion\n\nCodeforces.com\n\nProblem 63A\n\"\"\"\n\none = input()\ntwo = input()\n\ntop = 0\nbot = 0\n\nfor i in range(len(one)):\n if one[i] == '4' and two[i] == '7':\n top += 1\n elif one[i] == '7' and two[i] == '4':\n bot += 1\n\nprint(max(top,bot))\n", "a = input()\r\nb = input()\r\n\r\nn = len(a)\r\n\r\ncnt4 = 0\r\ncnt7 = 0\r\nfor i in range(n):\r\n if(a[i] != b[i]):\r\n if(a[i] == '4'):\r\n cnt4 += 1\r\n else:\r\n cnt7 += 1\r\n\r\n\r\n\r\nans = cnt4 + cnt7 - min(cnt4, cnt7)\r\n\r\nprint(ans)", "def main ():\n \"\"\"Convert n in m, making minimum changes as possible\"\"\"\n\n n: str = input()\n m: str = input()\n dif_4 = 0 # amount of 4s that n need\n dif_7 = 0 # amount of 7s that n need\n\n for i in range (len(n)):\n if n[i] != m[i]:\n if n[i] == '7':\n dif_4 += 1\n else:\n dif_7 += 1\n\n print(max(dif_7, dif_4))\n\nif __name__ == '__main__':\n main()\n\t \t \t \t\t \t \t \t\t \t\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\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\na=input().rstrip('\\n')\r\nb=input().rstrip('\\n')\r\nr=0\r\nx,y=0,0\r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n r+=1\r\n if(a[i]=='4'):\r\n x+=1\r\n else:\r\n y+=1\r\nprint(min(x,y)+(abs(x-y)))\r\n \r\n \r\n\r\n \r\n \r\n \r\n", "a,b=0,0\r\nfor i,j in zip(input(),input()):\r\n if i!=j:\r\n if i=='4':a+=1;\r\n else:b+=1;\r\nprint(max(a,b))", "a,b = input().strip(),input().strip()\r\nx,y = 0,0\r\nfor i in range(len(a)):\r\n f = a[i] + b[i]\r\n if f == '47':\r\n x += 1\r\n elif f == '74':\r\n y += 1\r\nprint(max(x,y))", "\r\n\r\na = input()\r\nb = input()\r\n\r\ns = 0\r\nf = 0\r\nln = len(a)\r\n\r\nfor i in range(ln):\r\n if a[i] != b[i]:\r\n if a[i] == '7':\r\n s+=1\r\n else:\r\n f+=1\r\n\r\n\r\nprint(max(s, f))\r\n", "a = input()\nb = input()\n\ns1 , s2 = 0 , 0\n\nfor i in range(len(a)):\n\tif (a[i] == \"4\" and b[i] == \"7\"):\n\t\ts1 += 1\n\tif (a[i] == \"7\" and b[i] == \"4\"):\n\t\ts2 += 1\n\nprint(max(s1,s2))\n", "def question3():\r\n A = list(input())\r\n B = list(input())\r\n count_7_4 = 0\r\n count_4_7 = 0\r\n for i in range(len(A)):\r\n if A[i] != B[i]:\r\n if A[i] == \"4\":\r\n count_4_7 += 1 \r\n else:\r\n count_7_4 += 1 \r\n count = min(count_7_4,count_4_7) + max(count_7_4,count_4_7) - min(count_4_7,count_7_4) \r\n return count \r\nremained_test_cases = 1 \r\nwhile remained_test_cases > 0:\r\n print(question3())\r\n remained_test_cases -= 1 ", "a=input()\r\nb=input()\r\nsum1=0\r\nsum2=0\r\nfor i in range(len(a)):\r\n\tif(a[i]!=b[i]):\r\n\t\tif(a[i]=='4'):\r\n\t\t\tsum1=sum1+1\r\n\t\telse:\r\n\t\t\tsum2=sum2+1\r\nprint(max(sum1,sum2))", "s1 = input()\r\ns2 = input()\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n if(s1[i]=='4'):\r\n c1+=1\r\n if(s1[i]=='7'):\r\n c2+=1\r\nprint(max(c1,c2))\r\n", "import sys\r\nimport math\r\n \r\na = sys.stdin.readline()\r\nb = sys.stdin.readline()\r\n\r\nz = [0] * 4\r\nfor i in range(len(a) - 1):\r\n if(a[i] == b[i]):\r\n continue\r\n if(a[i] == '4'):\r\n z[0] += 1\r\n if(a[i] == '7'):\r\n z[1] += 1\r\n if(b[i] == '4'):\r\n z[2] += 1\r\n if(b[i] == '7'):\r\n z[3] += 1\r\n \r\nprint(max(z))", "a=list(input())\r\nt=list(input())\r\ncnta=0\r\ncntb=0\r\nfor i in range(len(a)):\r\n if a[i]=='7' and t[i]=='4':\r\n cnta+=1\r\n if a[i]=='4' and t[i]=='7':\r\n cntb+=1\r\nprint(max(cnta,cntb))", "a=input()\r\nb=input()\r\n\r\ncount4=0\r\ncount7=0\r\nfor i in range(0,len(a)):\r\n if a[i]!=b[i]:\r\n if ord(a[i])-48 == 4:\r\n count4+=1\r\n else:\r\n count7+=1\r\n \r\nprint(abs(count4-count7)+min(count4,count7))\r\n", "a = input()\r\nb = input()\r\nl = len(a)\r\nd = {'4':0,'7':0}\r\nfor i in range(l):\r\n if a[i] != b[i]:\r\n d[a[i]] += 1\r\nvals = d.values()\r\nprint(min(vals) + (max(vals)-min(vals)))", "x = input(\"\")\r\ny = input(\"\")\r\ncount = 0\r\ncount1 = 0\r\nif x == y:\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(len(x)):\r\n\t\tif(x[i] == '4' and y[i] == '7'):\r\n\t\t\tcount+=1\r\n\t\telif (x[i] == '7' and y[i] == '4'):\r\n\t\t\tcount1+=1\r\n\tm = max(count,count1)\r\n\tprint(m)\t\t\t\t", "import random\nimport sys\nimport os\nimport math\nfrom collections import Counter, defaultdict, deque\nfrom functools import lru_cache, reduce\nfrom itertools import accumulate, combinations, permutations\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\nfrom io import BytesIO, IOBase\nfrom copy import deepcopy\nimport threading\nimport bisect\n\nBUFSIZE = 4096\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef I():\n return input()\n\n\ndef II():\n return int(input())\n\n\ndef MI():\n return map(int, input().split())\n\n\ndef LI():\n return list(input().split())\n\n\ndef LII():\n return list(map(int, input().split()))\n\n\ndef GMI():\n return map(lambda x: int(x) - 1, input().split())\n\n\ndef LGMI():\n return list(map(lambda x: int(x) - 1, input().split()))\n\n\ndef check(limit: int, a: list) -> bool:\n s = 0\n cnt = 0\n for i in range(1, len(a)):\n cnt += 1\n if cnt & 1:\n s += a[i]\n else:\n s -= a[i]\n if cnt == limit:\n cnt = 0\n if s == 0:\n return True\n else:\n return False\n\n\ndef solve() -> None:\n n, k = MI()\n if n == k == 1:\n print(1)\n return ;\n\n res = 0\n if n & 1:\n if k <= n // 2 + 1:\n res = 1\n else:\n k -= n // 2 + 1\n res = 2\n else:\n if k <= n // 2:\n res = 1\n else:\n k -= n / 2\n res = 2\n if k == 0:\n print(res)\n else:\n for _ in range(k):\n res += 2\n print(res)\n\n\n\n\n\n\n\n\nif __name__ == '__main__':\n a=I()\n b=I()\n p=q=0\n for i in range(len(a)):\n if a[i]=='7':\n p+=1\n if b[i]=='7':\n q+=1\n res=c=abs(p-q)\n s=\"\"\n if p>q:#上面的7多，所以要把7换成4\n ch=\"4\"\n else:ch=\"7\"\n for i in range(len(a)):\n if a[i]!=ch and c>0 and a[i]!=b[i]:\n c-=1\n s+=ch\n else:s+=a[i]\n ans=0\n for i in range(len(b)):\n if b[i]!=s[i]:ans+=1\n print(res+(ans//2))\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\t \t", "a = input()\r\nb = input()\r\nc7 = c4 = 0\r\nfor i in range(len(a)):\r\n if(b[i]!=a[i]):\r\n if(b[i]=='7'):\r\n c7+=1\r\n else:\r\n c4+=1\r\n\r\nans = min(c7,c4)\r\n\r\nans += max(c7,c4) - min(c7,c4)\r\n\r\nprint(ans)", "a=input().rstrip()\r\nb=input().rstrip()\r\nn=len(a)\r\np4=[]\r\np7=[]\r\nfor i in range(n):\r\n if a[i]!=b[i]:\r\n if a[i]=='7':p7.append(i)\r\n else:p4.append(i)\r\nprint(max(len(p4),len(p7)))", "from collections import Counter\r\n\r\nstring1 = input()\r\nstring2 = input()\r\n\r\nx1 = Counter(string1)\r\nx2 = Counter(string2)\r\n\r\nstring1 = list(string1)\r\nstring2 = list(string2)\r\nq = Counter()\r\nq['4'] = abs(x1['4'] - x2['4'])\r\nq['7'] = abs(x1['7'] - x2['7'])\r\nif q['4'] < q['7']:\r\n w = '4'\r\nelse:\r\n w = '7'\r\nans = 0\r\ndp = 0\r\nfor i in range(len(string1)):\r\n if string1[i] != string2[i]:\r\n if q[w] > 0:\r\n ans += 1\r\n q[w] -= 1\r\n else:\r\n dp += 1\r\ndp //= 2\r\nprint(ans + dp)\r\n", "def solve(prev, curr):\r\n\tp_d = {'4': 0, '7': 0}\r\n\r\n\tfor i in range(len(prev)):\r\n\t\tp_d[prev[i]] = p_d[prev[i]] + 1\r\n\r\n\tope = 0\r\n\r\n\tdiff = {'4': 0, '7': 0}\r\n\r\n\tfor i in range(len(prev)):\r\n\t\tif prev[i] != curr[i]:\r\n\t\t\tdiff[prev[i]] = diff[prev[i]] + 1\r\n\r\n\tmax_n = max(diff['4'], diff['7'])\r\n\tmin_n = min(diff['4'], diff['7'])\r\n\r\n\tif max_n == min_n:\r\n\t\treturn max_n\r\n\telse:\r\n\t\treturn min_n + (max_n - min_n)\r\n\r\n\r\nprev = input()\r\ncurr = input()\r\nprint(solve(prev, curr))\r\n", "s = list(input())\r\nt = list(input())\r\none = 0\r\ntwo = 0\r\nfor i in range(len(s)):\r\n\tif s[i] == '4' and t[i] == '7':\r\n\t\tone += 1\r\n\tif s[i] == '7' and t[i] == '4':\r\n\t\ttwo += 1\r\nprint(max(one, two))", "\r\nnum1 = input()\r\nnum2 = input()\r\nminimum_changes = 0\r\ninequaltiy = {}\r\nfor first, second in zip(num1, num2):\r\n if first == second: continue\r\n else:\r\n if first not in inequaltiy:\r\n inequaltiy[first] = 1\r\n else:\r\n inequaltiy[first] += 1\r\nif not inequaltiy:\r\n print(0)\r\nelif len(inequaltiy) == 1:\r\n for key in inequaltiy:\r\n print(inequaltiy[key])\r\nelse:\r\n pairs = min(inequaltiy[\"4\"], inequaltiy[\"7\"])\r\n minimum_changes += pairs \r\n minimum_changes += inequaltiy[\"4\"] + inequaltiy[\"7\"] - (2 * pairs)\r\n print(minimum_changes)", "import math\r\n\r\n\r\ndef solve():\r\n a = list(input())\r\n b = list(input())\r\n n = len(a)\r\n seven_a = a.count('7')\r\n seven_b = b.count('7')\r\n\r\n if seven_a == seven_b:\r\n count = 0\r\n for i in range(n):\r\n if a[i] != b[i]:\r\n count += 1\r\n return count // 2\r\n\r\n count_s = 0\r\n count_f = 0\r\n for i in range(n):\r\n if a[i] == '7' and b[i] == '4':\r\n count_s += 1\r\n elif a[i] == '4' and b[i] == '7':\r\n count_f += 1\r\n\r\n return max(count_f, count_s)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(solve())\r\n", "a, b = input(), input()\nfs, sf = 0, 0\nfor i, x in enumerate(a):\n if a[i] == '4' and b[i] == '7':\n fs += 1\n elif a[i] == '7' and b[i] == '4':\n sf += 1\nprint(max(sf, fs))\n", "a=str(input())\r\nb=str(input())\r\na1=list(a)\r\nb1=list(b)\r\nk=0\r\nfor i in range(0,len(a)):\r\n if(a1[i]!=b1[i]):\r\n k=k+1\r\nka=a1.count('7')\r\nkb=b1.count('7')\r\nif(ka>kb):\r\n f=(k-(ka-kb))//2\r\n print(f+ka-kb)\r\nelse:\r\n f=(k-(kb-ka))//2\r\n print(f+kb-ka)\r\n", "# your code goes here\ns=input()\nt=input()\ncount_7,count_4=0,0\nfor i in range(len(s)):\n\tif s[i]==t[i]:\n\t\tcontinue\n\tif s[i]=='7':\n\t\tcount_7+=1\n\telse:\n\t\tcount_4+=1\nprint(count_7 if count_7>=count_4 else count_4)\n\t\t\t \t \t \t\t\t \t \t \t\t", "a = [int(i) for i in list(input())]\r\nb = [int(i) for i in list(input())]\r\nc = zip(a, b)\r\nindices = [i for i, v in enumerate(c) if v[0] != v[1]]\r\n\r\ncnt4 = sum([a[i]==4 for i in indices])\r\ncnt7 = len(indices) - cnt4\r\n\r\nprint(max([cnt4, cnt7]))", "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\nfrom itertools import accumulate\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\na = ip()\r\nb = ip()\r\n\r\nx = y = 0\r\n\r\nfor i,j in zip(a , b):\r\n if i!=j:\r\n if i=='7':\r\n x+=1\r\n else:\r\n y+=1\r\n \r\nprint(max(x , y))", "s, t = input(), input()\r\na = len(s)\r\nvalues = [[x, int(s[x])] for x in range(a) if s[x] != t[x]]\r\nb = len(values)\r\nn = 0\r\nfor x in values:\r\n if x[1] == 4:\r\n n += 1\r\nn = min([n, b - n])\r\nprint(b - n)", "s=input()\r\ns1=input()\r\nk1=0\r\nk=0\r\nfor i in range(len(s)) :\r\n if s[i]!=s1[i] :\r\n if s[i]==\"4\" :\r\n k+=1\r\n else :\r\n k1+=1\r\nprint(max(k,k1))\r\n", "a=input()\r\nb=input()\r\nd=e=0\r\nfor i in range(len(b)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4':\r\n d+=1\r\n else:\r\n e+=1\r\nprint(max(d,e))", "a = list(input())\r\nb = list(input())\r\nk1 = 0\r\nk2 = 0\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if a[i] == \"4\":\r\n k1 += 1\r\n else:\r\n k2 += 1\r\nprint(max(k1, k2))\r\n", "from sys import stdin, stdout, setrecursionlimit\r\nfrom gc import disable\r\n\r\n#stdin = open(\"input.txt\",\"r\")\r\n#stdout = open(\"output.txt\",\"w\")\r\n \r\n#setrecursionlimit((1<<31)-1)\r\n\r\n \r\ngets = input\r\nputs = print\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\n\r\ndef main() -> int:\r\n disable()\r\n a = gets()\r\n b = gets()\r\n c1 = 0\r\n c2 = 0\r\n for i in range(len(a)):\r\n if (a[i]!=b[i]):\r\n if (a[i] == \"4\"):\r\n c1+=1\r\n else:\r\n c2+=1\r\n print(\"%i\"%(c1 if (c1 > c2) else c2))\r\n return 0;\r\n \r\nif (__name__ == \"__main__\"):\r\n main()\r\n \r\n#stdin.close()\r\n#stdout.close()", "def main():\n l = [x == '7' for x, y in zip(input(), input()) if x != y]\n x = sum(l)\n print(max(x, len(l) - x))\n\n\nif __name__ == '__main__':\n main()", "a=input()\r\nb=input()\r\nfou=0; sev=0\r\n\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4':\r\n fou+=1\r\n else:\r\n sev+=1\r\nprint(max(fou,sev))\r\n", "\r\n \r\n#import operator\r\n# t = int(input())\r\n# for _ in range(t):\r\n#n = int(input())\r\n#cost = int(input())\r\n# a = [int(i) for i in input().split()]\r\n# b = [int(i) for i in input().split()]\r\na=str(input())\r\nb=str(input())\r\nlist1=[0]*2 #index 0:4, index 1:7\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if a[i] == \"4\":\r\n list1[0] += 1\r\n else:\r\n list1[1] += 1\r\n# print(list1) . \r\nres = min(list1) + abs(list1[0]-list1[1])\r\nprint(res)", "a=list(map(int,list(input())))\r\nb=list(map(int,list(input())))\r\nc=0\r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n c+=1\r\nc1=0\r\nfor i in range(len(a)):\r\n if(a[i]==7 and b[i]==4):\r\n c1+=1\r\nc2=0\r\nfor i in range(len(a)):\r\n if(a[i]==4 and b[i]==7):\r\n c2+=1\r\nprint(c-min(c1,c2))", "A = input()\r\nB = input()\r\n\r\nmis_a, mis_b = 0, 0\r\n\r\nfor i in range(len(A)):\r\n if A[i] != B[i]:\r\n if A[i] == '4':\r\n mis_a += 1\r\n else:\r\n mis_b += 1\r\nprint(\"%d\" % max(mis_a, mis_b))\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\na = input()\r\nb = input()\r\nextrafour, extraseven = 0, 0\r\ncount = 0\r\nfor i in range(len(a)) :\r\n if a[i] != b[i] :\r\n if b[i] == '4' :\r\n extrafour += 1\r\n else :\r\n extraseven += 1\r\nswap = min(extrafour, extraseven)\r\nprint(swap + max(0, extrafour - swap) + max(0, extraseven - swap))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "a, b = input(), input()\r\nx, y = a.count('7'), b.count('7')\r\nif x > y: a, b = b, a\r\nd = abs(x - y)\r\np, s = d, 0\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if d and b[i] == '7': d -= 1\r\n else: s += 1\r\nprint(p + s // 2 + s % 2)", "def luckyConversion():\r\n count1 = 0 \r\n count2 = 0 \r\n for i in range(len(a)):\r\n if a[i] == b[i]:\r\n pass\r\n else:\r\n if a[i] == '4':\r\n count1 += 1 \r\n \r\n if a[i] == '7':\r\n count2 += 1\r\n \r\n #return(count2,count1)\r\n return max(count2,count1) \r\n\r\n \r\na = input()\r\nb = input()\r\nx = luckyConversion()\r\nprint(x)\r\n ", "a=input()\r\nb=input()\r\nc4,c7=0,0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4':\r\n c4+=1\r\n else:\r\n c7+=1\r\nprint(min(c7,c4)+abs(c7-c4))\r\n ", "import sys\r\nread=sys.stdin.buffer.readline\r\n\r\nmi=lambda:map(int,read().split())\r\nli=lambda:list(mi())\r\ncin=lambda:int(read())\r\n\r\na=input()\r\nb=input()\r\nd={'4':0,'7':0}\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n d[b[i]]+=1\r\nprint(max(d['4'],d['7']))", "a=input().strip()\r\nb=input().strip()\r\nx,y=0,0\r\nfor i in range(0,len(a)):\r\n\tif a[i]=='4' and b[i]=='7':\r\n\t\tx+=1\r\n\telif a[i]=='7' and b[i]=='4':\r\n\t\ty+=1\r\nprint(max(x,y))\r\n", "l=list(input())\r\nm=list(input())\r\ncount=0\r\nfour=0\r\nseven=0\r\nfor i in range(len(l)):\r\n if l[i]!=m[i] and l[i] == '4':\r\n four+=1\r\n elif l[i]!=m[i] and l[i] == '7':\r\n seven+=1\r\ncount=max(seven,four)\r\nprint(count)\r\n\r\n", "\nif __name__== \"__main__\":\n\n data_A = input()\n data_B = input()\n\n cont_7 = 0; cont_4 = 0\n\n for it in range(len(data_A) ):\n if data_A[it] != data_B[it]:\n if data_A[it] == '7':\n cont_7 += 1\n else:\n cont_4 += 1\n\n print( max( cont_4, cont_7) )\n\n\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\na = list(input().rstrip())\r\nb = list(input().rstrip())\r\nc = [0] * 2\r\nfor i, j in zip(a, b):\r\n if i ^ j:\r\n c[i & 1] += 1\r\nans = max(c)\r\nprint(ans)", "import sys\r\na, b = sys.stdin.read().split()\r\n\r\nx = 0\r\ny = 0\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if a[i] == '4':\r\n x += 1\r\n else:\r\n y += 1\r\nprint (max(x,y))\r\n", "def solve(s1,s2):\n\tx,y = 0,0\n\tfor i in range(len(s1)):\n\t\tif s1[i] == '4' and s2[i] == '7':\n\t\t\tx += 1\n\t\telif s1[i] == '7' and s2[i] == '4':\n\t\t\ty += 1\n\tprint(max(x,y))\n\ns1,s2 = input(),input()\n\nif __name__ == '__main__':\n\tsolve(s1,s2)", "a = input()\r\nb = input()\r\nf=s=0\r\nfor x in range(len(a)):\r\n if a[x]!=b[x]:\r\n if a[x]=='4': f+=1\r\n else: s+=1\r\nprint(max(f,s))", "#n,k = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\ns1=input()\r\ns2=input()\r\nsa=0\r\nsb=0\r\nfa=0\r\nfb=0\r\nfor i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n if s1[i]=='4':\r\n fa+=1\r\n else:\r\n sa+=1\r\n if s2[i]=='4':\r\n fb+=1\r\n else:\r\n sb+=1\r\nprint(max(sa,fa))\r\n\r\n\r\n", "s1 = input()\r\ns2 = input()\r\nn = len(s1)\r\nres_47, res_74 = 0, 0\r\nfor i in range(n):\r\n if s1[i] == '4' and s2[i] == '7':\r\n res_47 += 1\r\n if s1[i] == '7' and s2[i] == '4':\r\n res_74 += 1\r\nprint(max(res_47, res_74))\r\n", "a=list(input())\nb=list(input())\nx=0\ny=0\nfor i in range(len(a)):\n if a[i]=='4' and b[i]=='7':\n x+=1\n elif a[i]=='7' and b[i]=='4': \n y+=1\nprint(max(x,y))\n\t \t \t \t\t \t\t\t\t \t\t \t \t \t\t \t", "a = input()\r\nb = input()\r\nfour = seven = 0\r\nl = len(a)\r\nfor i in range(l):\r\n if a[i]=='4' and b[i]=='7':\r\n four += 1\r\n elif a[i]=='7' and b[i]=='4':\r\n seven += 1\r\nprint(max(four,seven))", "a = input()\r\nb = input()\r\nx,y = 0,0\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if a[i] == \"4\":\r\n x += 1\r\n else:\r\n y += 1\r\nprint(max(x,y))", "a=input()\r\nb=input()\r\nl1=list(a)\r\nl2=list(b)\r\nl=len(l1)\r\ni=0\r\nf=0\r\ns=0\r\nwhile i<l:\r\n if l1[i]==l2[i]:\r\n l1[i]='0'\r\n i+=1\r\n\r\ni=0\r\nwhile i<l:\r\n if l1[i]=='4':\r\n f+=1\r\n elif l1[i]=='7':\r\n s+=1\r\n i+=1\r\nprint(max(f,s))\r\n", "a = input()\r\nb = input()\r\n\r\ndiff = list()\r\nfor i in range(len(a)):\r\n if(a[i]==b[i]): continue\r\n else:\r\n diff.append(a[i])\r\n\r\nc4 = diff.count('4')\r\nc7 = diff.count('7')\r\nprint(max(c4,c7))", "a = input()\nb = input()\ns = ''.join(x if x != y else '' for x, y in zip(a, b))\nfours = s.count('4')\nsevens = s.count('7')\nprint(min(fours, sevens) + abs(fours - sevens))\n", "s1 = input()\r\ns2 = input()\r\nc1 = c2 = 0\r\nfor i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n if s1[i] == '4':\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nprint(max(c1, c2))# 1698075621.9756825", "c = []\r\n\r\nfor i, j in zip(input(), input()):\r\n if i != j:\r\n c.append(i < j)\r\n\r\nprint(max(sum(c), len(c) - sum(c)))\r\n", "a = list(input())\r\nb = list(input())\r\n\r\na_copy = a[:]\r\na_copy.sort()\r\nb_copy = b[:]\r\nb_copy.sort()\r\n\r\nreplace_counter = 0\r\nswap_counter = 0\r\n\r\nfor i in range(len(a_copy)):\r\n if(a_copy[i] != b_copy[i]):\r\n replace_counter += 1\r\n\r\nfor i in range(len(a)):\r\n if (a[i] != b[i]):\r\n swap_counter += 1\r\n\r\nswap_counter = (swap_counter - replace_counter) // 2\r\nprint(replace_counter + swap_counter)", "a=input()\r\nb=input()\r\nfou=0; sev=0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4': fou+=1\r\n else: sev+=1\r\nprint(max(fou,sev))", "s = input()\r\ns1 = input()\r\nnu4 = 0\r\nnu7 = 0\r\nfor i in range(len(s)):\r\n if not s[i] == s1[i]:\r\n if s[i] =='4':\r\n nu4 += 1\r\n else:\r\n nu7 += 1\r\n#res = min(nu4,nu7)//2\r\nres = max(nu4,nu7) \r\nprint(res)", "a=input()\nb=input()\ncount_4=0\ncount_7=0\nfor i in range(0,len(a)):\n if a[i]!=b[i]:\n if int(a[i])==4:\n count_4=count_4+1\n else :\n count_7=count_7+1\nprint(max(count_4,count_7))", "a,b=input(),input();c,d=0,0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]=='4': c+=1\r\n else: d+=1\r\nprint(max(c,d))", "a=input()\r\nb=input()\r\nx=0\r\ny=0\r\nfor i in range(0,len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]==\"4\":\r\n x=x+1\r\n elif a[i]==\"7\":\r\n y=y+1\r\nprint(max(x,y))", "word1 = input()\r\nword2 = input()\r\n\r\ndef codeforces_145(A, B):\r\n A = str(A)\r\n B = str(B)\r\n\r\n count = 0\r\n _4 = _7 = 0\r\n\r\n for i in range(0, len(A)):\r\n if A[i] != B[i]:\r\n if A[i] == '4':\r\n _4 += 1\r\n else:\r\n _7 += 1\r\n\r\n \r\n min = _7 if _4 >= _7 else _4\r\n ans = min + ((_4 - min) + (_7 - min))\r\n print(ans)\r\n \r\n\r\ncodeforces_145(word1, word2)", "a=input()\r\nb=input()\r\nn=len(a)\r\nx=0\r\ny=0\r\nfor i in range (0,n):\r\n if a[i]!=b[i] and a[i]=='4':\r\n x+=1\r\n elif a[i]!=b[i] and a[i]=='7':\r\n y+=1\r\nprint(max(x,y))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l=list(input())\r\nm=list(input())\r\ne=0\r\nf=0\r\nfor i in range(len(l)):\r\n if(l[i]!=m[i]):\r\n if(l[i]=='4'):\r\n e+=1\r\n else:\r\n f+=1\r\nprint(max(e,f))", "import sys\r\ninput = sys.stdin.readline\r\n\r\na = input()[:-1]\r\nb = input()[:-1]\r\nx = len(a)\r\n\r\nc, d = 0, 0\r\nfor i in range(x):\r\n if a[i] == '7' and b[i] == '4':\r\n c += 1\r\n if a[i] == '4' and b[i] == '7':\r\n d += 1\r\n\r\nprint(min(c,d) + c - min(c, d) + d - min(c,d))\r\n", "a,b,d=input(),input(),{4:0,7:0}\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n d[int(a[i])]+=1\r\nprint(max(d[4],d[7]))", "n = input()\r\nm = input()\r\n\r\nfour=0\r\nseven=0\r\n\r\nfor i in range(len(n)):\r\n if n[i]!=m[i]:\r\n if(n[i]=='4'):\r\n four+=1\r\n else:\r\n seven+=1\r\nans=min(four,seven)\r\nans+=max(four,seven)-min(four,seven)\r\nprint(ans)", "a, b = input(), input()\r\nf = list(zip(a, b)).count(('4', '7'))\r\ns = list(zip(a, b)).count(('7', '4'))\r\nprint(f + s - min(f, s))\r\n", "a,b=input(), input()\ni=0\nf=0\ns=0\n\nfor j in (a):\n\tif b[i]!=j:\n\t\tif j==\"4\":\n\t\t\tf+=1\n\t\telse:\n\t\t\ts+=1\n\ti+=1\nprint(max(s,f))\n\t\t\t\t \t \t \t\t \t\t\t\t\t \t \t \t", "a, b = input(), input()\r\ncnt4 = sum([a[i] == '4' and b[i] == '7' for i in range(len(a))])\r\ncnt7 = sum([a[i] == '7' and b[i] == '4' for i in range(len(a))])\r\nprint(cnt4 + cnt7 - min(cnt4, cnt7))\r\n", "a = list(map(int,input()))\r\nb= list(map(int,input()))\r\nc = 0; z = 0\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if a[i]==4:\r\n c+=1\r\n else:\r\n z+=1\r\nprint(max(c,z))\r\n\r\n", "'''\r\nCreated on Feb 11, 2015\r\n\r\n@author: mohamed265\r\n'''\r\na = input()\r\nb = input()\r\nnum4 = num7 = 0\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if a[i] == '4':\r\n num4 += 1\r\n else:\r\n num7 += 1\r\nprint(min(num4, num7) + (0 if num4 == num7 else abs(num4 - num7)))\r\n", "a=list(input())\r\nb=list(input())\r\nx=0\r\ny=0\r\nfor i in range(len(a)):\r\n if a[i]=='4' and b[i]=='7':\r\n x+=1\r\n elif a[i]=='7' and b[i]=='4': \r\n y+=1\r\nprint(max(x,y))", "a=input()\nb=input()\nn = len(a)\nm={'4':0,'7':0}\nfor i in range(n):\n if a[i]==b[i]:\n pass\n else:\n m[a[i]]+=1\n\np=m['4']\nq=m['7']\nans=min(p,q)\np-=ans\nq-=ans\nans+=p+q\nprint ( ans)\n" ]

[ "import sys\r\n\r\nn = int(sys.stdin.readline())\r\narr1 = list(map(int, sys.stdin.readline().split()))\r\narr2 = list(map(int, sys.stdin.readline().split()))\r\ncnt = 0\r\narr = arr1 + arr2\r\nfor i in arr:\r\n for j in arr:\r\n temp = i ^ j\r\n if temp == 2 * n:\r\n cnt += 1\r\nprint('Karen' if cnt % 2 == 0 else 'Koyomi')", "n=int(input())\r\nLko = list(map(int, input().split()))\r\nLka=list(map(int,input().split()))\r\n\r\nE=set(Lko+Lka)\r\n\r\nc=0;\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if((Lko[i]^Lka[j])in E) :\r\n c=c+1;\r\n\r\nif (c%2==0):\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")\r\n", "n = int(input())\r\nif n == 1:\r\n arr1 = [int(input())]\r\n arr2 = [int(input())]\r\nelse:\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\nprint(\"Karen\")\r\n\r\n", "import os\nimport turtle\na=1\nb=1\nc=1\nd=1\nprint(\"Karen\")\n \t \t \t \t\t \t\t\t\t\t \t \t\t\t \t \t", "n = int(input())\nxs = list(map(int, input().split()))\nys = list(map(int, input().split()))\n\n# cnt = 0\n\n# for i in range(n):\n# for j in range(n):\n# xor = xs[i] ^ ys[j]\n# if xor in xs or xor in ys:\n# cnt += 1\n# if cnt % 2 == 0:\n# print('Karen')\n# else:\n# print('Koyomi')\n\n# xi ^ yj = xk, xk ^ yj = xi\n\nprint('Karen')", "import sys\n\n\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\n\nn = int(input())\n\na = get_list()\nb = get_list()\n\nprint(\"Karen\")\n\t\t\t \t\t \t\t\t \t\t \t \t \t\t \t", "print('Karen')\n\n#if A^B==C then A^C ==B\n", "I = lambda: list(map(int, input().split()))\r\n\r\nI()\r\nX, Y = I(), I()\r\nZ = set(X) | set(Y)\r\n\r\nprint('Koyomi' if sum(x^y in Z for x in X for y in Y) % 2 else 'Karen')", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nprint('Karen')\r\n\r\n", "import marshal\r\n\r\nbytes = b'\\xe3\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x00\\x02\\x00\\x00\\x00@\\x00\\x00\\x00s\\x0c\\x00\\x00\\x00e\\x00d\\x00\\x83\\x01\\x01\\x00d\\x01S\\x00)\\x02Z\\x05KarenN)\\x01\\xda\\x05print\\xa9\\x00r\\x02\\x00\\x00\\x00r\\x02\\x00\\x00\\x00\\xfa\\x08<string>\\xda\\x08<module>\\x01\\x00\\x00\\x00s\\x00\\x00\\x00\\x00'\r\n\r\ncode = marshal.loads(bytes)\r\nexec(code)", "#!/usr/bin/env python\r\n\r\nimport math\r\nn = input()\r\nn = int(n)\r\na = input().split()\r\nb = input().split()\r\nans = 0\r\nfor i in range(n):\r\n\tif int(a[i])^int(a[i]) == n<<2:\r\n\t\tans += 1\r\nfor i in range(n):\r\n\tif int(b[i])^int(b[i]) == n<<2:\r\n\t\tans += 1\r\nif ans%2 == 1: \r\n\tprint('Koyomi')\r\nelse:\r\n\tprint('Karen')\r\n#input('press<enter>')", "n=int(input())\r\nkoy = list(map(int, input().split()))\r\nkar = list(map(int, input().split()))\r\ns=set(koy+kar)\r\nd=0;\r\nfor i in koy:\r\n for j in kar:\r\n o = i ^ j\r\n if o in s:\r\n d+=1;\r\nif d % 2 == 0:\r\n print(\"Karen\")\r\nelse:\r\n print (\"Koyomi\")\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ns= set(l)\r\nfor i in a:\r\n s.add(i)\r\nc = 0\r\nfor i in l:\r\n for j in a:\r\n x= i^j\r\n if(x in s):\r\n c= c+1\r\n\r\nif(c%2==0):\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")\r\n", "print(\"Karen\")\r\n", "n=int(input())\nfirst=set(map(int, input().split()))\nsecond=set(map(int, input().split()))\n\nprint(\"Karen\")", "if __name__ == '__main__':\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n y = list(map(int, input().split()))\r\n\r\n print(\"Karen\")", "# LUOGU_RID: 113744414\nprint('Karen')", "N = input()\r\nleft = list(map(int, input().split()))\r\nright = list(map(int, input().split()))\r\nnumbers = set(left + right)\r\n \r\nxors = sum(l ^ r in numbers for l in left for r in right)\r\nprint(\"Koyomi\" if xors % 2 else \"Karen\")", "# Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!\r\n\r\nprint(\"Karen\")", "n=int(input())\r\na=*map(int,input().split()),\r\nb=*map(int,input().split()),\r\ns={*a}|{*b}\r\nprint('KKaoryeonm i'[sum(x^y in s for x in a for y in b)%2::2])", "\r\na = int(input())\r\nx = set(map(int,input().split()))\r\nxz = set(map(int,input().split()))\r\nqw = 0\r\nfor i in x:\r\n for u in xz:\r\n vb = i^u\r\n if vb in x or vb in xz:\r\n qw += 1\r\nif qw % 2 == 0:\r\n print('Karen')\r\nelse:\r\n print('Koyomi')", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\ndic={}\r\nfor i in range(n):\r\n dic[x[i]]=1\r\n dic[y[i]]=1\r\nans=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if (x[i]^ y[j]) in dic:\r\n ans+=1\r\nif ans%2:\r\n print(\"Koyomi\")\r\nelse:\r\n print(\"Karen\")", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\ns = set(x + y)\r\n\r\nc = sum(xi ^ yj in s for xi in x for yj in y)\r\nprint('Koyomi' if c % 2 else 'Karen')", "def solve(a, b, m):\n\tcnt = 0\n\tfor i in a:\n\t\tfor j in a:\n\t\t\tif m.get(i^j) != None:\n\t\t\t\tcnt += 1\n\treturn cnt%2==0\n\n\ndef main():\n\tn = int(input())\n\tN1 = [int(i) for i in input().split()]\n\tN2 = [int(i) for i in input().split()]\n\tm = {}\n\tfor i in N1:\n\t\tm[i] = 1\n\tfor i in N2:\n\t\tm[i] = 1\n\tif solve(N1,N2,m):\n\t\tprint(\"Karen\")\n\telse:\n\t\tprint(\"Koyomi\")\n\nmain()", "# 0ee7d3c2309a195acbbfca8221ac8e87774da6931b181a28333ecdf0ffd7263f\r\nprint(\"Karen\")", "# LUOGU_RID: 108544839\nprint(\"Karen\")", "n=int(input())\r\ns1=set(map(int,input().split()))\r\ns2=set(map(int,input().split()))\r\ns=s1.union(s2)\r\ncount=0\r\nfor e1 in s1:\r\n for e2 in s2:\r\n if(e1^e2 in s):\r\n count+=1\r\nif(count%2)==0:\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")\r\n", "n = int(input());a=input().split();b=input().split();print(\"Karen\")", "str = \"Karen\"\r\nprint(str)", "print(\"Karen\")", "#!/usr/bin/python\n\nn = int(input())\n\na = list(map(int, input().split(\" \")))\nb = list(map(int, input().split(\" \")))\n\nsa = set(a)\nsb = set(b)\n\ns= 0;\n\nfor x in a:\n for y in b:\n z = x ^ y\n s += (1 if z in sa or z in sb else 0)\n\nif s % 2:\n print(\"Koyomi\")\nelse:\n print(\"Karen\")\n", "n = int(input())\r\nkoy = list(map(int, input().split()))\r\nkar = list(map(int, input().split()))\r\n_set = set(koy).union(kar)\r\n\r\ncount = 0 \r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if koy[i]^kar[j] in _set:\r\n count+=1\r\n \r\nprint('Koyomi' if count%2==1 else 'Karen')\r\n\r\n", "print (\"Karen\")", "n=int(input())\r\nx=input()\r\ny=input()\r\nprint(\"Karen\")\r\n", "#+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nprint(\"Karen\")", "# LUOGU_RID: 108707937\nprint(\"Karen\")", "n=int(input())\r\nlko= list(map(int,input().split()))\r\nlka= list(map(int,input().split()))\r\ne=set(lko+lka)\r\nc=0;\r\nfor i in range (n):\r\n for j in range(n):\r\n if(lko[i]^lka[j] in e):\r\n c=c+1;\r\nif(c%2==0):\r\n print(\"Karen\")\r\nelse:\r\n print(\"Kayomi\")\r\n", "def solve(a,b,n):\n return 'Karen'\n\ndef main():\n n = int(input())\n a = list(map(int, input().split(\" \")))\n b = list(map(int, input().split(\" \")))\n print(solve(a,b,n))\n\nmain()", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=set(l1+l2)\r\nans=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if (l1[i]^l2[j]) in l3:\r\n ans=ans+1\r\nif ans%2==0:\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")", "n=int(input())\r\nko = list(map(int, input().split()))\r\nka = list(map(int, input().split()))\r\n\r\nL=set(ko+ka)\r\nc=0;\r\nfor i in ko:\r\n for j in ka:\r\n xor = i ^ j\r\n if xor in L:\r\n c+=1;\r\nif c % 2 == 0:\r\n print(\"Karen\")\r\nelse:\r\n print (\"Koyomi\")", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nnumbers = set(x+y)\r\ncount = 0\r\nfor i in x:\r\n for j in y:\r\n if i^j in numbers:\r\n count += 1\r\nif (count%2==0):\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")", "print(\"Kfaadrresehfn\"[::3])", "n = int(input())\r\nx = input()\r\ny = input()\r\nprint(\"Karen\")", "# -*- 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/6 21:41\r\n\r\n\"\"\"\r\n\r\n\r\nN = int(input())\r\nX = [int(x) for x in input().split()]\r\nY = [int(x) for x in input().split()]\r\nprint('Karen')", "# 50 characters meet to check. inputs\nprint(\"Karen\")\n\t \t\t \t \t\t \t\t \t\t\t\t \t\t\t \t\t \t\t \t", "from collections import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\ndd=defaultdict(int)\r\nfor i in l:\r\n dd[i]+=1\r\nfor i in d:\r\n dd[i]+=1\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n x=l[i]^d[j]\r\n if(dd[x]>0):\r\n c+=1\r\nif(c%2==0):\r\n print('Karen')\r\nelse:\r\n print(\"Koyomi\")", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,=I()\na=I();b=I()\nd=set(a+b)\nan=\"Karen\";p=0\nfor i in a:\n\tfor j in b:\n\t\tif i^j in d:\n\t\t\tp+=1\nif p%2:\n\tan=\"Koyomi\"\nprint(an)", "Sum, First, Second = 0, list(map(int, input().split())), list(map(int, input().split()))\r\nTemp = First + Second\r\nfor i in First:\r\n for j in Second:\r\n Sum += (1 if i ^ j in Temp else 0)\r\nprint(\"Karen\" if Sum % 2 == 0 else \"Koyomi\")\r\n# Come together for getting better !!!!\r\n", "import sys\r\n\r\ndef main():\r\n print(\"Karen\")\r\n \r\n\t\r\nif __name__ == '__main__':\r\n main() \r\n \r\n", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\ns = set(x+y)\r\n\r\nc = 0\r\n\r\nfor i in x:\r\n for j in y:\r\n if (i^j) in s:\r\n c += 1\r\nif c%2:\r\n print(\"Koyomi\")\r\nelse:\r\n print(\"Karen\")\r\n", "if __name__ == '__main__':\n n = int(input())\n A = [int(x) for x in input().split()]\n B = [int(x) for x in input().split()]\n C = set(A + B)\n k = 0\n for i in A:\n for j in B:\n if i^j in C:\n k += 1\n if k % 2 == 0:\n print(\"Karen\")\n else:\n print(\"Koyomi\")\n", "import operator\r\na = int(input())\r\nll = [int(x) for x in input().split()]\r\nhh = [int(x) for x in input().split()]\r\ns = 0\r\nfor i in range(a):\r\n if operator.xor(ll[i], hh[i]):\r\n s+=1\r\ns*=2\r\nif s%2 == 0:\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")", "KOYOMI = 'Koyomi'\r\nKAREN = 'Karen'\r\n\r\n\r\ndef main():\r\n input()\r\n first_str = input().split()\r\n first = list(map(int, first_str))\r\n second_str = input().split()\r\n second = list(map(int, second_str))\r\n print(game(first, second))\r\n\r\n\r\ndef game(first, second):\r\n unique_numbers = set(first + second)\r\n\r\n pairs = 0\r\n for i in first:\r\n for j in second:\r\n result = i ^ j\r\n if result in unique_numbers:\r\n pairs += 1\r\n\r\n return KOYOMI if pairs % 2 else KAREN\r\n\r\n\r\nmain()\r\n", "from sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\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 = ii1()\r\narr1 = iia()\r\narr2 = iia()\r\nnum = set([*arr1, *arr2])\r\nres = 0\r\nfor i in arr1:\r\n for j in arr2:\r\n if i ^ j in num:\r\n res += 1\r\nif res % 2 == 0:\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")\r\n", "print(\"Karen\")\n# Mon Sep 28 2020 19:23:43 GMT+0300 (Москва, стандартное время)\n", "import sys,os\r\nfrom math import sqrt, gcd,ceil,factorial\r\nfrom collections import defaultdict\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=int(input())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\ncnt=0\r\ndis=set(A+B)\r\nfor i in range(n):\r\n for j in range(n):\r\n if A[i]^B[j] in dis:\r\n cnt+=1\r\nprint(\"Koyomi\" if cnt%2 else \"Karen\")", "# collaborated with no one\n\nnumbers = int(input())\n\nkoyomi = list(map(int, input().split()))\n\nkaren = list(map(int, input().split()))\n\nprint(\"Karen\")\n\n\n\t\t\t\t\t\t \t \t \t \t\t\t\t", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\ns = set()\r\nfor xx in x:\r\n s.add(xx)\r\nfor yy in y:\r\n s.add(yy)\r\nkaren = 0\r\nfor xx in x:\r\n for yy in y:\r\n if xx^yy in s:\r\n karen += 1\r\nif karen%2 == 0:\r\n print('Karen')\r\nelse:\r\n print('Koyomi')", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nprint(\"Karen\")", "#python3\r\n#utf-8\r\nprint('Karen')\r\n", "n = int(input())\n\nx1 = [int(i) for i in input().split()]\nx2 = [int(i) for i in input().split()]\n\nprint(\"Karen\")\n", "print(\"Karen\")\n\n#The submission needs 50 characters.\n\t \t\t\t \t\t\t\t\t\t \t \t\t\t\t\t\t", "def main():\r\n names = ['Karen', 'Koyomi']\r\n n = int(input())\r\n x = [int(c) for c in input().split()]\r\n y = [int(c) for c in input().split()]\r\n\r\n nset = set(x).union(set(y))\r\n \r\n pairs = 0\r\n for xx in range(n):\r\n for yy in range(n):\r\n if xx^yy in nset:\r\n pairs += 1\r\n \r\n if pairs % 2 == 0:\r\n print(names[0])\r\n else:\r\n print(names[1])\r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\nn = int(rd())\r\nx = list(map(int, rd().split()))\r\ny = list(map(int, rd().split()))\r\n\r\nprint(\"Karen\")\r\n\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn = I()\r\nx = IL()\r\ny = IL()\r\nprint(\"Karen\")", "from sys import stdin\r\ninput = stdin.readline\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\nfrom collections import defaultdict as dd, deque as dq,Counter as C\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom bisect import bisect_left as bl ,bisect_right as br\r\nfrom itertools import combinations as c,permutations as p\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nmp = lambda : map(int,input().split())\r\nit = lambda: int(input())\r\nls = lambda : list(input().strip())\r\nmt = lambda r : [ list(mp()) for _ in range(r)]\r\nlcm = lambda a,b : (a*b)//gcd(a,b)\r\ndef fibo_n(n):\r\n\treturn (((1+sqrt(5))/2)**n)/sqrt(5)\r\nmod = 1000000007\r\na = it()\r\nb = list(mp())\r\nc = list(mp())\r\nk = C(b) + C(c)\r\ncnt =0\r\nfor i in b:\r\n\tfor j in c:\r\n\t\tif k[i^j]>0:\r\n\t\t\tcnt+=1\r\nprint([\"Karen\",\"Koyomi\"][cnt&1])", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nfrom itertools import product\r\n\r\nst = set((*a, *b))\r\n\r\nnpairs = sum((x ^ y) in st for x, y in product(a, b))\r\nprint('Koyomi' if npairs & 1 else 'Karen')", "n = int(input().strip())\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\ns1 = set(a+b)\nc = 0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif a[i]^b[j] in s1:\n\t\t\tc += 1\nprint(['Karen', 'Koyomi'][c%2])", "n=int(input())\r\nt1=list(map(int,input().split()))\r\nt2=list(map(int,input().split()))\r\ns=set(t1)\r\ns1=set(t2)\r\nnb=0\r\nfor i in range(n) :\r\n for k in range(n) :\r\n if (((t1[i]^t2[k]) in s) or ((t1[i]^t2[k])in s1)) :\r\n nb+=1\r\nif nb%2==0 :\r\n print(\"Karen\")\r\nelse :\r\n print(\"Koyomi\")", "n = int(input())\r\nax = list(map(int,input().split()))\r\nbx = list(map(int,input().split()))\r\ns = set(ax+bx)\r\nans = 0\r\nfor c1 in ax:\r\n for c2 in bx:\r\n ans += (c1 ^ c2) in s\r\nif ans%2==0:\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")\r\n", "#\n# @author\tMoe_Sakiya \t[email protected]\n# @date \t2018-02-22 20:35:10\n#\n\nprint(\"Karen\")", "def E1():\n n = int(input())\n kar = [int(x) for x in input().split()]\n koy = [int(x) for x in input().split()]\n print(\"Karen\")\n\nif __name__ == '__main__':\n E1()\n\t \t\t \t\t\t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\ns=set()\r\nfor i in a:\r\n s.add(i)\r\nfor i in b:\r\n s.add(i)\r\nfor i in a:\r\n for j in b:\r\n if i ^ j in s:\r\n c+=1\r\nprint(\"Karen\" if (c+1)%2 else \"Kiyomi\")", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,=I()\na=I();b=I()\nd=set(a+b)\nan=\"Karen\"\nprint(an)", "from sys import stdin,stdout\r\n\r\n\r\ndef solve():\r\n\tn = int(stdin.readline())\r\n\tx = [int(value) for value in stdin.readline().split()]\r\n\ty = [int(value) for value in stdin.readline().split()]\r\n\r\n\tcnt = 0\r\n\tfor xi in x:\r\n\t\tfor yj in y:\r\n\t\t\tif xi <= n and yj <= n:\r\n\t\t\t\tvalue = xi ^ yj\r\n\t\t\t\tif value in x or value in y:\r\n\t\t\t\t\tcnt +=1\r\n\r\n\r\n\tif cnt%2==0:\r\n\t\tstdout.write(\"Karen\")\r\n\telse:\r\n\t\tstdout.write(\"Koyom\")\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n\tsolve()\r\n", "from itertools import permutations\nprint(\"Karen\")\n", "input(),input(),input(),print(\"Karen\")", "a = int(input())\r\nb= input()\r\nc = input()\r\nprint(\"Karen\")", "# LUOGU_RID: 108717765\nprint(\"Karen\")", "# for(i=0;i<n;i++){\r\n# \t\tcin>>k;\r\n# \t\tsum+=k;\r\n# \t\tif(k&1) flag=min(flag,k);\r\n# \t}\r\n# \tif(sum&1) cout<<sum;\r\n# \telse cout<<max(0LL,sum-flag);\r\nn=(int)(input())\r\nll=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nprint('Karen')", "import sys\r\n\r\nlines = sys.stdin.readlines()\r\n\r\nn = int(lines[0])\r\nxs = map(lambda x: int(x), lines[1].split())\r\nys = map(lambda y: int(y), lines[2].split())\r\n\r\nall = set(xs).union(ys)\r\n\r\npairs = 0\r\n\r\nfor x in xs:\r\n for y in ys:\r\n if x ^ y in all:\r\n pairs += 1\r\n\r\nif pairs % 2 == 0:\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")\r\n", "\r\nn=int(input())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\n\r\nl=set(l1+l2)\r\nc=0\r\nfor i in l1:\r\n for j in l2:\r\n if (i^j )in l : \r\n c=c+1\r\n\r\nif (c % 2 == 0 ) :\r\n print(\"Karen\")\r\nelse:\r\n print(\"Koyomi\")", "print(\"Karen\")\n\n\n\n# Made By Mostafa_Khaled", "from base64 import b64decode as dec\r\neval(dec('cHJpbnQoJ0thcmVuJyk='))\r\n" ]

[ "n=int(input())\r\nprint(2*n-1, 2)\r\nprint(1, 2)", "n = int(input())\r\nprint (max(1,n*2-2),2,end=\" \\n\")\r\nprint (1,2,end=\" \")", "n=int(input())\r\nprint(n*2-1,2)\r\nprint(1,2)", "n = int(input())\r\nprint(max(1, (n - 1) * 2), 2)\r\nprint(1, 2)\r\n", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n print(n * 2 - 2, 2)\r\n print(1, 2)\r\nelse:\r\n print(n * 2 - 1, 2)\r\n print(1, 2)", "print(max(1,int(input())*2-2),\"2\\n1 2\")", "import sys\r\n\r\ndef rl(proc=None):\r\n if proc is not None:\r\n return proc(sys.stdin.readline())\r\n else:\r\n return sys.stdin.readline().rstrip()\r\n\r\ndef srl(proc=None):\r\n if proc is not None:\r\n return map(proc, rl().split())\r\n else:\r\n return rl().split()\r\n\r\ndef main():\r\n A = rl(int)\r\n print(2 * A - 1, 2)\r\n print(1, 2)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "print(int(input())*2-1,2,1,2)", "n=int(input())\r\nif n==1:\r\n print(1,1)\r\n print(1)\r\nelse:\r\n print(n*2-2,2)\r\n print(1,2)", "print(int(input())*2-1,2)\r\nprint(1,2)", "def main():\r\n a = int(input())\r\n x = 2 * a - 1\r\n print(x, 2)\r\n print(1, 2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = int(input())\nif a == 1:\n print(1, 1)\n print(1)\nelse:\n print(2 * (a - 1), 2)\n print(1, 2)\n", "n = int(input())\r\n\r\nprint(n * 2 - 1, 2)\r\nprint(1, 2)\r\n", "n=int(input())\nif n==1:\n print(1,1)\n print(1)\n exit()\nprint(2*(n-1),2)\nprint(1,2)", "a=int(input())\r\nif(a==1):\r\n print(1,1)\r\n print(1)\r\nelse:\r\n print(2*a-2,2)\r\n print(1,2)", "#!/usr/bin/env python3\r\n\r\n\r\ndef hh(a):\r\n return ((a - 1) * 4 - 1) // 2 + 1\r\n\r\n\r\nA = int(input())\r\n\r\nif A == 1:\r\n print('1 2\\n1 2')\r\nelse:\r\n print('{} 2\\n1 2'.format(hh(A)))\r\n", "n = int(input())\nif (n != 1) :\n print(n*2-2, 2)\n print(1,2)\nelse:\n print(1, 1)\n print(1)\n\n", "a=int(input())\r\nprint(2*a-1,2)\r\nprint(1,2)", "n = int(input())\nprint(2*n-1, 2)\nprint(1,2)", "a = int(input())\r\nprint(2 * a - 1, 2)\r\nprint(1, 2)", "a = int(input())\nif a == 1:\n print(1, 1)\n print(1)\nelse:\n print(a*2-1, 2)\n print(1, 2)\n", "def help(number):\r\n a = list()\r\n a.append(tuple((2 * number - 1, 2)))\r\n a.append(tuple((1, 2)))\r\n return a\r\n\r\n\r\nn = int(input())\r\nfor elem in help(n):\r\n print(*elem)\r\n", "n = int(input())\r\nprint(2 * n - 1, 2)\r\nprint(1, 2)\r\n", "n=int(input())\r\nprint(max(1,2*n-2),2)\r\nprint(1,2)", "print(int(input())*2-1,2,1,2)\n\n\n\n# Made By Mostafa_Khaled", "a = int(input())\r\n\r\nprint(a*2 - 1, 2, '\\n', 1, 2)\r\n", "a = input()\r\na = int(a)\r\nif (a!=1):\r\n\tprint((a - 1) * 2, 2)\r\n\tprint(1, 2)\r\nelse:\r\n\tprint(1, 2)\r\n\tprint(1, 2)", "A = int(input())\r\nans = 2*(A-1) if A > 1 else 1\r\nprint(\"%d %d\" % (ans, 2))\r\nprint(\"1 2\")", "#!/usr/bin/python3\r\n# Copyright (C) 2017 Sayutin Dmitry.\r\n#\r\n# This program is free software; you can redistribute it and/or\r\n# modify it under the terms of the GNU General Public License as\r\n# published by the Free Software Foundation; version 3\r\n#\r\n# This program is distributed in the hope that it will be useful,\r\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n# GNU General Public License for more details.\r\n#\r\n# You should have received a copy of the GNU General Public License\r\n# along with this program; If not, see <http://www.gnu.org/licenses/>.\r\n\r\ndef main():\r\n a = int(input())\r\n print(2 * a - 1, 2)\r\n print(1, 2)\r\n\r\nmain()\r\n", "n = int(input())\r\nnumber = 2*n -1\r\nm = 2\r\n\r\nprint(number,m,1,2)\r\n", "A=int(input())\r\nprint(2*A-1,2)\r\nprint(1,2)", "n=int(input())\r\na=2*n-1\r\nprint(a,2)\r\nprint(1,2)", "# -*- 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 18:13\r\n\r\n\"\"\"\r\n\r\nA = int(input())\r\n\r\nprint(2*A-1, 2)\r\nprint(1, 2)", "print(int(input()) * 2 - 1,\"2\\n1 2\")", "def main():\r\n count = int(input())\r\n print('{} 2'.format(count * 2 - 1))\r\n print('1 2')\r\n\r\n\r\nmain()\r\n", "# LUOGU_RID: 127490172\nprint(int(input())*2-1,end=\" 2\\n\")\r\nprint(\"1 2\")", "print(str((int(input())*2-1)),\"2\\n1 2\")", "a = int(input())\n\nprint(2*a - 1, end = \" \")\nprint(2)\nprint(1, end = \" \")\nprint(2)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(1, 1)\r\n print(1)\r\n exit(0)\r\n\r\nprint((n-1)*2, 2)\r\nprint(1, 2)", "def main():\r\n n = int(input())\r\n result = 1\r\n if n > 1:\r\n result = 2*n - 2\r\n print(\"{} 2\\n1 2\".format(result))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = int(input())\nif a != 1:\n x = 2 * (a - 1)\n print(x, 2)\n print(1, 2)\nelse:\n print(179, 1)\n print(179)", "a=int(input())\r\nif(a==1):\r\n print(3,1)\r\n print(3)\r\nelse:\r\n print(2*(a-1),2)\r\n print(1,2)\r\n ", "a = int(input())\r\nn = 2 * a - 1\r\nprint(n, 2)\r\nprint(1, 2)" ]

[ "from bisect import bisect_left\r\nn,k=map(int,input().split())\r\nq=\"abcdefghijklmnopqrstuvwxyz\"\r\na={i:[] for i in q}\r\n\r\nfor key,value in enumerate(input()):a[value].append(key)\r\n#print(a)\r\ndef g(t):return [(t[i]+t[i-1])//2 for i in range(1,len(t))] #类似于二分查找的思路 //便于快速确定位置\r\nc={i:g(a[i]) for i in q}\r\n#print(c)\r\n\r\nfor _ in range(n):\r\n s,t=0,input()\r\n lt=len(t)\r\n for key,value in enumerate(t):\r\n if a[value]:\r\n if c[value]:s+=abs(key-a[value][bisect_left(c[value],key)])\r\n else:s+=abs(key-a[value][0])\r\n else:\r\n s+=lt\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n", "from bisect import bisect_left\r\n\r\nn, k = map(int, input().split())\r\nq = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\na = {i: [] for i in q}\r\nfor i, j in enumerate(input()): a[j].append(i)\r\n\r\ndef g(t): return [(t[i] + t[i - 1]) // 2 for i in range(1, len(t))]\r\nc = {i: g(a[i]) for i in q}\r\n\r\ndef f():\r\n global a, c\r\n s, t = 0, input()\r\n d = len(t)\r\n for i, j in enumerate(t):\r\n if a[j]:\r\n if c[j]: s += abs(i - a[j][bisect_left(c[j], i)])\r\n else: s += abs(i - a[j][0])\r\n else: s += d\r\n return str(s)\r\n\r\nprint('\\n'.join(f() for i in range(n)))", "def g(t): return [(t[i] + t[i - 1]) // 2 for i in range(1, len(t))] + [1000000]\n\ndef h(a, b, c):\n\n j = s = 0\n\n for i in b:\n\n while i > c[j]: j += 1\n\n s += abs(i - a[j])\n\n return s\n\n\n\nn, k = map(int, input().split())\n\nq = 'abcdefghijklmnopqrstuvwxyz'\n\ns, a = 0, {i: [] for i in q}\n\nfor i, j in enumerate(input()): a[j].append(i)\n\nc = {i: g(a[i]) for i in q}\n\n\n\ndef f():\n\n s, b = 0, {i: [] for i in q}\n\n t = input()\n\n for i, j in enumerate(t): b[j].append(i)\n\n for i in q:\n\n if b[i]:\n\n if a[i]: s += h(a[i], b[i], c[i])\n\n else: s += len(t) * len(b[i])\n\n return str(s)\n\n\n\nprint('\\n'.join(f() for i in range(n)))\n\n\n\n# Made By Mostafa_Khaled", "# https://codeforces.com/problemset/problem/62/B\r\n# bin search\r\n\r\n\r\ndef search(val):\r\n l = 0\r\n r = 1\r\n\r\n while l <= r:\r\n pass\r\n\r\n\r\ndef calc_f(arr, val):\r\n n = len(arr)\r\n\r\n l = 0\r\n r = n - 1\r\n last_less = False\r\n\r\n while l <= r:\r\n m = l + (r - l) // 2\r\n\r\n if arr[m] < val:\r\n l = m + 1\r\n last_less = True\r\n elif arr[m] > val:\r\n r = m - 1\r\n last_less = False\r\n else:\r\n return abs(val - arr[m])\r\n\r\n if last_less:\r\n nearest = l, l - 1\r\n else:\r\n nearest = r, r + 1\r\n\r\n min_diff = 10**6\r\n for v in nearest:\r\n if 0 <= v < n:\r\n min_diff = min(min_diff, abs(val - arr[v]))\r\n\r\n return min_diff\r\n\r\n\r\ndef main():\r\n n = int(input().split()[0])\r\n s = input()\r\n\r\n d = {}\r\n for i, char in enumerate(s):\r\n arr = d.get(char, [])\r\n arr.append(i)\r\n d[char] = arr\r\n\r\n for i in range(n): # 2 * 10^5 max str length for all potential strings\r\n c = input()\r\n nc = len(c)\r\n\r\n f = 0\r\n for j, char in enumerate(c):\r\n if char not in d:\r\n f += nc\r\n else:\r\n f += calc_f(d[char], j)\r\n\r\n print(f)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n" ]

[ "x = open(\"input.txt\", \"r\")\nn = int(x.readline())\nc = sorted(map(int, x.readline().split()))\na, b = 0, n-1\nfor i in range(n):\n while a < n-1 and 2 * c[i] >= c[a+1]:\n a += 1\n b = min(b, n+i-a-1)\nopen(\"output.txt\", \"w\").write(str(b))\n \t\t\t\t \t\t\t \t \t \t\t \t\t\t \t\t", "import bisect\r\n\r\nf=open(\"input.txt\",\"r\")\r\nn=int(f.readline())\r\na=sorted(list(map(int, f.readline().split())))\r\nf.close()\r\nans=n\r\nfor i in range(n):\r\n ind=bisect.bisect_right(a,a[i]*2)\r\n ans=min(ans,n-ind+i)\r\nf2=open(\"output.txt\",\"w\")\r\nf2.write(str(ans))\r\nf2.close()\r\n\r\n", "\r\nip = open(\"input.txt\", \"r\")\r\nop = open(\"output.txt\", \"w\")\r\n\r\n\r\nn = int(ip.readline().strip())\r\narr = list(map(int, ip.readline().strip().split()))\r\narr.sort()\r\nips = 0\r\ni,j = 0,0\r\n\r\nwhile j<n:\r\n if 2*arr[i] >= arr[j]:\r\n ips = max(ips, j-i+1)\r\n j+=1\r\n \r\n else:\r\n i+=1\r\n\r\nop.write(str(n-ips))", "# with open(\"input.txt\",\"r\") as l:\r\n# a = int(l.readline())\r\n# c = sorted(int(i) for i in l.readline().split())\r\n# count = 0\r\n# for i in range(a):\r\n# j = 1\r\n# while j > i and 2*c[i]>=c[-j]:\r\n# j+=1\r\n# if j-i>count:\r\n# count=j-i\r\n# open(\"output.txt\",\"w\").write(str(a-count))\r\n\r\nf = open('input.txt', 'r')\r\nn = int(f.readline())\r\nc = sorted(map(int, f.readline().split()))\r\nj, v = 0, n - 1\r\nfor i in range(n):\r\n while j < n - 1 and 2 * c[i] >= c[j + 1]:\r\n j += 1\r\n v = min(v, n + i - j - 1)\r\nopen('output.txt', 'w').write(str(v))\r\n\r\n", "import sys\n \nsys.stdin = open('input.txt', 'r')\nsys.stdout = open('output.txt', 'w')\n \nn = int(input())\nc = list(map(int,sys.stdin.readline().split()))\np = [0] * 5001\nfor i in c:\n p[i] += 1\nq = p[:]\nfor i in range(1, 5001):\n q[i] += q[i - 1]\nans = q[5000] - q[2499]\nfor i in range(1, 2501):\n if p[i]:\n s = q[2 * i] - q[i - 1]\n if s > ans: ans = s\nprint(n - ans)\n\t \t\t \t\t\t \t \t \t\t \t \t \t", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Physics Practical\"\r\n# Class: B\r\n\r\nInFile = open(\"input.txt\", \"r\")\r\nOutFile = open(\"output.txt\", \"w\")\r\n\r\ndef Solve():\r\n n = int(InFile.readline())\r\n c = sorted(map(int, InFile.readline().split()))\r\n l = 0 ; ans = 0\r\n for r in range(n):\r\n while c[r]>2*c[l]:\r\n l+=1\r\n ans = max(r-l+1, ans)\r\n \r\n print(n-ans, file=OutFile)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "f = open('input.txt', 'r')\r\nn = int(f.readline())\r\nc = sorted(map(int, f.readline().split()))\r\nj, v = 0, n - 1\r\nfor i in range(n):\r\n while j < n - 1 and 2 * c[i] >= c[j + 1]:\r\n j += 1\r\n v = min(v, n + i - j - 1)\r\nopen('output.txt', 'w').write(str(v))", "def pset1B(n: int, numbers: list):\n numbers.sort()\n\n i = 0\n j = 0\n answer = n\n while i <= j < n and i < answer:\n while j < n and numbers[j] <= 2 * numbers[i]:\n answer = min(answer, n - (j - i + 1))\n j += 1\n i += 1\n \n return answer\n\nif __name__ == '__main__':\n \n with open('input.txt', 'r') as file:\n f = file.readlines()\n \n answers = []\n for i in range(0, len(f), 2):\n n = int(f[i])\n numbers = list(map(int, f[i + 1].strip().split()))\n answers.append(str(pset1B(n, numbers)))\n\n with open('output.txt', 'w') as file:\n file.write('\\n'.join(answers))\n\n \t \t \t \t \t \t\t\t\t \t \t \t \t", "\r\na = open('input.txt', 'r')\r\nz = int(a.readline()) - 1\r\nl = sorted(list(map(int, a.readline().split())))\r\nx, t = 0, 0\r\nfor x in range(z + 1):\r\n if l[x] <= l[t] * 2:\r\n continue\r\n t += 1\r\nopen(\"output.txt\", \"w\").write(str(t))", "a = open('input.txt', 'r')\nb = int(a.readline())\nc = b - 1\nd = sorted(map(int, a.readline().split()))\ne = 0\nfor x in range(b):\n while e < b - 1 and 2 * d[x] >= d[e + 1]:\n e = e + 1\n c = min(c, b + x - e - 1)\nopen('output.txt', 'w').write(str(c))\n\t\t \t \t\t\t \t\t\t\t \t\t\t \t\t \t \t\t\t \t", "def bins(n, v):\r\n\tl = 0\r\n\tr = len(v)-1\r\n\tans = r+1\r\n\twhile l <= r:\r\n\t\tmid = (l+r)//2;\r\n\t\tif v[mid] >= n:\r\n\t\t\tans = mid\r\n\t\t\tr = mid - 1\r\n\t\telse:\r\n\t\t\tl = mid + 1\r\n\treturn ans\r\n\r\nf = open(\"input.txt\", 'r')\r\nn = int(f.readline())\r\nnums = [int(i) for i in f.readline().split()]\r\nnums.sort()\r\nbest = 10**5\r\nfor i in range(len(nums)):\r\n\tcur = nums[i]\r\n\tpos = bins((cur+1)//2, nums)\r\n\tbest = min(best, n-i-1+pos)\r\nnf = open(\"output.txt\", \"w\")\r\nnf.write(str(best))\r\n", "x = open(\"input.txt\",\"r\")\ny = int(x.readline())\nz = sorted(map(int, x.readline().split()))\ncount = a = 0\nfor i in range(y):\n while a < y and 2*z[i]>=z[a]:\n a+=1\n count = max(a-i,count)\nopen(\"output.txt\",\"w\").write(str(y-count))\n \t \t \t \t\t\t\t \t \t\t\t \t\t", "input=open(\"input.txt\",\"r\")\noutput=open(\"output.txt\",\"w\")\nx=int(input.readline())\nz=list(map(int,input.readline().split()))\nz=sorted(z)\nb= 71891789178921875126571562 #I just need a big number\nc=1\nfor y in range(x):\n a=0\n while c<x and z[y]*2>= z[c]:\n c=c+1\n a=a+y+x-c\n if b>a: b=a\nb=str(b)\noutput.write(b)\n\n\t \t \t \t \t\t\t\t\t\t\t\t \t \t\t\t\t \t", "with open('input.txt','r') as f1:\r\n n=int(f1.readline())\r\n c=[*map(int,f1.readline().split())]\r\nc.sort()\r\nres=0\r\nfrom bisect import bisect\r\nfor i,x in enumerate(c):\r\n res=max(res,bisect(c,x*2)-i)\r\nwith open('output.txt','w') as f2:\r\n f2.write(str(n-res))", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ni = 0\r\nans = 0\r\nfor j in range(n):\r\n while arr[j] > arr[i]*2:\r\n i += 1\r\n ans = max(ans, j-i+1)\r\nprint(n-ans)\r\n", "import sys\nsys.stdin = open(\"input.txt\",\"r\")\nsys.stdout = open(\"output.txt\",\"w\")\nn = int(input())\na = [int(i) for i in sys.stdin.readline().split()]\na.sort()\nminsum=0\nmaxsum=0\nj=0\nfor i in range(n):\n sum_=0\n while j<n and 2*a[i]>=a[j]:\n j=j+1\n sum_=j-i\n if maxsum<sum_:\n maxsum = sum_\n if maxsum>=n-i-1:\n break\nminsum=n-maxsum\nprint(minsum)\n\n\n\t\t\t\t \t \t\t\t \t\t \t \t\t \t \t", "from bisect import *\nimport sys\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\nn = int(input())\nans = n\narr = list(map(int,input().split()))\narr.sort()\nfor i in range(n):\n ans = min(ans,n-bisect(arr,arr[i]*2)+i)\nprint(ans)\n \t\t \t\t\t \t\t\t \t\t \t \t \t\t", "import sys\r\n\r\n\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef bisect_right(a, x, lo=0, hi=None):\r\n if lo < 0:\r\n raise ValueError('lo must be non-negative')\r\n if hi is None:\r\n hi = len(a)\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if x < a[mid]:\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\n if lo == n or (lo > 0 and a[lo] > x):\r\n lo -= 1\r\n return lo\r\n\r\n\r\nn = int(input())\r\nl = sorted(list(map(int, input().split())))\r\nif l[0] == l[-1]:\r\n print(0)\r\nelse:\r\n max_influence = 0\r\n for i in range(n):\r\n potential_min = l[i]\r\n potential_max = 2 * potential_min\r\n index_potential_max = bisect_right(l, potential_max, i)\r\n influence = index_potential_max - i + 1\r\n max_influence = max(max_influence, influence)\r\n # print('val', l[i], 'influence', influence, 'min_i', i, 'max_i', index_potential_max)\r\n\r\n print(n - max_influence)\r\n", "with open('input.txt') as f:\r\n data = f.readlines()\r\n n = int(data[0])\r\n results = [int(i) for i in data[1].split()]\r\n\r\n\r\nresults.sort()\r\nans = 0\r\n\r\n\r\nj = 0\r\nfor i in range(n):\r\n while j < n and results[j] <= results[i] * 2:\r\n j += 1\r\n \r\n ans = max(ans, j - i + 1)\r\n\r\nans = n - ans + 1\r\nprint(ans)\r\n\r\n\r\n \r\nwith open('output.txt', 'w') as f:\r\n f.write(str(ans))", "with open(\"input.txt\", \"r\") as f_in, open(\"output.txt\", \"w\") as f_out:\r\n n = int(f_in.readline().strip())\r\n a = list(map(int, f_in.readline().strip().split()))\r\n a.sort()\r\n maxx = 0\r\n i, j = 0, 0\r\n while j < n:\r\n while j < n and a[j] <= 2 * a[i]:\r\n j += 1\r\n maxx = max(j - i, maxx)\r\n i += 1\r\n f_out.write(str(n - maxx))", "n = open(\"input.txt\",\"r\")\ng = int(n.readline())\nc = sorted(map(int, n.readline().split()))\ncount = s = 0\nfor i in range(g):\n while s < g and 2*c[i]>=c[s]:\n s+=1\n count = max(s-i,count)\nopen(\"output.txt\",\"w\").write(str(g-count))\n\t \t \t \t\t \t \t \t\t \t \t\t \t\t", "with open('input.txt', 'r') as rf:\n n = int(rf.readline())\n c = rf.readline().split(' ')\nfor i in range(n):\n c[i] = int(c[i])\na = 0\nb = 0\nc = sorted(c)\nans = len(c)\nwhile b < len(c):\n while c[a] * 2 < c[b] and a < b:\n a += 1\n ans = min(ans, len(c) - b + a - 1)\n b += 1\nwith open('output.txt', 'w') as wf:\n wf.write(str(ans))\n \t\t\t \t\t\t \t \t\t \t \t\t\t", "from bisect import bisect_left, bisect\nfrom sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\nrds = lambda: stdin.readline().rstrip()\nii = lambda: int(stdin.readline())\n\nwith open('input.txt') as f:\n data = [l.strip() for l in f.readlines()]\n\nn = int(data[0])\nar = list(map(int, data[1].split(' ')))\n\nar.sort()\n\n#print(ar)\n\nres = len(ar)\n# for each i find j <=i s.t. condition is fulfilled\nfor i in range(len(ar)):\n j = bisect(ar, ar[i]*2)\n # ar[i:j] - valid measurements \n \n res = min(res, n - j + i)\n\nwith open('output.txt', 'w') as f:\n f.write(f'{res}')\n", "import math\nfrom bisect import bisect_right\nf= open('input.txt', 'r')\nn = int(f.readline())\nz = sorted(map(int, f.readline().split()))\nmini=math.inf\nfor i in range(len(z)):\n mini=min(mini,i+len(z)-bisect_right(z,2*z[i]))\n \nopen('output.txt', 'w').write(str(mini))\n\t\t\t\t \t\t\t\t\t \t\t\t \t\t\t \t\t \t\t", "l = open(\"input.txt\",\"r\")\r\na = int(l.readline())\r\nc = sorted(map(int, l.readline().split()))\r\ncount = j = 0\r\nfor i in range(a):\r\n while j < a and 2*c[i]>=c[j]:\r\n j+=1\r\n count = max(j-i,count)\r\nopen(\"output.txt\",\"w\").write(str(a-count))", "def search(a, x, i):\r\n l, r = i, len(a)-1\r\n ans = 0\r\n while l <= r:\r\n mid = l+r>>1\r\n if a[mid] <= x:\r\n ans = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n return ans\r\n\r\n\r\nwith open(\"input.txt\", \"r\") as fp:\r\n n = int(fp.readline())\r\n a = sorted(map(int, fp.readline().split()))\r\n ans = 1e9\r\n for i in range(n):\r\n if i and a[i] == a[i-1]: continue\r\n ans = min(ans, n+i-search(a, a[i]<<1, i)-1)\r\n with open(\"output.txt\", \"w\") as out:\r\n out.write(str(ans))", "import bisect\r\nimport sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nans=n\r\nfor i in range(n):\r\n j=bisect.bisect_right(l,2*l[i])\r\n ans=min(ans,i+n-j)\r\nprint(ans)", "import sys\nsys.stdin = open('input.txt', 'r')\nsys.stdout = open('output.txt', 'w')\nMOD = 10**9 + 7\nI = lambda:list(map(int,input().split()))\n \nn, = I()\nfrom bisect import bisect_right as br\n \nl = I()\n \nl.sort()\nans = MOD\nfor i in range(n):\n\tk = l[i]\n\tj = br(l, 2*l[i])\n\tans = min(ans, n - (j - i))\nprint(ans)\n\t \t\t \t\t\t\t \t\t\t\t\t\t \t\t\t\t \t \t", "\ndef rem_read(N, reading):\n reading = sorted(reading)\n small = 0\n large = 1\n count = N\n while large < N:\n if reading[large] <= 2 * reading[small]:\n large += 1\n else:\n count = min(count, small + N - large)\n small += 1\n return min(count, small + N - large)\n\nif __name__ == '__main__':\n with open('input.txt', 'r') as file:\n f = file.readlines()\n N = int(f[0].strip())\n reading = list(map(int, f[1].strip().split()))\n answer = rem_read(N, reading)\n with open('output.txt', 'w') as file2:\n file2.write(str(answer))\n \t \t\t \t\t \t\t\t \t \t\t\t \t\t\t\t", "file = open(\"input.txt\", \"r\")\ntext = [line.rstrip() for line in file]\nfile.close()\n\nnumber = int(text[0])\nnumber_strings = text[1].split()\nnumbers_msm = [int(msm) for msm in number_strings]\nnumbers_msm.sort()\n\ncount = 0\nfor i in range(number):\n if numbers_msm[i] <= numbers_msm[count] * 2:\n continue\n count += 1\n\nfile = open(\"output.txt\", \"w\")\nfile.write(str(count))\nfile.close()\n \t \t \t\t \t \t\t \t \t\t \t", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nn = int(input())\r\narr = list(map(int , input().split()))\r\n\r\nc = [0]*5001\r\n\r\nfor i in range(n):\r\n c[arr[i]] += 1\r\n\r\nfor i in range(1 , 5001):\r\n c[i] += c[i-1]\r\n\r\nminn = 1000000\r\n\r\nfor i in range(1 , 2501):\r\n minn = min(minn , c[i-1] + n - c[2*i])\r\nprint(minn)", "import sys\nsys.stdin = open(\"input.txt\",\"r\")\nsys.stdout = open(\"output.txt\",\"w\")\nn = int(input())\na = list(map(int,input().split()))\na.sort()\nmaxx = 0\ni,j = 0,0\nwhile j<n:\n\twhile j<n and a[j]<=2*a[i]:\n\t\tj += 1\n\tmaxx = max(j-i,maxx)\n\ti += 1\nprint (n-maxx)\n \t \t\t\t \t\t\t\t\t \t \t\t\t \t \t \t\t", "import sys\r\n\r\nsys.stdin=open(\"input.txt\")\r\nsys.stdout=open(\"output.txt\", 'w')\r\n\r\nn = int(input())\r\nc = [0] * 5001\r\nfor e in map(int, input().split()):\r\n c[e] += 1\r\nprint(n - max([(sum(c[i : 2 * i + 1]), i) for i in range(2501)])[0])\r\n", "with open(\"input.txt\", \"r\") as g:\n measure = int(g.readline())\n num = g.readline().split()\nlist1 = sorted(list(map(int, num)))\nj = 0\nfor i in range(measure):\n if list1[i] <= list1[j] * 2:\n continue\n else:\n j += 1\nwith open(\"output.txt\", \"w\") as h:\n h.write(str(j))\n\t\t \t \t\t\t\t\t\t\t\t\t\t \t\t \t\t\t \t\t", "inp = open(\"input.txt\", \"r\")\nn = int(inp.readline())\nmeasurements = sorted(list(map(int, inp.readline().split(\" \"))))\n\nj, i = 0, 0\nfor i in range(n):\n if not measurements[i] <= 2 * measurements[j]:\n j += 1\n\nresult = n - (i - j + 1)\nout = open(\"output.txt\", \"w\")\nout.write(str(result))\nout.close()\n\n \t\t \t\t\t\t\t \t\t\t\t \t \t \t\t \t\t", "inp = open(\"input.txt\", \"r\")\nout = open(\"output.txt\", \"w\")\nn = int(inp.readline())\nl = inp.readline().split()\ncount = 0\nm = n - 1\nfor i in range(len(l)):\n l[i] = int(l[i])\nl = sorted(l)\nfor i in range(n):\n while count < n - 1 and 2 * l[i] >= l[count + 1]:\n count += 1\n m = min(m, n + i - count - 1)\nout.write(str(m))\n\t\t \t\t \t\t\t \t\t\t\t\t\t\t \t \t\t\t \t\t\t\t", "import sys\nfrom bisect import *\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\nn=int(input())\na=sorted(map(int,input().split()))\nm=n\nfor i in range(n):\n m=min(m,i+n-bisect_right(a,2*a[i]))\nprint(m)\n\t\t \t\t\t\t\t \t \t \t \t\t\t \t\t\t \t \t \t", "from collections import Counter\r\n\r\nfile = open('input.txt', 'r')\r\nfile.readline()\r\nm = Counter(map(int, file.readline().split()))\r\nans = sum(m.values()) - max(sum(m[i] for i in range(num, num * 2 + 1)) for num in m)\r\nprint(ans)\r\nopen(\"output.txt\", \"w\").write(str(ans))\r\n", "f = open('input.txt', 'r')\r\nn, lst = int(f.readline()), list(map(int, f.readline().split()))\r\nlst.sort()\r\ni=0\r\nj=0\r\ns=0\r\nwhile(i<=j and j<n):\r\n if(lst[j]<=2*lst[i]):\r\n if(j-i+1>s):\r\n s=j-i+1\r\n j=j+1\r\n else:\r\n i=i+1\r\nprint(n-s,file=open('output.txt', 'w'))", "with open(\"input.txt\") as fh:\n content = fh.read().splitlines()\n n = content[0]\n k = content[1].split(\" \")\noutput = open(\"output.txt\", \"w\")\nk = [int(x) for x in k]\nn = int(n)\nk.sort()\ny = 0\nx = 0\nans = len(k)\nwhile x < len(k):\n while k[y] * 2 < k[x] and y < x:\n y+=1\n ans = min(ans, len(k) - x + y - 1)\n x+=1\nprint(ans, file=output)\n\t \t\t \t\t\t \t\t \t\t\t \t \t \t", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nn = int(input())\r\nres = [int(t) for t in input().split()]\r\nres.sort()\r\nmin_erase = n\r\ni, j = 0, 0\r\nwhile i != n - 1:\r\n if res[j] <= 2 * res[i]:\r\n ans = True\r\n if n - (j - i + 1) < min_erase:\r\n min_erase = n - (j - i + 1)\r\n else:\r\n ans = False\r\n if ans and j != n - 1:\r\n j += 1\r\n else:\r\n i += 1\r\nprint(min_erase)", "file = open('input.txt', 'r')\r\nn = int(file.readline()) - 1\r\nlis = sorted(list(map(int, file.readline().split())))\r\ni, j = 0, 0\r\nfor i in range(n + 1):\r\n if lis[i] <= lis[j] * 2:\r\n continue\r\n j += 1\r\nout = n - i + j\r\nprint(out)\r\nopen(\"output.txt\", \"w\").write(str(out))", "with open('input.txt', 'r') as file:\r\n file_contents = file.read()\r\n\r\nwith open(\"input.txt\", \"r\") as input_file:\r\n n = int(input_file.readline().strip())\r\n measures = list(map(int, input_file.readline().strip().split()))\r\n\r\ndef binarySearch(x, arr):\r\n left, right = 0, len(arr) - 1\r\n result_index = -1\r\n \r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n \r\n if arr[mid] <= 2 * x:\r\n result_index = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n \r\n return result_index\r\n\r\nmeasures = sorted(measures)\r\n\r\nans = 0\r\narr = []\r\nfor i in range(n):\r\n ind = binarySearch(measures[i], measures)\r\n arr.append(n - ind - 1 + i)\r\n\r\nwith open(\"output.txt\", \"w\") as output_file:\r\n output_file.write(str(min(arr)))", "\n# open file\nfp = open('input.txt','r')\n\n# read first line\nline = fp.readline().strip()\nline = fp.readline().strip()\ndata = [int(w) for w in line.split()]\nfp.close()\ndata.sort()\n\nleft = 0\nright = 0\n\nmax_value = 0\nfor left in range(len(data)):\n while right < len(data) and 2 * data[left] >= data[right]:\n right = right + 1\n if max_value < right - left:\n max_value = right - left\n\n# write output\nout = open('output.txt','w')\nprint(len(data) - max_value, file=out)\nout.close()\n\n\t\t\t\t\t \t \t\t\t \t \t\t \t\t \t \t", "input_file = open(\"input.txt\", \"r\")\nn = int(input_file.readline()[:-1])\nc = input_file.readline()[:-1].split()\nc = [int(i) for i in c]\nc.sort()\n\ncounter = 0\nfor i in range(n):\n print(c[counter])\n if c[i] <= c[counter] * 2:\n continue\n counter += 1\n\noutput_file = open(\"output.txt\", \"w\")\noutput_file.write(str(counter) + \"\\n\")\n\n \t\t \t\t\t\t\t\t\t \t \t\t \t \t \t \t \t", "# Author : nitish420 --------------------------------------------------------------------\r\nimport sys\r\n\r\nsys.stdin = open(\"input.txt\",\"r\")\r\nsys.stdout = open(\"output.txt\",\"w\")\r\n\r\nfrom bisect import bisect_left\r\n\r\ndef main():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\tarr.sort()\r\n\tdbl=[2*item for item in arr]\r\n\t# print(dbl)\r\n\r\n\tans=float('inf')\r\n\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tz=bisect_left(dbl,arr[i])\r\n\t\tans=min(ans,n-i+z-1)\r\n\t\r\n\tprint(ans)\r\n\r\n\r\nmain()", "import sys\nfrom bisect import *\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\nn=int(input())\nx=sorted(map(int,input().split()))\nm=1e6\nfor i in range(n):\n m=min(m,i+n-bisect_right(x,2*x[i]))\nprint(m)\n\t\t \t\t \t\t \t\t\t \t\t \t \t \t \t", "def solv():\n f= open('input.txt', 'r') \n n=int(f.readline())\n a = list (map(int, f.readline().split())) ; a.sort()\n l=0; r=0\n while l<n :\n if a[l]> a[r]*2 : r+=1\n l+=1\n return r\nprint (solv(), file=open('output.txt', 'w'))\n\t\t \t \t \t\t \t \t\t\t\t \t\t \t \t", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nl = 0\r\nmin_1 = 0\r\nwhile l < n:\r\n if arr[l] > arr[min_1]*2:\r\n min_1 += 1\r\n l += 1\r\n\r\nprint(min_1)\r\n", "import sys\r\nsys.stdin = open(\"input.txt\")\r\nsys.stdout = open(\"output.txt\", 'w')\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nc = [0]*5001\r\nfor i in a:\r\n c[i]+=1\r\nfor i in range(1,5001):\r\n c[i]+=c[i-1]\r\nans = n\r\nfor i in a:\r\n if i<2501:\r\n one = c[-1]-c[i*2]\r\n else:\r\n one = 0\r\n two = c[i-1]\r\n ans = min(ans,one+two)\r\nprint(ans)\r\n", "def x(a,b):\r\n b.sort()\r\n c = []\r\n di = {}\r\n ans = 1\r\n x = 0\r\n for u in range(len(b)):\r\n if b[u] in di.keys():\r\n x+=1\r\n else:\r\n if u==0:\r\n di[b[u]] = 0\r\n c.append(b[u])\r\n else:\r\n di[b[u]] = x+1\r\n x+=1\r\n c.append(b[u])\r\n for k in range(len(c)):\r\n i = 0;\r\n j = a-1;\r\n while(i<=j):\r\n if i==j:\r\n if b[i]<=2*c[k]:\r\n ans = max(ans,(i+1)-di[c[k]])\r\n break\r\n else:\r\n ans = max(ans,i-di[c[k]])\r\n break\r\n mid = (i+j)//2\r\n if b[mid]<=2*c[k]:\r\n i = mid+1\r\n else:\r\n j = mid\r\n return a-ans\r\nwith open('input.txt', 'r') as file:\r\n f = file.readlines()\r\nanswers = []\r\nfor i in range(0, len(f), 2):\r\n n = int(f[i])\r\n numbers = list(map(int, f[i + 1].strip().split()))\r\n answers.append(str(x(n, numbers)))\r\n\r\nwith open('output.txt', 'w') as file:\r\n file.write('\\n'.join(answers))", "def binpoisk(a, x, index):\r\n l, r = index, len(a)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if 2*x >= a[m]:\r\n l = m\r\n else:\r\n r = m\r\n return l\r\n\r\ndef main():\r\n with open('input.txt', 'r') as fin:\r\n f = fin.readlines()\r\n n = int(f[0])\r\n a = list(map(int, f[1].split()))\r\n a.sort()\r\n ans = 10000000\r\n for i in range(n):\r\n index = binpoisk(a, a[i], i)\r\n ans = min(ans, i + n - index - 1)\r\n with open('output.txt', 'w') as fout:\r\n fout.write(str(ans))\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\n\r\n\r\ndef ints_input():\r\n return [int(i) for i in sys.stdin.readline().strip(\"\\n\").split(\" \")]\r\n\r\n\r\ndef print_list(arr):\r\n sys.stdout.writelines(str(x)+\" \" for x in arr)\r\n sys.stdout.write(\"\\n\")\r\n\r\n\r\ndef fast_input(type=str):\r\n return type(sys.stdin.readline().strip(\"\\n\"))\r\n\r\n\r\n# n = fast_input(int)\r\n# arr = ints_input()\r\nwith open(\"input.txt\", 'r') as f:\r\n reader = f.read()\r\n reader = reader.split(\"\\n\")\r\n n = int(reader[0])\r\n arr = list(map(int, reader[1].split(\" \")))\r\n\r\narr.sort()\r\nfreq = [0] * (5000+9)\r\nfor i in range(n):\r\n freq[arr[i]] += 1\r\n \r\ns = set(arr)\r\nans = []\r\nfor k in s:\r\n ans.append(sum(freq[:k])+sum(freq[2*k+1:]))\r\n\r\n\r\n\r\nwith open(\"output.txt\", 'w') as o:\r\n o.write(str(min(ans)))\r\n", "with open('input.txt', 'r') as f:\r\n input_data = f.read().strip().split('\\n')\r\n n = int(input_data[0])\r\n a = list(map(int, input_data[1].split()))\r\n\r\na.sort()\r\nmaxx = 0\r\ni,j = 0,0\r\nwhile j<n:\r\n while j<n and a[j]<=2*a[i]:\r\n j += 1\r\n maxx = max(j-i,maxx)\r\n i += 1\r\n\r\nwith open('output.txt', 'w') as f:\r\n f.write(str(n - maxx))", "with open(\"input.txt\") as f:\n n = int(f.readline())\n arr = list(map(int, f.readline().strip().split()))\narr.sort()\nlo = float(\"inf\")\ni = 0\nfor j in range(n):\n while arr[i]*2 < arr[j]:\n i+=1\n lo = min(lo, n - (j-i+1))\n\nwith open(\"output.txt\", \"w\") as f:\n f.write(str(lo))\n", "import sys\r\nsys.stdin = open('input.txt', 'r') \r\nsys.stdout = open('output.txt', 'w')\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\nl=[0 for _ in range(5001)]\r\n\r\nfor x in c:\r\n l[x]+=1\r\n \r\nr=1e10\r\nend=0\r\nfor i in range(1,5001):\r\n \r\n \r\n r=min(r,n-sum(l[i:2*i+1]))\r\nprint(r)", "a = open('input.txt', 'r')\r\nfrom bisect import bisect\r\nz = int(a.readline()) - 1\r\nl = sorted(list(map(int, a.readline().split())))\r\nl.sort()\r\nt = z + 1 \r\nfor i in range(z + 1):\r\n j = bisect(l, 2 * l[i])\r\n t = min(i + z + 1 - j, t)\r\nopen(\"output.txt\", \"w\").write(str(t))", "import bisect\r\nimport sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=10**18\r\nfor i in range(n):\r\n x=a[i]*2\r\n idx=bisect.bisect_right(a,x)\r\n cnt=i+(n-idx)\r\n ans=min(ans,cnt)\r\nprint(ans)", "def find_largest_less_than_or_equal_to_2n(a, n):\r\n left, right = 0, len(a) - 1\r\n result_index = -1\r\n\r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n\r\n if a[mid] <= 2 * n:\r\n result_index = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return result_index\r\n\r\n# Read input from input.txt\r\nwith open(\"input.txt\", \"r\") as input_file:\r\n n = int(input_file.readline().strip())\r\n c = list(map(int, input_file.readline().strip().split()))\r\n\r\n# Sort the array in ascending order\r\nc.sort()\r\n\r\n# Initialize an array to store indices\r\nans = 0\r\n\r\n# Iterate through each element and find the largest index satisfying the condition\r\nfor i in range(n):\r\n ind = find_largest_less_than_or_equal_to_2n(c, c[i])\r\n ans = max(ans, ind - i + 1)\r\n\r\n# Calculate the final result\r\nresult = n - ans\r\n\r\n# Write the output to output.txt\r\nwith open(\"output.txt\", \"w\") as output_file:\r\n output_file.write(str(result))\r\n", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nimport sys\r\n\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n# n = int(input())\r\n# l = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# mod = 1000000007\r\nimport bisect\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans=sys.maxsize\r\n#print(l)\r\nfor i in range(n):\r\n x = bisect.bisect_right(l,2*l[i])\r\n #print(x,i+n-x)\r\n ans=min(ans,i+n-x)\r\nprint(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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "with open(\"input.txt\") as f:\r\n n = int(f.readline())\r\n arr = list(map(int,f.readline().split()))\r\nf2 = open(\"output.txt\", \"w\")\r\nmin = n-1\r\nminimum_index = 0\r\narr.sort()\r\nminimum = arr[0]\r\nfor i in range(1,n):\r\n if arr[i]<=2*minimum:\r\n count = minimum_index+n-i-1\r\n if min>count:\r\n min = count\r\n else:\r\n while(arr[i]>2*minimum):\r\n minimum_index+=1\r\n minimum = arr[minimum_index]\r\n count = minimum_index + n - i - 1\r\n if min > count:\r\n min = count\r\nf2.write(str(min))", "R = lambda: map(int, input().split())\r\nwith open('input.txt') as f:\r\n n = int(f.readline())\r\n arr = sorted(map(int, f.readline().split()))\r\n j = 0\r\n res = n\r\n for i in range(n):\r\n while j < i and arr[j] * 2 < arr[i]:\r\n j += 1\r\n res = min(res, n - (i - j + 1))\r\n with open('output.txt', 'w') as w:\r\n w.write(str(res))", "with open('input.txt', 'r') as fin:\n n = int(fin.readline().strip())\n c = [0] * 5001\n for e in map(int, fin.readline().split()):\n c[e] += 1\n\nmax_val = max([(sum(c[i:2*i+1]), i) for i in range(2501)])\nresult = n - max_val[0]\n\nwith open('output.txt', 'w') as fout:\n fout.write(str(result))\n\n\t \t\t \t \t\t \t \t\t \t\t\t \t \t", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nn = int(input())\r\nl = sorted([int(i) for i in input().split()])\r\nk = j = 0\r\nfor i in range(n):\r\n while j < n and l[i] * 2 >= l[j]:\r\n j += 1\r\n k = max(k, j - i)\r\n\r\nprint(n - k)", "import fileinput\r\n\r\ninputs = []\r\nfor line in fileinput.input(\"input.txt\"):\r\n inputs.append(line)\r\n\r\nn = int(inputs[0])\r\nmeasurements = sorted(list(map(int, inputs[1].split())))\r\n\r\nans = r = 0\r\nfor l in range(n):\r\n while r < n and measurements[r] <= 2 * measurements[l]:\r\n r += 1\r\n ans = max(ans, r - l)\r\n\r\nwith open(\"output.txt\", \"w\") as f:\r\n f.write(str(n - ans) + \"\\n\")\r\n", "from itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\nimport collections,sys,threading\r\nimport collections,sys,threading\r\nfrom bisect import bisect_left,bisect_right\r\n#sys.setrecursionlimit(10**9)\r\n#threading.stack_size(10**8)\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\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\na.sort()\r\nans=10**5\r\nfor i in range(n):\r\n rr=bisect_right(a,2*a[i],0,n)\r\n ll=bisect_left(a,(a[rr-1]//2)+(a[rr-1]%2),0,n)\r\n \r\n ans=min(ans,n-rr+ll)\r\n \r\n \r\nprint(ans)\r\n", "fileIn=open(\"input.txt\",\"r\")\nfileOut=open(\"output.txt\",\"w\")\nnum=int(fileIn.readline().strip())\nmeasurements=list(map(int,fileIn.readline().strip().split()))\nmeasurements.sort()\nerase=0\nj=0\nfor i in range(num):\n while j<num and 2*measurements[i]>=measurements[j]:\n j+=1\n erase=max(j-i,erase)\nfileOut.write(str(num-erase))\n\t\t \t \t \t \t \t\t\t\t\t\t \t \t\t \t \t", "import sys\r\nsys.stdin = open(\"input.txt\",\"r\")\r\nsys.stdout = open(\"output.txt\",\"w\")\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nmaxx = 0\r\ni,j = 0,0\r\nwhile j<n:\r\n\twhile j<n and a[j]<=2*a[i]:\r\n\t\tj += 1\r\n\tmaxx = max(j-i,maxx)\r\n\ti += 1\r\nprint (n-maxx)", "file1=open('input.txt','r')\nfile2=open('output.txt','w')\n\nx=int(file1.readline())\n\nlist1=list(map(int,file1.readline().split()));\nlist1.sort() \nindex=0\ncount=0\nwhile index<x:\n if list1[index] > list1[count]*2 : \n count+=1\n index+=1\ncount=str(count)\nprint(count)\nfile2.write(count)\n\n \t \t \t\t \t \t\t \t\t \t\t", "from collections import Counter\r\nimport sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\t\tsys.stdin = open('input.txt', 'r')\r\n\t\tsys.stdout = open('output.txt', 'w')\r\nn = int(input()) \r\nms = list(map(int,input().split())) \r\nms.sort() \r\nj = 0 \r\nans = 0\r\nfor i in range(n):\r\n while j < n and ms[j] <= 2*ms[i]:\r\n j += 1 \r\n ans = max(ans, j - i)\r\nprint(n - ans) ", "from math import ceil as ce\r\nfrom collections import Counter as cc\r\n\r\nimport sys\r\nsys.stdin=open(\"input.txt\")\r\nsys.stdout=open(\"output.txt\", 'w')\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = dict(cc(l))\r\nl = sorted(list(d.items()),key=lambda x:x[0])\r\n\r\nco = [0]*5001\r\nj=0\r\n\r\n\r\n\r\nfor i in range(1,5001):\r\n if j<len(l) and l[j][0]==i:\r\n co[i]+=l[j][1]\r\n j+=1\r\n co[i]+=co[i-1]\r\n \r\n# print(co[0:11])\r\n\r\nm = float(\"inf\")\r\nfor i in range(len(l)):\r\n m = min(m,co[int(ce(l[i][0]/2))-1]+n-co[l[i][0]])\r\nprint(m)\r\n " ]

[ "s=input()\na=int(s,2)\nn=len(s)\nprint((a*(2**(n-1)))%1000000007)\n\n", "s=input()\r\na=int(s,2)\r\nn=len(s)\r\nprint((a*(2**(n-1)))%1000000007)", "s = input()[::-1]\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n ans = ans * 2 % (10 ** 9 + 7)\r\n else:\r\n ans = (ans * 2 + 2 ** (2 * i)) % (10 ** 9 + 7)\r\nprint(ans)", "def dance_club(x):\r\n n = len(x)\r\n mod = 10 ** 9 + 7\r\n\r\n ans = 0\r\n for i in range(n):\r\n if x[i] == '0':\r\n ans = (ans * 2) % mod\r\n else:\r\n ans = (ans * 2 + pow(2, 2 * i, mod)) % mod\r\n\r\n return ans\r\n\r\n\r\nx = input().strip()[::-1]\r\ncomplexity = dance_club(x)\r\nprint(complexity)\r\n\r\n", "def solve():\r\n x = input().strip()\r\n complexity = int(x, 2) * 2 ** (len(x) - 1)\r\n print(complexity % 1000000007)\r\n \r\nsolve()", "s = input()\r\nn = len(s)\r\nx = int(s, 2)\r\n\r\n'''\r\n#O((2^N)^2) solution\r\nnum = []\r\nans = 0;\r\nfor i in range(1 << n):\r\n num.append(i ^ x)\r\nfor i in range(1 << n):\r\n for j in range(i,1 << n):\r\n if (num[i] > num[j]):\r\n ans += 1\r\nprint(ans)\r\n'''\r\n \r\n#O(N) solution\r\ndp = [0 for i in range(n + 1)]\r\nfor i in range(n - 1, -1, -1):\r\n if (s[i] == '1'):\r\n dp[i] = dp[i+1] * 2 + (2 ** (n - i - 1)) ** 2 #pretend i precomputed power\r\n else:\r\n dp[i] = dp[i+1] * 2\r\nprint(dp[0] % 1000000007)", "# coding = utf-8\ndiv = 1000000007\ns = input()\nn = len(s)\nans = 0\n\nmi = [1]\n\nfor i in range(100):\n\tmi.append(mi[-1]*2%div)\n\nfor i in range(n):\n\tif s[n-1-i] == '1':\n\t\tret = mi[i]*mi[i]%div*mi[n-1-i]%div\n\t\tans = (ans+ret)%div\nprint(ans)\n\t\t \t\t \t\t\t\t \t\t\t \t\t \t\t", "s = input()\r\nnew_s = \"\"\r\nn = len(s)\r\nfor i in range(n - 1, -1, -1):\r\n new_s += s[i]\r\ns = new_s\r\nkek = 0\r\nfor i in range(n):\r\n kek += (1 << i) * (s[i] == '1')\r\nfor i in range(n - 1):\r\n kek *= 2\r\nprint(kek % (10 ** 9 + 7))", "MOD = 1000000007\r\nstr = input()\r\nl = len(str)\r\ndef b2d(str):\r\n\tans = 0\r\n\tcnt = 0\r\n\tstr=str[::-1]\r\n\tfor k in str:\r\n\t\tif k == '1':\r\n\t\t\tans += pow(2,cnt)\r\n\t\t\tans %= MOD\r\n\t\tcnt+=1\r\n\treturn ans\r\n\r\nprint((b2d(str)*pow(2,l-1))%MOD)\r\n", "M = 10 ** 9 + 7\ndef solve1(x):\n n = len(x)\n x = int(x, 2)\n ans = 0\n for a in range(2 ** n):\n for c in range(2 ** n):\n b = a ^ x\n d = c ^ x\n if a < c and b > d:\n ans += 1\n return ans % M\n\ndef solve2(x):\n return int(x, 2) * pow(2, (len(x) - 1), M) % M\n\nx = input()\n# print(solve1(x))\nprint(solve2(x))\n\n\n", "pri=pow(10,9)+7\r\n\r\ns=input()\r\nm=len(s)\r\nval=int(s,2)\r\nprint((pow(2,m-1,pri)*val)%pri)\r\n", "s = str(input())\r\nn = int(s, 2)\r\nprint((n * (2 ** (len(s) - 1))) % (10 ** 9 + 7))", "s,m,ans=input()[::-1],int(1e9+7),0\r\nfor i in range(len(s)):\r\n ans*=2\r\n if s[i]=='1':ans+=pow(2,2*i,m)\r\n ans%=m\r\nprint(ans)", "s = str(input())\r\na = len(s)\r\nx = 2**(a - 1)\r\nx %= 1000000007\r\ny = 0; z = 0\r\nfor i in range(a - 1, -1, -1):\r\n if(s[i] == \"1\"):\r\n z += (2**y)\r\n z %= 1000000007\r\n y += 1\r\nprint((x * z) % 1000000007)", "def f(x):\r\n if x == '0':\r\n return 0\r\n if x == '1':\r\n return 1\r\n\r\n r = 2 * f(x[1:])\r\n if x[0] == '1':\r\n r += 2 ** (2 * len(x) - 2)\r\n\r\n return r % 1000000007\r\n\r\n\r\ns = input().strip()\r\nprint(f(s))", "t = input()\r\nn, d = len(t), 1000000007\r\ndef f(k): return 0 if k == n else 2 * f(k + 1) + (pow(2, 2 * (n - k - 1), d) if t[k] == '1' else 0)\r\nprint(f(0) % d)", "mod = 10 ** 9 + 7\n\nx = input()[::-1]\nn = len(x)\n\nans = 0\n\nfor i, t in enumerate(x):\n if t == '1':\n ans = (ans + pow(2, n - 1 + i)) % mod\n\nprint(ans)", "mod = int(1e9 +7)\r\ns = input()\r\ns = s[::-1]\r\nans = 0\r\nfor i in range(len(s)):\r\n\tans *= 2\r\n\tif s[i] == '1':\r\n\t\tans += pow(2,2*i,mod)\r\n\tans %= mod\r\nprint(ans)", "s = input()\r\nans = 0\r\nfor i, c in enumerate(s):\r\n if c == '1':\r\n ans += 1 << (2 * len(s) - i - 2)\r\nprint(ans % (10 ** 9 + 7))", "p = 1000000007\r\ns = input()\r\nprint(int(s,2) * pow(2, len(s) - 1) % p)", "#!/usr/bin/env python3\np = 1000000007\ns = input()\nprint(int(s,2) * pow(2, len(s) - 1) % p)\n", "x =input()\r\nprint((int(x,2) << (len(x) - 1))%1000000007)" ]

[ "n=int(input())\r\narr=['R','O','Y','G']\r\nprint(\"BIV\",end='')\r\nfor i in range(n-3):\r\n\tprint(arr[i%4],end='')", "n=int(input())\r\na='ROYGBIV'\r\nfor i in range(7,n):\r\n for j in ['R','O','Y','G','B','I','V']:\r\n if j!=a[i-1] and j!=a[i-2] and j!=a[i-3] and (i+1<n or j!=a[(i+1)%n]) and (i+2<n or j!=a[(i+2)%n]) and (i+3<n or j!=a[(i+3)%n]):\r\n a+=j\r\n break\r\nprint(a)", "colors=[\"R\",\"G\",\"B\",\"V\",\"I\",\"Y\",\"O\"]\r\ns=0\r\nsol=\"\"\r\nn=int(input())\r\nfor i in range(n):\r\n char=colors[s]\r\n if i >=(n-3):\r\n while (char in sol[0:i-n+4]):\r\n s=(s+1)%7\r\n char=colors[s]\r\n \r\n sol+=char\r\n s=(s+1)%7\r\nprint(sol)", "\"\"\"\r\n\r\nThe Easter Rabbit laid n eggs in a circle and is about to paint them.\r\n\r\nEach egg should be painted one color out of 7: red, orange, yellow, green, blue, indigo or violet. Also, the following conditions should be satisfied:\r\n\r\nEach of the seven colors should be used to paint at least one egg.\r\nAny four eggs lying sequentially should be painted different colors.\r\nHelp the Easter Rabbit paint the eggs in the required manner. We know that it is always possible.\r\n\r\nInput\r\nThe only line contains an integer n — the amount of eggs (7 ≤ n ≤ 100).\r\n\r\nOutput\r\nPrint one line consisting of n characters. The i-th character should describe the color of the i-th egg in the order they lie in the circle. The colors should be represented as follows: \"R\" stands for red, \"O\" stands for orange, \"Y\" stands for yellow, \"G\" stands for green, \"B\" stands for blue, \"I\" stands for indigo, \"V\" stands for violet.\r\n\r\nIf there are several answers, print any of them.\r\n\"\"\"\r\n\r\nn = int(input())\r\nbase = \"ROYGBIV\" + \"GBIV\" * 24\r\n\r\nprint(base[:n])", "hat = int(input())\r\nlst = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\nnew = \"\"\r\nif hat == 7:\r\n print(\"\".join(lst))\r\nelif hat == 8:\r\n print(\"ROYGRBIV\")\r\nelif hat == 9:\r\n print(\"ROYGROBIV\")\r\nelif hat == 10:\r\n print(\"ROYGROYBIV\")\r\nelse:\r\n new += \"\".join(lst) * int(hat / 7)\r\n x = 3\r\n for i in range(hat % 7):\r\n if x > 6:\r\n x = 3\r\n new += lst[x]\r\n x += 1\r\n print(new)\r\n", "n = int(input())\nn -= 3\nprint(\"ROY\", end=\"\")\ns = \"GBIV\"\ni = 0\nwhile n:\n\ti %= 4\n\tprint(s[i], end=\"\")\n\ti += 1\n\tn -= 1\nprint()\n\t \t \t \t\t\t \t\t \t\t \t \t \t\t", "l = [\"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\",\"OYGBIV\"]\nn = int(input())\nprint(\"ROYGBIV\"*int(n/7.0)+l[n%7])\n\t\t\t\t\t \t\t\t\t\t\t\t\t\t\t\t \t", "n=int(input())\r\nc='ROYGBIV'\r\nans=''\r\nfor i in range(n):\r\n ans+=c[i%7]\r\nif ans[-2]=='O':\r\n ans=ans[:-3]+\"GBI\"\r\nelif ans[-1]=='R':\r\n ans=ans[:-1]+'G'\r\nelif ans[-2:]=='RO':\r\n ans=ans[:-2]+'GB'\r\nprint(ans)", "n = int(input())\r\ns='ROYGBIV'\r\nif n%7>3:\r\n print(n//7*s+s[:n%7])\r\nelse:\r\n print(n//7*s+s[3:3+n%7])", "n=int(input())\r\ntmp='VIBGYOR'\r\nans=[0]*n\r\ni,j,idx=0,n-1,-1\r\ncnt=0\r\nwhile i<=j:\r\n idx=(idx+1)%7\r\n if cnt%2==0:\r\n ans[i]=tmp[idx]\r\n i+=1\r\n else:\r\n ans[j]=tmp[idx]\r\n j-=1\r\n cnt+=1\r\nprint(''.join(ans))", "from itertools import product\r\nfrom math import ceil, gcd, sqrt\r\nimport string\r\nfrom decimal import Decimal\r\n\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\nnum = int(input())\r\nnum -= 7\r\nelements = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\n\r\nposition = 0\r\nbuild = ''.join(elements)\r\n\r\nwhile num > 0:\r\n\r\n can_not_use = build[0:3] + build[-3:]\r\n\r\n for i in elements:\r\n if i not in can_not_use:\r\n build += i\r\n break\r\n num -= 1\r\n\r\n\r\nprint(build)", "n = int(input())\r\nx = n-3\r\nans = []\r\nadder = ['R', \"O\", 'Y', 'G']\r\nfor i in range(x//4):\r\n ans.append('ROYG')\r\nif x%4 != 0:\r\n for i in range (x%4):\r\n ans.append(adder[i])\r\nans.append('BIV')\r\nfans = ''.join(ans)\r\nprint(fans)", "n = int(input())\ns = 'VIBGYOR'\ntimes = n//7\nremains = n%7\nif remains > 4:\n print(f'{s*times}{s[0:remains]}')\nelse:\n print(f'{s*times}{s[3:3+remains]}')\n", "n=int(input())\r\nj=0;x=3;f=0\r\ns=[\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\r\nfor i in range(0,n):\r\n print(s[j],end='');j+=1;\r\n if(j==7):j=3\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jul 28 09:29:58 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 8 - CF078-DIV2B\r\n\"\"\"\r\nn = int(input())\r\nans = \"BIV\"\r\nadd = [\"R\", \"O\", \"Y\", \"G\"]\r\nfor i in range(n-3):\r\n ans += add[i%4]\r\nprint(ans)\r\n", "n,ans,extra=int(input()),'ROYGBIV','GBIV'\r\nrem=n-7\r\nprint(ans+(rem//4)*extra+extra[:(rem%4)])\r\n\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn = int(input())\r\ncol = \"ROYGBIV\"\r\nres = col * (n // 7)\r\nif n % 7 != 0 :\r\n if n % 7 <= 4 :\r\n res += \"GBIV\"[:n % 7]\r\n else :\r\n res += col[:n % 7]\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", "n=int(input())\r\nm=\"ROYG\"\r\nv=m*((n-3)//4)\r\nprint(m*((n-3)//4)+m[0:n-(len(v)+3)]+\"BIV\")", "n = int(input())\r\nl = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\nl1 = ['G', 'B', 'I', 'V']\r\nx = n//7\r\nx = x*7\r\ns = \"\"\r\nj = 0\r\nfor i in range(x):\r\n s = s + l[j]\r\n j = (j+1) % 7\r\n\r\nj = 0\r\nfor i in range(x, n):\r\n s = s + l1[j]\r\n j = (j+1) % 4\r\n\r\nprint(s)\r\n\r\n", "n=int(input())\r\nfor i in range(n//7):\r\n print(\"ROYGBIV\",end=\"\")\r\ndata=[\"\",\"G\",\"GB\",\"YGB\",\"YGBI\",\"OYGBI\",\"OYGBIV\"]\r\nprint(data[n%7])", "n = int(input())\r\ns = \"ROYGBIV\"\r\na, b = divmod(n, len(s))\r\nres = s * a\r\nstart = 3 if b <= 4 else 0\r\nres += s[start:start+b]\r\nprint(res)", "eggs = int(input()) - 3\r\nprint(\"ROYG\" * (eggs // 4) + \"ROYG\"[0:eggs % 4] + \"BIV\")\r\n", "colors=[\"R\",\"G\",\"B\",\"V\",\"I\",\"Y\",\"O\"]\ns=0\nsol=\"\"\nn=int(input())\nfor i in range(n):\n char=colors[s]\n if i >=(n-3):\n while (char in sol[0:i-n+4]):\n s=(s+1)%7\n char=colors[s]\n \n sol+=char\n s=(s+1)%7\nprint(sol)\n \t \t\t \t \t\t\t \t \t\t\t \t\t \t\t", "n = int(input())\r\n\r\nc = \"BGIORVY\"\r\n\r\nans = c + \"ORVY\"*25\r\n\r\nprint(ans[:n])\r\n", "l=\"ROGYVBI\"\r\ns=\"YVBI\"\r\nn=int(input())\r\nprint(l,end=\"\")\r\nfor i in range(n-7):\r\n print(s[i%4],end=\"\")\r\nprint()", "n = int(input())\r\ncolor = 'VIBGYOR'\r\nrem = ['', 'G', 'GY', 'GYO', 'VIBG', 'VIBGY', 'VIBGYO']\r\nres = (n//7) * color\r\nres += rem[n%7]\r\nprint(res)", "n = int(input())\r\n\r\ns = \"ROYGBIV\"\r\n\r\nfor _ in range(n-7):\r\n s += s[-4]\r\n\r\nprint(s)\r\n", "n = int(input())\r\ns = \"ROYGBIV\"\r\nans = s\r\nm = 3\r\nctr = n - 7\r\nwhile ctr > 0:\r\n ans += s[m]\r\n m = ((m - 3 + 1) % 4) + 3\r\n ctr -= 1\r\nprint(ans)", "from sys import stdin, stdout\r\ndef istr(): return input()\r\ndef inum(): return int(stdin.readline())\r\ndef imul(): return map(int, stdin.readline().split())\r\ndef ilst(): return list(map(int, stdin.readline().split()))\r\ndef splt(): return list(stdin.readline().strip())\r\ndef emat(row): return [inum() for i in range(row)]\r\nmax_itr = 100\r\nmodd = 10**9+7\r\nfrom itertools import combinations\r\nimport math\r\n\r\n#************************* Code******************************\r\n#************************************************************\r\n\r\nn=inum()\r\nfirst=\"ROYGBIV\"\r\nif(n<=7):print(first[0:n])\r\nelse:\r\n\tt=n//7\r\n\tprint(first[0:7]*t,end='')\r\n\taa=n%7\r\n\tl=['NULL','G','GB','YGB','YGBI','OYGBI','OYGBIV']\r\n\tif(aa>0):print(l[aa])", "main = int(input())\r\n\r\nseven = ['R', 'O', 'Y' 'G', 'B', 'I', 'V']\r\nrotate = ['G', 'B', 'I', 'V']\r\n\r\nfinal = 'ROYGBIV'\r\n\r\nj = 0\r\nfor i in range(main - len(final)):\r\n final += rotate[j]\r\n j += 1\r\n if j == 4: j = 0\r\n\r\nprint(final)\r\n \r\n\r\n", "a = \"ROYGBIV\"\nb = \"GBIV\"\nn = int(input())\nif(n <= 7):\n print(a[:n])\nelse:\n s = a[:]\n n-=7\n s = s + (b)*(n//4)\n s = s + (b[:(n%4)])\n print(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nc = list(\"ROYGBIV\")\r\nans = [c[i % 7] for i in range(n)]\r\nfor i in range(n // 7 * 7, n):\r\n s = set(c)\r\n for j in range(1, 4):\r\n for k in [-1, 1]:\r\n if ans[(i + j * k) % n] in s:\r\n s.remove(ans[(i + j * k) % n])\r\n ans[i] = list(s)[0]\r\nprint(\"\".join(ans))", "from sys import stdin\r\ninput = stdin.readline\r\ncolors = [\"R\", \"O\", \"Y\", \"G\", \"B\", \"I\", \"V\"]\r\n\r\nn = int(input())\r\nans = [4, 5, 6]\r\ni = 0\r\nwhile len(ans) < n:\r\n ans.append(i)\r\n i = (i + 1) % 4\r\nans = [colors[x] for x in ans]\r\nprint(*ans, sep=\"\")", "a = ['G', 'Y', 'O', 'R']\r\nans = 'VIBGYOR'\r\nn = int(input())\r\nfor i in range(8, n+1):\r\n ans += a[i%4]\r\nprint(ans)", "n=int(input())\r\ns=\"ROYGBIV\"\r\nt=\"GBIV\"\r\nif n==7:\r\n print(s)\r\nelse:\r\n print(s,end=\"\")\r\n q=(n-7)//4\r\n r=(n-7)%4\r\n for i in range(q):\r\n print(t,end=\"\")\r\n print(t[:r])\r\n \r\n \r\n", "# Wadea #\r\n\r\nnum_of_eggs = int(input())\r\ncolor = \"ROYGBIV\"\r\nnew_color = \"GBIV\" * num_of_eggs\r\nnew = color\r\nfor i in range(num_of_eggs - 7):\r\n new += new_color[i]\r\nprint(new)\r\n", "arr=[\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\r\nn= int(input())\r\nlis=arr*(n//7)\r\ns=\"\"\r\nx=n%7\r\nif x<=3 and x!=0:\r\n z=-4\r\n for i in range(x):\r\n s+=arr[z]\r\n z+=1\r\nelse:\r\n y=x-4\r\n z=-4-y\r\n for i in range(x):\r\n s+=arr[z]\r\n z+=1\r\nprint(\"\".join(lis)+s)", "lst='ROYGBIV'\r\nn=int(input())\r\nprint(lst,end='')\r\nfor j in range(7,n):\r\n k=(j-4)\r\n print(lst[k],end='')\r\n lst+=lst[k]\r\nprint()", "x=int(input())\r\nn=x-7\r\ns=\"ROYG\"\r\n\r\nl=['R','O','Y','G']\r\ni=0\r\nwhile(n!=0):\r\n s+=l[i]\r\n i+=1\r\n if i>3:\r\n i=0\r\n n-=1\r\ns+='BIV'\r\n\r\nprint(s)\r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n", "s=\"ROYGBIV\"\r\nt=\"GBIV\"\r\nn=int(input())-7\r\nprint(s+(n//4*t)+t[:n%4])", "n = int(input())\r\ncolors = 'ROYGBIV'\r\nwhile len(colors) < n:\r\n colors += colors[len(colors) - 4]\r\nprint(colors)", "inp = int(input())\n\nstring = \"ROYGBIV\"\n\ndivPart = inp // 7\nremPart = inp % 7\n\nans = \"\"\nfor _ in range(divPart):\n ans += string\n\nremainder = \"GBIVGBI\"\n\nans += remainder[0:remPart]\n\n\nprint(ans)\n", "\"\"\"\r\n/*************************************************************\r\n# by : mohamd abda alazez hashim #\r\n# e-mail : [email protected] #\r\n# problem : B. Queue at the School #\r\n*************************************************************/\r\n\"\"\"\r\nn = int(input())\r\n\r\ncolors_repeat = int(n/7)\r\nremain = n%7\r\n\r\ncolors=\"ROYGBIV\"\r\nno_equal=\"GBIV\"\r\n\r\nif remain == 6:\r\n colors=colors*colors_repeat+\"RO\"+no_equal\r\nelif remain == 5:\r\n colors=colors*colors_repeat+\"R\"+no_equal\r\nelse: \r\n colors=colors*colors_repeat+no_equal[:remain]\r\n\r\n \r\nprint(colors)", "n = int(input())\r\n\r\nwhile n >= 7:\r\n n -= 7\r\n print(\"ROYGBIV\",end='')\r\nif n <= 3:\r\n print(\"GBI\"[:n])\r\nelse:\r\n print(\"ROYGBIV\"[:n])\r\n", "n = int(input())\r\n\r\ns = 'ROYGBIV'\r\n\r\nfor i in range(n - 7):\r\n s += s[-4]\r\n\r\nprint(s)\r\n", "\r\nn = int(input())\r\noutput = []\r\ncolors = [\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\r\ntemp = 4\r\nfor x in range(n):\r\n if x < 7:\r\n output.append(colors[x])\r\n else:\r\n for i in colors:\r\n if i not in output[temp:temp+4]:\r\n if i not in output[0:3]:\r\n output.append(i)\r\n temp +=1\r\n break\r\nprint(\"\".join(output))", "n = int(input())\r\n\r\noptions = [['R', 'O', 'Y', 'G', 'B', 'I', 'V'] for _ in range(n)]\r\nassign = [ \"\" for _ in range(n) ]\r\n\r\ncolors = set()\r\n\r\nfor i in range(n):\r\n tobe_assigned = ''\r\n for option in options[i]:\r\n if option not in colors:\r\n colors.add(option)\r\n tobe_assigned = option\r\n break\r\n \r\n tobe_assigned = options[i][0] if tobe_assigned == '' else tobe_assigned\r\n \r\n assign[i] = tobe_assigned\r\n \r\n for j in range(i-3, i+4):\r\n if j >= n:\r\n try:\r\n options[j%n].remove(tobe_assigned)\r\n except:\r\n pass \r\n else:\r\n try:\r\n options[j].remove(tobe_assigned)\r\n except:\r\n pass\r\n \r\nfor c in assign:\r\n print(c, end=\"\")", "def main():\r\n n = int(input())\r\n repeated = n // 7\r\n sequence = 'ROYGBIV'\r\n remained = n % 7\r\n eggs = sequence * repeated + sequence[max(4 - remained, 0):max(4 - remained, 0) + remained]\r\n print(eggs)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "word= \"ROYGBIV\"\r\nn=int(input())\r\nprint((n//7)*word+word[(n%7<4)*(4-n%7):(n%7<=4)*4+(n%7>4)*n%7])", "alphabet = 'ROYGBIV'\r\nn = int(input())\r\nq, r = divmod(n, 7)\r\nindex = 3 if r < 5 else (7 - r)\r\noutput = alphabet * q + alphabet[index:(index + r)]\r\nprint(output)\r\n", "def main():\n n = int(input())\n s1 = 'ROY'; s2 = 'GBIV'\n for i in range(n-3):\n s1 += s2[i % 4]\n print(s1)\n\n\nif __name__ == '__main__':\n main()\n \t\t \t \t \t \t\t\t \t\t\t \t \t \t \t", "n = int(input())\r\n\r\ncircle = \"ROYGBIV\"\r\ni = 7\r\nwhile len(circle)<n:\r\n circle+=circle[i-4]\r\n i+=1\r\nprint(circle)", "\r\neggs = input()\r\neggs = int(eggs)\r\nans= \"ROYGBIV\"; \r\nwhile(eggs >= 7 & eggs <= 100):\r\n #start from the end of ans and then add the 4th last element from your pos\r\n for i in range(len(ans),eggs):\r\n ans += ans[i - 4]\r\n print(ans,end=\"\")\r\n break\r\n", "n = int(input())\r\nl = 'ROYGBIV'\r\nq = [\"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\", \"OYGBIV\"]\r\nprint(l*(n//7), q[n%7], sep='')", "n=int(input())\r\ns=\"ROYGBIV\"\r\ncount=0\r\nfor x in range(n//7):\r\n print(s,end=\"\")\r\ntemp=\"GBIVGBIV\"\r\nif n%7!=0:\r\n ss=n-(n//7)*7\r\n for x in range(ss):\r\n print(temp[count],end=\"\")\r\n count=(count+1)%7", "n = int(input())\ns = \"ROYGBIV\"\nfor i in range(0,int(n/7)):\n\tprint(s,end=\"\")\nif n%7 == 1:\n\tprint(\"G\")\nelif n%7 == 2:\n\tprint(\"GB\")\nelif n%7 == 3:\n\tprint(\"YGB\")\nelif n%7 == 4:\n\tprint(\"YGBI\")\nelif n%7 == 5:\n\tprint(\"OYGBI\")\nelif n%7 == 6:\n\tprint(\"OYGBIV\")\n", "print('BIV' + ''.join('ROYG'[i%4] for i in range(int(input())-3)))", "n = int(input())\n\nprint(\"VIBGYOR\"*(n//7), end='')\n\nif n % 7 < 5:\n print(\"GYOR\"[:n % 7])\nelse:\n print(\"VIBGYOR\"[:n % 7])\n\n \t\t \t \t \t\t\t \t\t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\ns = 'GBIV'\r\nans = 'ROYGBIV'\r\n\r\nfor i in range((n-7)//4):\r\n\tans+=s\r\nfor i in range((n-7)%4):\r\n\tans+=s[i]\r\nprint(ans)", "n=int(input())\r\ns=\"ROYGBIV\"\r\nx=\"GBIVGB\"\r\nres=s*(n//7)+x[:n%7]\r\nprint(res)\r\n", "n = int(input())\r\n\r\n\r\ndef is_good(color, result, n):\r\n i = len(result) \r\n j = i - 1\r\n while j >= 0 and j >= i - 3:\r\n if result[j] == color:\r\n return False\r\n j -= 1\r\n for k in range(1,4):\r\n z = (k+i) %n\r\n if z<len(result) and result[z] == color:\r\n return False\r\n return True\r\n\r\ndef paint(n, result):\r\n colors = list(\"ROGYGBIV\")\r\n if len(result) == n:\r\n if len(list(set(result))) == 7:\r\n print(result)\r\n return True\r\n return False\r\n for color in colors:\r\n if is_good(color, result, n):\r\n if paint(n, result + color):\r\n return True\r\n return False\r\n\r\npaint(n, \"\")\r\n", "colors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\n\r\nans=\"\"\r\n\r\nn = int(input())\r\n\r\nc =0\r\n\r\nfor i in range(n):\r\n ans+= colors[c]\r\n c+=1\r\n \r\n if(c==7):\r\n c=3\r\n \r\n\r\nprint(ans)\r\n", "a=int(input())\r\nl=['R','O','Y','G']\r\nfor i in range(a-3):\r\n print(l[i%4],end='')\r\nprint('BIV')\r\n", "n = int(input())\r\n\r\nl = []\r\nrb = 'VIBGYOR'\r\ns = ''\r\nfor i in range(n // 7):\r\n for j in range(7):\r\n l.append(rb[j])\r\n\r\nfor i in range(n - n // 7 * 7):\r\n l.append(rb[i])\r\n\r\nfor i in range(3):\r\n if l[0] == l[-1] or l[0] == l[-2] or l[0] == l[-3]:\r\n l[0] = l[-4]\r\n\r\n elif l[1] == l[0] or l[1] == l[-1] or l[1] == l[-2]:\r\n l[1] = l[-3]\r\n\r\n elif l[2] == l[1] or l[2] == l[0] or l[2] == l[-1]:\r\n l[2] = l[-2]\r\n\r\nfor i in range(n):\r\n s += l[i]\r\n\r\nprint(s)", "from sys import stdin, stdout\r\n\r\n\r\nn = int(stdin.readline()) - 7\r\nans = 'ROYGBIV'\r\n\r\nwhile n:\r\n ans += ans[-4]\r\n n -= 1\r\n\r\nstdout.write(ans)", "n = int(input())\r\ncolors = ['R','O','Y','G','B','I','V']\r\ncolors2 = ['G','B','I','V']\r\nfor i in colors:\r\n print(i,end = \"\");\r\nfor i in range(n-7):\r\n print(colors2[i%4],end=\"\")\r\nprint()", "colors = ['R','O','Y','G','B','I','V']\nn= int(input())\nprint('ROYG',end='')\nfor i in range(4,n-3):\n print(colors[i%4],end='')\n \nprint('BIV')\n\n\n\n\n", "n=int(input())\r\ns=\"ROYGBIV\"\r\nm=n//7\r\no=n%7\r\nk=[ \"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\",\"OYGBIV\"]\r\nfor i in k:\r\n if(len(i)==o):\r\n print(s*m+i)\r\n", "c = \"ROYGBIV\"\r\ne = \"GBIV\"\r\nn = int(input())\r\nwhile not n >= 7:\r\n n = int(input())\r\nif n%7 == 0:\r\n print(c*int(n/7))\r\nelif n%7 <= 3:\r\n print(c*int(n//7)+e[0:n%7])\r\nelse:\r\n print(c*int(n//7)+c[0:n%7])", "def main():\r\n\t\r\n\tn = int(input())\r\n\tcolors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\n\tl = ['G', 'B', 'I', 'V']\r\n\r\n\tif n <= 7:\r\n\t\tprint(''.join(colors[:n]))\r\n\t\treturn\r\n\r\n\tresult = []\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\tif i < 7:\r\n\t\t\tresult.append(colors[i])\r\n\t\t\tcontinue\r\n\t\tresult.append(l[cnt % 4])\r\n\t\tcnt += 1\r\n\t\r\n\t# print(result)\r\n\tprint(''.join(result))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n\r\n", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\n\r\nN = int(input())\r\nstring = ['R','O','Y','G','B','I','V']\r\nmod = ['G','B','I','V']\r\nstring = ''.join(string)\r\nres = string*(N//7)\r\nremaining = (N%7)\r\nif remaining!=0:\t\r\n\tres += (''.join(mod))*(remaining//4)\r\n\t# print(remaining)\r\n\tremaining =(remaining%4)\r\n\tif remaining!=0:\r\n\t\tres += ''.join(mod[:remaining])\r\nprint(res)", "n=int(input())-7\na=n//4\nb=n%4\nprint(\"ROYGBIV\"+\"GBIV\"*a+\"GBIV\"[:b])\n\t \t\t \t\t \t\t \t \t\t\t\t\t \t\t\t \t", "print(('ROY' + 'GBIV' * 100)[:int(input())])", "s = \"ROYGBIV\"\na = \"GBIV\"\nn = int(input())\n\nif n < 8:\n ans = s[:n]\nelse:\n ans = s\n for i in range(7, n):\n ans += a[(i-3) % 4]\n\nprint(ans)", "n = int(input())\r\ncolors = \"ROYGBIV\"\r\nseq = 0\r\nword = ''\r\ni=0\r\nword = colors*(n//7)\r\nif n%7 <= 4:\r\n word += colors[3:3+(n%7)]\r\n\r\nelse:\r\n word += colors[(7-(n%7)):]\r\nprint(word)", "\r\ncolors = \"ROYG\"\r\nn = int(input())\r\n\r\nfor i in range(n - 3):\r\n print( colors[i%4] , end = \"\")\r\nprint(\"BIV\")", "# your code goes her\r\nn=int(input())\r\na=['V','I','B','G','Y','O','R']\r\nn-=7\r\nwhile(n):\r\n\ta.append(a[-4])\r\n\tn-=1\r\nprint(''.join(a))\r\n\t\r\n\t\r\n\t\r\n\t", "colors = [\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\n\nn = int(input())\ns = [\"\"] * n\nfor i in range(n):\n s[i] = colors[i % 4]\nfor i in range(3):\n s[i] = colors[6-i]\nprint(\"\".join(s))", "n = int(input())\r\ns = 'ROYGBIV'\r\na = int((n - n%7)/7)\r\nb = ''\r\nfor i in range(0, a):\r\n b+=s\r\na = int(n%7)\r\nif a > 3:\r\n b += s[0:a]\r\nelse:\r\n b += s[3:3+a]\r\nprint(b)", "a=int(input())\r\nb='VIBGYOR'\r\nc='GBIV'\r\nd=0\r\nfor i in range(a):\r\n if(i<7):\r\n print(b[len(b)-1-(i%7)],end='')\r\n else:\r\n print(c[d%4],end='')\r\n d+=1", "n = int(input())\r\nl1 = []\r\ncolours1 = \"VIBGYOR\"\r\ncolours2 = \"GYOR\"\r\nfor i in range(7):\r\n l1.append(colours1[i % 7])\r\nfor i in range(0, n - 7):\r\n l1.append(colours2[i % 4])\r\nprint(''.join(l1))\r\n", "c = \"ROYGBIV\"\ne = \"GBIV\"\nn = int(input())\nwhile not n >= 7:\n n = int(input())\nif n%7 == 0:\n print(c*int(n/7))\nelif n%7 <= 3:\n print(c*int(n//7)+e[0:n%7])\nelse:\n print(c*int(n//7)+c[0:n%7])\n \n\t\t \t\t \t\t\t \t \t \t \t\t \t \t\t", "n = int(input())\r\nprint(('ROY' + 'GBIV'*25)[:n])", "n = int(input())\r\nres = [0]*n\r\nv = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\nres[:7] = \"\".join(v)\r\nfor i in range(7, n):\r\n res[i]=res[i-4]\r\nprint(\"\".join(res))", "\r\nsub1 = 'ROYG'\r\nsub2 = 'BIV'\r\n\r\neggs = int(input())\r\nremaining = eggs - 7\r\n\r\nif remaining == 0:\r\n print(sub1+sub2)\r\nelse:\r\n #ans = sub1 + .... + sub2\r\n ans = sub1\r\n while remaining >= 4:\r\n ans += sub1\r\n remaining -= 4\r\n\r\n #remainder\r\n ans+=sub1[0:remaining]\r\n ans+=sub2\r\n print(ans)\r\n\r\n\r\n", "n=int(input())\r\nx=['R','O','Y','G','B','I','V']\r\nans=\"\"\r\nif n%7 in [0,6,5,4]:\r\n for i in range(n):\r\n ans+=x[(i%7)]\r\nelse:\r\n z=n//7\r\n for i in range((z*7)):\r\n ans+=x[(i%7)]\r\n c=n%7\r\n m=\"BIV\"\r\n if c==1:\r\n ans=ans[:-3]+'R'+m\r\n elif c==2:\r\n ans=ans[:-3]+\"RO\"+m\r\n elif c==3:\r\n ans=ans[:-3]+\"ROY\"+m\r\nprint(ans) \r\n ", "n = int(input())\r\ncolor = \"VIBGYOR\"\r\ncolor = color[::-1]\r\nfor i in range(n-7):\r\n \r\n color += color[-4]\r\n \r\nprint(color)", "n = int(input())\nprint('VIBGYOR' + 'GYOR' * ((n-7) // 4) + 'GYOR'[:(n-7) % 4])\n \t \t\t\t \t\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t", "u = int(input())\r\nprint((\"ROY\" + \"GBIV\" * 30)[:u])\r\n", "n = int(input())\nprint('VIBGYOR' + (n - 7) // 4 * 'GYOR' + 'GYOR'[:(n - 7) % 4])", "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\na=int(input())\r\nb=\"ROYGBIV\"\r\narr=[0]*a\r\nfor i in range(a):\r\n if i < 7:\r\n arr[i]=b[i]\r\n else:\r\n for i in range(7,len(arr)):\r\n arr[i]=arr[i-4]\r\nc=\"\"\r\nfor i in arr:\r\n c+=i\r\nprint(c)", "def solve():\r\n n=int(input())\r\n arr=[None for i in range(n)]\r\n #VIBGYOR\r\n arr[0]=\"V\"\r\n arr[1]=\"I\"\r\n arr[2]=\"B\"\r\n arr[3]=\"G\"\r\n arr[-1]=\"R\"\r\n arr[-2]=\"O\"\r\n arr[-3]=\"Y\"\r\n d=[\"V\",\"I\",\"B\",\"G\"]\r\n i=0\r\n j=0\r\n for i in range(4,n-3):\r\n arr[i]=d[j]\r\n j+=1\r\n j=j%4\r\n \r\n op=\"\"\r\n op=op.join(x for x in arr)\r\n print(op)\r\n \r\n\r\nif __name__==\"__main__\":\r\n solve()", "n=int(input())\r\ns=\"ROYGBIV\"\r\nx=n//7\r\ny=n%7\r\ns=s*x\r\nif y>4:\r\n s+=s[:y]\r\nelse:\r\n s+=s[3:y+3]\r\nprint(s)\r\n", "n = int(input())\r\ncolors = 'ROYGBIV'\r\nans = 'ROYGBIV'\r\n\r\nfor i in range(n-7):\r\n for j in colors:\r\n if j not in ans[-3:] and j not in ans[:3]:\r\n ans += j\r\n break\r\n\r\nprint(ans)", "s=\"ROGYVBI\"\r\nadd=\"YVBI\"\r\nn=int(input())\r\nprint(s,end=\"\")\r\nfor i in range(n-7):\r\n print(add[i%4],end=\"\")", "n=int(input())\r\n\r\ns=\"ROYGBIV\"\r\nif(n<=7):\r\n\r\n print(s[0:n])\r\n\r\nelse:\r\n t=n//7\r\n print(s[0:7]*t,end='')\r\n mod=n%7\r\n l=['NULL','G','GB','YGB','YGBI','OYGBI','OYGBIV']\r\n if(mod>0):\r\n print(l[mod])\r\n \r\n \r\n\r\n", "def produs_cifre(numar):\r\n \r\n produs=1\r\n for i in numar:\r\n produs=produs*int(i)\r\n return (produs)\r\n \r\ndef prime_generator(nr_elemente_prime):\r\n \r\n vector_prime=[-1]*nr_elemente_prime\r\n vector_rasp=[0]*nr_elemente_prime\r\n \r\n vector_prime[1]=1\r\n \r\n vector_rasp[1]=1\r\n#primes sieve \r\n contor=2\r\n \r\n for i in range(2,nr_elemente_prime):\r\n if vector_prime[i]==-1:\r\n vector_prime[i]=1\r\n vector_rasp[contor]=i\r\n contor=contor+1\r\n for j in range(i+i,nr_elemente_prime,i):\r\n if vector_prime[j]==-1:\r\n vector_prime[j]=i\r\n #print(i,j) \r\n \r\n my_set=set(vector_rasp)\r\n my_set.remove(0)\r\n my_set.remove(1)\r\n \r\n #lista_prime=list(my_set)\r\n #lista_prime.sort()\r\n return my_set\r\n\r\n#z=int(input())\r\nfor contor in range(0,1):\r\n #n,k\r\n #lista==list(map(int,input().split()))\r\n n=int(input())\r\n rasp='ROYGBIV'\r\n \r\n if n>7:\r\n for i in range(8,n+1):\r\n rasp+=rasp[i-5]\r\n print(rasp)\r\n \r\n\r\n \r\n ", "n, = map(int, input().split())\nchars = [\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\n\nans = []\nfor i in range(n):\n ans.append(i%7)\n\nlast = ans[-1]+1\n\nif last <= 3:\n for i in range(1,last+1):\n ans[-i] = (ans[-i]+3)%7\n\nprint(\"\".join(chars[a] for a in ans))\n\n", "#\tAuthor\t: debugster\r\n#\tEmail\t: [email protected]\r\n#\tDate\t: 2020-06-06 15:47:41\r\n\r\nimport sys\r\nimport os\r\n\r\ndef get_int():\r\n return map(int, input().split())\r\n\r\ndef get_array():\r\n return list(map(int, input().split()))\r\n\r\ndef str_replacer(old_str, new_str, index):\r\n if index in range(len(old_str)):\r\n return old_str[:index] + new_str + old_str[index + 1:]\r\n else:\r\n return old_str\r\n\r\nif os.environ.get(\"DEBUGSTER_PYTHON\"):\r\n sys.stdin = open('in.txt', 'r')\r\n sys.stdout = open('out.txt','w')\r\n\r\n# VBIGYOR\r\ns = \"VBIGYOR\"\r\npat = \"GYOR\"\r\n\r\nwhile len(s) < 100:\r\n s += pat\r\n\r\nn = int(input())\r\nprint(s[:n])", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\nfrom itertools import cycle\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n ans = [None for _ in range(n)]\r\n ans[0], ans[1], ans[2], ans[3] = \"R\", \"O\", \"Y\", \"G\"\r\n ans[-1], ans[-2], ans[-3] = \"B\", \"I\", \"V\"\r\n colors = cycle([\"R\", \"O\", \"Y\", \"G\"])\r\n for i in range(n):\r\n if ans[i] == None:\r\n ans[i] = next(colors)\r\n print(''.join(ans))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\r\ns = 'ROYG'\r\nfor i in range(n-3):\r\n print(s[i%4],end='')\r\nprint('BIV')", "n = input()\r\n\r\ncolors = ['R', 'O', 'Y', 'G', 'B', 'I', \"V\"]\r\n\r\nout = \"\"\r\nfst = True\r\n\r\nwhile(len(out) != int(n)):\r\n\r\n for c in colors:\r\n if fst and len(out) != int(n):\r\n out+=c\r\n fst = False\r\n elif len(out) != int(n):\r\n out = c + out\r\n fst = True\r\n\r\nprint(out)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n l = ['R' , 'O', 'Y', 'G', 'B', 'I', 'V']\r\n result = []\r\n for i in range(n//7):\r\n result += l\r\n remain = n % 7\r\n if remain <= 4:\r\n result += l[3:3+remain]\r\n else:\r\n result += l[:remain]\r\n print(''.join(result))", "a = int(input())\ns = \"ROYGBIV\"*14\ns += \"ROY\"\n# print(s[:a], s[0], s[a-1])\nif s[a-1] == 'R':\n ns = s[:a-1]\n ns+= 'G'\n print(ns)\nelif s[a-1] == 'O':\n ns = s[:a-2]\n ns+= 'GB'\n print(ns)\nelif s[a-1] == 'Y':\n ns = s[:a-3]\n ns+= 'GBI'\n print(ns)\n\nelse:\n print(s[:a])\n\n# Y ROYGBIV ROY\n# ROYGBIVROI\n# ROYGBIVGBI\n", "colors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\ncomplete_colors = ['G', 'B', 'I', 'V', 'G', 'B']\r\n\r\nballs_count = int(input(\"\"))\r\ncomplete_seq = int(balls_count / 7)\r\nsub_seq = balls_count % 7\r\n\r\nsequence = colors * complete_seq\r\nsequence.extend(complete_colors[0:sub_seq])\r\nprint(''.join(sequence))\r\n", "__author__ = 'dougct'\n\n\ndef main():\n n = int(input())\n colors = ['','G', 'YG','OYG','ROYG','ROYGB','ROYGBI']\n print(\"ROYGBIV\" * (n // 7) + colors[n % 7])\n\nif __name__ == '__main__':\n main()", "ans = 'ROYGVBI'\r\nans2 = ['', 'G', 'GV', 'GVB', 'GVBI', 'RGVBI', 'ROGVBI']\r\nn = int(input())\r\nprint((n//7) * ans + ans2[n%7])", "n = int(input())\r\ncolors = \"ROYGBIV\"\r\nresult = ''\r\n\r\nfor i in range(n // 7):\r\n result += colors\r\nif n % 7 == 0:\r\n print(result)\r\nelif n % 7 < 4:\r\n result += result[len(result) - 4: len(result) - 4 + n % 7]\r\n print(result)\r\nelse:\r\n result += colors[:n % 7]\r\n print(result)", "print(\"ROY\" + (100*\"GBIV\")[:int(input())-3])", "count_eggs = int(input())\nvalue = 1\nname = 'ROYGBIV'\nfor i in range(6, count_eggs-1):\n if value == 1:\n name = name + 'G'\n value += 1\n elif value == 2:\n name = name + 'B'\n value += 1\n elif value == 3:\n name = name + 'I'\n value += 1\n else:\n name = name + 'V'\n value = 1\n \nprint(name)\n", "n=int(input())\r\nanswer=''\r\nl='ROYGBIV'\r\n#ROYGBIVGBIVYG\r\nanswer=l*(n//7)\r\nq=[\"\",\"G\",\"GB\",\"YGB\",\"YGBI\",\"OYGBI\",\"OYGBIV\"]\r\nt=n%7\r\nanswer+=q[t]\r\n \r\nprint(answer)\r\n", "n = int(input())\r\nseq = {0: 'ROYGBIV',\r\n 1: 'G',\r\n 2: 'GB',\r\n 3: 'GBI',\r\n 4: 'GBIV',\r\n 5: 'GBIVG',\r\n 6: 'GBIVGB'\r\n }\r\nout = []\r\nq = n // 7\r\nr = n % 7\r\nif r == 0:\r\n out.append(seq[0] * q)\r\nelse:\r\n out.append(seq[0] * q)\r\n out.append(seq[r])\r\n\r\nprint(''.join(out))", "i = int(input())\r\nc = (i//4)-1\r\nans ='ROYV'+('GBIV'*(c))+'GBI'[:i%4]\r\nprint(ans)", "n = int(input()) - 7\r\nprint('VIBGYOR' + 'GYOR' * (n // 4) + 'GYOR'[:n % 4])", "n = int(input())\ns = \"ROYGBIV\"\ntmp = 0\nprint(s, end=\"\")\nfor i in range(8, n+1):\n tmp += 1\n if tmp == 1:\n print(\"G\", end=\"\")\n elif tmp == 2:\n print(\"B\", end=\"\")\n elif tmp == 3:\n print(\"I\", end=\"\")\n else:\n tmp = 0\n print(\"V\", end=\"\")\n\t\t\t\t \t \t \t \t \t \t \t \t\t\t\t\t\t \t", "n = int(input())\r\n\r\nmain = \"ROYGBIV\"\r\nstrings = [\"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\" , \"OYGBIV\"]\r\n\r\ntotal = main*(n//7)\r\ntotal += strings[n%7]\r\nprint(total)", "n=(int)(input())\r\ns=\"ROYBGIV\"\r\ns2=\"BGIV\"\r\nk=0\r\nn1=n//7\r\ns1=s*n1\r\nn2=n-(7*n1)\r\nfor i in range (0,n2):\r\n\ts1=s1+s2[k]\r\n\tk=k+1\r\n\tif(k==4):\r\n\t\tk=0\r\nprint(s1)", "N = int(input())\r\n\r\ncolors = [\"\", \"G\", \"BG\", \"IBG\", \"VIBG\", \"VIBGY\" , \"VIBGYO\"]\r\n\r\nprint(\"VIBGYOR\" * (N // 7) + colors[N % 7])", "import itertools\r\n\r\ncolors = \"GBIV\"; s = \"\"\r\nrep = itertools.cycle(colors)\r\nn = int(input())\r\nprint(\"ROYGBIV\", end=\"\")\r\nfor i in range(n-7):\r\n s += next(rep)\r\nprint(s)", "n=int(input())\n\ncolorlist=[\"R\",\"O\",\"Y\",\"G\"]\ny=0\nx=n%7\nwhile y<n-3:\n z=y%4\n print(colorlist[z],end=\"\")\n y+=1\n\nprint(\"BIV\")\n\t \t\t\t \t \t \t \t\t\t", "n = int(input())\r\nl=['R','O','Y','G','B','I','V']\r\ns=''.join(l[:4])\r\nres=((n-3)//4)*s\r\nres+=s[:(n-3)%4]\r\nres+=''.join(l[4:])\r\nprint(res)", "n = int(input())\r\nif n >= 3:\r\n print('VIB', end='')\r\n n -= 3\r\n\r\ng = 'GYOR'\r\nfor _ in range(n//4):\r\n print(g, end='')\r\n\r\nprint(g[:n % 4])\r\n", "s = 'ROYGBIV'\r\nt = 'GBIV'\r\nn = int(input())\r\nfor i in range(n - 7):\r\n\ts += t[i % 4]\r\nprint(s)\r\n", "n = int(input())\r\ns1 = 'ROYG'\r\ns2 = ''\r\ns3 = 'BIV'\r\nx = n - 7\r\nwhile x > 0:\r\n s2 += s1[0:x]\r\n x -= 4\r\nans = s1 + s2 + s3\r\nprint(ans)", "n = int(input())\r\nlst = \"VIBGYOR\"\r\nlst = lst[::-1]\r\nfor i in range(n-7):\r\n\r\n lst+=lst[-4]\r\n\r\nprint(lst)", "n = int(input())\r\ncolors = \"ROYGBIV\"\r\nres = \"GBIVGB\"\r\nprint(colors*(n//7) + res[:n%7])\r\n", "st1 = \"ROYGBIV\"\r\nst2 =\"GBIV\"\r\ninputt = input()\r\ninputt = int(inputt)\r\n\r\n\r\nc = inputt /7\r\nc= int(c)\r\nm = inputt%7\r\n\r\nout1 = st1*c\r\nout2=\"\"\r\nif m> 4:\r\n out2 = st2[0:4]\r\n m-=4\r\n\r\nout2+= st2[0:m]\r\nfinal = out1+out2\r\n\r\nprint(final)", "n=int(input())\r\ns1='ROYGBIV'\r\ns = s1*(n//7)\r\nif n%7!=0:\r\n if n%7>4:\r\n s+=s1[:n%7]\r\n else:\r\n s+=s1[3:n%7+3]\r\nprint(s)", "import sys\ninput = sys.stdin.readline\n\nn = int(input().strip())\npaint = 'ROYGBIV'\nfor i in range(8, n + 1): paint += paint[i - 5]\nprint(paint)\n", "s=\"\"\r\nn=int(input())\r\nfor i in range(n-3):\r\n s+=\"ROYG\"[i%4]\r\nprint(s+\"BIV\")\r\n", "n = int(input())\r\n\r\nres = \"\"\r\ntimes = n // 7\r\nfor _ in range(times):\r\n res += \"ROYGBIV\"\r\n\r\narr = ['', 'G', 'GB', 'YGB', 'YGBI', 'OYGBI', 'OYGBIV']\r\nrem = n % 7\r\nres += arr[rem]\r\nprint(res)", "n = int(input())\r\ncolors = \"VIBGYOR\"\r\nans = colors + (n-7)//4 * colors[3:] + colors[3:(3+(n-7)%4)] \r\nprint(ans)", "n=int(input())\r\na=[]\r\nm=n//7\r\ns=n%7\r\nfor i in range(0,m):\r\n a.append(\"ROYGBIV\")\r\nif s==1:\r\n a.append(\"G\")\r\nelif s==2:\r\n a.append('GB')\r\nelif s==3:\r\n a.append('YGB')\r\nelif s==4:\r\n a.append('YGBI')\r\nelif s==5:\r\n a.append('OYGBI')\r\nelif s==6:\r\n a.append('OYGBIV')\r\nprint(*a,sep='')", "N = int(input()) - 7\r\n\r\nprint(\"VIBGYOR\" + \"GYOR\"*(N // 4) + \"GYOR\"[:N % 4])", "n = int(input())\r\ns = st = 'ROYGBIV'\r\nfor i in range(n//4):\r\n st += s[3:]\r\nprint(st[:n])\r\n", "z=int(input())\r\nx=list(\"ROYGBIV\")*z\r\nans=\"\"\r\nfor i in range(z):\r\n ans+=x[i]\r\nif ans[-1]==\"R\":\r\n ans=list(ans)\r\n ans.reverse()\r\n ans=\"\".join(ans)\r\n ans=ans.replace(\"R\",\"G\",1)\r\nelif ans[-1]==\"O\":\r\n ans=list(ans)\r\n ans.reverse()\r\n ans=\"\".join(ans)\r\n ans=ans.replace(\"R\",\"G\",1)\r\n ans=ans.replace(\"O\",\"B\",1)\r\nelif ans[-1]==\"Y\":\r\n ans=list(ans)\r\n ans.reverse()\r\n ans=\"\".join(ans)\r\n ans=ans.replace(\"R\",\"G\",1)\r\n ans=ans.replace(\"O\",\"B\",1)\r\n ans=ans.replace(\"Y\",\"I\",1)\r\nprint(ans)\r\n\r\n", "class CodeforcesTask78BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n\n def read_input(self):\n self.n = int(input())\n\n def process_task(self):\n self.n -= 7\n self.result = \"ROYGBIV\"\n if self.n >= 4:\n self.result += \"ROYG\" * (self.n // 4) + \"BIV\"[:self.n % 4]\n else:\n if self.n == 1:\n self.result += \"G\"\n elif self.n == 2:\n self.result += \"GB\"[:self.n]\n else:\n self.result += \"YGB\"[:self.n]\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask78BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "\"\"\"\r\nread: 1:00\r\nthink: 3:00\r\ncode: 5:00\r\ndebug: --:--\r\nstatus: --\r\n\"\"\"\r\nfrom math import floor\r\n\r\ns = \"ROYGBIV\"\r\nb = [\"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\", \"OYGBIV\"]\r\nn = int(input())\r\nc = floor(n / 7)\r\n\r\nss = \"\"\r\nss += s * c\r\nss += b[n % 7]\r\n\r\nprint(ss)", "n=int(input());print(\"VIBG\"*(n//4-1)+\"YOR\"+\"VIBG\"[3-(n)%4:])", "k=int(input())\r\ns=\"ROY\"+\"GBIV\"*k\r\nprint(s[:k])", "s=\"VIBGYOR\"\r\nn=int(input())\r\nif n<=7:\r\n print(s[:n])\r\nelse:\r\n e=s[-4:]\r\n n-=7\r\n s+=e*(n//4)\r\n s+=e[:n%4]\r\n print(s)", "\r\ndef mi():\r\n\treturn map(int, input().split())\r\n\r\nn = int(input())\r\nprint ('VIBGYOR', end = '')\r\nfor i in range(n-7):\r\n\tt = i%4\r\n\tif t==0:\r\n\t\tprint ('G', end = '')\r\n\telif t==1:\r\n\t\tprint ('Y', end = '')\r\n\telif t==2:\r\n\t\tprint ('O', end = '')\r\n\telse:\r\n\t\tprint('R', end = '')", "n =int(input())\r\ncolors = ['R', 'O', 'Y', 'G']\r\nres = \"BIV\"\r\n\r\nn -= 3\r\n\r\nfor i in range(n):\r\n res += colors[i % 4]\r\n\r\nprint(res)\r\n", "n=int(input())\r\ns=\"ROY\"+\"GBIV\"*n\r\nprint(s[:n])", "n = int(input())\nstring = \"ROYG\"\nidx = 0\nwhile n > 3:\n n -= 1\n print(string[idx], end=\"\")\n idx += 1\n idx %= 4\nprint(\"BIV\")\n\n\t\t \t \t \t\t \t \t\t\t \t\t \t\t \t", "from sys import stdin, stdout\r\nfrom collections import defaultdict\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\n#for _ in range(int(stdin.readline())):\r\nn=get_int()\r\nc=\"ROYGBIV\"\r\ns=\"GBIV\"\r\ni=0\r\nans=\"\"\r\nfor i in range(n//7):\r\n ans+=c\r\nn=n%7\r\nif n>=4:\r\n ans+=s\r\nfor i in range(n%4):\r\n ans+=s[i]\r\nprint(ans)\r\n\r\n ", "n = int(input())\r\ncolour =\"ROYGBIV\"\r\nother = [\"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\" , \"OYGBIV\"]\r\nx = n//7\r\ns=colour*x\r\ns+=other[n%7]\r\nprint(s)\r\n", "n=int(input())\r\nfrom sys import stdout\r\nstdout.write(\"VIBGYOR\")\r\nn-=7\r\nwhile(n>4):\r\n stdout.write(\"GYOR\")\r\n n-=4\r\n#VIBGYOR \r\nstdout.write(\"GYOR\"[:n])", "n=int(input())\r\nprint((((n-3)//4)*\"ROYG\")+(\"ROYG\"[:((n-3)%4)]+\"BIV\"))\r\n", "n = int(input())\r\ncolors = ['R','O','Y','G','B','I','V']\r\nres = []\r\nm = n//7\r\nmod = n%7\r\nfor i in range(m):\r\n res.extend(colors)\r\nif mod == 1:\r\n res.append('G')\r\nelif mod == 2:\r\n res.extend(['G','B'])\r\nelif mod == 3:\r\n res.extend(['Y','G','B']) \r\nelif mod == 4:\r\n res.extend(['Y','G','B','I'])\r\nelif mod == 5:\r\n res.extend(['O','Y','G','B','I'])\r\nelif mod == 6:\r\n res.extend(['O','Y','G','B','I', 'V'])\r\nstring = \"\"\r\nfor char in res:\r\n string+=char\r\n\r\nprint(string)", "x=int(input())\r\npattern=\"ROYGBIV\"\r\ns=\"\"\r\nfor i in range(x//7):\r\n s+=pattern\r\npattern1=\"\"\r\nif x%7==1:\r\n pattern1+=\"G\"\r\nelif x%7==2:\r\n pattern1+=\"GB\"\r\nelif x%7==3:\r\n pattern1+=\"YGB\"\r\nelif x%7==4:\r\n pattern1+=\"YGBI\"\r\nelif x%7==5:\r\n pattern1+=\"OYGBI\"\r\nelif x%7==6:\r\n pattern1+=\"OYGBIV\"\r\nprint(s+pattern1)\r\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\nn = inp()\nans = [0] * n\nans[0:7] = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\nrep = ['G', 'B', 'I', 'V']\nfor i in range(7, n):\n ans[i] = rep[( i - 7) % 4]\nprint(''.join(ans))\n", "colors = 'ROYGBIV';a = 'GBIV'\r\nfor i in range(int(input()) - 7):\r\n colors += a[i%4]\r\nprint(colors)", "# your code goes here\r\n\r\nfrom sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\noutput = \"ROYGBIV\"\r\n\r\nn-=7\r\nx = (n) % 4\r\n\r\nif x == 0:\r\n\toutput += \"GBIV\"*(n//4)\r\nelif x== 1:\r\n\toutput += \"GBIV\"*(n//4) + \"G\"\r\nelif x == 2:\r\n\toutput += \"GBIV\"*(n//4) + \"GB\"\r\nelse:\r\n\toutput += \"GBIV\"*(n//4) + \"GBI\"\r\n\t\r\nprint(output)\r\n\t", "n = int(input())\r\n\r\nst = 'ROYGBIV'\r\nsub = 'GBIV'\r\nx = 0\r\nfor i in range(n-7):\r\n st += sub[x]\r\n x = (x+1) % 4\r\n\r\nprint(st)\r\n", "a = ['R','O','Y','G','B','I','V']\n\nn = int(input())\nd = [0 for i in range(n)]\nret = ['A' for i in range(n)]\ndef ver(ret,n,i):\n j = 1\n while (j < 4):\n if(ret[(i + j) % n] == ret[i]):\n return(False)\n if(ret[i-j] == ret[i]):\n return(False)\n j +=1\n if ((n - ret.count('A')) <= 7 and ret.count(ret[i]) > 1):\n return(False)\n return(True)\n\ndef recucive(a, ret, n):\n i1 = 0\n while (i1 < n and i1 >= 0):\n if (d[i1] < 7):\n ret[i1] = a[d[i1]]\n if (ver(ret,n,i1) and d[i1] < 7):\n i1+=1\n else:\n d[i1]+=1\n if (d[i1] >= 7):\n d[i1] == 0\n i1 -= 1\n d[i1] += 1\n return(ret)\n\nret = recucive(a,ret,n)\nfor i in ret:\n print(i,end = '')\nprint()\n", "n = int(input())\ns = \"ROYGBIV\"\nif(n==7):\n print(s)\nelse:\n rem = n-7\n s1 = \"GBIV\"\n if(rem%4==0):\n k = int(rem/4)\n ad = s1*k\n s+=ad\n else:\n k = int(rem/4)\n ad = s1*k\n k = rem%4\n ad = ad+s1[:k]\n s+=ad\n print(s)\n", "n = int(input())\r\nsol = 'ROYGBIV'\r\nwhile len(sol) < n:\r\n sol += sol[len(sol) - 4]\r\nprint(sol)\r\n\r\n\r\n", "n = int(input())\r\n\r\n\r\n\r\nmod = n % 7\r\nt = n //7\r\ns = 'ROYGBIV'\r\ns = s*t\r\n\r\n\r\n\r\nif mod ==1:\r\n s +='G'\r\nelif mod ==2:\r\n s += \"GB\"\r\nelif mod ==3:\r\n s += \"YGB\"\r\nelif mod ==4:\r\n s += \"YGBI\"\r\nelif mod ==5:\r\n s += \"OYGBI\"\r\nelif mod ==6:\r\n s += \"OYGBIV\"\r\n\r\nprint(s)\r\n", "n = int(input())\n\ns2 = 'ROYGBIV'\n\n\n\n\nr2 = 'ROYG'\nfor i in range(0, n - 7 ):\n\tr2 += r2[(i)%4]\nprint(r2 + \"BIV\") ", "n = int(input().strip())\r\ns = \"BIV\"\r\ns1 = \"ROYG\"\r\nnum = int((n-3)/4)\r\nrem = (n-3)%4\r\ns2 = s1*num\r\n#print(s2)\r\noutput = \"\"\r\noutput += s2\r\noutput += s1[0:rem]\r\noutput+=s\r\nprint(output)", "'''\r\n\r\nWelcome to GDB Online.\r\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\r\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\r\nCode, Compile, Run and Debug online from anywhere in world.\r\n\r\n'''\r\n#!/usr/bin/python3\r\n\r\ncolours = \"ROYGBIV\"\r\ncolour_pattern = \"\"\r\n\r\nif __name__ == \"__main__\":\r\n \r\n # Read the input from the user\r\n num_eggs = int(input())\r\n \r\n if num_eggs >= 7:\r\n \r\n # paint with 7 unique colours as much as possible\r\n multiplier = int(num_eggs/7)\r\n for x in range(0, multiplier):\r\n colour_pattern = colour_pattern + colours\r\n \r\n # colour the remaining eggs\r\n pos = (multiplier * 7)\r\n for idx in range(pos, num_eggs):\r\n \r\n # find the suitable colour\r\n for i in range(3, 7):\r\n # places to verify (idx-3, idx-2, idx-1, (idx), idx+1, idx+2, idx+3)\r\n if colour_pattern.find(colours[i], (idx - 3), idx) == -1:\r\n # check first indexes w.r. to its position in circular placement\r\n if (idx + 3) >= num_eggs:\r\n num_circ_pos = (idx + 3) - num_eggs\r\n if colour_pattern.find(colours[i], 0, num_circ_pos) != -1:\r\n continue\r\n colour_pattern += colours[i]\r\n break\r\n \r\n print (colour_pattern)\r\n", "c = ['R' , 'O' , 'Y' , 'G' , 'B' , 'I' , 'V']\r\nn = int(input())\r\nfor i in range(7,n):\r\n c.append(c[i-4])\r\nprint(*c,sep=\"\")", "import sys\nlines = sys.stdin.readlines()\n\n(n) = int(lines[0].strip())\n\nres = \"\"\nfor i in range((n-3)//4):\n res += \"ROYG\"\nres += \"ROYG\"[:(n-3)%4]\nres += \"BIV\"\nprint(res)", "n=int(input())\r\ns=\"ROY\" + \"GBIV\"*n\r\nprint(s[0:n])", "s = \"ROYGBIV\"\r\nn = int(input())\r\nfor i in range(0, n - 7, 7):\r\n print(s, end = '')\r\nif n%7 == 1:\r\n print(\"G\")\r\nelif n%7 == 2:\r\n print(\"GB\")\r\nelif n%7 == 3:\r\n print(\"GYB\")\r\nelif n%7 == 4:\r\n print(\"GYBI\")\r\nelif n%7 == 5:\r\n print(\"GOYBI\")\r\nelif n%7==0:\r\n print(s)\r\nelse:\r\n print(\"GOYBIV\")", "n = int(input())\ncolor = {0:'R', 1:'O', 2:'Y', 3:'G', 4:'B', 6:'I', 7:'V'}\nans = \"BIVROYG\"\nfor i in range(n-7):\n ans = ans+color[i%4]\nprint(ans)", "n = int(input())\r\ns = \"ROY\" + \"GBIV\" * n\r\nprint(s[:n])", "n = int(input())\r\nans = (n//7)*\"VBIGYOR\"\r\ntemp = (((n%7)//4)+1)*\"GYOR\"\r\ntemp = temp[0:(n%7)]\r\nprint(ans+temp)", "n = int(input())\ncolor = ['R', 'O', 'Y', 'G', 'I', 'V', 'B']\n\ns = [0 for i in range(n)]\n\nfor i in range(n//2):\n\ts[i] = color[(2*i)%7]\n\ts[n-i-1] = color[(2*i+1)%7]\n\ni += 1\nif n%2:\n\ts[n//2] = color[(2*i)%7]\n\nprint(''.join(s))", "\r\nrem = ['','G','GB','YGB','YGBI','OYGBI','OYGBIV']\r\npattern = 'ROYGBIV'\r\nn = int(input())\r\nq,r = n // 7,n % 7\r\nres = pattern * q + rem[r]\r\nprint(res)", "res = {}\r\nres[0] = 'R';\r\nres[1] = 'O';\r\nres[2] = 'Y';\r\nres[3] = 'G';\r\nres[4] = 'B';\r\nres[5] = 'I';\r\nres[6] = 'V';\r\nn = int(input())\r\nfor i in range(7,n):\r\n res[i] = res[i - 4]\r\nk = res.values()\r\nk = list(k)\r\ns = ''.join(k)\r\nprint(s)", "from itertools import cycle\r\n\r\nn = int(input())\r\nc = cycle(list(\"GBIV\"))\r\n\r\nj = 3\r\nmy_list = [\"R\", \"O\", \"Y\"]\r\n\r\nfor i in c:\r\n my_list.append(i)\r\n j +=1\r\n if j == n:\r\n break\r\n\r\nanswer = \"\".join(my_list)\r\nprint(answer)", "n = int(input())\r\na = 'ROYGBIV'\r\nc = \"GBIVGB\"\r\nb = n // 7\r\nprint(a*b+c[:n%7])", "n = int(input())\r\ns = \"ROY\"\r\nss = [\"G\", \"B\", \"I\", \"V\"]\r\nfor i in range(n - 3):\r\n s = s + ss[i % 4]\r\nprint(s)", "n = int(input())\r\n\r\ncolors = \"VIBG\"\r\npattern = list(\"ROYGBIV\")\r\nmid = 3\r\nt = 0\r\nwhile(len(pattern) !=n):\r\n pattern.insert(mid,colors[t])\r\n t += 1\r\n if t==4:\r\n t = 0\r\nprint(''.join(pattern))\r\n", "import sys\nx = int(sys.stdin.readline()[:-1])\nif x <= 3:\n print('ROY'[0:x])\nelse:\n s = 'GBIV' * int((x-3) / 4) + 'GBIV'[0:((x-3) % 4)]\n print('ROY' + s)\n\t\t \t \t \t \t \t \t \t \t \t\t \t", "import sys,math,string\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())\nn=int(input())\np=\"ROYGBIV\"\nn-=7\nfor i in range(n):\n p+=p[-4]\nprint(p)\n", "x=int(input())\r\nlist=[\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\r\ni=0\r\nn=x\r\nwhile(n>0):\r\n print(list[i],end='')\r\n i+=1\r\n if(i==7):\r\n if(x-7>=4):\r\n i=0\r\n elif(x-7==3):\r\n i=1\r\n elif(x-7==2):\r\n i=2\r\n elif(x-7==1):\r\n i=3\r\n elif(x-7==0):\r\n i=4\r\n x-=7\r\n n-=1", "n = int(input())\r\np = 'ROYG'\r\nm = (n-7)//4 * p + p[:(n-3)%4]\r\ns = \"BIV\"\r\nprint(p + m + s)\r\n", "n=int(input())\r\nm=n-3\r\nc=\"GBIV\"\r\nif m%4:\r\n k=m//4+1\r\n c*=k\r\n c=c[:m]\r\nelse:\r\n k=m//4\r\n c*=k\r\nprint(\"ROY\"+c)", "#ROUNIAAUDI\r\nint1=int(input())\r\nq=\"ROY\"\r\ny=\"GBIV\"*int1\r\nprint(q+y[:int1-3])\r\n", "c=['R','O','Y','G','B','I','V']\r\nn=int(input())\r\nif(n%7==0):\r\n print(*c*int(n/7),sep='')\r\nelse:\r\n l=(n-7)\r\n print(*c[0:4]+int(l/4)*c[0:4]+c[0:int(l%4)]+c[4:7],sep='')\r\n ", "n=int(input())\r\ns = 'ROYGBIV'\r\nx=(n//7)*s\r\nl =len(x)\r\nif l<n:\r\n x+=s[3:]*3\r\nprint(x[:n])", "n = int(input())\r\nstring = \"ROYG\"\r\nidx = 0\r\nwhile n > 3:\r\n n -= 1\r\n print(string[idx], end=\"\")\r\n idx += 1\r\n idx %= 4\r\nprint(\"BIV\")\r\n", "n = int(input())\r\ns = \"ROYGBIV\"\r\ni = 3\r\nfor j in range( n - len(s) ):\r\n s += s[i]\r\n i = (i + 1) % len(s)\r\nprint(s)\r\n \r\n", "n = int(input())\ncolors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\nfor i in range(n):\n if i <= 6:\n print(colors[i], end= '')\n else:\n mul = (i-7) // 4\n print(colors[i-(mul*4+7)+3], end = '')\n \t\t \t \t \t\t\t\t \t \t\t \t", "def solve():\r\n n = int(input()) \r\n div, rem, s, rem_s = n//4, n%4, 'GBIV', ''\r\n if rem != 0: rem_s = s[:rem]\r\n print('ROY' + (div * s)[3:] + rem_s)\r\nsolve() ", "n = int(input())\nresult = \"ROYGBIV\"\ngbiv = \"GBIV\"\nfor i in range(n-7):\n result += gbiv[i%4]\nprint(result)", "n=int(input())\r\nl=\"GYOR\"\r\nprint(\"VIBGYOR\"+l*((n-7)//4)+l[:(n-7)%4])\r\n", "n=int(input())\r\nch=\"ROYGBIV\"\r\nres=ch*(n//7)\r\nif n%7==1:\r\n res+=\"G\"\r\nelif n%7==2:\r\n res+=\"GB\"\r\nelif n%7==3:\r\n res+=\"GBI\"\r\nelif n%7==4:\r\n res+=\"GBIV\"\r\nelif n%7==5:\r\n res+=\"RGBIV\"\r\nelif n%7==6:\r\n res+=\"ROGBIV\"\r\nprint(res)", "n = int(input())\r\ncolors = 'ROYGBIV'\r\ncomplete = 'GBIVGBIV'\r\nans = colors * (n//7) + complete[:n%7]\r\nprint(ans)", "n = int(input())\r\ns = 'ROYGBIV'\r\nst = 'ROYGBIV'\r\nfor i in range(30):\r\n st += s[3:]\r\nprint(st[:n])\r\n", "n=int(input())\r\ns=\"ROYGBIV\"\r\nh,t=\"ROY\",\"BIV\"\r\ns=\"GROY\"\r\n#首：ROY 尾BIV\r\n#GROY\r\nn1=(n-6)//4\r\nn2=(n-6)%4\r\nprint(h+s*n1+s[:n2]+t)", "n=int(input())\nif(n%7==0):\n print(\"VIBGYOR\"*int(n/7))\nelif(n%7==1):\n print(\"VIBGYOR\"*int((n/7))+\"G\")\nelif(n%7==2):\n print(\"VIBGYOR\"*int((n/7))+\"GY\")\nelif(n%7==3):\n print(\"VIBGYOR\"*int((n/7))+\"GYO\")\nelif(n%7==4):\n print(\"VIBGYOR\"*int((n/7))+\"GYOR\")\nelif(n%7==5):\n print(\"VIBGYOR\"*int((n/7))+\"GYORG\")\nelif(n%7==6):\n print(\"VIBGYOR\"*int((n/7))+\"GYORGY\")\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\ngetInts = lambda : list(map(int,input().split()))\r\n\r\n\r\nn = int(input())\r\nwholeDivision = n // 7\r\nremainder = n % 7\r\naddedString = [\"\",\"G\",\"GB\", \"YGB\",\"YGBI\",\"OYGBI\",\"OYGBIV\"]\r\n\r\n\r\nans = (wholeDivision * \"ROYGBIV\") + addedString[remainder]\r\nprint(ans)", "n = int(input())\n\nans = list(\"ROYG\")\nidx = 0\n\nfor i in range(n - 7):\n ans.append(ans[idx])\n idx += 1\n idx %= 4\n\nans.extend(list(\"BIV\"))\n\nprint(''.join(ans))\n", "n = int(input(\"\"))\r\nrep = \"ROYG\"\r\n\r\nprint(\"BIV\", end=\"\")\r\nn -= 3\r\ni = 0\r\nwhile n > 0:\r\n print(rep[i], end=\"\")\r\n i += 1\r\n if i > 3:\r\n i = 0\r\n n -= 1\r\n", "sequence=\"ROYGBIV\"+\"GBIV\"*24\nn=int(input())\nprint(sequence[0:n])\n\t\t\t \t \t \t\t \t \t\t\t \t\t \t", "import sys\n\ndef main(n):\n can_use = \"ROYG\"\n using = 0\n l = []\n for i in range(1, n + 1):\n if n - i <= 2:\n break\n l.append(can_use[using])\n using = (using + 1) % 4\n\n # Last 3.\n l.extend([\"B\", \"I\", \"V\"])\n print(\"\".join(l))\n\nif __name__ == \"__main__\":\n for e, line in enumerate(sys.stdin.readlines()):\n n = int(line.strip())\n main(n)\n", "import math;\r\nn = int(input());\r\n\r\narr = ['R', 'O', 'Y', 'G', 'B', 'I', 'V'];\r\nstr = \"ROYGBIV\";\r\nj = 0;\r\nfor i in range(0, math.floor(n/7)):\r\n print(str, end = '');\r\n\r\nn = n%7;\r\n\r\nif n < 3 and n !=0:\r\n j = 3;\r\n for i in range(0, n):\r\n print(arr[j], end='');\r\n j = j+1;\r\nelif n >= 3 and n!= 0:\r\n j = 1;\r\n for i in range(0, n):\r\n print(arr[j], end='');\r\n j = j+1;", "print(\"ROY\"+(100*\"BGIV\")[:int(input())-3])", "n=int(input())\r\nq=n//7\r\nr=n%7\r\ns=\"ROYGBIV\"\r\np=\"GBI\"\r\nfor i in range(q+1):\r\n if i==q:\r\n if r>=4:\r\n print(s[0:r],end=\"\")\r\n elif r<4:\r\n print(p[0:r],end=\"\")\r\n else:\r\n print(s,end=\"\")\r\n \r\n", "n = int(input())\r\ncolors = \"ROY\" + \"GBIV\"*50\r\nprint(colors[:n])", "n = int(input())\r\nx = n//7\r\n# ROYGBIV\r\nif n%7 == 0:\r\n print('ROYGBIV'*x)\r\nelif n%7 == 1:\r\n print('ROYGBIV'*x + 'G')\r\nelif n%7 == 2:\r\n print('ROYGBIV'*x + 'YG')\r\nelif n%7 == 3:\r\n print('ROYGBIV'*x + 'YGB')\r\nelif n%7 == 4:\r\n print('ROYGBIV'*x + 'OYGB')\r\nelif n%7 == 5:\r\n print('ROYGBIV'*x + 'OYGBI')\r\nelse:\r\n print('ROYGBIV'*x + 'ROYGBI')\r\n\r\n\r\n ", "n = int(input())\r\nC = 'ROYGBIV'\r\nans = [C]*(n//7)\r\nr = n%7\r\nif r == 0:\r\n pass\r\nelif r == 1:\r\n ans += 'G'\r\nelif r == 2:\r\n ans += 'GB'\r\nelif r == 3:\r\n ans += 'GBI'\r\nelif r == 4:\r\n ans += 'GBIV'\r\nelif r == 5:\r\n ans += 'GBIVG'\r\nelif r == 6:\r\n ans += 'GBIVGB'\r\nprint(''.join(ans))\r\n", "#!/usr/bin/python3\n\nn = int(input())\n\ns = \"ROY\"\nwhile len(s) < n:\n s += \"GBIV\"\n\nprint(s[:n])\n", "n = int(input())\r\n\r\nres = \"ROYGBIV\"\r\nfor i in range(7, n):\r\n res += res[len(res)-4]\r\n \r\nprint(res)", "print(('ROY' + 'GBIV' * 30)[:int(input())])\r\n", "n = int(input())\r\n\r\ncolors = 'ROYGBIV'\r\nans = []\r\nfor i in range(n):\r\n ans.append(colors[i % 4])\r\n\r\nfor i in range(3):\r\n ans[i] = colors[4+i]\r\n\r\nprint(''.join(ans))\r\n", "import random\nn = int(input())\nclrs = \"ROYGBIV\"\nc = \"\"\nc += clrs * (n // 7)\nif n % 7 == 1:\n c += \"G\"\nelif n % 7 == 2:\n c += \"GB\"\nelif n % 7 == 3:\n c += \"YGB\"\nelif n % 7 == 4:\n c += \"YGBI\"\nelif n % 7 == 5:\n c += \"OYGBI\"\nelif n % 7 == 6:\n c += \"OYGBIV\"\nprint(c)", "n = int(input())\r\npattern = 'ROYGBIV'\r\nex_pattern = 'GBIVROY' #GBIVROY\r\ns = n // 7 * pattern\r\nif n % 7 > 4:\r\n\ts += pattern[:n % 7]\r\nelse:\r\n\ts += ex_pattern[:n % 7]\r\nprint(s)", "n=input()\r\nn=int(n)\r\ns1=\"ROY\"\r\ns2=\"GBIV\"\r\nj=0\r\nfor i in range(n-3):\r\n s1+=s2[j]\r\n j+=1\r\n if j==4:\r\n j=0\r\nprint(s1)", "import random\r\nx = int(input())\r\nres = \"\"\r\ncolors = [\"\", \"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\", \"OYGBIV\"]\r\nres += 'ROYGBIV' * (x // 7)\r\nres += colors[x%7]\r\nprint(res)", "koko = [\"G\", \"B\", \"I\", \"V\"]\r\nout = \"ROYGBIV\"\r\nc = 0\r\nfor i in range(int(input()) - 7):\r\n if i % 4 == 0 and i != 0:\r\n c = (i // 4) * 4\r\n out += koko[i - c]\r\nprint(out)", "n = int(input());print((\"ROY\" + \"GBIV\" * n)[:n])", "x=\"ROYGBIV\"\r\nv=\"GBIV\"*2\r\nn=int(input())\r\nprint((x*(n//7))+(v[:n%7]))", "import sys\n\n\ndef solve():\n\tcolors = 'ROYGBIV'\n\t\n\t# fin = open('input.txt')\n\t# input = fin.readline \n\tinput = sys.stdin.readline\n\tn = int(input())\n\n\tif n == 7:\n\t\treturn colors\n\n\tresult = [None] * n\n\n\tfor i in range(len(colors)):\n\t\tresult[i] = colors[i]\n\n\tremaining = n - 7\n\n\tfor i in range(remaining):\n\t\tresult[7 + i] = result[7 + i - 4]\n\n\treturn ''.join(result)\n\n\n\t\t\nprint(solve())", "n = int(input())\r\ncolor = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\r\n\r\nif n == 7:\r\n print(''.join(color))\r\nelse:\r\n extra = ['G', 'B', 'I', 'V']\r\n j = 0\r\n for i in range(7, n):\r\n color.append(extra[j])\r\n j += 1\r\n if j == 4:\r\n j = 0\r\n print(''.join(color))\r\n", "string = \"ROYGBIV\"\r\nn = int(input())\r\nif n % 7 > 4:\r\n print(string*(n//7), string[7-(n % 7):], sep='')\r\nelse:\r\n print(string * (n // 7), string[3: (n % 7) + 3], sep='')\r\n", "t=int(input())\r\nk =\"ROYG\"\r\ns=int((t-3)/4)*k \r\ns=s+ k[:((t-3)%4)] \r\ns=s+\"BIV\" \r\nprint(s)", "\r\nn=int(input())\r\nb='GBIV'\r\na='ROYGBIV'\r\nres=''\r\nres=a\r\nn-=7\r\nif n==0:\r\n print(res)\r\nelse:\r\n for _ in range(n//4):\r\n res+=b\r\n u=n%4\r\n for i in range(u):\r\n res+=b[i]\r\n print(res)", "n = int(input())\r\n\r\ncolours = ['R', 'O', 'Y', 'G']\r\n\r\nprint('BIV', end='')\r\nfor i in range(n-3):\r\n print(colours[i % 4], end='')\r\n", "\"\"\"\r\nhttps://codeforces.com/contest/78/problem/B\r\n\"\"\"\r\nn = int(input())\r\ns = \"ROYGBIV\"\r\ndis = \"GBIV\"\r\nsol = s + (dis * (((n - 7) // 4) + 1))\r\n\r\nprint(sol[:n])\r\n", "n = int(input())\r\ncolors = \"ROYGBIV\"\r\nword = colors*(n//7)\r\nif n%7 <= 4:\r\n print(word + colors[3:3 + (n % 7)])\r\nelse:\r\n print(word + colors[(7-(n%7)):])\r\n", "if __name__ == \"__main__\":\r\n s = \"ROYGBIV\"\r\n cases = ['','G','GB','YGB','YGBI','OYGBI','OYGBIV']\r\n n = int(input())\r\n to_print = n//7\r\n cases_print = n%7\r\n print( s*to_print, end=\"\")\r\n print( cases[cases_print], end=\"\")\r\n", "n=int(input())\nc=['R','O','Y','G','B','I','V']\nans=[]\nfor i in range(n-3):\n ans.append(c[i%4])\nfor i in range(3):\n ans.append(c[i+4])\nprint(''.join(ans))\n", "palette = 'ROYGBIV'\r\nrep = 'GBIV'\r\ncolors = palette + rep*100\r\nn = int(input())\r\ns = colors[:n]\r\nprint(s)", "chaine2 = input()\r\nliste2 = list(map(int, chaine2.split(\" \")))\r\nx = liste2[0]\r\n#chaine = str(input())\r\nchars=\"ROYGBIV\"\r\ni=4\r\nres='ROYG'\r\nwhile len(res)<x :\r\n if i == len(chars) :\r\n i= 0\r\n if chars[i] not in (res[:3] or res[len(res)-3,len(res)]) :\r\n res+=chars[i]\r\n i+=1\r\n else :\r\n i+=1\r\n\r\nprint(res)", "#rOkY\r\n#FuCk\r\n\r\n############################### kOpAl ##################################\r\n\r\nimport math\r\nt=int(input())\r\ns='ROYGVIB'\r\n\r\ni=0\r\ncnt=0\r\nwhile(i<t-3):\r\n print(s[cnt],end='')\r\n cnt+=1\r\n i+=1\r\n if(cnt==4):\r\n cnt=0\r\nfor i in range(4,7,1):\r\n print(s[i],end='')\r\nprint()\r\n", "colors = \"ROYG\"\r\ni = \"BIV\"\r\nn = int(input())\r\ncolors *= int((n/4)+1)\r\ncolors = colors[:n-3] + i\r\nprint(colors)", "\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n c = 'ROYGBIV'\r\n r = 'GBIV'\r\n s = c*(n//7)\r\n for i in range(n%7):\r\n s += r[i%4]\r\n print(s)\r\n\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\r\n amount = int(input())\r\n colors = [\"R\", \"O\", \"Y\", \"G\", \"B\", \"I\", \"V\"]\r\n result = \"ROYGBIV\"\r\n\r\n index = 0\r\n for _ in range(7, amount):\r\n current = colors[index % 7]\r\n compare = [result[0], result[1], result[2], result[-1], result[-2], result[-3]]\r\n while(current in compare):\r\n index += 1\r\n current = colors[index % 7]\r\n\r\n result = result + colors[index % 7]\r\n\r\n print(result)\r\n\r\nmain()", "n=int(input())\r\ns='ROY'\r\nwhile(len(s)<n):\r\n s+=\"GBIV\"\r\nprint(s[:n])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 26 13:03:49 2021\r\n\r\n@author: Mo'men\r\n\"\"\"\r\n\r\nn = int(input())\r\ncounter = 0\r\nanswer = \"\"\r\nwhole = int(n / 7)\r\nfrac = n % 7\r\nword = \"GBIV\"\r\nfor i in range(whole):\r\n answer += \"ROYGBIV\"\r\nfor i in range(frac):\r\n answer += word[i%4]\r\nprint(answer)", "n=int(input())\r\ns='ROYGBIV'\r\nse='GBIV'\r\nc=n%len(s)\r\nd=n//len(s)\r\nf=int((c)%4)\r\nif(c==0):\r\n print(s*d)\r\nelse:\r\n if(c<=4):\r\n print((s*d)+(se[0:c]))\r\n \r\n else:\r\n if(f==0):\r\n print((s*d)+(se*(c//4)))\r\n else:\r\n print((s*d)+(se*(c//4))+se[0:f])\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\ncolors = \"ROYGBIV\"\nss = \"\"\nfor j in range(n):\n if j % 2 == 0:\n ss = ss + colors[j%7]\n else:\n ss = colors[j%7] + ss\nprint(ss)", "import itertools\r\nimport math\r\nimport threading\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\nfrom math import factorial as fac\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n s = 'ROYGBIV'\r\n\r\n for i in range(n - 3):\r\n print(s[i % 4], end=\"\")\r\n\r\n print(\"BIV\")\r\n\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n multitest = 0\r\n\r\n if multitest != 0:\r\n t = int(sys.stdin.readline())\r\n for i in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n = int(input())\r\nstr = ''\r\nwhile len(str) != n:\r\n if n - len(str) >= 7:\r\n str += 'ROYG'\r\n elif n - len(str) == 6:\r\n str += 'ROY'\r\n elif n - len(str) == 5:\r\n str += 'RO'\r\n elif n - len(str) == 4:\r\n str += 'R'\r\n else:\r\n str += 'BIV'\r\nprint(str)", "# LUOGU_RID: 104833040\nprint(('ROY' + 'GBIV' * 25)[:int(input())])\r\n", "import sys\r\nimport bisect\r\nfrom collections import deque\r\n# from math import ceil,log,gcd,sqrt\r\n# sys.setrecursionlimit(10**9)\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 = 10 ** 9 + 7\r\n\r\n\r\nn = int(ri())\r\nans = [-1]*n\r\nans[n-1]='I'\r\nans[n-2]='V'\r\nans[n-3]='O'\r\nc = ['R','B','G','Y']\r\nite=0\r\nfor i in range(n-3):\r\n ans[i] = c[ite]\r\n ite= (ite+1)%4\r\nprint(''.join(ans))", "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 *\r\nfrom itertools import accumulate\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 = ii()\r\na = n // 7\r\nb = n % 7\r\ns = \"VIBGYOR\"\r\nans = list(s * a + \"-\" * b + s)\r\ni = 7 * a\r\nfor j in range(i, i + b):\r\n x = list(s)\r\n for k in range(max(0, j - 3), j + 4):\r\n if ans[k] in x:\r\n x.remove(ans[k])\r\n ans[j] = x[0]\r\n\r\nans = (ans[:-7])\r\nprint(''.join(ans))", "n = int(input())\r\ns = ''\r\nfor i in range(n-3):\r\n s += 'ROYG'[i%4]\r\nprint(s + 'BIV')", "\r\nst='ROYGBIV'\r\nst1='GBIV'\r\nx=int(input())\r\nx=x-7\r\nprint(f'{st}{st1*(x//4)}{st1[:x%4]}')\r\n", "n = int(input()) - 7\r\nprint('ROYGBIV' + 'GBIV' * (n // 4) + 'GBIV'[:n % 4])", "n=int(input())\r\nclrs='VIBGYOR'\r\n#clrs=clrs[::-1]\r\ni=0\r\nco=0\r\nwhile(co<=n):\r\n \r\n if i==7:\r\n if n-co>= 4:\r\n i=0\r\n else:\r\n x=n-co\r\n i=5-x-1\r\n \r\n if co==n:\r\n break\r\n \r\n print(clrs[i],end=\"\")\r\n \r\n i+=1\r\n co+=1\r\n ", "n = int(input())\r\nl = [\"R\",\"O\",\"Y\",\"G\",\"B\",\"I\",\"V\"]\r\ns = \"\"\r\np = 0\r\nwhile len(s) < n:\r\n if p == 7:\r\n diff = n - len(s)\r\n if diff > 3:\r\n p = 0\r\n else:\r\n p = 3\r\n s += l[p]\r\n p += 1\r\n\r\nprint(s)", "n = int(input())\ns = 'ROYGBIV'\ns1 = 'GBIV'\nprint(s, (n - 7) // 4 * s1, s1[:(n - 7) % 4], sep='')\n", "\r\nrgb = \"ROYGBIV\"\r\nn = int(input())\r\nout = \"\"\r\n\r\nout += rgb * (n // 7)\r\nn %= 7\r\n\r\nout += rgb[3:] * (n // 4)\r\nn %= 4\r\n\r\nout += rgb[3:n+3]\r\n\r\nprint(out)\r\n\r\n\r\n\r\n\r\n\r\n", "colors = \"ROYGBIV\"\neggs = int(input())\nprint(colors,end=\"\")\nfor i in range(eggs-7):\n\tprint(colors[(i%4)+3],end=\"\")\nprint()\n \t \t \t\t\t \t \t\t\t \t\t \t\t\t\t", "n = int(input())\r\nx = n % 7\r\ncolors = 'ROYGBIV'\r\nres = ''\r\nres += colors * (n//7)\r\nif(x >= 4):\r\n res += colors[:x]\r\nelse:\r\n res += colors[3:3+x]\r\nprint(res)", "n = int(input())\r\ncolors = [\"R\", \"O\", \"Y\", \"G\", \"B\", \"I\", \"V\"]\r\nanswer = list()\r\nfor i in range(n):\r\n answer.append(colors[i%7])\r\nif (n % 7) < 4:\r\n elements = n % 7\r\n for i in range(elements):\r\n j = len(answer) - 1\r\n k = 3\r\n temp = answer[j]\r\n while k > 0:\r\n answer[j] = answer[j-1]\r\n j -= 1\r\n k -= 1\r\n answer[j] = temp\r\nprintstring = \"\"\r\nfor i in range(len(answer)):\r\n printstring += answer[i]\r\nprint(printstring)", "n = int(input())\ns = 'ROYGBIV' + 'GBIV' * 24\nprint(s[:n])\n\n# ok maybe I did need a few more characters :)\n \t \t\t \t\t\t \t \t\t\t \t \t \t\t", "n = int(input())\r\ncolors = \"ROYGBIV\"\r\nif n%7 <= 4:\r\n print(colors*(n//7) + colors[3:3 + (n % 7)])\r\nelse:\r\n print(colors*(n//7) + colors[(7-(n%7)):])\r\n", "n=int(input())-3\r\nprint(\"ROY\",end=\"\")\r\nfor i in range(int(n/4)):\r\n print(\"GBIV\",end=\"\")\r\ns=\"GBIV\"\r\nprint(s[0:n%4])", "color = \"ROYGBIV\"\nn = int(input())\nprint(color,end=\"\")\nfor i in range(n-len(color)):\n print(color[i%4+3],end=\"\")\n \t\t \t \t\t \t\t \t \t\t\t\t\t \t\t\t \t \t", "\n\n\ncolors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\n\nn = int(input())\n\nresult = []\n\nfor i in range(n-3):\n result += [colors[i%4]]\n\nresult += colors[4:]\n\n\n\nprint(\"\".join(result))\n\n\n\n", "import sys\n\nn = int(sys.stdin.readline())\n\ncolors = 'ROYGBIV'\n\ncircle = colors[:4] * (n // 4)\n\nm = n - len(circle)\ncircle += colors[4:]\ncircle = circle[3-m:]\nprint(circle)\n\t\t\t\t\t\t \t \t\t\t \t \t\t \t \t\t\t\t \t", "# LUOGU_RID: 128407558\nprint(('ROY'+25*'GBIV')[:int(input())])", "def solve():\r\n n = int(input()) \r\n rem, s, rem_s = n%4, 'GBIV', ''\r\n if rem: rem_s = s[:rem]\r\n print('ROY' + (n//4 * s)[3:] + rem_s)\r\nsolve() ", "n=int(input())\r\ns='ROY'\r\nfor i in range(n-3):\r\n if i%4==0:\r\n s+='G'\r\n elif i%4==1:\r\n s+='B'\r\n elif i%4==2:\r\n s+='I'\r\n else:\r\n s+='V'\r\nprint(s)", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \n\nn = ri()\ncolors= \"ROYGBIV\"\nans =[]\n\nfor i in range(n):\n\tans.append(colors[i%7])\nif n%7 == 1:\n\n\tans[-1] = colors[3]\nelif n%7 == 2:\n\tans[-1] = colors[3]\n\tans[-2] = colors[2]\nelif n%7 == 3:\n\tans[-1] = colors[3]\n\tans[-2] = colors[2]\n\tans[-3] = colors[1]\nprint(\"\".join(ans))\n\n\n", "t=int(input())\r\nm=t//7\r\nr=t%7\r\na=\"VIBGYOR\"\r\np=(len(a)-r)//2\r\nv=a*(m-1)+a[:p+r]+a[:r]+a[p+r:]\r\nprint(v)", "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\ns='ROYGBIV'\r\nn=ii()\r\ns1='ROY'\r\ns2='BIV'\r\nfor i in range(n-6):\r\n for j in s:\r\n if not j in s1 and not j in (s2[-1]+s2[-2]+s2[-3]):\r\n s2=s2+j\r\n break\r\nprint(s1+s2)\r\n", "if __name__ == '__main__':\r\n num = int(input().strip())\r\n f_count = num // 7\r\n rem = num % 7\r\n chain = ['ROYGBIV','G','GB','YGB','ROYG','ROYGB','ROYGBI']\r\n if(rem == 0):\r\n print(chain[0] * f_count)\r\n else:\r\n print(chain[0] * f_count + chain[rem])", "def main():\n S = \"ROYGBIV\"\n ans = \"\"\n n = int(input())\n\n for i in range(n):\n\n if i < len(S):\n ans += S[i]\n else:\n ans += ans[i-4]\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\n\r\nprint(('ROYG'*((n+3)//4))[:n-3] + 'BIV')", "# ip = open(\"testdata.txt\", \"r\")\n\n# def input():\n# \treturn ip.readline().strip()\n\nfrom collections import defaultdict\n\nhmap = [\"R\", \"O\", \"Y\", \"G\", \"B\", \"I\", \"V\"]\n\nn = int(input())\n\nn = n - 7\nrep = n//4\nrem = n - rep*4\nans = \"ROYGBIV\" + \"GBIV\"*rep + ''.join([hmap[3+i] for i in range(rem)])\nprint(ans)\n", "def toch(s,f,l):\r\n\tns=s[:f]\r\n\tns+=s[l:]\r\n\tns+=s[f:l]\r\n\treturn ns\r\n\r\nn=int(input())\r\np=n%7\r\nm=n//7\r\nts='ROYGBIV'\r\ns=m*ts\r\ns+=ts[:p]\r\nif p<4 and p>0:\r\n\ts=toch(s,(m-1)*7+p+3,m*7)\r\nprint(s)", "n = int(input())\ncolors = ['R', 'O', 'Y', 'G', 'B', 'I', 'V']\n\nans = ''\nfor i in range(n-3):\n ans += colors[i % 4]\nans += 'BIV'\nprint(ans)\n", "n=int(input())\r\ncol=\"OYIV\"\r\nstring=\"RGB\"\r\nn=n-3\r\nfor i in range(n):\r\n\t\tstring=string+col[i%4]\r\nprint(string)", "s = \"VIBGYOR\"\r\nn = int(input())\r\ns2 = s * (n//7)\r\nn %= 7\r\nif n == 1:\r\n s2 += \"G\"\r\nif n == 2:\r\n s2 += \"GY\"\r\nif n == 3:\r\n s2 += \"GYO\"\r\nif n == 4:\r\n s2 += \"GYOR\"\r\nif n == 5:\r\n s2 += \"GYORG\"\r\nif n == 6:\r\n s2 += \"GYORGY\"\r\nprint(s2)", "n = int(input())\r\nword = \"ROYGBIV\"\r\nans = word*(n//7)\r\nr = n%7\r\nif r == 0:\r\n print(ans)\r\nelif r==1:\r\n print(ans+\"G\")\r\nelif r==2:\r\n print(ans+\"GB\")\r\nelif r==3:\r\n print(ans+\"YGB\")\r\nelif r==4:\r\n print(ans+\"YGBI\")\r\nelif r==5:\r\n print(ans+\"OYGBI\")\r\nelse:\r\n print(ans+\"OYGBIV\")\r\n", "n = int(input())\n\ncolors = \"ROYGBIV\"\n\nres = colors[:]\nn -= 7\n\ni = 0\nsmall_colors = \"GBIV\"\nwhile n:\n res += small_colors[i % 4]\n i += 1\n n -= 1\n\nprint(res)\n" ]

[ "n = int(input())\r\nl = list(map(int,input().split()))\r\np = max(l)\r\nv=0\r\nr=0\r\nfor i in l:\r\n v = p-i\r\n r+=v\r\nprint(r)\r\n \r\n ", "a=int(input())\r\nb=list(map(int,input().split()))\r\nm=max(b)\r\nq=sum(b)\r\nprint(a*m-q)", "\n\ndef solve():\n n = int(input())\n numbers = input().split()\n\n# Convert the list of strings to a list of integers\n numbers = [int(x) for x in numbers]\n\n biggest = max(numbers)\n equality = n * biggest\n print(equality - sum(numbers))\n\ndef main():\n solve()\n\nmain()", "c=int(input())\r\na = [int (x) for x in input ().split()]\r\ns=0\r\nx=a.sort()\r\nmaxx=a[-1]\r\nfor w in a:\r\n d=int(maxx)-int(w)\r\n s+=d\r\nprint(s)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nm= max(l)\r\nto = sum(m - wealth for wealth in l)\r\nprint(to)\r\n", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ncnt = 0\r\nl = sorted(l,reverse=True)\r\nval = l[0]\r\nfor i in range(n):\r\n cnt += val - l[i]\r\n\r\nprint(cnt)\r\n", "_ = input()\nl_w = list(map(int, input().split()))\nm = max(l_w)\nt = 0\n\nfor w in l_w:\n t += m - w\n\nprint(t)", "n= int(input())\r\narr = [int(x) for x in input().split()]\r\nval = max(arr)\r\nequal = [abs(val-i) for i in arr]\r\nprint(sum(equal))", "x=int(input());l=list(map(int,input().split()));m=max(l);c=0\r\nfor i in l: c+=m-i\r\nprint(c)", "\r\n\r\ndef solve():\r\n n = int(input())\r\n welfare = list(map(int, input().split(maxsplit=n)))\r\n max_bienestar = max(welfare)\r\n return sum(\r\n map(\r\n lambda c: max_bienestar - c, welfare\r\n )\r\n )\r\n\r\n\r\nprint(solve())\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmax1=max(arr)\r\nres=0\r\nfor i in arr:\r\n if i==max1:\r\n arr.remove(i)\r\nfor i in arr:\r\n res+=max1-i\r\nprint(res)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum+=(max(s)-s[i])\r\nprint(sum)\r\n", "n = int(input())\r\n\r\ncit = list(map(int, input().split()))\r\nans = 0\r\n\r\nmaxN = max(cit)\r\n\r\nfor i in cit:\r\n ans += maxN - i\r\n\r\n\r\nprint(ans)", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ny = a[n-1]\r\nc = 0\r\nfor i in range(n):\r\n if a[i] < y :\r\n x = abs(y-a[i])\r\n c = c + x\r\nprint(c)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nmx=max(a);c=0\r\nfor x in a:\r\n c+=(mx-x)\r\nprint(c)", "people_count = int(input())\r\npeople = [int(x) for x in input().split()]\r\ni = 0\r\ncosts = 0\r\nmax_wealth = max(people)\r\nwhile i < people_count:\r\n\tcosts += max_wealth - people[i]\r\n\ti += 1\r\nprint(costs)", "n = int(input())\r\na = list(map(int ,input() .split()))\r\ns = [ ]\r\nfor i in range(len(a)):\r\n s += [max(a) - a[i]]\r\nprint(sum(s))", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nm=max(l)\r\neq=0\r\nfor i in l:\r\n eq+=m-i\r\nprint(eq) ", "def format_input():\n s_input = input()\n return list(map(int ,s_input.split()))\n\ndef main():\n n = format_input()[0]\n salaries = format_input()\n salaries.sort()\n total = 0\n for salary in salaries:\n total += salary\n highest_salary = salaries[n-1]\n print(highest_salary*n - total)\n return\n \nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns=0\r\nm=max(a)\r\ni=0\r\nwhile i<n:\r\n s += m - a[i]\r\n i+=1\r\nprint(s)", "# LUOGU_RID: 109743142\nN = int(input())\nnums = [int(x) for x in input().split()]\nans = 0\nm = max(nums)\nfor n in nums:\n ans+=m-n\nprint(ans)", "n=input()\r\ns = input().split()\r\nv = [int(x) for x in s]\r\nmaxv=0\r\nfor x in v:\r\n if (x>maxv):\r\n maxv=x\r\nres=0\r\nfor x in v:\r\n res=res+maxv-x\r\nprint (res)", "n = int(input())\n\nlist = list(map(int, input().split()))\n\nmaxiumum = max(list)\n\n\nsum = 0\nfor i in list :\n sum += maxiumum - i\n\nprint(sum)\n\n\n\n\n \t \t\t \t\t \t\t\t\t\t \t\t\t\t \t\t\t", "\r\nn = int(input())\r\nj = [int(i) for i in input().split(\" \")]\r\n# a, b = [int(i) for i in input().split(\" \")]\r\n\r\n\r\nm = max(j)\r\n\r\nprint(sum([m-i for i in j]))", "input()\r\na=list(map(int,input().split()))\r\nprint(sum(max(a)-i for i in a))", "n = int(input())\r\nl=[int(i) for i in input().split()]\r\ns=0\r\nk=max(l)\r\nfor i in l:\r\n if i<k:\r\n s+=(k-i)\r\n else:\r\n pass\r\nprint(s)", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nm = lst[0]\r\ns = 0\r\nfor i in range(1, len(lst)):\r\n if lst[i] >= m:\r\n m = lst[i]\r\nfor i in range(len(lst)):\r\n s += m - lst[i]\r\n lst[i]+= m - lst[i]\r\n \r\nprint(s)", "ppl_num = int(input(\"\"))\r\ninp = input(\"\")\r\ninp_lst = [int(i) for i in inp.split()]\r\ntarget = (ppl_num-1)*max(inp_lst)\r\ninp_lst.remove(max(inp_lst))\r\nttl = sum(inp_lst)\r\nprint(target-ttl)", "input()\r\nnumbers = list(map(int, input().split()))\r\nmaximum = max(numbers)\r\nsum = 0\r\nfor number in numbers:\r\n sum += (maximum - number)\r\nprint(sum)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=max(l)\r\nx=0\r\nl.remove(d)\r\nfor i in range(len(l)):\r\n x+=d-l[i]\r\nprint(x)\r\n", "b=int(input())\r\nk=list(map(int,input().split()))\r\nn=max(k)\r\no=0\r\nfor i in k:\r\n o+=n-i\r\nprint(o)", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the list of welfare values for each citizen\r\nwelfare_values = list(map(int, input().split()))\r\n\r\n# Find the maximum welfare among the citizens\r\nmax_welfare = max(welfare_values)\r\n\r\n# Calculate the sum of the differences between each citizen's welfare and the maximum welfare\r\ntotal_spending = sum(max_welfare - welfare for welfare in welfare_values)\r\n\r\n# Print the result\r\nprint(total_spending)\r\n", "##t = int(input())\r\n##for i in range(t):\r\n## n,m,k = map(int,input().split())\r\n## x,y = map(int,input().split())\r\n## s = (x + y) % 2\r\n## r = 'YES'\r\n## for j in range (k):\r\n## x,y = map(int,input().split())\r\n## w = (x + y) % 2\r\n## if s == w:\r\n## r = 'NO'\r\n## print(r)\r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nq = max(a)\r\ns = 0\r\nfor i in a:\r\n s += q - i\r\nprint(s)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ndolg = 0\r\nfor i in a:\r\n\tdolg += max(a) - i\r\nprint(dolg)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nval = max(l)\r\nmoney = 0\r\nfor i in l:\r\n money+=(val-i)\r\nprint(money)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = max(b)\r\ns = 0\r\nfor i in b:\r\n s += c - i\r\nprint(s)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nprint(sum([abs( y - max(a)) for y in a]))", "n = int(input())\r\nwlfs = [int(i) for i in input().split()]\r\ns = 0\r\n\r\nwlfs.sort(reverse=True)\r\n\r\nfor i in wlfs:\r\n s += wlfs[0] - i\r\n\r\nprint(s)", "num = int(input())\r\nli = [int(i) for i in input().split()]\r\ncount = 0\r\nmax = max(li)\r\n\r\n\r\n\r\n\r\nfor item in li:\r\n if item < max:\r\n count += max-item\r\n\r\nprint(count)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nm=max(s)\r\nsu=0\r\nfor i in range (0,len(s)):\r\n su=su+m-s[i]\r\n \r\nprint(su)", "nik=int(input())\r\n*n,=map(int,input().split())\r\nprint(nik*max(n)-sum(n))", "c = int(input())\nm = list(map(int, input().split()))\n\nn = max(m)\nt = 0\n\nfor i in m:\n t += n-i\nprint(t)", "def solve():\r\n n = int(input())\r\n t = list(map(int, input().split()))\r\n maxi = max(t)\r\n s = 0\r\n for i in range(n):\r\n s += maxi - t[i]\r\n print(s)\r\n\r\n# n = int(input())\r\n# for i in range(n):\r\nsolve()\r\n# print()", "n = int(input())\r\narr = list( map(int, input().split()) )\r\n\r\nmax_element = max(arr)\r\nmoney_needed = 0\r\n\r\nfor money in arr:\r\n money_needed += (max_element - money)\r\n\r\nprint(money_needed)", "\r\ninput()\r\narr =list(map(int, input().split()))\r\nbob = max(arr)\r\narr = list(map(lambda x: bob-x, arr))\r\nprint(sum(arr))", "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\na = l[-1]\r\ncount = 0\r\nfor i in range(n):\r\n count = count + a - l[i] \r\n\r\nprint(count) ", "n=int(input())\r\nnabor=list(map(int,input().split()))\r\nmax=max(nabor)\r\ncazna=0\r\nfor i in nabor:\r\n razn=max-i\r\n cazna+=razn\r\nprint(cazna)\r\n", "a = int(input())\r\ncounter = 0 \r\nb = str(input()).split()\r\nc = [int(x) for x in b]\r\nd = max(c)\r\n\r\nfor x in c:\r\n while x < d:\r\n x = x + 1\r\n counter = counter + 1\r\nprint(counter)", "n = int(input())\r\na = list(map(int, input().split()))\r\nd, c = max(a), 0\r\nfor i in a:\r\n c += d - i\r\nprint(c)", "people = int(input())\r\n\r\nnumbers = input().split(\" \")\r\nnumbers = [int(i) for i in numbers]\r\n\r\nnumbers.sort()\r\n\r\nmax = numbers[-1]\r\ntotal = 0\r\n\r\nfor i in range(people):\r\n if numbers[i] != max:\r\n total += max - numbers[i]\r\n numbers[i] += max - numbers[i]\r\n\r\nprint(total)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmax_nbr = max(l)\r\ncount = 0\r\nfor i in range(n):\r\n count = count + max_nbr - l[i]\r\nprint(count)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\n\r\n# Find the maximum wealth among the citizens\r\nmax_wealth = max(wealth)\r\n\r\n# Calculate the total money needed to make everyone's wealth equal\r\ntotal_money_needed = sum(max_wealth - w for w in wealth)\r\n\r\nprint(total_money_needed)", "n=int(input())\narr=[int(i) for i in input().split()]\narr.sort()\nsum=0\nfor i in range(0 , n-1) :\n x= arr[len(arr)-1] - arr[i]\n sum+=x\nprint(sum)\n\t\t\t\t\t \t \t\t \t\t \t \t \t \t \t\t\t", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the amounts of money each citizen has\r\ncitizens = list(map(int, input().split()))\r\n\r\n# Find the citizen with the maximum amount of money\r\nmax_money = max(citizens)\r\n\r\n# Initialize a variable to store the total money needed\r\ntotal_money_needed = 0\r\n\r\n# Calculate the total money needed for each citizen to have the maximum amount\r\nfor money in citizens:\r\n total_money_needed += max_money - money\r\n\r\n# Print the result\r\nprint(total_money_needed)\r\n", "# https://codeforces.com/problemset/problem/758/A\r\n\r\ninput()\r\nseq = tuple(map(int, input().split()))\r\nm, s = max(seq), 0\r\nfor i in seq:\r\n s += m - i\r\nprint(s)", "n = int(input())\r\nequities = [int(x) for x in input().split()]\r\nequities.sort(reverse=True)\r\nsum = 0\r\nhigh = 0\r\nfor i in range(len(equities)):\r\n if i == 0:\r\n high = equities[i]\r\n else:\r\n sum += high - equities[i]\r\nprint(sum)", "n=int(input())\r\nli=list(map(int,input().split()))\r\nmx=max(li)\r\nsum=0\r\nfor x in li:\r\n if x<mx:\r\n sum+=mx-x\r\nprint(sum)", "n = int(input())\r\nstr_list = input()\r\nstr_list = str_list.split(\" \")\r\nlista = [int(a) for a in str_list]\r\nmaxi = max(lista)\r\nsuma = 0\r\nfor num in lista:\r\n suma += (maxi-num)\r\nprint(suma)\r\n", "# @name: Holiday Of Equality\r\n# @author: AbrarShakhi\r\n# @link: https://codeforces.com/problemset/problem/758/A\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmax = 0\r\nfor num in arr:\r\n if max < num:\r\n max = num\r\n\r\nsum = 0\r\nfor num in arr:\r\n sum += (max - num)\r\n\r\nprint(sum)", "T = int(input())\r\nA = list(map(int, input().split()))\r\nst = []\r\nm = max(A)\r\nfor i in A:\r\n st.append(abs(m-i))\r\nprint(sum(st))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\ns=0\r\nfor i in a:\r\n if i!=m:\r\n i=m-i\r\n s+=i\r\nprint(s)", "n = int(input())\r\ns = input().split()\r\na = []\r\nfor m in s:\r\n a.append(int(m))\r\n\r\n\r\nc=0\r\nfor rub in a:\r\n if len(a) == 1:\r\n c = 0\r\n else:\r\n ma = max(a)\r\n c += ma - rub\r\n\r\nprint(c)", "n = int(input())\r\nlist1 = list(map(int,input().split()))\r\nmaxi=max(list1)\r\nfor i in range(len(list1)):\r\n list1[i] = maxi-list1[i]\r\nprint(sum(list1))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nc=0\r\nfor i in range(n):\r\n if l[i]<m:\r\n c+=m-l[i]\r\nprint(c)", "chir=int(input())\r\nvan=list(map(int,input().split()))\r\nris=max(van)\r\ns0L=0\r\nfor ch in range(len(van)):\r\n s0L=s0L+ris-van[ch]\r\nprint(s0L)", "# 코드포스 758A Holiday Of Equality\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn = int(put())\r\na = list(map(int, put().split()))\r\nmaximum = max(a)\r\n\r\nprint(sum([maximum - i for i in a]))", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)\r\nc = 0\r\nfor i in range(n):\r\n if a[i] < m:\r\n c += m-a[i]\r\n \r\nprint(c)\r\n\r\n ", "n=int(input())\r\nl=[int(num) for num in input().split(\" \",n-1)]\r\nsum=0\r\nfor i in range(0,len(l)):\r\n sum=sum+max(l)-l[i]\r\nprint(sum)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = max(a)\r\nres = 0\r\nfor elem in a:\r\n res += mx - elem\r\nprint(res)\r\n", "n=int(input())\nlst=list(map(int, input().split()))\nmx=max(lst)\nans=0\nfor i in lst:\n ans+=mx-i\nprint(ans)\n \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\nk,s=max(a),0\r\nfor i in range(n):\r\n s+=k-a[i]\r\nprint(s)", "n = int(input())\r\nwel = list(map(int,input().split()))\r\nmax_wel = max(wel)\r\nT = sum(max_wel - w for w in wel)\r\nprint(T)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(max(l)*len(l)-sum(l))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmaxi=max(a)\r\ni=0\r\nresult=0\r\nwhile i<n:\r\n if a[i]<maxi:\r\n val=maxi-a[i]\r\n a[i]+=val\r\n result+=val\r\n i+=1\r\nprint(result)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nif(n==1):\r\n print(0)\r\nelse:\r\n k=max(l)\r\n for i in l:\r\n s=s+(k-i)\r\n print(s)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = max(b)\r\np = 0\r\nfor i in b:\r\n p+=c-i\r\nprint(p)\r\n", "n = int(input())\na = list(map(int, input().split()))\ns = max(a)\nans = 0\nfor x in a:\n ans += s - x\nprint(ans)", "n = int(input())\r\nif n == 1:\r\n m = input()\r\n print(0)\r\nelse:\r\n answer = 0\r\n welfare = list(map(int, input().split()))\r\n x = max(welfare)\r\n for i in welfare:\r\n answer += x - i\r\n print(answer)\r\n", "input()\r\nc_1 = [int(x) for x in input().split()]\r\nc_1.sort()\r\nh_c = c_1[-1]\r\ntotal_c = 0\r\nfor i in range(len(c_1)-1):\r\n total_c += (h_c-c_1[i])\r\nprint(total_c)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nsum = 0\r\nfor i in range(len(l)-1):\r\n sum += l[-1] - l[i]\r\nprint(sum)", "n = int(input())\ninp = list(map(int, input().split(' ')))\n\nmax_inp = max(inp)\ninp.remove(max_inp)\ndiff_max = map(lambda x: max_inp - x, inp)\nresult = sum(diff_max)\n\nprint(result)\n", "n= int(input())\r\nl=[int(x) for x in input().split()]\r\nma =max(l)\r\ndif=[ma-x for x in l]\r\nprint(sum(dif))", "n = int(input())\r\ncount = 0\r\ns = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n count += max(s) - s[i]\r\nprint(count)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax = max(arr)\r\nsum = 0\r\n\r\nfor num in arr:\r\n sum += max - num\r\n\r\nprint(sum)\r\n", "n = int(input())\r\nelements = list(map(int, input().split()))\r\nmaxn = max(elements)\r\ntemp = 0\r\nfor i in range(n):\r\n temp += maxn - elements[i]\r\nprint(temp)\r\n", "k = int(input())\r\n*h, = map(int,input().split())\r\nprint(k * max(h) - sum(h))", "n = int(input())\r\nlist = list(map(int, input().split()))\r\nans = 0\r\nmax = list[0]\r\nfor i in list:\r\n if i > max:\r\n max = i\r\nfor i in list:\r\n ans += max - i\r\nprint(ans)", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\nhighest = max(welfare)\r\ntotal = 0\r\nfor i in range(n):\r\n total += highest - welfare[i]\r\nprint(total)\r\n", "n = int(input())\n# k = map(int, input().split())\na = list(map(int, input().split()))\nm = max(a)\nans = 0\nfor i in a:\n ans += m - i\nprint(ans)\n# while n != 0:\n\n# n -= 1\n", "s = int(input())\nlst = input().split()\nall = []\nfor i in lst:\n all.append(int(i))\nnum = 0\nall.sort()\nfor i in range(len(all)-1):\n num += all[-1]-all[i]\n\nprint(num)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=max(l)\r\n\r\nc=0\r\nfor i in range(len(l)):\r\n p=s-l[i]\r\n c=c+p\r\n \r\nprint(c)\r\n ", "n=int(input())\r\nwealth=list(map(int,input().split()))\r\nmax_wealth=max(wealth)\r\ntotal_money=0\r\nfor w in wealth:\r\n total_money+=(max_wealth-w)\r\nprint(total_money)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nmx = max(b)\r\nsum = 0\r\nfor i in b:\r\n if i < mx:\r\n s = mx-i\r\n sum+=s\r\nprint(sum)\r\n \r\n", "n=int(input())\r\nn1=input().split(\" \")\r\nl=[]\r\nfor i in n1:\r\n l.append(int(i))\r\nx=max(l)\r\ns=0\r\nfor j in l:\r\n s=s+(x-j)\r\nprint(s)", "c=int(input())\r\na=list(map(int,input().split()))\r\nmax=0\r\nfor i in a:\r\n if max<i:\r\n max=i\r\nsum=0\r\nfor i in a:\r\n sum+=max-i\r\nprint(sum) ", "n=int(input())\r\nlista=input().split()\r\nfor i in range(n):\r\n lista[i]=int(lista[i])\r\nmx=max(lista)\r\nsuma=0\r\nfor i in range(n):\r\n suma+=(mx-lista[i])\r\nprint(suma)", "n = int(input()) # Number of citizens\r\nwelfare = list(map(int, input().split())) # Welfare of each citizen\r\n\r\n# Find the maximum welfare among all citizens\r\nmax_welfare = max(welfare)\r\n\r\n# Calculate the total cost needed to equalize the welfare\r\ntotal_cost = sum(max_welfare - w for w in welfare)\r\n\r\n# Print the total cost\r\nprint(total_cost)\r\n", "p_count = int(input())\r\nwelfare = list(map(int,input().split()))\r\nmaximum = max(welfare)\r\ncount = 0\r\nfor i in welfare : count += maximum - i\r\nprint(count)", "n = int(input()); a = sorted(list(map(int, input().split()))); m = a[n-1]; print(m*(n-1)-sum(a[:n-1]))", "n=int(input())\r\nexpense=0\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nb=l[-1]\r\nfor i in l:\r\n expense+=(b-i)\r\nprint(expense)", "a=int(input())\r\nb=list(map(int,input().split()))\r\n\r\nprint(sum(list(map(lambda x: max(b) - x, b))))", "N = int(input())\r\nA = list(map(int, input().split()))[:N]\r\nm = max(A)\r\nr = 0\r\nfor i in A:\r\n r += m - i\r\nprint(r)\r\n", "p=int(input())\r\n\r\na=list(map(int, input().split()))\r\nb= max(a)\r\ns=0\r\nfor i in range(len(a)):\r\n s=s+(b-a[i])\r\n \r\nprint(s)", "n=int(input())\r\na=[]\r\na=input().split()\r\np=0\r\nk=0\r\nfor i in a:\r\n if(int(i)>k):\r\n k=int(i)\r\nfor i in a:\r\n p=p+k-int(i)\r\nprint(p)\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\nval = max(arr)\r\ncount = 0\r\nfor i in range(n):\r\n count += val - arr[i]\r\nprint(count)", "\nn = int(input())\n\na = list(map(int,\n input().strip().split()))[:n]\n\nmax = max(a)\nsum = 0\n\nfor i in range(0,n):\n\tsum += max - a[i]\n\nprint(sum)\n \t\t \t \t \t \t \t\t \t \t\t \t\t\t\t", "a=int(input())\r\nb=input()\r\nn=0\r\nb=list(map(int,b.split()))\r\ng=max(b)\r\nfor h in b:\r\n n+=g-h\r\nprint(n)\r\n ", "n = int(input())\r\ncitizen = list(map(int,input().split()))\r\n\r\nspend = sum([max(citizen) - citizen[burles] for burles in range(n)])\r\n\r\nprint(spend)", "n=int(input());a=list(map(int,input().split()));a.sort();c=0\r\nfor i in a:c+=a[-1]-i\r\nprint(c)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nmax_val=max(lst)\r\nfor i in range(len(lst)):\r\n lst[i]=(max_val-lst[i])\r\nprint(sum(lst))", "n = int(input())\r\ns = sorted([int(i) for i in input().split()])\r\nmaximum = max(s)\r\nc = 0\r\nfor i in range(n):\r\n c+=maximum - s[i]\r\nprint(c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nm*=n\r\ns=sum(l)\r\nprint(m-s)", "n = int(input())\r\nwealth = list(map(int,input().split(' ')))\r\nif len(set(wealth)) == 1:\r\n print(0)\r\nelse:\r\n expence = 0\r\n c = max(wealth)\r\n for i in wealth:\r\n expence += c-i\r\n print(expence)", "n = int(input())\r\nar = list(map(int,input().split()))\r\nj = max(ar)\r\ns = 0\r\nv = 0\r\nfor i in ar:\r\n v = j-i\r\n s+=v\r\nprint(s)", "import math\r\ndef number():\r\n return(list(map(int,input().split())))\r\ndef strinp():\r\n return(list(input().split()))\r\n\r\n\r\nc=0\r\nsum=0\r\ni=0\r\nnn=number()\r\narr=number()\r\nm=max(arr)\r\nfor x in (arr):\r\n sum+=m-x\r\n\r\nprint(sum)\r\n", "input()\r\npersons = list(map(int,input().split()))\r\nmaxi = max(persons)\r\ncount = 0\r\nfor i in persons:\r\n if i != maxi:\r\n count += maxi - i\r\nprint(count)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nma = max(s)\r\nsums = 0\r\nfor i in s :\r\n sums+=(ma-i)\r\nprint(sums)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)\r\nc=0\r\nfor i in range(len(l)):\r\n c+=a-l[i]\r\nprint(c)", "n = int(input())\r\nlist = [int(x) for x in input().split()]\r\nmx = max(list)\r\nsum = 0\r\nfor x in range(n):\r\n sum += mx - list[x]\r\nprint(sum)", "n = int(input()); l = list(map(int, input().split()))\r\nmax = 0\r\nfor x in l:\r\n if x > max:\r\n max = x\r\nout = 0\r\nfor y in l:\r\n if y < max:\r\n out += max - y\r\nprint(out)", "citizens = int(input())\r\ncitizens_wealth = [int(x) for x in input().split()]\r\n\r\nmax_wealth = max(citizens_wealth)\r\nkingdom_spendings = 0\r\n\r\nfor citizen in citizens_wealth:\r\n kingdom_spendings += max_wealth - citizen\r\n\r\nprint(kingdom_spendings)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=max(l)\r\nc=0\r\nfor i in l:\r\n c+=(r-i)\r\nprint(c)", "a=int(input())\r\n*b,=map(int,input().split())\r\nprint(a*max(b)-sum(b))", "n = int(input())\r\nls = list(map(int,input().split()))\r\nmaxx = max(ls)\r\nres=0\r\nfor i in range(len(ls)):\r\n if(ls[i]<maxx):\r\n res+=maxx-ls[i]\r\nprint(res)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nx = 0\r\nfor i in range(a):\r\n x += b[a-1] - b[i]\r\nprint(x)", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\nc = b[-1]\r\nd = 0\r\n\r\nfor i in b:\r\n d += c - i\r\n\r\nprint(d)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nl.sort()\r\nm=l[n-1]\r\nfor i in range(n):\r\n s=s+abs(m-l[i])\r\nprint(s)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nsm = sum(l)\r\nmx = max(l)\r\nprint(mx*n-sm)", "n = int(input(\"\"))\r\narr = [int(p) for p in input(\"\").split()]\r\nmaks = max(arr)\r\nlmao = (len(arr) * maks) - (sum(arr))\r\nprint(lmao)", "#************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n#بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n#********************************************* Bismillahir Rahmanir Rahim\r\n\r\n#************************************************************************\r\n\r\n # PROBLEM :A. Holiday Of Equality\r\n # SOLUTATOIN....\r\n\r\n#************************************************************************\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nt=sum(a)\r\nm=max(a)\r\ns=(m*n)-t\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_a = max(a)\r\nadd = 0\r\nfor i in a:\r\n add = add+max_a-i\r\nprint(add)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = l.sort()\r\nl.reverse()\r\nm = l[0]\r\nres = 0 \r\nfor i in l:\r\n if m-i >0:\r\n res+= m-i\r\nprint(res) ", "T = int(input())\r\nline = list(map(int, input().strip().split()))\r\nm = max(line)\r\nline = [m-x for x in line]\r\nprint(sum(line))\r\n", "n = int(input())\r\nwelfares = list(map(int, input().split()))\r\nprint(max(welfares) * n - sum(welfares))", "n=int(input())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\ns=0\r\nfor i in range(0,n-1):\r\n s=s+(li[n-1]-li[i])\r\nprint(s)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nn=max(l)\r\nm=[]\r\nsum=0\r\nfor i in range(len(l)):\r\n m.append(n-l[i])\r\nfor j in range(len(m)):\r\n sum+=m[j]\r\nprint(sum)", "a = int(input())\r\nb=input()\r\nlst = [int(i) for i in b.split()]\r\nmx = -1\r\ntong = 0\r\n\r\nfor i in range(a):\r\n mx = max(lst[i], mx)\r\nfor j in range(len(lst)):\r\n tong += mx - lst[j]\r\n\r\nprint(tong)", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\n\r\nprint( sum( list( map(lambda elem : max(welfare) - elem, welfare) ) ) )\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nnums.sort()\r\ntotal = 0\r\nfor i in nums:\r\n total += nums[-1]-i\r\nprint(total)\r\n", "long = int(input())\r\narr = list(map(int,input().split()))\r\nmax = max(arr)\r\nc = 0\r\nfor i in range(len(arr)):\r\n c += max - arr[i]\r\nprint(c)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\na=max(lst)\r\nc=0\r\nfor i in range(n):\r\n b=a-lst[i]\r\n c+=b\r\nprint(c)", "n = int(input())\r\nsostoyanie = input()\r\nsost = [int(x) for x in sostoyanie.split()]\r\nmx = max(sost)\r\nsm = 0\r\nfor i in range(n):\r\n sm += mx - sost[i]\r\nprint(sm)", "n = int(input())\nvalues = list(map(int, input().split()))\nmax_value = max(values)\nexpenses = 0\n\nfor v in values:\n expenses += (max_value - v)\n\nprint(expenses)\n \t \t \t \t \t\t \t \t\t \t\t\t\t", "n=int(input())\r\nx=list(map(int,input().split()))\r\n\r\n#맥시멈값에 맞춰서 돈을 한명씩 다 더 채워주고 그 총량을 구하는 문제\r\n\r\nmaxi=max(x)\r\n\r\ny=[]\r\n\r\nfor i in x:\r\n y.append(maxi-i) #y라는 비어있는 리스트에 맥시멈 값을 채우기 위해서 더줘야하는 돈을 저장\r\n\r\nprint(sum(y))\r\n", "t=int(input())\r\np=list(map(int,input().split()))\r\ncnt=0\r\nl=max(p)\r\nfor i in p:\r\n cnt=cnt+(l-i)\r\nprint(cnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\nk=max(a)\r\nfor i in a:\r\n count+=k-i\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nres=0\r\nfor i in l:\r\n res+=abs(m-i)\r\nprint(res)", "x=int(input())\r\ny=list(map(int,input().split()))\r\nz=sum(y)\r\na=max(y)*len(y)\r\nprint(a-z)", "n = int(input())\r\nlist = input().split()\r\nlist = [int(x) for x in list]\r\nmaxi = max(list)\r\nall = []\r\nfor i in list:\r\n i = maxi - i\r\n all.append(i)\r\nprint(sum(all)) ", "\"\"\"\r\n ⢰⡖⣶⣆⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣰⣶⣶⡆\r\n⠀⠀⠘⠓⠛⡟⢻⣿⣤⣤⠀⠀⣠⣤⣼⣿⣿⣧⣤⣄⠀⠀⣤⣤⣿⣿⣿⠛⠛⠃\r\n⠀⠀⠀⠀⠀⠉⠉⢹⠈⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠉⠉\r\n⠀⠀⠀⣀⣀⡖⢲⣾⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣶⣶⣀⣀\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⠃⠀⠘⢻⣿⣿⣿⣿⣿⣿⡟⠃⠀⠘⣿⣿⣿⣿⣿⣿⡇\r\n⢰⢲⣾⣷⣿⣿⣿⣿⣿⣆⣀⣰⣾⣿⣿⣿⣿⣿⣿⣷⣆⣀⣰⣿⣿⣿⣿⣿⣿⣷⣶⡆\r\n⢸⢸⣿⠛⠛⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⠛⣿⣿⡇\r\n⢸⢸⣿⠀⠀⠉⠉⠹⠿⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠏⠉⠉⠀⠀⣿⣿⡇\r\n⢸⣸⢿⣀⠀⠀⠀⠀⠀⠀⠛⠛⢻⣿⣿⣿⣿⣿⣿⡟⠛⠛⠀⠀⠀⠀⠀⠀⣀⣿⣿⡇\r\n⠀⢸⢀⣿⣦⣤⡄⠀⠀⠀⠀⠀⠀⠀⠘⠛⠛⠃⠀⠀⠀⠀⠀⠀⠀⢠⣤⣴⣿⣿⡇\r\n⠀⠈⠉⠉⠧⠽⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⠿⠿⠉⠉⠁ ⠀⠀\r\n ⣀⣀⣤⣤⣤⡀\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀ ⣶⣿⣿⣿⣿⣿⠇\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⢀⣸⣿⣿⣿⣿⣿⣿⣿\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣶⣾⣿⣿⣿⣿⣿⡿⠟\r\n ⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣀⣾⣿⣿⣿⣿⣿⣿⠋⠁\r\n ⠀⠀⢸⣿⣿⣿⣤⠀⣤⣿⣿⣿⣿⣿⣿⠛\r\n ⠀⠀⠸⢿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠏⠉\r\n ⠀⠀⠀⠸⠿⣿⣿⣿⣿⣿⣿⣏⣤⣀\r\n ⠀⠀⠀⣤⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿\r\n ⢰⣶⣾⣿⣿⣿⡟⠃⠛⠛⢻⡿⠿⠛\r\n ⢸⣿⣿⣿⣿⠏\r\n ⠈⠛⠛⠉⠉\r\n\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\"\"\"\r\na = int(input())\r\nb = list(map(int, input().split()))\r\nb.sort(reverse = True)\r\nc = b.pop(0)\r\nd = 0\r\n\r\nif len(b) == 0:\r\n print(0)\r\nelse:\r\n for j in b:\r\n\r\n if j != c:\r\n e = c - j\r\n d += e\r\n else:\r\n continue\r\n\r\n print(d)", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\nmax_welfare = max(welfare) \r\nmin_charges = sum(max_welfare - w for w in welfare) \r\nprint(min_charges)\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\nz=max(t)\r\ns=[]\r\nfor i in range(len(t)):\r\n s.append(abs(t[i]-z))\r\nprint(sum(s))", "n=int(input())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in a:\r\n res+=(max(a)-i)\r\nprint(res)", "a=input()\r\nb=list(map(int, input().split()))\r\nprint(sum(map(lambda x: max(b)-x, b)))", "n = int(input())\r\nm = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += max(m)-m[i]\r\nprint(cnt)\r\n ", "n = int(input())\r\nk= input().split()\r\nk=[int(i) for i in k]\r\nmax = max(k)\r\ngiven = 0\r\nfor i in range(n):\r\n if k[i]!= max:\r\n add = max-k[i]\r\n k[i]+=add\r\n given+=add\r\nprint(given)\r\n \r\n\r\n \r\n \r\n\r\n\r\n", "n=int(input());l=list(map(int,input().split()));m=max(l);s=0\r\nfor i in l:s+=(m-i)\r\nprint(s)", "input()\r\na=[int(o) for o in input().split()]\r\nprint(max(a)*len(a)-sum(a))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\ns=0\r\nfor i in range(len(a)):\r\n if(a[i]!=m):\r\n s+=(m-a[i])\r\nprint(s)", "t=int(input())\r\ns=list(map(int,input().split()))\r\ny=0\r\nx=max(s)\r\nfor i in range(0,t):\r\n y=y+(x-s[i])\r\nprint(y)", "_ = int(input())\r\nvls = list(map(int, input().split()))\r\ny = max(vls)\r\nr = 0\r\nfor x in vls:\r\n r += y - x\r\n\r\nprint(r)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=l[0]\r\nif n==1:\r\n print(\"0\")\r\nelse:\r\n for i in range(0,len(l)):\r\n if c<l[i]:\r\n c=l[i]\r\n d=0\r\n for i in range(0,n):\r\n d=d+(c-l[i])\r\n print(d)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nl.sort()\r\nmaxx=l[n-1]\r\nc=0\r\nfor i in l:\r\n c+=maxx-i\r\n \r\nprint(c)", "i=int(input())\r\nv1=list(map(int,input().split()))\r\nmax=max(v1)\r\nc=0\r\nfor i in v1:\r\n if i<max:\r\n w=max-i\r\n c+=w\r\nprint(c)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nc=0\r\n\r\nfor i in range(len(a)):\r\n c+=max(a)-a[i]\r\n\r\nprint(c)\r\n", "a = int(input());x = list(map(int, input().split()));x.sort();s = 0\r\nfor i in range(len(x)):\r\n s += (x[-1] - x[i]);x[i] += x[-1] - x[i]\r\nprint(s)\r\n \r\n", "n = int(input())\r\n\r\nmax = 0\r\nsum = 0\r\n\r\na_list = map(int, input().split())\r\nfor a in a_list:\r\n if a > max:\r\n max = a\r\n sum += a\r\n\r\nprint(n*max - sum)", "a = int(input())\r\nb = input().split()\r\nb = [int(x) for x in b]\r\n\r\nif a == 1:\r\n print(0)\r\nelse:\r\n c = max(b)\r\n d = 0\r\n b.remove(c)\r\n for i in b:\r\n d += c - i\r\n print(d)\r\n ", "numberOfcitizens = int(input(\"\"))\r\nwelfares = input(\"\").split(\" \")\r\nwelfares = list(map(int, welfares))\r\nif numberOfcitizens >= 1 and numberOfcitizens <= 100:\r\n numberOfburles = 0\r\n for i in range(numberOfcitizens):\r\n maximumOne = max(welfares)\r\n numberOfburles += (maximumOne - welfares[i])\r\n print(numberOfburles)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)\r\nb=0\r\ni=0\r\nwhile i<n:\r\n if l[i]<a:\r\n b+=(a-l[i])\r\n i+=1\r\nprint(b)\r\n", "n=int(input())\r\nsum = 0\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nmax = arr[n-1]\r\nfor i in range(n-1):\r\n sum += abs (max - arr[i])\r\nprint(sum)", "n = int(input())\r\n\r\nm = list(map(int, input().split()))\r\n\r\nm.sort()\r\n\r\nmax_balance = m[-1]\r\n\r\nneeded = 0\r\n\r\nfor i in range(0, n - 1):\r\n\r\n if m[i] != max_balance:\r\n\r\n needed += max_balance - m[i]\r\n\r\n else: break\r\n\r\nprint(needed)", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\ncount = 0\r\nfor i in range(n-1):\r\n count += (a[n-1]-a[i])\r\nprint(count)", "n=int(input())\r\nstr1 = input()\r\nlst = str1.split()\r\n#print(lst)\r\nlst2=[]\r\nfor i in lst :\r\n i = int(i)\r\n lst2.append(int(i))\r\n#print(lst2)\r\ns=0\r\nm = max(lst2)\r\nfor i in lst2 :\r\n if i!=m :\r\n s = s + m-i\r\nprint(s)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nans=0\r\nmx=max(l)\r\nfor i in range(n):\r\n ans+=mx-l[i]\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint((max(arr)*n)-sum(arr))", "t = int(input())\r\npos = list(map(int,input().split()))\r\npos.sort()\r\nsum = 0\r\nfor i in range (t):\r\n sum = sum + pos[i]\r\nprint(t*pos[t-1]-sum)", "x = int(input())\r\nk=0\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nfor i in range(len(l)-1):\r\n k+=(l[-1]-l[i])\r\nprint(k)\r\n ", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nma=max(lst)\r\ns=0\r\nfor i in lst:\r\n s+=ma-i\r\nprint(s)", "# len(str(n)) == len(set(str(n))) - проверка, явяляются ли все цифры в числе различными\n\n\na = int(input())\nspisok = [int(x) for x in input().split()]\ncounter = 0\nfor i in spisok:\n if i != max(spisok):\n counter += max(spisok) - i\n else:\n pass\nprint(counter)\n\n", "N = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nif N == 1:\r\n print(0)\r\nelse:\r\n maxWelfare = max(lst)\r\n res = 0\r\n for i in lst:\r\n if i != maxWelfare:\r\n res += maxWelfare - i\r\n print(res)", "\"\"\"\r\n=> @auther:Abdallah_Gaber\r\n=> A computer science student\r\n=> AOU University \"Egypt Branch\"\r\n\"\"\"\r\nn=int(input())\r\nlst=[int(x) for x in input().split()]\r\nmx=max(lst)\r\nnum=0\r\nfor item in lst:\r\n if item != mx:\r\n num+=mx-item\r\nprint(num)\r\n \r\n", "n = int(input())\r\narray = [n]\r\narray = list(map(int,input().split()))\r\nx = max(array)\r\nresult = 0\r\nif (len(array)==1):\r\n print('0')\r\nelse:\r\n for i in range(len(array)):\r\n if (array[i]<x):\r\n result += x - array[i]\r\n print(result)", "t=int(input())\r\nlist1=list(map(int,input().split()))\r\nresult=0\r\nlist1.sort()\r\nfor x in range(0,t-1):\r\n result+=list1[-1]-list1[x]\r\nprint(result)", "a = int(input())\r\nq = list(map(int, input().split()))\r\nr = max(q)\r\nc = 0\r\nfor i in q:\r\n c += r - i\r\nprint(c)", "n = int(input())\r\na_i = [int(x) for x in input().split(\" \")]\r\n\r\nm = max(a_i)\r\nx = 0\r\nfor i in a_i:\r\n x += m - i\r\n\r\nprint(x)", "# Holiday Of Equality \ndef main():\n n = int(input())\n a = [int(i) for i in input().split()]\n\n m = max(a)\n print(sum(m - x for x in a))\n\nif __name__ == '__main__':\n main()\n\n\t\t \t \t \t \t\t \t \t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nl.sort()\r\nfor i in range (len(l)):\r\n c=c+(l[len(l)-1]-l[i])\r\nprint(c)\r\n", "n = int(input())\r\na = map(int, input().split()) #для вызова list(a)\r\nlista=list(a)\r\nlist(a).sort()\r\nres=0\r\nfor i in lista:\r\n res+=max(lista)-i\r\nprint(res)", "n=int(input())\r\n*a,=map(int,input().split())\r\nprint(n*max(a)-sum(a))", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nt=max(l)\r\nc=0\r\nfor i in l:\r\n c+=t-i\r\nprint(c)", "a=int(input())\r\nm=list(map(int,input().split()))\r\nc=m[0]\r\nif a==1:\r\n print(\"0\")\r\nelse:\r\n for i in range(0,len(m)):\r\n if c<m[i]:\r\n c=m[i]\r\n d=0\r\n for i in range(0,a):\r\n d=d+(c-m[i])\r\n print(d)", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nmx = max(lst)\r\n\r\nprint(sum([mx - lst[i] for i in range(n)]))", "x = int(input())\r\nd = input()\r\ntot = 0\r\nnum = \"\"\r\narray = []\r\nfor count in range(0, len(d), 1):\r\n if d[count] != \" \":\r\n num = num + d[count]\r\n else:\r\n array.append(int(num))\r\n num = \"\"\r\narray.append(int(num))\r\narray = sorted(array)\r\nmax = array[x - 1]\r\nfor c in range(0, x, 1):\r\n tot = tot + (max - array[c])\r\nprint(tot)", "x=int(input())\r\nlis=list(map(int,input().split()))\r\nlis.sort()\r\ncou=0\r\nm=lis[x-1]\r\nfor i in range(x):\r\n cou=cou+abs(m-lis[i])\r\nprint(cou)", "n = int(input())\nl = list(map(int, input().split()))\n\nprint(sum(list(map(lambda x: max(l)-x, l))))", "n = int(input())\r\nwelfare_values = list(map(int, input().split()))\r\n\r\nmax_welfare = max(welfare_values)\r\n\r\nmin_spent = 0\r\nfor welfare in welfare_values:\r\n diff = max_welfare - welfare\r\n min_spent += diff\r\n\r\nprint(min_spent)\r\n", "\ndef resposta(valor):\n print(valor)\n\nn = int(input())\n\ntotal = 0\nres = 0\nvalores = []\nmaior = 0\n\nline = input()\nvalores = line.split()\n\nfor i in valores:\n i = int(i)\n total += i\n if maior < i:\n maior = i\n \nres = (maior*n) - total\n\nresposta(res)\n\n \t \t\t\t\t \t \t \t\t \t \t", "n=int(input())\r\n\r\nsum=0\r\n\r\nnumList = list(map(int, input().split()))\r\n\r\nmaxval = max(numList)\r\nfor x in range(n):\r\n sum+=maxval-numList[x]\r\nprint(sum)", "k=int(input())\r\nn=list(map(int,input().split()))\r\nmaxa=max(n)\r\nmini=0\r\nfor i in n:\r\n mini+=maxa-i\r\nprint(mini) ", "input()\r\npeople = list(map(int, input().split(' ')))\r\nmax_number_in_list_people = max(people)\r\nanswer = 0\r\nfor i in people:\r\n if i == max_number_in_list_people: answer += 0\r\n else: answer += max_number_in_list_people - i\r\nprint(answer)", "a=int(input())\r\ns=map(int,input().split())\r\nd=list(s)\r\nw=0\r\nfor i in d:\r\n\tr=max(d)\r\n\tf=r-i\r\n\tw=w+f\r\nprint(w)\r\n\t", "def main():\r\n n = int(input())\r\n citizen_money = list(map(int, input().split()))\r\n if n == 1:\r\n print(0)\r\n else:\r\n print((max(citizen_money) * n - sum(citizen_money)))\r\n\r\nmain()", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nmx = max(a)\r\nfor i in range(n):\r\n ans += mx - a[i]\r\nprint(ans)", "n = int(input())\ncitizens = list(map(int,input().split()))\ncount = 0\n\nfor a in citizens:\n count = count + (max(citizens)-a)\n\nprint(count)\n\n", "input()\r\nseq = tuple(map(int, input().split()))\r\nprint(max(seq) * len(seq) - sum(seq))", "# LUOGU_RID: 101648421\nn, *a = map(int, open(0).read().split())\r\nprint(max(a) * n - sum(a))", "m=int(input())\r\na=[int(i) for i in input().split()][:m]\r\nif m==1:\r\n print(\"0\")\r\nelse:\r\n f=0\r\n c=max(a)\r\n for i in a:\r\n if i!=c:\r\n f+=(c-i)\r\n print(f)", "s=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nk=0\r\nfor i in l:\r\n k+=(m-i)\r\nprint(k)\r\n ", "n_ = input()\r\nn = input().split()\r\nfor i in range(len(n)):\r\n n[i] = int(n[i])\r\nmax_ = max(n)\r\ntotal = 0\r\nfor i in n:\r\n if i < max_:\r\n total += max_ - i\r\nprint(total)", "z = int(input())\r\ny = input()\r\nx = y.split()\r\nw = 0\r\nma = 0\r\nfor i in range(len(x)):\r\n x[i] = int(x[i])\r\n ma = max(ma, x[i])\r\nfor j in range(len(x)):\r\n x[j] = int(x[j])\r\n w += ma - x[j]\r\nprint(w)\r\n\t\t\t \t \t \t \t \t\t\t\t\t \t", "n=int(input())\r\nm=input().split()\r\np=[]\r\nq=0\r\nfor i in m:\r\n p.append(int(i))\r\nfor i in p:\r\n q=q+max(p)-i\r\nprint(q)\r\n", "n=int(input())\r\nx=list(map(int,input().split(\" \")))\r\ntmp=max(x)\r\nans=0\r\nfor i in x:\r\n ans+=(tmp-i)\r\nprint(ans)", "n = int(input())\r\nz = [int(x) for x in input().split()]\r\nmaxpayne = max(z)\r\ndf = 0\r\n\r\nfor i in z:\r\n if i != maxpayne:\r\n df += maxpayne - i\r\nprint(df)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nx=max(l)\r\nfor i in l:\r\n sum= sum + x-i\r\nprint(sum)", "#!/usr/bin/python3\r\n\r\n#Leo una cadena y la convierto a entero\r\nn= int(input())\r\n# Leo una cadena con input. La separo por espacios con split\r\n# Con map, aplico a cada elemento la funcion int para\r\n# convertitlo a entero\r\n# En este caso, ademas aplico list para convertirlo en lista\r\nciudadanos = list(map(int, input().split(\" \")))\r\nmaximo=max(ciudadanos)\r\n\r\ngastadoRey=0\r\nfor i in range(len(ciudadanos)):\r\n gastadoRey=gastadoRey+(maximo-ciudadanos[i])\r\n\r\nprint(gastadoRey)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmax=a[0]\r\nfor i in a:\r\n if(i>max):\r\n max=i\r\nsum=0\r\nfor i in a:\r\n sum+=(max-i)\r\nprint(sum)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=a[n-1]\r\nc=0\r\nfor i in range(0,n-1):\r\n if m!=a[i]:\r\n c=c+(m-a[i])\r\nprint(c)", "n=int(input())\r\nwelfare=list(map(int,input().split()))\r\nmax_welfare=max(welfare)\r\nburles=0\r\nfor i in welfare:\r\n if i==max_welfare:\r\n burles+=0\r\n else:\r\n rem_burles=max_welfare-i\r\n burles+=rem_burles\r\nprint(burles)", "n = int(input())\r\na = map(int,input().split(\" \"))\r\na = sorted(a)\r\nb = max(a)\r\noutput = 0\r\nfor i in range(n-1):\r\n output += b-a[i]\r\nprint(output)", "n = int(input())\r\nwealths = list(map(int, input().split()))\r\n\r\nmax_wealth = max(wealths)\r\ntotal_burles = 0\r\n\r\nfor wealth in wealths:\r\n total_burles += max_wealth - wealth\r\n\r\nprint(total_burles)\r\n", "n = int(input())\nn_details = input().split()\n\nmax = 0\nneed_to_spend = 0\n\n\nfor x in n_details:\n if int(x) > max:\n max = int(x)\n\nfor x in n_details:\n if int(x) < max:\n need_to_spend += max - int(x)\n\nprint(need_to_spend)\n\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n length_ = int(input().rstrip())\r\n ct_ = list(map(int, input().rstrip().split()))\r\n money_needed = 0\r\n ct_.sort()\r\n for i in range(length_-1):\r\n money_needed += ct_[-1] - ct_[i]\r\n output(str(money_needed))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=max(b)\r\no=0\r\nfor x in range(a):\r\n if b[x]!=c:\r\n o+=c-b[x]\r\nprint(o)", "input()\r\na = list(map(int, input().split()))\r\nk = max(a)\r\nresult = sum(map(lambda x: k - x, a))\r\nprint(result)", "def equality(burdles, n):\r\n equal_burdle = max(burdles)\r\n count = 0\r\n for i in burdles:\r\n count += (equal_burdle - i)\r\n return count\r\n\r\nn = int(input())\r\nburdles = [int(x) for x in input().split()]\r\nprint(equality(burdles, n))", "import sys\r\nnum = int(sys.stdin.readline().strip())\r\nline = sys.stdin.readline().strip().split()\r\nmp = map(int, line)\r\nmpp = list(mp)\r\nmaxi = max(mpp)\r\ncounter = 0\r\nfor i in mpp:\r\n counter += (maxi - i)\r\nprint(counter)\r\n", "n = int(input())\r\nstring = list(map(int, input().split()))\r\nprint(n * max(string) - sum(string))", "n = int(input())\r\nans = 0\r\na = list(map(int,input().split()))\r\nk = max(a)\r\nfor i in a:\r\n ans+=k-i\r\nprint(ans)", "n=int(input())\r\na=list(map(int, input().split()))\r\nm=max(a)\r\ns=0\r\nfor i in range(len(a)):\r\n p=m-a[i]\r\n s=p+s\r\nprint(s)", "def BurlesEqualizer(n , List):\r\n a = max(List)\r\n spend=0\r\n for i in range (n):\r\n spend += (a - List[i] )\r\n return spend\r\n\r\na = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nprint(BurlesEqualizer(a,b))", "vezes = int(input(\"\"))\r\nif vezes>100 or vezes<1:\r\n exit(1)\r\nlistaValores = list(map(int, input(\"\").split()))\r\nmaior = max(listaValores)\r\nsoma = 0\r\nfor i in range(len(listaValores)):\r\n if maior!=listaValores[i]:\r\n soma = soma + (maior-listaValores[i])\r\nprint(soma)\r\n\r\n\r\n", "t = int(input())\r\nx = list(map(int,input().split()))\r\nc=0\r\nz= max(x)\r\nfor i in x:\r\n y = z-i\r\n c+=y\r\nprint(c)", "x=int(input())\ny = list(map(int,input().split(\" \")))\nz=max(y)\nk=0\nfor i in y:\n k+=z-i\nprint(k)\n \t\t\t \t \t \t\t\t\t\t\t\t \t \t \t\t \t", "n=int(input())\r\nfor i in range(n):\r\n lst=list(map(int,input().strip().split()))\r\n mx=max(lst)\r\n count=0\r\n for j in range(len(lst)):\r\n count=count+abs(mx-lst[j])\r\n print(count)\r\n quit()", "n = int(input())\r\ncs = list(map(int,input().split()))\r\n\r\ncnt = 0\r\nm = max(cs)\r\nfor i in cs:\r\n cnt += (m-i)\r\nprint(cnt)", "#Coder_1_neel\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\ncon=0\r\nfor num in a:\r\n if num<m:\r\n x= m-num\r\n con+=x\r\nprint(con) ", "n = int(input())\r\narr = input().split()\r\nfor i in range(0,len(arr)):\r\n arr[i] = int(arr[i])\r\nspend = 0\r\nfor i in range(0,len(arr)):\r\n spend = max(arr) - arr[i] + spend\r\nprint(spend)", "moves=0\r\n#n:number of citizens\r\nn=int(input())\r\nif(1<=n<=100):\r\n a=list(map(int,input().split()))\r\n maX=max(a)\r\n a.remove(maX)\r\n for i in range(len(a)):\r\n moves+=(maX-a[i])\r\n print(moves)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nk=max(l)\r\nsum=0\r\nfor i in l:\r\n sum=sum+(k-i)\r\nprint(sum)", "def minIncentive(arr):\r\n richest = max(arr)\r\n count = 0\r\n for i in arr:\r\n count += (richest - i)\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n items = int(input())\r\n minIncentive(list(map(int, input().split(\" \"))))\r\n\r\n", "def minimum_charges(n, citizens):\r\n max_welfare = max(citizens)\r\n total_charges = 0\r\n\r\n for welfare in citizens:\r\n total_charges += max_welfare - welfare\r\n\r\n return total_charges\r\n\r\nn = int(input())\r\ncitizens = list(map(int, input().split()))\r\n\r\nprint(minimum_charges(n, citizens))\r\n", "n = int(input())\r\n\r\nx = input()\r\nx = list(map(int, x.split()))\r\n\r\nm = max(x)\r\ncount=0\r\nfor i in x:\r\n count += m-i\r\n\r\nprint(count)", "x = int(input())\r\nmas = list(map(int, input().split()))\r\nc = 0\r\nfor i in mas:\r\n if i != max(mas):\r\n c += max(mas) - i\r\nprint(c)", "t=int(input())\r\nl2=[int(x) for x in input().split()]\r\nl2.sort()\r\nans=0\r\nfor i in range(t-1):\r\n ans=ans+(l2[t-1]-l2[i])\r\nprint(ans)", "_ = input();a=list(map(int, input().split()));m = max(a);print(sum([m-i for i in a]))", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\n\r\nmax_wealth = max(wealth)\r\ntotal_spent = 0\r\n\r\nfor i in range(n):\r\n if wealth[i] != max_wealth:\r\n total_spent += max_wealth - wealth[i]\r\n\r\nprint(total_spent)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\na.sort()\r\nl = a[-1]\r\nfor i in range(n-1):\r\n ans+= l - a[i]\r\nprint(ans)", "#n = int(input())\r\n#a = list(map(int,input().split())\r\n#amax = max(a)\r\n#rem = 0\r\n#for i in a:\r\n# rem += (amax - i)\r\n#print(rem)\r\n\r\n#n=int(input())\r\n#ch=input()\r\n#l=[]\r\n#l=ch.split(' ')\r\n#m=int(max(l))\r\n#k=0\r\n#for i in range(n):\r\n# j=0\r\n# while int(l[i])<m:\r\n# j=j+1\r\n# k=k+j\r\n#print(k)\r\n\r\n\r\n#a=input()\r\n#print(sum(list(map(int, set(input().split())))))\r\n\r\nn = input()\r\nl = input().split()\r\nj = 0 \r\nwhile(j<len(l)):\r\n l[j] = int(str(l[j]))\r\n j = j + 1\r\ni = 0\r\nmax1 = 0\r\nwhile(i<len(l)):\r\n if(max1 < l[i]):\r\n max1 = l[i]\r\n i = i + 1\r\ncharges = 0\r\ni = 0\r\nwhile(i<len(l)):\r\n if(l[i]<max1):\r\n charges += max1 - l[i]\r\n i = i + 1\r\nprint(charges)", "num_of_citizens = int(input())\r\ncitizen_welfare = list(map(int, input().split()))\r\nmin_number_of_burles = 0\r\nmax_welfare = max(citizen_welfare)\r\nif num_of_citizens <= 1:\r\n min_number_of_burles = 0\r\nelse:\r\n for val in citizen_welfare:\r\n if val < max_welfare:\r\n min_number_of_burles += max_welfare - val\r\nprint(min_number_of_burles)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nequal = max(arr)\r\ntotal = 0\r\nfor x in arr:\r\n if x == max:\r\n continue\r\n else:\r\n total = total + (equal-x)\r\nprint(total)", "t = int(input())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nc =max(l)\r\nfor i in range(t):\r\n s += c - l[i]\r\nprint(s)", "a=int(input())\r\nx=list(map(int,input().split()))\r\ncnt=0\r\nx.sort()\r\nfor i in range(len(x)-1):\r\n cnt+=x[-1]-x[i]\r\nprint(cnt)", "n=int(input())\r\nc=0\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nfor j in l:\r\n if j<m:\r\n c=c+(m-j)\r\n \r\nprint(c)", "n = int(input())\r\ncitz = list(map(int, input().split()))\r\nburles = max(citz) * n - sum(citz)\r\n\r\nprint(burles)", "s=int(input())\r\nd=0\r\nw=0\r\na=list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n d=max(d,a[i])\r\nfor i in range(len(a)):\r\n r=d-a[i]\r\n w+=r\r\nprint(w)\r\n", "def main():\n n=int(input())\n arr = list(map(int, input().split(' ')))\n min_burles = 0\n sum = 0\n arr.sort()\n max = arr[n-1]\n for i in range(0,n-1):\n sum += abs(max - arr[i])\n \n print(sum)\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\ndata_list = list(map(int, input().split()))\r\nprint((max(data_list)*n)-sum(data_list))", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nb = max(l)\r\nr = 0\r\nfor i in l:\r\n c = b - i\r\n r += c\r\nprint(r)\r\n \r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nmax1 = max(lst)\r\ncount = 0\r\nfor i in range(len(lst)):\r\n if(lst[i]<max1):\r\n count += (max1 - lst[i])\r\n \r\nprint(count)", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(len(a)):\r\n if a[i] < a[-1]:\r\n ans += a[-1] - a[i]\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nmx = max(l)\r\ncnt = 0\r\n\r\nfor i in l:\r\n cnt+=mx-i\r\n\r\nprint(cnt)", "k=0\r\nint(input());mas=sorted([int(i) for i in input().split()])[::-1]\r\nfor i in range(1,len(mas)):\r\n k+=mas[0] - mas[i]\r\nprint(k)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\ncount=0\r\nb=max(a)\r\nfor i in a:\r\n d=abs(i-b)\r\n count+=d\r\n \r\nprint(count)", "n=int(input())\r\nsp=[int(i) for i in input().split()]\r\nmx,cnt=max(sp),0\r\nfor i in range(len(sp)):\r\n cnt+=(mx-sp[i])\r\nprint(cnt)", "input(); a = list(map(int, input().split()))\r\nmaxA = max(a); answer = 0\r\n\r\nfor i in a: answer += (maxA - i)\r\nprint(answer)", "\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\na=max(c)\r\nprint(sum(([a-x for x in c])))", "n = int(input())\r\nl = input().split() # Split the input into a list of strings\r\nreq = 0\r\nli = [int(i) for i in l] # Convert the list elements to integers\r\nmaximum = max(li)\r\n\r\nfor i in range(n):\r\n if li[i] < maximum:\r\n req += (maximum - li[i])\r\n\r\nprint(req)\r\n", "n=int(input())\r\nsum=0\r\na=list(map(int,input().split(' ')[:n]))\r\nfor i in a:\r\n sum=sum+(max(a)-i)\r\nif(len(a)>1):\r\n print(sum)\r\nelse:\r\n print(0)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nt=0\r\nx=0\r\nfor j in l1:\r\n x=max(l1)\r\n t=t+(x-j)\r\nprint(t)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = max(a)\r\nres = 0\r\nfor i in a:\r\n res += (m - i)\r\nprint(res)", "n=int(input())\r\na=tuple(map(int,input().split()))\r\nb=max(a)\r\nc=0\r\nd=[]\r\nfor i in range(n):\r\n c=b-a[i]\r\n d.append(c)\r\nprint(sum(d))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nc = max(a)\r\ns = 0\r\n\r\nfor i in range(n):\r\n s = s + (c - a[i])\r\n\r\nprint(s)", "L=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nK=max(a)\r\nM=0\r\nfor i in range(L-1):\r\n M=M+(K-a[i])\r\nprint(M)\r\n ", "a=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n c+=i-max(l)\r\nprint(abs(c))", "n = int(input())\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\ni = 0\r\nm = max(a)\r\nc = 0\r\nfor i in range(len(a)):\r\n c = c+ (m-a[i])\r\nprint(c)", "input()\r\nc = list(map(int, input().split()))\r\nprint(len(c) * max(c) - sum(c))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nm = max(lst)\r\ns = 0\r\nfor x in lst:\r\n s += m - x\r\nprint(s)", "def main():\r\n n = int(input())\r\n citizens = [int(i) for i in input().split()]\r\n # Base case: n = 1\r\n if n == 1:\r\n print(0)\r\n return\r\n # Loop and count\r\n count = 0\r\n max_earn = max(citizens)\r\n for c in citizens:\r\n if c != max_earn:\r\n count += max_earn - c\r\n print(count)\r\n \r\n\r\nmain()", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nm = max(l)\r\nsum = 0 \r\nfor i in range(n):\r\n sum = sum + (m - l[i])\r\n\r\nprint(sum)", "n = int(input())\nburles = [int(x) for x in input().split()]\nmaxWelfare = max(burles)\ntotalSpend = 0\nfor each in range(n):\n totalSpend += (maxWelfare - burles[each])\nprint(totalSpend)\n \t \t \t \t \t\t\t\t \t\t \t \t \t \t", "n = int(input())\r\na = [int(a) for a in input().split()]\r\nm = max(a)\r\nadd = 0\r\nfor i in a:\r\n add += (m-i)\r\nprint(add)\r\n", "n = int(input())\r\nli = list(map(int,input().split()))[:n]\r\nh = max(li)\r\nsum = 0\r\nfor i in li:\r\n t = h - i\r\n sum = sum + t\r\nprint(sum)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nflag=0\r\nfor i in l:\r\n flag+=(max(l)-i)\r\nprint(flag)", "n = int(input())\r\nm = list(map(int,input().split()))\r\nk = 0\r\na = max(m)\r\nfor i in m:\r\n k +=abs(i-a)\r\nprint(k)", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nmaxi=max(arr)\r\ns=0\r\nfor i in arr:\r\n s+=(maxi-i)\r\nprint(s)", "n= int(input())\r\na= list(map(int, input().split()))\r\np= max(a)\r\nq= n*p\r\nr= q-sum(a)\r\nprint(r)", "N = int(input())\nmaior = 0\nsoma = 0\nnew = []\nnew = list(map(int, input().split(' ')))\nfor item in new: \n if(item > maior): \n maior = item\nfor item in new: \n soma+=maior-item\n\nprint(soma)\n \t \t \t \t\t \t \t \t \t\t \t", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nr = max(l)\r\nl.remove(r)\r\ns = 0\r\nfor i in l:\r\n s = s + (r-i)\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nmx = max(a)\r\nfor num in a:\r\n ans += mx - num\r\n\r\nprint(ans)", "\r\nn = input()\r\nl = input().split()\r\nj = 0 \r\nwhile(j<len(l)):\r\n l[j] = int(str(l[j]))\r\n j = j + 1\r\ni = 0\r\nmax1 = 0\r\nwhile(i<len(l)):\r\n if(max1 < l[i]):\r\n max1 = l[i]\r\n i = i + 1\r\ncharges = 0\r\ni = 0\r\nwhile(i<len(l)):\r\n if(l[i]<max1):\r\n charges += max1 - l[i]\r\n i = i + 1\r\nprint(charges)", "n = int(input())\r\n\r\nnlist = list(map(int, input().split()))\r\n\r\ntemp = max(nlist)\r\ncount = 0\r\nans = 0\r\nfor i in range(len(nlist)):\r\n\r\n count = temp - nlist[i]\r\n ans += count\r\n\r\nprint(ans)\r\n\r\n ", "n=int(input())\r\na=input().split()\r\na=[int(i) for i in a]\r\nm,s=max(a),0\r\nfor i in range(n):\r\n s+=m-a[i]\r\nprint(s)", "n = int(input())\r\nwelfare = [int(i) for i in input().split()]\r\n\r\nm = max(welfare)\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(welfare)):\r\n total += (m - welfare[i])\r\n\r\nprint(total)", "x=int(input())\r\ny=list(map(int,input().split()))\r\ny1=max(y)\r\ns=0\r\nfor i in y:\r\n s+=y1-i\r\nprint(s)", "n = int(input())\r\n\r\ndata = [int(x) for x in input().split()]\r\nmx = max(data)\r\nprint(sum([mx - x for x in data]))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nmx=max(lst)\r\ncount=0\r\nfor i in lst:\r\n if i<mx:\r\n count+=mx-i\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nz=max(y)\r\na=y.index(z)\r\ny.pop(a)\r\nv=0\r\nfor i in y:\r\n v+=abs(i-z)\r\nprint(v)", "a = int(input())\r\nb = input().split()\r\nc = []\r\nd = 0\r\nfor i in b:\r\n c.append(int(i)) \r\nfor z in range(0,a): \r\n x = max(c)- c[z] \r\n d+=x \r\nprint(d)\r\n", "n=int(input())\r\na=input().split()\r\nlst=[]\r\nfor i in a:\r\n lst.append(int(i))\r\ncount=0\r\nfor j in lst:\r\n count+=int(max(lst))-int(j)\r\nprint(count) ", "n=int(input())\r\nprices=list(map(int,input().split()))\r\nmax_price=prices[0]\r\nfor price in prices:\r\n if price>max_price:\r\n max_price=price\r\nsum=0\r\nfor price in prices:\r\n sum+=(max_price-price)\r\nprint(sum)", "n=int(input())\r\nm=list(map(int, input().split()))\r\na=m[0]\r\nfor i in range (n):\r\n if m[i]>a:\r\n a=m[i]\r\nq=0\r\nfor i in range (n):\r\n if a>m[i]:\r\n q+=a-m[i]\r\nprint(q)\r\n\r\n", "n = int(input())\r\nvalues = list(map(int, input().split()))\r\nmaxV = max(values)\r\nprint(sum(map(lambda x, maxV=maxV: maxV - x, values)))", "citizens = int(input())\nsalaries = list(map(int, input().split()))\n\nmax_salary = max(salaries)\n\nequality = 0\nfor salary in salaries:\n if salary == max_salary: continue\n equality += max_salary - salary\n\nprint(equality)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\n\r\nmax_wealth = max(wealth)\r\ntotal_cost = 0\r\n\r\nfor i in wealth:\r\n total_cost += max_wealth - i\r\n\r\nprint(total_cost)\r\n", "number_of_citizens = int(input())\r\nl = list(map(int,input().split()))\r\nn = max(l)\r\nans = 0\r\nfor i in l:\r\n ans += abs(n-i)\r\nprint(ans)", "n= int(input())\na= list(map(int,input().strip().split()))[:n]\nm = max(a)\nfor i in range(len(a)):\n a[i] = m - a[i]\n S = sum(a)\nprint(S)\n\t\t \t \t\t\t\t \t\t\t\t \t \t \t \t\t", "inp = int(input())\r\ninpu = list(map(int, input().split()))\r\nmx = max(inpu)\r\nfor i in range(inp):\r\n inpu[i] = mx - inpu[i]\r\n\r\nprint(sum(inpu))\r\n", "n=int(input())\r\nmoney=[int(x) for x in input().split()]\r\nif n==1:\r\n print(0)\r\nelse:\r\n maxi=max(money)\r\n total=0\r\n for i in range(n):\r\n total+=(maxi-money[i])\r\n print(total)\r\n", "##a=str(input())\r\n##b=\"\"\r\n##for i in range(len(a)):\r\n## if i%3!=0:\r\n## print(a[i], end=\"\")\r\n\r\n\r\n##n=int(input()) #кол-во соревнований\r\n##list_= [int(value) for value in input().split()] #кол-во баллов во всех соревнованиях\r\n##list2=[list_.pop(0)] #удаляем баллы за первое соревнование и помещаем в новый список\r\n##maxim=0\r\n##minim=0\r\n##for i in list_: #проверяем каждое его соревнование на баллы\r\n## if i>max(list2): #провеяем если он набрал за новое соревнования больше баллов чем в\r\n## maxim+=1 #предыдщуих всех соревнованиях наращиваем удивительное соревнование\r\n## elif i<min(list2): #если он набрал за новое соревнования меньше баллов чем в\r\n## minim+=1#предыдщуих всех соревнованиях наращиваем удивительное соревнование\r\n## list2.append(i)#добавляем баллы за его соревнование во второй список\r\n##print(maxim+minim)#выводим общее кол-во удивительных соревнований\r\n\r\n#минимальное кол-во денег надо потратить, чтобы уровнять всех\r\nn=int(input()) #кол-во граждан\r\na=list(map(int,input().split())) #бюджет каждого отдельного человека\r\nz=max(a) #самый большой капитал человека к которому мы будем уравнивать\r\nq=0 #общее кол-во денег всех граждан\r\nfor i in a:\r\n q+=i\r\nprint(z*n-q)\r\n", "cit=int(input())\r\nwelfare=list(map(int,input().split()))\r\nz=max(welfare)\r\ncount=0\r\nfor i in welfare:\r\n count+=(z-i)\r\nprint(count)", "n = int(input())\r\nx = [int(x) for x in input().split(\" \")]\r\nmaks = max(x)\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += maks - x[i]\r\n\r\nprint(ans)", "n = int(input())\r\nincomes = [int(i) for i in input().split()]\r\nincomes.sort()\r\npeak = incomes[-1]\r\ndel incomes[-1]\r\ncount = 0\r\nfor i in incomes:\r\n count += peak - i\r\nprint(count)", "nin=int(input())\r\n*ll,=map(int,input().split())\r\nprint(nin*max(ll)-sum(ll))", "n=int(input())\r\na=list(map(int, input().split()))\r\nm,s=max(a),0\r\nfor i in a:\r\n s+=(m-i)\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_val = max(a)\r\nres = 0\r\nfor x in a:\r\n res += max_val - x\r\nprint(res)\r\n", "input()\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in a:\r\n s += max(a) -i\r\nprint(s)\r\n", "s, max1 = 0, 0\r\nn = int(input())\r\nfor i in input().split(): \r\n i = int(i)\r\n if i > max1: max1 = i\r\n s += i\r\nprint(max1 * n - s)", "n = int(input())\r\nmyList = list(map(int , input().split()))\r\nans = 0\r\nfor i in range(len(myList)):\r\n ans+=max(myList)-myList[i]\r\nprint(ans)\r\n", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\ns = 0\r\n\r\nfor i in range(n):\r\n if a[i]<max(a):\r\n s=s+max(a)-a[i]\r\n else:\r\n s+=0\r\n\r\nprint(s)", "input()\r\na=list(map(int,input().split()))\r\nm=max(a)\r\nc=0\r\nfor i in a:\r\n c+=(m-i)\r\nprint(c)", "n=int(input(\"\"))\r\nL=list(map(int,input().split(\" \")))\r\nmax1=L[0]\r\ncount=0\r\nfor i in range(n):\r\n if L[i]>max1:\r\n max1=L[i]\r\nfor i in range(n):\r\n count=count+(max1-L[i])\r\nprint(count)", "N = int(input())\r\ninput_num = list(map(int, input().split()))\r\n\r\nmax_num = max(input_num)\r\nN_len = len(str(N))\r\n\r\ncount = 0\r\ncount_1 = 0\r\n\r\nif N_len == '1':\r\n print(input_num)\r\nelse: \r\n for i in range(N):\r\n if input_num[i] == max_num :\r\n count_1 += 0\r\n else:\r\n X = max_num-input_num[i] \r\n count += X\r\n \r\n# print(max_num)\r\n print(count)\r\n# print(N_len)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nk = max(arr)\r\ns = 0\r\nfor i in range(n):\r\n if arr[i] != k:\r\n s += abs(k - arr[i])\r\n\r\nprint(s)\r\n", "n = int(input())\r\nnumbers = [int(number) for number in input().split(\" \")]\r\nmax_number = 0\r\nans = 0\r\nfor number in numbers:\r\n max_number = max(number, max_number)\r\nfor number in numbers:\r\n ans += max_number - number\r\nprint(ans)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nd = lst[-1]\r\nsum1 = 0\r\nfor i in range(len(lst)):\r\n if lst[i] != d:\r\n sum1 = sum1 + (d - lst[i]) \r\n \r\nprint(sum1)", "a=int(input())\r\nd=list(map(int,input().split()))\r\nf=0\r\nfor x in range(a):\r\n f=f+max(d)-d[x]\r\nprint(f)\r\n ", "#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n n = int(input())\n arr = [int(item) for item in input().split()]\n m = max(arr)\n s = 0\n for item in arr:\n s += m - item\n print(s)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\ntotal_wealth = sum(wealth)\r\nmax_wealth = max(wealth)\r\nmin_burles = n * max_wealth - total_wealth\r\nprint(min_burles)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nl.remove(m)\r\nres=0\r\nfor i in l:\r\n d=abs(m-i)\r\n res+=d\r\nprint(res)", "x=int(input())\r\ny=input()\r\ny=y.split(\" \")\r\nf=[]\r\nfor i in y:\r\n f.append(int(i))\r\ns=0\r\nm=max(f)\r\nf.remove(max(f))\r\nfor i in f:\r\n s=s+m-i\r\nprint(s)", "n = int(input())\na = list(map(int,input().split()))\ns = 0\nfor i in a:\n s = s + (max(a) - i)\nprint(s)", "# Input the number of citizens\r\nz = int(input())\r\n\r\n# Input the welfare of each citizen as a list\r\nwelfare = list(map(int, input().split()))\r\n\r\n# Calculate the maximum welfare among all citizens\r\nmax_welfare = max(welfare)\r\n\r\n# Calculate the total amount needed to equalize welfare\r\ntotal_cost = sum(max_welfare - v for v in welfare)\r\n\r\n# Output the minimum number of burles needed\r\nprint(total_cost)\r\n", "n=int(input())\r\nif n==1:\r\n print(0)\r\nelse:\r\n a=[int(i) for i in input().split()]\r\n res=max(a)\r\n ans=0\r\n for i in a:\r\n ans+=res-i\r\n print(ans)", "input()\r\nn = list(map(int,input().split()))\r\nprint(max(n)*len(n)-sum(n))", "n = input()\narr = list(map(int,input().split()))\nans = 0\na = max(arr)\nprint(sum([(a-i) for i in arr]))\n", "num = int(input())\r\nnumber = list(map(int,input().split()))\r\nc = 0\r\nmax_number = max(number)\r\nfor i in number:\r\n if i < max_number:\r\n c += max_number -i\r\nprint(c)\r\n", "t = int(input())\r\ns = list(map(int, input().split()))\r\nm = max(s)\r\nc = 0\r\nfor i in range(t):\r\n c += (m - s[i])\r\nprint(c)", "a = int(input())\r\nq = sorted(list(map(int, input().split())))\r\nprint (a * q[-1] - sum(q))", "# cook your dish here\r\nt = int(input())\r\nl = list(map(int,input().split()))\r\nm = max(l)\r\nfor i in range(0,len(l)):\r\n l[i] = m - l[i]\r\nprint(sum(l))\r\n ", "n = int(input()) \r\nwealth = list(map(int, input().split())) \r\n\r\nmax_wealth = max(wealth)\r\ntotal_expense = 0 \r\n\r\nfor i in range(n):\r\n total_expense += max_wealth - wealth[i] \r\n\r\nprint(total_expense) ", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nhighest = max(a)\r\n\r\ntotal = sum(a)\r\n\r\nminCharge = (n * highest) - total\r\n\r\nprint(minCharge)", "\r\ncantidad = int(input())\r\nx = input()\r\nvector = x.split(\" \")\r\nv = [int(i) for i in vector]\r\nv.sort(reverse=True)\r\nif(len(vector) == 1):\r\n print(\"0\")\r\nelse:\r\n total = 0\r\n \r\n for i in range(0,cantidad):\r\n if(v[i] != int(v[0])):\r\n total += abs(int(v[0]) - int(v[i]))\r\n\r\n print(total)\r\n", "n=int(input())\r\na = list(map(int,input().split()))\r\nb = max(a)\r\ntotal = 0\r\nfor i in a:\r\n total+=b-i\r\nprint(total)", "num = int(input())\nnumbers = list(map(int, input().split()))\nresult = num * max(numbers) - sum(numbers)\nprint(result)\n\n \t\t\t \t \t\t\t\t \t\t\t \t \t\t\t \t", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = max(b)\r\nd = 0;e = 0\r\nfor i in range(a):\r\n if b[i]<=c:\r\n d = c - b[i]\r\n e = e + d\r\nprint(e)", "_ = int(input())\r\n\r\na = sorted(list(map(int,input().split())))\r\nres = 0\r\n\r\nfor i in a[0:-1]:\r\n res += a[-1] - i\r\n\r\nprint(res)", "n=int(input())\nl=[int(z) for z in input().split()]\nhighest=max(l)\nsum=0\nfor i in range(len(l)):\n sum+= highest-l[i]\nprint(sum)", "n=int(input())\r\na=[]\r\na=input().split(maxsplit=n)\r\na=[int(item) for item in a]\r\nk=0\r\nfor i in range (n):\r\n k=k+max(a)-a[i]\r\nprint(k)\r\n\r\n", "n =int(input())\r\na=[]\r\ntx=input()\r\na=tx.split()\r\nmaxim=int(a[0])\r\notv=0\r\nfor i in range (n):\r\n if maxim<int(a[i]):\r\n maxim=int(a[i])\r\nfor i in range (n):\r\n otv=otv+(maxim-int(a[i]))\r\nprint (otv)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nsum, max = sum(l), max(l)\r\nprint(max * n - sum)", "n = int(input());a = list(map(int,input().split()));s = sum(a);print(max(a)*len(a)-s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nli = []\r\n\r\nfor i in range(len(a)):\r\n diff = max(a) - a[i]\r\n li.append(diff)\r\n\r\nprint(sum(li))", "n=int(input())\r\nlis=list(map(int,input().split()))\r\np=max(lis)\r\nc=0\r\nfor i in lis:\r\n c+=p-i\r\nprint(c)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nmax = max(s)\r\nans = 0 \r\nfor i in range(n):\r\n ans += (max - s[i])\r\nprint(ans) ", "input()\r\nlst = list(map(int, input().split()))\r\nmx = max(lst)\r\ncnt = 0\r\nfor _ in lst:\r\n cnt+=mx-_\r\nprint(cnt)\r\n", "n = int(input())\r\np = [int(x) for x in input().split()]\r\nprint(n * max(p) - sum(p))", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nm = max(l)\r\nans=0\r\nfor i in l:\r\n ans += m-i\r\n \r\nprint(ans)\r\n", "n = int(input())\r\na = input().split(' ')\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nmaxi=a[0]\r\nfor i in range(1,n):\r\n if(a[i]>maxi):\r\n maxi=a[i]\r\nans=0\r\nfor i in range(n):\r\n ans+=maxi-a[i]\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(n-1):\r\n c+=(l[n-1]-l[i])\r\nprint(c)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nif len(s) == 1:\r\n print(0)\r\nelse:\r\n answer = 0\r\n for i in s:\r\n answer += max(s) - i\r\n print(answer)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\narr.sort() # Sorting the array in ascending order\n\nspend = 0\nfor i in range(n):\n if arr[i] != arr[n-1]:\n spend += (arr[n-1] - arr[i])\n\nprint(spend)\n\n \t \t\t \t \t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\nc = list(map(int, input().split()))\r\nmax_w = max(c)\r\nmin_b = 0\r\nfor i in c:\r\n min_b += (max_w - i)\r\nprint(min_b)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmx = max(l)\r\ns = 0\r\nfor i in l:\r\n if i == mx:\r\n continue\r\n else:\r\n s += mx - i\r\n \r\nprint(s)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nmx = max(nums)\r\nans = 0\r\nfor num in nums:\r\n ans += mx - num\r\nprint(ans)", "n=int(input())\r\ns=input().split()\r\nd=[]\r\nfor i in range(n):\r\n d.append(int(s[i]))\r\n \r\nc=max(d)\r\nc1=0\r\nfor i in d:\r\n c1+=abs(c-i)\r\n \r\nprint(c1)", "a = int(input())\r\nn = [int(n) for n in input().split()]\r\n\r\nmax_n = max(n)\r\ns = 0\r\nfor i in range(a):\r\n if n[i]<max_n:\r\n s= s+(max_n-n[i])\r\nprint(s)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)\r\na.remove(m)\r\ns = 0\r\nfor i in range(len(a)):\r\n s += m-a[i]\r\nprint(s)", "n=int(input())\r\nlist1=list(map(int,input().split(' ')))\r\nmax1=max(list1)\r\ncount=0\r\nfor i in list1:\r\n if(i<max1):\r\n count=count+(max1-i)\r\nprint(count)\r\n", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\nimport math\r\nimport re\r\nimport random\r\ndef solve():\r\n #for i in range(int(input())):\r\n for i in range(1):\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n maxi = max(a)\r\n spend = 0\r\n for x in a:\r\n spend+=(maxi-x)\r\n print(spend)\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n=int(input())\r\narr=list(map(int,input().split()))\r\nif n==1:\r\n print(0)\r\nelse:\r\n sumof=0\r\n arr.sort()\r\n max=arr[n-1]\r\n for i in range(n-1):\r\n sumof+=max-arr[i]\r\n print(sumof)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = max(a)\r\nans = 0\r\nfor i in a:\r\n if i < x:\r\n ans += x - i\r\n\r\nprint(ans)", "n = int(input())\r\ncitizens_welfare = list(map(int, input().split()))\r\n\r\nmax_welfare = max(citizens_welfare)\r\n\r\n# Calculate the minimum charges required\r\nmin_charges = sum(max_welfare - wealth for wealth in citizens_welfare)\r\n\r\nprint(min_charges)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nlargest = max(a)\r\ncount = 0\r\nfor x in a:\r\n count += largest - x\r\nprint(count)", "a = int(input())\r\nlist_of_citizens = input().split()\r\nlist_of_citizens = list(map(int, list_of_citizens))\r\nmax_rub = max(list_of_citizens)\r\ni = 0\r\ns = 0\r\nwhile (i < a):\r\n if (list_of_citizens[i] < max_rub):\r\n s = s + (max_rub-list_of_citizens[i])\r\n i+=1 \r\nprint(s)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)\r\nS = []\r\nfor i in range(len(a)):\r\n s = m - a[i]\r\n S.append(s)\r\nprint(sum(S))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nmaxi = max(a)\r\nfor i in range(n):\r\n ans += maxi - a[i]\r\nprint(ans)", "n = int(input())\r\nwelfare = [int(x) for x in input().split()]\r\n\r\nmax_welfare = max(welfare)\r\nmin_treasure = 0\r\n\r\nfor a in welfare:\r\n min_treasure += (max_welfare - a)\r\n\r\nprint(min_treasure)\r\n", "n = int(input())\r\nsList = list(map(int,input().split()))\r\na = max(sList)\r\ncount = 0\r\nfor i in range(len(sList)):\r\n if sList[i] < a:\r\n count += (a-sList[i])\r\nprint(count)\r\n \r\n", "n = int(input())\nb = 0\ncit = list(map(int, input().split()))\nm = max(cit)\nfor i in cit:\n b += (m-i)\n\nprint(b)\n\t\t \t \t\t\t \t", "from math import ceil\r\n\r\ndef lstStrRd():\r\n return list(input())\r\ndef intRd():\r\n return int(input())\r\n\r\n\r\ndef lstRd():\r\n return list(map(int, input().split()))\r\n\r\n\r\nfor _ in range(1):\r\n n = intRd()\r\n\r\n\r\n a = lstRd()\r\n\r\n res = 0\r\n for i in range(n):\r\n res += abs(a[i] - max(a))\r\n print(res)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nhighest = max(a)\r\nspending = 0\r\n\r\nfor i in range(n):\r\n spending += highest - a[i]\r\nprint(spending)", "n = int(input())\r\nwealths = list(map(int, input().split()))\r\n\r\n# Find the maximum wealth\r\nmax_wealth = max(wealths)\r\n\r\n# Calculate the total cost needed to equalize the wealth\r\ntotal_cost = sum(max_wealth - wealth for wealth in wealths)\r\n\r\nprint(total_cost)\r\n", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nc = 0 \r\nfor i in arr : \r\n if i < max(arr) : c+= max(arr) - i \r\nprint(c)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans=0\r\nhighest =max(a)\r\nfor x in a:\r\n\tans+=(highest-x)\r\n\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nx = (input())\r\nout=0\r\nl=[int(x) for x in x.split(\" \")]\r\nfor i in range (0,len(l)):\r\n out= out + (max(l)-l[i])\r\n \r\nprint(out)\r\n \r\n ", "n = int(input())\r\nwelfares = list(map(int,input().split()))\r\nmax_welfare = max(welfares)\r\nmoney = 0\r\nfor i in welfares:\r\n money += max_welfare - i\r\nprint(money)", "n = int(input())\r\n\r\nwelf = list(map(int, input().split()))\r\n\r\nequ = max(welf)\r\ns = sum(equ - w for w in welf)\r\n\r\nprint(s)\r\n", "n = int(input())\r\nwealthy = [int(i) for i in input().split()]\r\nmax_wealth = max(wealthy)\r\ntotal = 0\r\n\r\nfor i in wealthy:\r\n total += max_wealth - i\r\nprint(total)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n if i!=max(a):\r\n c=c+(max(a)-i)\r\nprint(c)\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmx = max(a)\r\nres = 0\r\nfor x in a: res+=mx-x\r\nprint(res)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\ns=sum(l1)\r\nm=max(l1)\r\nm=m*n\r\nprint(m-s)", "n=int(input())\nl=list(map(int,input().split()))\na=max(l)\nd=0\nfor i in l:\n d+=(a-i)\nprint(d)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\no=0\r\nfor i in l:\r\n o+=m-i\r\nprint(o)", "n=input()\r\nl=[int(i) for i in input().split()]\r\nd=max(l)\r\nans=0\r\nfor i in l:\r\n ans+=d-i\r\nprint(ans)", "n = int(input())\r\nl = [ int(x) for x in input().split()] \r\nm = max(l)\r\ns = 0 \r\nfor ele in l:\r\n s += m-ele \r\nprint(s)", "n=int(input())\r\nz=[int(i) for i in input().split()]\r\nz=sorted(z)\r\nma=z[-1]\r\ntotal=0\r\nfor i in range(len(z)):\r\n total=total+(ma-z[i])\r\nprint(total)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmx = max(a)\r\nsum = 0\r\nfor i in range(n):\r\n sum += mx - a[i]\r\nprint(sum)", "n = int(input())\r\nif n == 1:\r\n a = int(input())\r\n print(a-a)\r\nelse:\r\n list1 = list(map(int,input().split()))\r\n max1 = max(list1)\r\n count = 0\r\n for j in list1:\r\n if j != max1:\r\n count+=(max1-j)\r\n print(count)", "t=int(input())\r\ns=input().split()\r\nl=[int]*t\r\nfor i in range(len(l)):\r\n l[i]=int(s[i])\r\nm=max(l)\r\nans=0\r\nfor i in range(len(l)):\r\n ans+=(m-l[i])\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nmax=arr[n-1]\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+(max-arr[i])\r\nprint(sum)\r\n \r\n", "from collections import Counter\r\n\r\n\r\nlength = int(input())\r\ndata = Counter(map(int, input().split()))\r\nm = max(data)\r\nprint(sum((m - i) * data[i] for i in data))", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nm = max(a)\r\nfor elem in a:\r\n ans += m - elem\r\nprint(ans)", "n = int(input().strip())\r\na = list(map(int, input().split()))\r\nresult = 0\r\na.sort()\r\nfor i in range(n):\r\n result += a[n-1] - a[i]\r\nprint(result)", "# BOOGEYMAN >>> Version 11.0\nimport os, sys, math, itertools, bisect\nfrom string import ascii_lowercase, ascii_uppercase\nfrom collections import deque, defaultdict, OrderedDict, Counter\nii,si = lambda : int(input()), lambda : input() \nmi, msi = lambda : map(int,input().strip().split(\" \")), lambda : map(str,input().strip().split(\" \")) \nli, lsi = lambda : list(mi()), lambda : list(msi())\n\ndef BoogeyMan() -> None:\n '''\n Query\n '''\n length = ii()\n l = li()\n l.sort()\n if len(l)==1: print(f\"{0}\",end=\"\\n\") \n else:\n counter = 0\n m = l[-1]\n l.pop()\n for i in l:\n counter+=m-i\n print(f\"{counter}\",end=\"\\n\")\n \n \n \nif __name__ == \"__main__\":\n try:\n from baba_yaga import cmdIO, _generator_\n def _BoogeyMan_() -> None : yield cmdIO(); yield BoogeyMan(); yield _generator_()\n master = _BoogeyMan_()\n try:\n while True: assert not next(master)\n except StopIteration: pass\n except (FileNotFoundError,ModuleNotFoundError): BoogeyMan()\n \t\t \t \t \t\t\t\t \t\t \t \t\t\t \t\t", "n = int(input())\r\n\r\nlist = [int(num) for num in input().split()]\r\n\r\nmaxx = max(list)\r\nresult = []\r\n\r\nfor peop in list:\r\n count = 0\r\n if peop < maxx:\r\n count = maxx - peop\r\n result.append(count)\r\n else:\r\n continue\r\nprint(sum(result))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in l:\r\n t.append(max(l)-i) \r\nprint(sum(t))", "x = int(input())\r\ny = list(map(int, input().split()))\r\nz = max(y)\r\nw = 0\r\nfor i in range(x):\r\n w += abs(y[i] - z)\r\nprint(w)", "_ = input()\r\nsun=list(map(int,input().split()))\r\nm = max(sun)\r\ns = 0\r\nfor i in sun:\r\n s += m-i\r\nprint(s)", "x=int(input())\r\ny=list(map(int,input().split()))\r\nm=max(y)\r\ns=0\r\nfor i in y:\r\n s=s+(m-i)\r\nprint(s)", "n = int(input())\r\nallWelfare = list(map(int, input().split()))\r\n\r\ncountMoney = 0\r\nmaxWelfare = max(allWelfare)\r\nfor welfare in allWelfare:\r\n countMoney += maxWelfare - welfare\r\nprint(countMoney)", "##\nn = int(input())\ncitz = list(map(int, input().split()))\nburles = max(citz) * n - sum(citz)\n\nprint(burles)\n\t\t\t\t \t\t \t\t \t\t \t\t \t\t\t\t", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nm = max(l)\r\ncount = 0\r\nfor i in l:\r\n count += m-i\r\nprint(count)", "total_citizens = int(input())\r\n\r\nlist = []\r\ncount = 0\r\n\r\nlist += map(int, input().split())\r\n\r\nmax_ele = max(list)\r\n\r\nfor item in list:\r\n if item != max_ele:\r\n count += (max_ele - item)\r\n \r\nprint(count)", "n = int(input())\r\np = list(map(int, input().split()))\r\nmax1 = max(p)\r\nr = 0\r\nfor i in p:\r\n if i < max1:\r\n r += max1 - i\r\nprint(r)", "n = input()\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in a:\r\n ans += max(a) - i\r\nprint(abs(ans))", "n = int(input())\r\nans = 0\r\n\r\na = list(map(int, input().split()))[:n]\r\n\r\nm = max(a)\r\n\r\nfor i in a:\r\n b = m - i\r\n ans = ans + b\r\nprint(ans)", "a = int(input())\r\ns = list(map(int, input().split()))\r\nt = 0\r\nfor i in range(a):\r\n k = max(s)-s[i]\r\n t+=k\r\nprint(t)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=max(arr)\r\nd=0\r\nsum=0\r\nfor item in arr:\r\n d=m-item\r\n sum+=d\r\nprint(sum)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = max(l)\r\nexpense = 0\r\nfor i in l:\r\n expense += m-i\r\nprint(expense)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nm = max(lst)\r\ns = sum([m-i for i in lst])\r\nprint(s)", "def main(arr):\r\n n, s = max(arr), 0\r\n\r\n for i in range(len(arr)):\r\n s += n - arr[i]\r\n\r\n return s\r\n\r\nif __name__ == \"__main__\":\r\n _ = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n print(main(arr))", "a=int(input())\r\nb=list(map(int,input().split()))\r\ncnt=0\r\nfor i in b:\r\n cnt+=max(b)-i\r\nprint(cnt)", "n = int(input())\r\n\r\nnums = [int(i) for i in input().split()]\r\n\r\nsum = 0\r\nmax_num = nums[0]\r\n\r\nfor num in nums:\r\n sum += num\r\n if num > max_num: max_num = num\r\n\r\nprint((max_num*n)-sum)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmaxi = s[0]\r\ncount = 0\r\nfor i in s:\r\n if i > maxi:\r\n maxi = i\r\nfor i in s:\r\n count += maxi - i\r\nprint(count)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ntot=0\r\nfor x in l:\r\n tot+=max(l)-x\r\nprint(tot)", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\ncnt = []\r\nmax_val = max(l1)\r\n\r\nfor i in range(len(l1)):\r\n if l1[i] <= max(l1):\r\n a = max(l1)-l1[i]\r\n cnt.append(a)\r\ntotal = 0\r\nfor item in cnt:\r\n total += item\r\n\r\nprint(total)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmaxa=max(a)\r\nmini=0\r\nfor i in a:\r\n mini+=maxa-i\r\nprint(mini) ", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\n\r\nmax_welfare = max(welfare)\r\nmin_expenses = sum(max_welfare - ai for ai in welfare)\r\n\r\nprint(min_expenses)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nprint(max(lst) * n - sum(lst))\r\n", "a = int(input())\r\nmoney = [int(i) for i in (input().split())]\r\nmax_money = max(money)\r\nbank = 0\r\nfor i in range(a):\r\n if money[i] < max_money:\r\n z = max_money - money[i]\r\n bank += z\r\n\r\nprint(bank)", "def calculate(maximum, Money):\r\n return maximum - Money\r\n\r\n\r\nnumberOfPeople = int(input())\r\nmaxMoney = 0\r\nmoneyOfPeople = []\r\nmoney = input()\r\nfor i in money.split():\r\n moneyOfPeople.append(int(i))\r\nfor i in range(0, len(moneyOfPeople)):\r\n if moneyOfPeople[i] >= maxMoney:\r\n maxMoney = moneyOfPeople[i]\r\nsumMoney = 0\r\nfor i in range(0, len(moneyOfPeople)):\r\n sumMoney += calculate(maxMoney, moneyOfPeople[i])\r\nprint(sumMoney)\r\n", "k = int(input())\r\ninput_str = input()\r\nnumbers = list(map(int, input_str.split()))\r\nn = sorted(numbers)\r\ns = 0\r\nfor i in range(k):\r\n s = s + (n[k-1] - n[i])\r\nprint(s)\r\n", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nl1.sort()\r\nk=l1[-1]\r\nl1.remove(k)\r\nsum=0\r\nfor j in l1:\r\n sum=sum+k-j\r\nprint(sum)", "n=int(input()) \r\nl=list(map(int,input().split())) \r\nm=max(l) \r\no=0 \r\nfor i in l: \r\n o+=m-i \r\nprint(o)", "a = int(input())\r\nl1 = list(map(int, input().split()))\r\n#n, a, b, c = map(int, input().split())\r\nsayac = 0\r\nfor i in l1:\r\n sayac = sayac + max(l1) -i\r\nprint(sayac)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans = ans + l[-1]-l[i]\r\nprint(ans)", "k=int(input())\r\na=[int(i) for i in input().split()]\r\nc=max(a)\r\ncount=0\r\nd=0\r\nfor i in range(k):\r\n d=c-a[i]\r\n if(c!=a[i]):\r\n a[i]=a[i]+d\r\n count+=d\r\n else:\r\n count+=0\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\ncount=0\r\na=max(l)\r\nfor i in l:\r\n count+=a-i\r\nprint(count)", "t = int(input())\r\nc = list(map(int, input().split()))\r\nm = max(c)\r\nsum = 0\r\nfor i in range(t):\r\n sum+=(m-c[i])\r\nprint(sum)", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = n * max(a) - sum(a)\r\nprint(result)\r\n", "n=int(input())\nlst=list(map(int,input().split()))\nmx=max(lst)\ntotal=0\nfor num in lst:\n if num!=mx:\n total+=mx-num\nprint(total)", "n = int(input()) \r\na = list(map(int, input().split())) \r\nb = max(a) \r\ns = sum(b - i for i in a) \r\nprint(s)\r\n", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nm=max(s)\r\nsum=0\r\nfor i in range(0,n):\r\n sum+=(m-s[i])\r\nprint(sum)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nk=max(l)\r\nc=0\r\nfor i in l:\r\n c+=(k-i)\r\nprint(c)", "n = int(input())\r\ndata = input().split()\r\na = [int(x) for x in data]\r\nmaxi = max(a)\r\nans = 0\r\nfor i in range(0, n):\r\n ans += maxi - a[i]\r\nprint(ans)", "n=int(input())\r\nlst=list(map(int,input().split()))[:n]\r\nm=max(lst)\r\ns=0\r\nfor i in lst:\r\n s+=m-i\r\nprint(s)", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\ntotal_welfare = sum(welfare)\r\nmax_welfare = max(welfare)\r\nmin_charges = max_welfare * n - total_welfare\r\nprint(min_charges)\r\n", "n = int(input())\r\nli =list(map(int, input().split()))\r\nb = 0\r\nm = max(li)\r\nfor i in li:\r\n b += m - i\r\nprint(b)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=a[n-1]\r\nsum=0\r\nfor i in range(n-1):\r\n sum=sum+abs(m-a[i])\r\nprint(sum)", "n = int(input())\na = list(i for i in input().split())\nburles = 0\nfor i in range(n):\n a[i]=int(a[i])\n \nmaximum = max(a)\n\nfor i in a:\n burles = burles + (maximum-i)\n \nprint(burles)\n\t \t\t \t\t \t\t \t \t \t\t \t \t", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the welfare of each citizen\r\nwelfare = list(map(int, input().split()))\r\n\r\n# Find the maximum welfare\r\nmax_welfare = max(welfare)\r\n\r\n# Calculate the minimum number of burles required\r\ntotal_burles = sum(max_welfare - w for w in welfare)\r\n\r\n# Print the result\r\nprint(total_burles)", "# URL: https://codeforces.com/problemset/problem/758/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\n_ = inp()\na = list(map(int, inp().split()))\nm = max(a)\nans = 0\nfor x in a:\n ans += m - x\nout(f\"{ans}\")\n", "def Holiday_Equlality(citizens):\r\n pay = 0 \r\n maxi = max(citizens)\r\n for i in range(len(citizens)):\r\n if citizens[i] < maxi:\r\n pay += (maxi - citizens[i])\r\n return pay\r\nn = int(input())\r\ncitizens = list(map(int, input().split()))\r\nprint(Holiday_Equlality(citizens))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=max(l)\r\nc=0\r\nfor i in l:\r\n if i<t:\r\n c+=(t-i)\r\nprint(c)\r\n", "input()\r\nb = [int(x) for x in input().split()]\r\nm = max(b)\r\nprint(sum(m - x for x in b))\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nmon=[]\r\nfor i in lst:\r\n mon.append(max(lst)-i)\r\nprint(sum(mon))", "n = int(input())\r\nwealths = list(map(int, input().split()))\r\n\r\nmax_wealth = max(wealths)\r\nmin_spending = 0\r\nfor wealth in wealths:\r\n min_spending += max_wealth - wealth\r\n\r\nprint(min_spending)\r\n", "ln = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nmx = max(arr)\r\n\r\nspend = 0\r\n\r\nfor i in arr:\r\n spend += mx-i\r\n\r\nprint(spend)", "input()\r\na = list(map(int, input().split()))\r\nmx = max(a)\r\n\r\ns = 0\r\nfor t in set(a):\r\n s += (mx-t)*a.count(t)\r\n\r\nprint(s)", "x = (int(input()))\r\n\r\ny = (list(map(int,input().split())))\r\n\r\nif x == 1:\r\n \r\n print(0)\r\n \r\nelse:\r\n \r\n j = max(y)\r\n \r\n k = []\r\n \r\n for i in range(len(y)):\r\n \r\n k.append(j-y[i])\r\n\r\n print(sum(k))\r\n\r\n \r\n", "n = int(input())\r\nm = list(map(int , input().split()))\r\nans = 0\r\n\r\nfor i in m:\r\n ans += max(m)-i\r\n\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l) \r\ncount=0\r\nfor i in range(len(l)):\r\n if(l[i]!=m):\r\n count+=m-l[i] \r\nprint(count)\r\n ", "def solve(l, n):\r\n if(n == 1):\r\n return 0\r\n sum_l = sum(l)\r\n max_val = max(l)\r\n return max_val*n - sum_l\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nprint(solve(l, n))", "t=int(input())\r\na=list(map(int,input().split(\" \")))\r\nmaxi=max(a)\r\ncount=0\r\nfor i in a:\r\n count+=(maxi-i)\r\nprint(count)", "n=int(input())\nl=list(input().split())\nfor i in range(n):\n\tl[i]=int(l[i])\nx=max(l)\ns=0\nfor i in l:\n\ts+=(x-i)\nprint(s)", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nans = 0\r\nfor i in a:\r\n ans+= a[-1]-i\r\nprint(ans)", "n=int(input())\r\nnavid=list(map(int,input().split()))\r\nprint((n*max(navid))-sum(navid))\r\n\r\n\r\n", "p= int(input())\r\nq= list(map(int, input().split()))\r\nmax_1 = max(q)\r\nres = sum(max_1 - w for w in q)\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\ns=0\r\nfor i in range(n):\r\n s+=(m-l[i])\r\nprint(s)", "n = int(input())\r\np = list(map(int,input().split()))\r\no = max(p)\r\nc=0\r\nfor i in p:\r\n c = c + abs(i-o)\r\n\r\nprint(c)\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nl =sorted(nums)\r\ns=0\r\nfor i in range(0,len(l)):\r\n x=l[-1]-l[i]\r\n s=s+x\r\n\r\nprint(s)", "n = int(input())\r\nb = 0\r\na = list(map(int,input().split()))[:n]\r\nfor i in range(len(a)):\r\n if max (a)> a[i]:\r\n b += max(a)- a[i]\r\n elif max(a)== a[i]:\r\n b = b\r\nprint(b)\r\n", "n = int(input())\r\n\r\nciv = list(map(int, input().split()))\r\nciv = sorted(civ)\r\nmaxi = max(civ)\r\nsum = 0\r\nfor i in civ:\r\n sum += maxi - i\r\nprint(sum)", "num1 = int(input())\r\nstr1 = input().split()\r\nstr1 = [int(a) for a in str1]\r\ncounter = 0\r\nstr1.sort(reverse = True)\r\nfor x in range(1,len(str1)) :\r\n mod = str1[0] - str1[x]\r\n counter+=mod\r\nprint(counter)", "n = int(input())\r\nnum = [int(x) for x in input().split()]\r\nl = sorted(num)[-1]\r\nt = 0\r\nfor n in num:\r\n t += l - n\r\nprint(t)", "# A. Holiday Of Equality\r\nn = int(input())\r\nlista = [int(x) for x in input().split(' ')]\r\nmaximo = max(lista)\r\nsoma = 0\r\nif n == 1:\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n soma += maximo - lista[i] \r\n print(soma)", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nx = sorted(x)\r\nsum = 0\r\n\r\nfor i in range(n):\r\n sum += int(x[-1]) - int(x[i])\r\n i += 1\r\n\r\nprint(sum)", "m=int( input())\r\n*n,=map(int,input().split() )\r\nprint(m*max(n)-sum(n))", "n = int(input())\r\nlst = list(map(int, input().split(\" \")))\r\nmx = max(lst)\r\nsm = sum(lst)\r\ntotal = n*mx\r\nneed = total-sm\r\nprint(need)\r\n", "'''\r\n#list(map(int,input().split()))'''\r\n# before you win, you have to fail\r\ninput();i=list(map(int,input().split()))\r\nprint(sum([max(i)-x for x in i]))\r\n \r\n", "T = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nb = max(a)\r\nk = 0\r\nfor i in a:\r\n if i < b:\r\n k += b - i\r\nprint(k)", "n = int(input())\r\ntrash = list(map(int,input().split()))\r\ncount=0\r\nmax_element = max(trash)\r\nfor i in range(n):\r\n if trash[i]<max_element:\r\n count+= max_element - trash[i]\r\nprint(count)", "a=int(input())\nb=input()\nc=b.split()\nd=0\nmaxi=0\nfor i in range(len(c)):\n c[i]=int(c[i])\n maxi=max(maxi,c[i])\nfor n in range(len(c)):\n c[n]=int(c[n])\n d+=maxi-c[n]\nprint(d)\n\t\t\t \t \t \t \t \t\t\t\t\t \t", "n = int(input())\r\ncount = 0\r\n\r\nmoney = [int(i) for i in input().split()]\r\n\r\nfor i in range(len(money)):\r\n count += max(money) - money[i]\r\n\r\nprint(count)\r\n", "input()\r\nmyList = list(map(int, input().split()))\r\nhigh = max(myList)\r\ntotal = 0\r\nfor i in myList:\r\n total += high - i\r\nprint(total)", "a = int(input())\r\ng = 0\r\nk = 0\r\nn = list(map(int, input().split()))\r\nfor i in range(a):\r\n if n[i] < max(n):\r\n k = max(n) - n[i]\r\n g += k\r\n if n[i] >= max(n):\r\n g += 0\r\n\r\n\r\n\r\n\r\n\r\nprint(g)", "t=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=max(a)\r\nc=0\r\nfor i in range(t-1):\r\n c=c+(b-a[i])\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n", "Number=int(input())\r\nlistNum=list(map(int,input().split()))\r\nrestlist=sorted(listNum)\r\nmaxlist=max(restlist)\r\nnewlistNum=[]\r\nfor i in range(Number):\r\n if((i+1)==Number):\r\n break\r\n else:\r\n restNum=maxlist - restlist[i]\r\n newlistNum.append(restNum)\r\nprint(sum(newlistNum))\r\n", "_ = input()\r\nwealth = [int(x) for x in input().split()]\r\n\r\nwealth_max = max(wealth)\r\nprint(sum(wealth_max - x for x in wealth))", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nsm=0\r\nmx=max(a)\r\nfor i in a:\r\n sm+=(mx-i)\r\nprint(sm)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nM=max(arr)\r\nb=0\r\nfor i in arr:\r\n if(i<M):\r\n b=b+(M-i)\r\nprint(b)", "n = int(input())\r\nS = list(map(int, input().split()))\r\ni = max(S)\r\ncount = 0\r\nfor j in range(n):\r\n count+=i-S[j]\r\nprint(count)", "t = int(input())\r\nl = list(map(int,input().split()))\r\na = max(l)\r\ns = 0\r\nfor i in l:\r\n s += a-i\r\nprint(s)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nsum=0\r\nfor i in l:\r\n sum=sum-i+m\r\nprint(sum)", "a,b=int(input()),list(map(int,input().split()))\r\nprint(a*max(b)-sum(b))", "n = int(input())\r\n\r\nar = list(map(int, input().split()))\r\n\r\ndef maximum(L): \r\n maxi = L[0]\r\n for i in range(1,len(L)): \r\n if maxi < L[i]: \r\n maxi = L[i]\r\n return maxi\r\nmax = maximum(ar)\r\n\r\nS = 0\r\nfor i in range(n): \r\n S += max - ar[i]\r\n\r\nprint(S)", "x=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)\r\ns=0\r\nfor i in l:\r\n s+=(a-i)\r\nprint(s)", "tests = int(input(\"\"))\r\nnums = [int(i) for i in input(\"\").split()][:tests]\r\nsums = [max(nums) - n for n in nums]\r\nprint(sum(sums))", "input()\r\nns = list(map(int, input().split()))\r\na = max(ns)\r\ns = 0 \r\nfor i in ns:\r\n s += a - i \r\nprint(s)", "input()\r\nprint((lambda l:sum(map(lambda x:max(l)-x,l)))(list(map(int,input().split()))))", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nr=max(a)\r\nt=0\r\nfor i in a:\r\n t+=abs(r-i)\r\nprint(t)", "n=int(input(\"\"))\r\nli=[]\r\na=[int(a) for a in input(\"\").split()]\r\no=sorted(a)\r\nif n==1:\r\n print(0)\r\nelse:\r\n sum=0\r\n for i in range (n):\r\n sum+=o[n-1]-o[i]\r\n print(sum)", "def minimum_burles_spent(n, citizens):\r\n max_welfare = max(citizens)\r\n total_spent = sum(max_welfare - welfare for welfare in citizens)\r\n\r\n return total_spent\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input()) # Number of citizens\r\n citizens = list(map(int, input().split())) # Welfare of each citizen\r\n\r\n result = minimum_burles_spent(n, citizens)\r\n print(result)\r\n", "def PARTY(arr):\r\n m=max(arr)\r\n k=0\r\n for i in arr:\r\n k+=m-i\r\n return k\r\nt=int(input())\r\na=[int(i) for i in input().split()]\r\nprint(PARTY(a))", "n = int(input())\r\nresidents = list(map(int, input().split()))\r\nrich_boy = max(residents)\r\ns = 0\r\nfor i in range (n):\r\n s += rich_boy - residents[i]\r\nprint(s)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nm = max(b)\r\ncount = 0\r\nfor i in range(a):\r\n if b[i] < m:\r\n count += m - b[i]\r\n\r\nprint(count)\r\n \r\n\r\n", "k=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ncount=0\r\nn=len(a)\r\nfor i in range(n):\r\n count+=a[n-1]-a[i]\r\nprint(count)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nm=max(a)\r\nfor i in a:\r\n\ts+=m-i\r\nprint(s)", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in s:\r\n ans += max(s) - i\r\nprint(ans)", "count = 0\r\ncount_people = int(input())\r\ndata = [int(string) for string in input().split()]\r\nmax_value = max(data)\r\n\r\nfor index in range(count_people):\r\n\tif data[index] < max_value:\r\n\t\tcount += max_value - data[index]\r\n\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nm=max(a)\r\nfor i in a:\r\n s+=abs(m-i)\r\nprint(s)\r\n ", "n = int(input())\r\nmoney = list(map(int, input().split()))\r\nrichest = max(money)\r\ntotal = 0\r\nfor i in range(n):\r\n total += richest - money[i]\r\nprint(total)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=max(a)\r\nres=0\r\nfor x in a:\r\n res+=k-x\r\nprint(res)\r\n ", "b=input()\r\na=list(map(int,input().split()))\r\nc=0\r\nfor x in a:\r\n c+=max(a)-x\r\nprint(c)", "n = int(input())\ns = list(map(int, input().split()))\nans, m = 0, max(s)\n\nfor i in s:\n ans += abs(i - m)\n\nprint(ans)\n\n\t\t\t \t \t \t\t \t \t\t\t \t", "import math\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nm=max(arr)\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+abs(m-arr[i])\r\nprint(sum)", "f = input()\r\nx = input().split()\r\ny = 0\r\nfor i in x:\r\n if int(i) > y:\r\n y = int(i)\r\ng = 0\r\nfor i in x:\r\n g += y - int(i)\r\nprint(g)\r\n\r\n\r\n", "a=int(input())\r\narr=[int(arr) for arr in input().split()]\r\nma=max(arr)\r\ncount=0\r\nfor i in arr:\r\n count=count+(ma-i)\r\nprint(count)", "n = int(input())\r\nwelfares = list(map(int, input().split()))\r\nmax_welfare = max(welfares)\r\ns = 0\r\n\r\nfor welfare in welfares:\r\n s += (max_welfare - welfare)\r\nprint(s)\r\n", "n=int(input())\r\nl=list(map(int, input().rstrip().split()))\r\nM=[]\r\nm=max(l)\r\nfor i in l:\r\n if i!=m:\r\n M.append(abs(i-m))\r\nprint(sum(M))\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nk=max(l)\r\nfor i in l:\r\n c+=(k-i)\r\nprint(c)", "t=int(input())\r\na=list(map(int,input().split()))[:t]\r\nm=max(a)\r\nc=0\r\ni=0\r\nwhile i<len(a):\r\n c=c+m-a[i]\r\n i+=1\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmax=a[0]\r\ns=0\r\nfor i in range(n):\r\n if a[i]>max:\r\n max=a[i]\r\nfor i in range(n):\r\n if max>a[i]:\r\n s=s+(max-a[i])\r\nprint(s)", "\"\"\"Праздник равенства\"\"\"\r\n\r\ndef main():\r\n n = int(input())\r\n lst = [int(i) for i in input().split()]\r\n print(sum([max(lst) - i for i in lst]))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, arr, flag = int(input()), list(map(int, input().split())), 0\r\nfor i in arr: flag += max(arr) - i\r\nprint(flag)", "s=int(input())\r\nli=list(map(int,input().split()))\r\nm=max(li)\r\np=0\r\nfor i in li:\r\n p+=(m-i)\r\nprint(p)", "n=int(input())\r\na=list(map(int,input().split()))\r\nsumm=sum(a)\r\nmaxx=max(a)\r\nprint((maxx*n)-summ)", "n = int (input ())\r\nwealth = tuple (map (int, input ().split (' ')))\r\nnew = max (wealth)\r\ncost = new * len (wealth) - sum (wealth)\r\nprint (cost)", "n = int(input())\r\nv = sorted(list(map(int, input().split())))\r\n\r\nx = 0\r\nfor i in range(n-2, -1, -1):\r\n\tx += v[n-1]-v[i]\r\n\t\r\nprint(x)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nk=0\r\nfor i in range(n-1):\r\n k=k+(a[-1]-a[i])\r\nprint(k)", "n= int(input())\r\nl=list(map(int,input().split()))\r\nprint((n*(max(l)))-sum(l))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=max(arr)\r\nans=sum([m-x for x in arr])\r\nprint(ans)", "n=int(input())\r\nwelfare=list(map(int, input().split()))\r\nmax_welfare = max(welfare)\r\ncharges=sum(max_welfare-w for w in welfare)\r\nprint(charges)", "n = int(input())\r\nmylist = [int(x) for x in input().split()]\r\ntrimmed = max(mylist)\r\nmylist.remove(max(mylist))\r\nlis = []\r\nfor i in mylist:\r\n lis.append(abs(i - trimmed))\r\nprint(sum(lis))\r\n ", "def readint():\r\n return int(input())\r\n\r\ndef readarray(typ: str):\r\n return list(map(typ, input().split()))\r\n\r\nn = readint()\r\nwelfare = readarray(int)\r\n\r\nwelfare.sort()\r\ntoBeSpent = 0\r\n\r\nfor i in range(len(welfare)-1):\r\n toBeSpent += welfare[-1] - welfare[i]\r\n\r\nprint(toBeSpent)", "number=int(input())\r\n*s,=map(int,input().split())\r\nprint(number*max(s)-sum(s))\r\n", "b= int(input())\r\na= list(map(int, input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(b):\r\n c+=a[b-1]-a[i]\r\nprint(c)\r\n", "n = int(input())\r\nlistA = list(map(int,input().split(\" \")))\r\nmaxVal = max(listA)\r\nans = 0\r\nfor a in listA:\r\n ans+= abs(maxVal-a)\r\nprint(ans)", "n = int(input())\r\nmoney = list(map(int,input().split()))\r\nprint(max(money)*(len(money)) - sum(money))", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\ns=0\r\nfor i in b:\r\n s=s+(max(b)-i)\r\nprint(s)", "n=int(input())\r\nar=list(map(int,input().split()))\r\nx=max(ar)\r\ncount=0\r\nfor i in ar:\r\n count += x-i\r\nprint(count)", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\nmax = max(welfare)\r\ncount = 0\r\nfor i in welfare:\r\n count = count + (max - i)\r\nprint(count)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\n\r\ncount = 0\r\nfor i in range(n):\r\n count += (nums[-1] - nums[i])\r\n\r\nprint(count)\r\n ", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\nmax_welfare = max(welfare)\r\ntotal_expenses = sum(max_welfare - citizen for citizen in welfare)\r\nprint(total_expenses)\r\n", "n = int(input())\nt = input()\nArr = [int(i) for i in t.split()]\nM=max(Arr)\ncount = 0\nfor i in Arr:\n count+=(M-i)\nprint(count)\n\t\t \t\t\t \t \t\t\t \t\t \t\t \t\t\t", "number_of_citezens = int(input())\r\nwelfare_of_each = input ().split()\r\nwelfare_of_each = [int(welfare) for welfare in welfare_of_each]\r\nwelfare_of_each.sort()\r\nneeded_burls = 0\r\nfor person in welfare_of_each:\r\n needed_burls += welfare_of_each[-1] - person\r\nprint(needed_burls)", "n=int(input())\r\na=[int(i) for i in input().split()][:n]\r\nx=max(a)\r\ncount=0\r\nfor i in a:\r\n count=count+x-i\r\nprint(count)\r\n ", "a = int(input())\nb = list(map(int,input().split()))\n\nc = b[0]\nfor j in b:\n if j > c:\n c = j\n\nm = 0\nfor k in b:\n m += (c-k)\n\nprint(m)\n\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nm = max(lst)\r\nans = 0\r\nfor i in lst:\r\n ans += m-i\r\nprint(ans)", "N=int(input())\r\nL=list(map(int,input().split()))\r\nM=max(L)\r\nC=0\r\nfor i in L:\r\n if i!=M:\r\n C=C+abs(M-i)\r\nprint(C) ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\ns=0\r\nfor i in a:\r\n s+=(max(a)-i)\r\n\r\nprint(s)\r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nx = max(data)\r\nans = 0\r\nfor i in data:\r\n ans += (x - i)\r\nprint(ans)", "n = int(input()) \nwealths = list(map(int, input().split())) \n\nmax_wealth = max(wealths)\n\ntotal_cost = sum(max_wealth - wealth for wealth in wealths)\n\nprint(total_cost)\n \t \t\t \t \t \t\t\t \t \t", "# pega o max do vetor\r\n# vê o quando gasta pra igualar todos os elementos ao máx do vetor\r\n_ = input()\r\nentrada = input().split()\r\nentrada = [int(a) for a in entrada]\r\nmaximo = max(entrada)\r\ndiff = [abs(a-maximo) for a in entrada]\r\nprint(sum(diff))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nm=max(a)\r\n\r\n#print(n, m, a)\r\n\r\nd=0\r\nfor i in a:\r\n d=d-(i-m)\r\nprint(d)\r\n", "n = int(input())\r\n\r\nk = list(map(int, input().split()))\r\n\r\nmax_k = max(k)\r\n\r\nk.remove(max_k)\r\n\r\ntotal = 0\r\n\r\nfor i in k:\r\n total += max_k - i\r\n \r\nprint(total)", "n=int(input())\r\n*l,=map(int,input().split())\r\nprint((max(l)*n)-sum(l))\r\n", "input()\r\nq = list(map(int, input().split()))\r\na = max(q)\r\ns = 0\r\nfor j in q:\r\n s += a-j\r\nprint(s)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nburls=0\r\nm=max(lst)\r\nfor ele in lst:\r\n burls+=(m-ele)\r\nprint(burls)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmax_ele = max(arr)\r\nmin_am = 0\r\nfor ele in arr:\r\n min_am+=(max_ele-ele)\r\n\r\nprint(min_am)", "n = int(input())\r\nx = sorted(map(int, input().split()))\r\nc = 0\r\nfor i in x:\r\n if(max(x) > i):\r\n c += max(x)-i\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nA=max(a)\r\ns=sum(list(map(lambda i: A-i,a)))\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\ndiff = []\r\nmax_value = max(a)\r\nfor i in range(n):\r\n diff.append(max_value - a[i])\r\nprint(sum(diff))\r\n", "def solve(a):\n incomes = list(map(int, a.split(' ')))\n max_income = max(incomes)\n s = 0\n\n for income in incomes:\n s += max_income - income\n\n return s\n\ndef test_solve():\n assert solve('0 1 2 3 4') == 10\n assert solve('1 1 0 1 1') == 1\n assert solve('1 3 1') == 4\n\nif __name__ == '__main__':\n n = input()\n print(solve(input()))\n", "n = int(input())\nm = input().split()\nfor i in range(0, len(m)):\n m[i] = int(m[i])\n\nres = 0\nfor k in m:\n if k < max(m):\n res += max(m) - k\nprint(res)\n", "a=int(input());b=list(map(int,input().split()))\r\nq=max(b);c=sum(b)\r\nprint((a*q)-c)\r\n", "import sys\r\n\r\na = int(input(\"\"))\r\nc = 0\r\nb = [int(j) for j in sys.stdin.readline().split()]\r\nfor i in range(0, a):\r\n if b[i] < max(b):\r\n c += max(b) - b[i]\r\nprint(c)\r\n", "input()\r\nx = list(map(int,input().split()))\r\nmx = max(x)\r\nc = 0\r\nfor i in x:\r\n c+=(mx-i)\r\nprint(c)", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nprint(n*max(s)-sum(s))", "# Holiday Of Equality\r\nn = int(input())\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\ns.sort()\r\nsum = 0\r\nfor i in range(len(s)):\r\n sum += s[len(s)-1] - s[i]\r\nprint(sum)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nn=max(a)\r\nd=0\r\nfor j in a:\r\n d+=n-j\r\nprint(d)", "n = int(input())\r\ns =list(map(int, input().split()))\r\nprint(n*max(s)-sum(s))\r\n\r\n", "n = int(input())\r\ny = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in y:\r\n if i > k:\r\n k = i\r\nc = 0\r\nfor i in y:\r\n c += (k - i)\r\nprint(c)", "b=0\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\na=max(x)\r\nfor i in x:\r\n b+=a-i\r\nprint(b)", "p = int(input())\r\nw = list(map(int, input().split()))\r\ntotal= sum(w)\r\nmaxw= max(w)\r\nmi = maxw* p - total\r\nprint(mi)", "def solve(n,a):\r\n count=0\r\n for i in a:\r\n count= count + (n-i)\r\n return count\r\n\r\n\r\ndef main():\r\n t=int(input())\r\n i=0\r\n arr=[]\r\n arr=input().split(\" \")\r\n arr2=[]\r\n for i in arr:\r\n arr2.append(int(i))\r\n arr2.sort(reverse=True)\r\n print(solve(arr2[0],arr2))\r\nmain()", "n = int(input())\r\ncitizens = sorted(list(map(int, input().split())))\r\nans = 0\r\nmaxx, minn = max(citizens), min(citizens)\r\n\r\nif maxx - minn == 0:\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n ans += maxx - citizens[i]\r\n print(ans)", "from re import A, S\r\nimport sys, os.path\r\nimport math\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 = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmx = max(a)\r\ncnt = 0\r\nfor i in range(n):\r\n cnt+=(mx-a[i])\r\nprint(cnt)", "s = int(input())\r\nm = list(map(int,input().split()))\r\ncounter=0\r\nmax1=max(m)\r\nfor i in m :\r\n if i < max1 :\r\n counter+=(max1-i)\r\nprint(counter)", "while True:\r\n try:\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n max_val = max(arr)\r\n\r\n sum_diff = sum([abs(max_val - x) for x in arr])\r\n\r\n print(sum_diff)\r\n except:\r\n break\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = 0\r\nfor i in range( n ):\r\n if a[i] < max(a):\r\n b += max(a) - a[i]\r\nprint(b)\r\n", "n = int(input())\nal = list(map(int,input().split()))\ncounter = 0\nfor i in range(n):\n counter += max(al)-al[i]\nprint(counter)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaximum = max(a)\r\ntotal = 0\r\nfor i in a:\r\n total += maximum - i\r\n\r\nprint(total)\r\n", "n = int(input(\"\"));l = list(map(int,input(\"\").split()));l.sort();print(n*max(l) - sum(l))", "dl = int(input())\r\nlista = input().split()\r\nfor i in range(dl):\r\n lista[i] = int(lista[i])\r\n\r\nmax(lista)\r\n\r\nwynik = 0\r\n\r\nfor i in lista:\r\n wynik += max(lista) - i\r\n\r\nprint(wynik)", "n = int(input())\npeople = list(map(int, input().split()))\nrich = 0\nmoney = 0\nfor i in range(n):\n if people[i] > rich:\n rich = people[i]\nfor i in range(n):\n if people[i] < rich:\n money = money + (rich - people[i])\nprint(money)\n", "n = int(input())\r\nl = list(int(x) for x in input().split())\r\nct = 0\r\nmaxl = max(l)\r\nfor i in range(n):\r\n ct += maxl - l[i]\r\n\r\nprint(ct)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxBurle = max(a)\r\nmaxInd = a.index(maxBurle)\r\ns = 0 #minimum Burles\r\nfor i in range(n):\r\n if a[i] < maxBurle:\r\n s += maxBurle - a[i]\r\nprint(s)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)\r\nc = 0\r\nfor i in a:\r\n c+=m-i\r\nprint(c)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ncharge = 0\r\nfor i in range (len(l)):\r\n charge += max(l) - l[i]\r\nprint(charge)", "def main():\r\n n=int(input())\r\n arr=[int(i) for i in input().split()]\r\n arr2=arr\r\n arr2.sort()\r\n res=0\r\n largestVal = arr2[len(arr2)-1]\r\n for key,val in enumerate(arr):\r\n res+=largestVal-val\r\n\r\n print(res)\r\n\r\nmain()\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = max(a)\r\nprint(sum(x - c for c in a))\r\n", "x = int(input())\r\n\r\ny = list(map(int, input().split()))\r\n\r\nz = max(y)\r\n\r\nc = 0\r\n\r\nfor i in range(x) :\r\n\r\n a = y[i]\r\n b = z - a\r\n c += b\r\n\r\nprint(c)\r\n\r\n", "# your code goes here\r\ndef main():\r\n n = int(input())\r\n num = list(map(int, input().split()))\r\n num.sort()\r\n sum = 0\r\n for i in range(n - 1):\r\n sum += num[n - 1] - num[i]\r\n print(sum)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# import math\r\n# count = 0\r\n# t = int(input())\r\n# while t > 0:\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nmaxVal = max(a)\r\n\r\nres = 0\r\nfor x in a:\r\n res += maxVal - x\r\nprint(res)\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n # t -= 1\r\n# print(count)\r\n# # 3 2 6\r\n\r\n# # odd = [3]\r\n# # even= [2]\r\n\r\n# a = [int(i) for i in input().split()]\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\nw = list(map(int, input().split()))\r\nmax_w = max(w)\r\ntotal_spending = 0\r\nfor w in w:\r\n total_spending += max_w - w\r\nprint(total_spending)\r\n", "n = int(input(''))\narr = [int(x) for x in input('').split(' ')]\no, m = 0, max(arr)\n\nfor c in arr:\n o += m - c\n\nprint(o)\n", "n = int(input())\r\nw = list(map(int,input().split()))\r\nmw = max(w)\r\ntc = sum(mw - we for we in w)\r\nprint(tc)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl1.sort()\r\na=l1[-1]\r\nb=0\r\nfor i in range(n):\r\n b+=l1[i]-a\r\nprint(-b)", "n = int(input())\r\nwel = list(map(int, input().split()))\r\nmax_welfare = max(wel)\r\ntotal = sum(max_welfare - w for w in wel)\r\n \r\n\r\nprint(total)\r\n", "citizens = int(input())\nlst = input().split()\nfor i in range(0, len(lst)):\n lst[i] = int(lst[i])\nfunds = 0\nmax = lst[0]\nfor i in lst:\n if i > max:\n max = i\nfor i in lst:\n funds += max - i\nprint(funds)", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = max(x)\r\nres = 0\r\nfor i in x:\r\n res += (y - i)\r\n\r\nprint(res)", "n=int(input())\r\namounts=input().split(' ')\r\nfor i in range(n):\r\n amounts[i]=int(amounts[i])\r\namounts.sort()\r\nsum=0\r\nfor j in range(n):\r\n sum+=amounts[-1]-amounts[j]\r\nprint(sum)", "input()\nc = list(map(int, input().split()))\nm = max(c)\nprint(sum(m - x for x in c))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nhigh = 0\r\nS = 0\r\nfor i in a:\r\n if i > high:\r\n high = i\r\nfor i in a:\r\n if i < high:\r\n S += (high - i)\r\nprint(S)", "n = int(input())\ns = input().split()\nl = []\nfor i in s : \n l.append(int(i))\n\nmx = max(l)\nsum = 0\nfor i in l : \n sum += mx - i\nprint(sum)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=max(a)\r\nc=0\r\nfor i in a:\r\n c+=b-i\r\nprint(c)", "n = int(input())\r\nnum_list = [int(num) for num in input().split()]\r\ncount = 0\r\n\r\nmax_num = max(num_list)\r\n\r\nfor num in num_list:\r\n count += max_num - num\r\n\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=max(a)\r\ns=0\r\nfor i in range(n):\r\n s+=(x-a[i])\r\nprint(s)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nm = max(b)\r\ncount = 0\r\nfor i in range(len(b)):\r\n count+=m-b[i]\r\nprint(count)", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nsum = 0\r\nmax_a = max(a)\r\nfor elem in a:\r\n sum += max_a - elem\r\nprint(sum)\r\n", "\n\n\n\n\n\nn = int(input())\n\narr = list(map(int, input().split()))\n\n\n\nmx = max(arr)\n\ntot = 0\n\nfor i in arr :\n tot += abs(mx - i)\n\nprint(tot)\n \t \t\t\t \t\t\t \t\t \t \t \t\t \t \t\t", "number = int(input())\r\nelements = [int(el) for el in input().split(\" \")]\r\nmx = max(elements)\r\nans = 0\r\nfor i in range(len(elements)):\r\n if elements[i] < mx:\r\n ans += mx - elements[i]\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nv = max(a)\r\nmin_cost = 0\r\nfor i in a:\r\n min_cost += v - i\r\nprint(min_cost)", "_ = input()\nwelfares = list(map(int, input().split(\" \")))\ncount = 0\nfor i in welfares:\n count += max(welfares) - i\nprint(count)\n", "n = int(input())\r\nc = list(map(int, input().split()))\r\nd = max(c)\r\nanswer = 0\r\nif len(c)>1:\r\n for i in range(len(c)):\r\n answer += d - c[i]\r\n print(answer)\r\nelse:\r\n print(0)", "n= int(input())\r\n\r\n*x,=map(int,input().split())\r\na =(n*max(x))-sum(x)\r\nprint(a)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nm=lst[0]\r\nfor i in range(1,n):\r\n if lst[i]>m:\r\n m=lst[i]\r\nans=0\r\nfor i in range(n):\r\n if lst[i]<m:\r\n ans+=m-lst[i]\r\nprint(ans)", "num1 = int(input())\r\nlist1 = list(map(int, input().split()))\r\n\r\nmax = max(list1)\r\ncount = 0\r\nfor i in range(num1):\r\n count+=(max-list1[i])\r\nprint(count)", "n = int(input())\r\ng = list(map(int, input().split()))\r\ns = 0\r\nmaxg = 0\r\nfor i in g:\r\n if i > maxg:\r\n maxg = i\r\nfor i in g:\r\n if i < maxg:\r\n s += maxg - i\r\nprint(s)", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\nli = []\r\nnew_li = []\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nmx = max(arr)\r\n\r\nfor i in arr:\r\n\tli.append(mx-i)\r\nprint(sum(li))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsum = 0\r\nm = max(arr)\r\nfor i in arr:\r\n sum += (m-i)\r\nprint(sum)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nprint(a*max(l)-sum(l))", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl = [max(l) - l[i] for i in range(n)]\r\nprint(sum(l))", "n = int(input())\narr = [int(i) for i in input().split()]\nm = arr[0]\n\nfor i in range(1,len(arr)):\n if arr[i] > m:\n m = arr[i]\n\ns = 0\nfor i in range(len(arr)):\n s += m - arr[i]\nprint(s)\n\n\t\t\t\t\t\t\t\t \t \t\t\t \t\t \t\t\t \t", "\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n citizens = list(map(int, input().split()))\r\n\r\n max_welfare = max(citizens)\r\n total_spent = 0\r\n\r\n for citizen in citizens:\r\n total_spent += max_welfare - citizen\r\n\r\n print(total_spent)\r\n", "no_of_citizen = int(input())\r\ncitizen_welfare = list(map(int, input().split()))\r\nmax_welfare = max(citizen_welfare)\r\nmin_burles = 0\r\nfor citizen in citizen_welfare:\r\n min_burles += (max_welfare - citizen)\r\n\r\nprint(min_burles)", "input()\n\narr = list(map(int, input().split()))\n\nm = max(arr)\n\ntotal = sum(m-i for i in arr)\nprint(total)\n \t \t \t \t\t\t \t \t \t \t", "a = int(input())\r\ns = input()\r\nb = s.split()\r\nm = 0\r\nl = list(map(int, b))\r\nsum = 0\r\nfor i in range(a):\r\n m = max(l)\r\n if l[i] < m:\r\n sum = sum + (m - l[i])\r\nprint(sum) ", "#Holiday Of Equality\r\n\r\nn = int(input())\r\n\r\nBiggest_value = 0\r\n\r\nc_expense = [int(x) for x in input().split()]\r\nfor value in c_expense:\r\n\tif int(value) > Biggest_value:\r\n\t\tBiggest_value = int(value)\r\n\r\nTotal_expense = 0\r\n#print(Biggest_value)\r\n\r\nfor value1 in c_expense:\r\n\tTotal_expense += Biggest_value - value1\r\n\t#print(Total_expense)\r\n\r\n\r\nprint(Total_expense)", "n=int(input())\r\na=list(map(int,input().split()))\r\nres=max(a)\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+(res-a[i])\r\nprint(sum)\r\n ", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nl = list(map(int, sys.stdin.readline().split()))\r\nsumm = 0\r\nmx = max(l)\r\nfor i in l:\r\n summ += mx - i\r\nprint(summ)", "a = input()\r\nb = input().split()\r\ncounter = 0\r\na = int(a)\r\nfor i in range(a):\r\n b[i] = int(b[i])\r\n \r\nbmax = b[0]\r\n\r\nfor i in range(a):\r\n if b[i] > bmax:\r\n bmax = b[i]\r\n\r\nfor i in b:\r\n counter += bmax - i\r\n\r\nprint(counter)", "n = int(input())\r\nwelfares = [int(x) for x in input().split(\" \")]\r\nm = max(welfares)\r\nburles = 0\r\n\r\nfor i in welfares:\r\n burles += (m-i)\r\n\r\nprint(burles)\r\n\r\n\r\n", "n = int(input())\nnum = [int(i) for i in input().split()]\na = max(num)\nc = 0\nfor i in num:\n c += abs(a-i)\nprint(c)", "a = int(input())\narray = list(map(int, input().split()))\narray.sort()\nsum = 0\nfor item in array:\n sum += (array[-1] - item)\nprint(sum)\n \t\t\t \t\t \t \t\t\t \t\t\t\t\t \t \t \t \t", "n = int(input())\na = list(map(int, input().split(' ')))\n\n\ndef equalize_welfare(a):\n max_owner = max(a)\n res = 0\n for i in a:\n res += max_owner - i\n print(res)\n\n\nequalize_welfare(a)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=0\r\nif n==1:\r\n print(0)\r\nelse:\r\n ma=max(a)\r\n for i in range(0,n):\r\n d=d+ma-a[i]\r\n print(d)", "t=int(input())\r\n\r\nn=list(map(int, input().strip().split()))\r\n\r\nn=sorted(n)\r\nc=0\r\nfor i in range(t):\r\n a=n[len(n)-1]-n[i]\r\n c=c+a\r\nprint(c)", "n, s = int(input()), [int(i) for i in input().split()]\r\nprint(max(s)*n-sum(s))", "n = int(input())\r\ninput_values = input().split()\r\nmy_list = [int(value) for value in input_values[:n]]\r\nlargest_number = max(my_list)\r\nmy_list.remove(largest_number)\r\nprint((n*largest_number)-(sum(my_list))-largest_number)", "s=int(input())\r\nr=list(map(int,input().split()))\r\nm=max(r)\r\no=0\r\nfor i in r:\r\n o+=m-i\r\nprint(o)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=max(a)\r\nc=0\r\nfor i in range(len(a)):\r\n if(a[i]<d):\r\n c+=d-a[i]\r\nprint(c)", "a = int(input())\r\nb = input().split()\r\nc = list(b)\r\nfor i in range(a):\r\n c[i]=int(c[i])\r\nx = max(c)\r\ns = 0\r\nfor i in c:\r\n s = s+(x-i) \r\nprint(s)", "x=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nif len(l)==1:\r\n print(\"0\")\r\nelse:\r\n m=max(l)\r\n for i in l:\r\n if i==m:\r\n continue\r\n else:\r\n c+=(m-i)\r\n print(c)", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=n*max(x)-sum(x)\r\nprint(y)\r\n\r\n", "from sys import stdin, stdout\r\ninput()\r\nlisty = [int(x) for x in stdin.readline().split()]\r\nrichest = max(listy)\r\ntotal = 0\r\nfor e in listy:\r\n total += richest-e\r\nprint(total)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=max(l)\r\nc=0\r\nfor i in l:\r\n c=c+k-i\r\nprint(c)", "\r\nn = int(input())\r\n\r\nprices = list(map(int, input().split()))\r\n\r\nmax_price = prices[0]\r\n\r\nfor price in prices:\r\n if price > max_price:\r\n max_price = price\r\n\r\nsum = 0\r\n\r\nfor price in prices:\r\n sum += ( max_price - price )\r\n\r\nprint(sum)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nj=max(l)\r\nfor i in l:\r\n if i!=j:\r\n s+=(j-i)\r\nprint(s) \r\n \r\n ", "n=int(input()) \r\nc=0\r\na=list(map(int, input().split())) \r\nmx=max(a) \r\ndel(a[a.index(mx)]) \r\nfor i in a: \r\n c+=(mx-i) \r\nprint(c) ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif len(arr) < 2:\r\n print(0)\r\nelse:\r\n m = max(arr)\r\n res = 0\r\n for i in arr:\r\n res += m - i\r\n print(res)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\np=max(l)\r\nl.remove(p)\r\nfor i in l:\r\n m=p-i\r\n l1.append(m)\r\nprint(sum(l1))\r\n ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ndem=0\r\nkiem=0\r\nfor i in a:\r\n dem=max(dem,i)\r\nfor i in a:\r\n kiem+=(dem-i)\r\nprint(kiem)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nm=max(nums)\r\nmm=m*n\r\ns=sum(nums)\r\nprint(mm-s)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nmas.sort()\r\ncount = 0\r\nfor elem in mas:\r\n count += mas[-1]-elem\r\nprint(count)", "import math\r\nimport itertools\r\nfrom collections import Counter\r\nfrom heapq import *\r\n\r\nlis = lambda: list(map(int, input().split()))\r\nmapnum = lambda: map(int, input().split())\r\nnum = lambda: int(input())\r\nstrlis = lambda: input().split()\r\n\r\n\r\nn = num()\r\narr = lis()\r\nm = max(arr)\r\nc = 0\r\nfor i in arr:\r\n if i == m:\r\n continue\r\n c += m-i\r\nprint(c)\r\n\r\n\r\n ", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the welfare of each citizen\r\ncitizens = list(map(int, input().split()))\r\n\r\n# Find the maximum welfare among all citizens\r\nmax_welfare = max(citizens)\r\n\r\n# Calculate the total number of burles needed to equalize the welfare\r\ntotal_burles = sum(max_welfare - welfare for welfare in citizens)\r\n\r\n# Print the result\r\nprint(total_burles)\r\n", "n = int(input())\r\nl =[ int(j) for j in input().split(\" \") ]\r\nm = max(l)\r\nans=0\r\nfor i in l:\r\n ans += (m-i)\r\nprint(ans)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nx=max(m)\r\nm.remove(x)\r\ncnt=0\r\nfor i in m:\r\n cnt+=(x-i)\r\nprint(cnt)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmaximum = max(arr)\r\nsum = 0\r\nfor i in range(len(arr)):\r\n sum+=maximum-arr[i]\r\nprint(sum)", "t=int(input())\r\nn=(list(map(int,input().split())))\r\nprint(max(n)*t-sum(n))\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nm= max(lst) \r\nt= 0\r\nfor w in lst:\r\n t+= m-w\r\nprint(t)", "b = int(input(''))\r\na = input('')\r\nlista = []\r\nk = 0\r\n\r\n\r\nfor i in a.split():\r\n lista.append(int(i))\r\n\r\n\r\n\r\nmaior = max(lista)\r\n\r\nfor j in lista:\r\n while j != maior:\r\n j = j + 1\r\n k = k + 1\r\n\r\nprint(k)\r\n", "'''// Problem: A. Holiday Of Equality\r\n// Contest: Codeforces - Codeforces Round #392 (Div. 2)\r\n// URL: https://codeforces.com/problemset/problem/758/A\r\n// Memory Limit: 256 MB\r\n// Time Limit: 1000 ms\r\n// \r\n// Powered by CP Editor (https://cpeditor.org)'''\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nb=0\r\na=l[-1]\r\nfor i in range(n):\r\n\tb+=a-l[i]\r\nprint(b)", "t = int(input())\r\narray = list(map(int, input().split()))\r\nmax = max(array)\r\ncounter = 0\r\n\r\nfor i in array:\r\n counter = counter + (max - i)\r\n \r\nprint(counter)", "n = int(input())\r\nwelfare = [int(x) for x in input().split()]\r\noutput = 0\r\n\r\nmaxMon = max(welfare)\r\n\r\n\r\nfor i in range(n):\r\n output+= (maxMon -welfare[i] )\r\n\r\nprint(output)", "n = int(input())\r\na = list(map(int, input().split(maxsplit=n-1)))\r\ntotal = 0\r\nx = max(a)\r\nfor c in a:\r\n y = x - c \r\n total += y\r\nprint(total)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jan 15 08:33:31 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n\r\nimport sys\r\nL=[]\r\nfor i in sys.stdin:\r\n L.append(i)\r\nK=[line.rstrip('\\n') for line in L if line]\r\ns=0\r\nn=int(K[0])\r\nK=[int(K[1].split(' ')[i]) for i in range(n)]\r\nfor i in range(n):\r\n s+=max(K)-K[i]\r\nprint(s)", "number_of_citizens = int(input())\r\ncitizen_welfare = list(map(int, input().split()))\r\n\r\nburles_spent = 0\r\nfor citizen in citizen_welfare:\r\n burles_spent += max(citizen_welfare) - citizen\r\n\r\nprint(burles_spent)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nma=max(nums)\r\nans=0\r\n\r\nfor item in nums:\r\n ans+=ma-item\r\n \r\n \r\nprint(ans)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nr=max(x)\r\nc=0\r\nfor e in range(n):\r\n for t in x: \r\n if r!=x[e]:\r\n a=r-x[e]\r\n c+=a\r\n e+=1\r\n if r==r:\r\n break\r\nprint(c) \r\n ", "n = int(input()) \r\na = list(map(int,input().split()))\r\nmax = max(a)\r\nl = len(a)\r\ns = sum(a)\r\nprint(max * l - s)", "n = input()\r\nx = list(map(int,input().split(\" \")))\r\np = max(x)\r\nk = 0\r\nfor i in x:\r\n k += (p-i)\r\nprint(k)\r\n", "n=int(input())\na=list(map(int,input().strip().split()))[:n]\nm=max(a)\nsum=0\nfor i in a:\n if(i!=m):\n sum=sum+m-i\n\nprint(sum)", "n = int(input()) # Read the number of citizens\r\nwelfare = list(map(int, input().split())) # Read the welfare of each citizen\r\n\r\nmax_welfare = max(welfare) # Find the maximum welfare among all citizens\r\n\r\ntotal_expense = 0\r\nfor i in range(n):\r\n total_expense += max_welfare - welfare[i] # Calculate the expense needed to equalize welfare\r\n\r\nprint(total_expense)\r\n", "n = int(input())\r\n\r\nburle = list(map(int, input().split()))\r\nburle = sorted(burle)\r\nmaxi = burle[-1]\r\n\r\ncount = 0\r\nfor i in burle:\r\n count += maxi - i\r\n\r\nprint(count)\r\n", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\nm = max(nums)\r\nres = 0\r\nfor i in range(len(nums)):\r\n res += m - nums[i]\r\n\r\nprint(res)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nx = max(a)\r\nprint(n*x-sum(a))", "n = int(input())\r\nar = list(map(int,input().split()))\r\nmaxi = max(ar)\r\nans = 0\r\nfor i in ar:\r\n ans += (maxi - i)\r\nprint(ans)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nprint(n * max(lst) - sum(lst))", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nmax=lst[0]\r\nfor i in range(1,n):\r\n if(lst[i]>max):\r\n max=lst[i]\r\nres=0\r\nfor i in range(n):\r\n res=res+max-lst[i]\r\nprint(res)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\nm = max(wealth)\r\nt= sum(m - w for w in wealth)\r\nprint(t)", "a = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\nb.sort()\r\ntotal = 0\r\nfor i in range(a[0]):\r\n total += (b[-1] - b[i])\r\nprint(total)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=max(l)\r\nc=0\r\nfor i in l:\r\n\tc+=abs(i-k)\r\nprint(c)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in l:\r\n ans += max(l)-i\r\nprint(ans)\r\n ", "n = int(input())\r\nmass = input().split()\r\nmass = list(map(int,mass))\r\nmak = max(mass)\r\nans = 0\r\nfor i in range(n):\r\n if mass[i] < mak:\r\n ans += mak - mass[i]\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nif n==1:\r\n print(0)\r\nelse:\r\n print(n*max(a)-sum(a))", "n=int(input())\r\narr=list(map(int,input().strip().split()))\r\nkey=max(arr)\r\nsum1=0\r\nfor i in arr:\r\n sum1+=key-i\r\nprint(sum1)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nj=max(l)\r\nfor i in l:\r\n if i!=j:\r\n k+=(j-i)\r\nprint(k) \r\n \r\n ", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\nmax_wealth = max(wealth)\r\ntotal_spent = 0\r\nfor i in wealth:\r\n total_spent += max_wealth - i\r\nprint(total_spent)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# find the maximum wealth\r\nmax_wealth = max(a)\r\n\r\n# calculate the total cost to equalize wealth\r\ntotal_cost = 0\r\nfor i in range(n):\r\n if a[i] != max_wealth:\r\n total_cost += max_wealth - a[i]\r\n\r\n# output the total cost\r\nprint(total_cost)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsum = 0\r\n\r\narr.sort()\r\nmax_val = arr[-1]\r\n\r\nfor i in range(n - 1):\r\n sum += abs(max_val - arr[i])\r\n\r\nprint(sum)\r\n\r\n ", "n=int(input())\r\na=list(map(int,input().strip().split()))[:n]\r\nx=max(a)\r\nsum=0\r\nfor i in range(n):\r\n a[i]=x-a[i]\r\n sum+=a[i]\r\nprint(sum)", "n = int(input())\r\ns = input().split(\" \")\r\n\r\n# Convert the list of strings to integers\r\ns = [int(x) for x in s]\r\n\r\nmax_welfare = max(s) # Find the maximum welfare\r\ntotal_spending = sum(max_welfare - x for x in s) # Calculate the total spending needed\r\n\r\nprint(total_spending)\r\n", "n=int(input())\r\ns=input()\r\ns=[int(z) for z in s.split()]\r\nm=max(s)\r\nw=0\r\nfor i in s:\r\n w+=(m-i)\r\nprint(w)", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nr=max(arr)\r\nc=0\r\ns=0\r\nfor i in range(n):\r\n c=r-arr[i]\r\n s=s+c \r\nprint(s)", "n = int(input())\r\nexp=list(map(int,input().strip().split()))\r\nmaximum = max(exp)\r\nsum=0\r\nfor j in exp:\r\n sum = sum + (maximum-j)\r\nprint(sum)", "n=int(input())\na=input()\nl=a.split()\nmaxi=-1\nfor i in range(len(l)):\n l[i]=int(l[i])\n maxi=max(maxi,l[i])\nsm=0\nfor i in range(len(l)):\n sm+=maxi-l[i]\nprint(sm)\n\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\nprint(max(a)*n-sum(a))", "n = int(input())\r\n\r\nar = list(map(int,input().strip().split()))\r\n\r\nmaxElement = max(ar)\r\ntotalSum = 0\r\nfor i in range(n):\r\n totalSum +=maxElement - ar[i]\r\nprint(totalSum)", "n= int(input())\r\nr= list(map(int,input().split()))\r\nm= max(r)\r\nc= 0\r\nfor i in r:\r\n c+= m-i\r\n\r\nprint(c)", "citizens = int(input())\r\nwelfare = list(map(int, input().split()))\r\nmax = max(welfare)\r\nres = 0\r\n\r\nfor i in welfare:\r\n if i < max:\r\n res += max - i\r\n\r\nprint(res)", "n = int(input())\nsequence = list(map(int, input().split(' ')))\n\n\n\n\n\nif n == 1:\n print(0)\nelse:\n sequence1 = sequence\n maxi = max(sequence1)\n # print(maxi)\n index_maxi = sequence1.index(maxi)\n # print(index_maxi)\n # print(sequence1)\n # print(len(sequence1))\n sequence1.pop(index_maxi)\n plus_lemming = 0\n b = 0\n for i in sequence1:\n b = maxi - i\n plus_lemming += b\n print(plus_lemming)\n", "\r\nn = int(input())\r\nvar = list(map(int, input().split()))\r\nif n > 1:\r\n var.sort(reverse= True)\r\n result = 0\r\n for i in range(1,n):\r\n temp = var[0] - var[i]\r\n result += temp\r\n print(result)\r\nelse:\r\n print(0)", "# 758A Holiday of equality \r\nn = int(input())\r\nk = list(map(int,input().split()))\r\nmaxM = max(k)\r\ntotalBurles = 0\r\nfor c in k:\r\n totalBurles = totalBurles + maxM - c\r\nprint(totalBurles)", "a = int(input())\r\nb = [int(num) for num in input().split()]\r\nc = max(b)\r\nk = 0\r\nfor i in range(a):\r\n if b[i]<c:\r\n k = k + (c - b[i])\r\nprint(k)", "x = int(input())\r\ns = list(map(int, input().split()))\r\nprint(max(s) * x - sum(s))", "t=int(input())\r\nl=list(map(int,input().split()))[:t]\r\nc=0\r\nfor i in range(len(l)):\r\n if(l[i]!=max(l)):\r\n c=c+max(l)-l[i]\r\nprint(c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)\r\ncnt=0\r\nfor i in range (0,n):\r\n cnt+=(a-l[i])\r\nprint(cnt)", "import sys\r\nn = int(sys.stdin.readline().strip())\r\na = list(map(int, sys.stdin.readline().strip().split()))\r\nm = max(a)\r\nans = sum(m-x for x in a)\r\nprint(ans)", "#758A\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nz=max(l)\r\nif n==1:\r\n print(c)\r\nelse:\r\n for i in range(n):\r\n c+=z-l[i]\r\n print(c)\r\n", "n = int(input())\r\n\r\n\r\nwelfare = list(map(int, input().split()))\r\n\r\nmax_w = max(welfare)\r\n\r\ntotal = 0\r\n\r\nfor n in welfare:\r\n total = total + (max_w - n)\r\n\r\nprint(total)\r\n", "n = int(input())\r\nmas = [int(el) for el in input().split()]\r\nmx = max(mas)\r\nans = 0\r\nfor el in mas:\r\n ans += mx - el\r\nprint(ans)", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nm = max(s)\r\ncol = 0\r\nfor i in range(n):\r\n col += m-s[i]\r\nprint(col)", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nif len(a)==1:\r\n print(\"0\")\r\nelse:\r\n n=len(a)\r\n c=a[n-1]\r\n b=0\r\n for i in range(n-1):\r\n b+=c-a[i]\r\n print(b)\r\n\r\n", "n=int(input())\r\n\r\nlst=[]\r\nlst=input().split()\r\nlst2=[]\r\n\r\nfor x in lst:\r\n lst2.append(int(x))\r\n\r\nsum=0\r\nlst2.sort()\r\nm=lst2[-1]\r\n\r\nfor i in (lst2):\r\n if(i< m):\r\n d=m-i\r\n sum=sum+d\r\n\r\n\r\nprint(sum)", "def holiday():\r\n n = int(input())\r\n l = []\r\n pe = input().split()\r\n l.extend(pe)\r\n int_l = []\r\n\r\n for c in l:\r\n int_l.append(int(c))\r\n total = 0\r\n for g in int_l:\r\n total += g\r\n\r\n s_l = sorted(int_l)\r\n if len(l) == n:\r\n large = s_l[-1]\r\n all = n * large\r\n exact = all - total\r\n print(exact)\r\n\r\n\r\nholiday()\r\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nm=max(lis)\r\ns=0\r\nif n==1:\r\n print(0)\r\nelse:\r\n for i in lis:\r\n s+=m-i\r\n print(s)\r\n ", "n=int(input())\r\narr=list(map(int,input().split()))\r\nc=max(arr)\r\nres=0\r\nfor i in arr:\r\n res=res+c-i\r\nprint(res) \r\n", "n = int(input())\r\nlis = list(map(int, input().split()))\r\nresult = 0\r\nfor i in range(len(lis)):\r\n result = result + max(lis) - lis[i]\r\nprint(result)", "citizen = int(input())\r\nmoney = list(map(int, input().split()))\r\nmax_money = max(money)\r\nresult = 0\r\nfor i in money:\r\n if i < max_money:\r\n result += (max_money - i)\r\nprint(result)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\ns=0\r\nfor i in range(n-1):\r\n s=s+(a[-1]-a[i])\r\nprint(s)\r\n \r\n \r\n \r\n", "n = int(input())\r\nc = [int(i) for i in input().split(' ')]\r\n\r\nt = max(c)*n\r\n\r\no = sum(c)\r\n\r\nprint(t-o)", "n = int(input())\r\ninput = [int(item) for item in input().split()]\r\ninput.sort()\r\noutput = 0\r\nfor i in range(len(input)-1):\r\n if input[i]!=input[-1]:\r\n output += input[-1] - input[i]\r\n else:\r\n break\r\nprint(output)", "n = int(input())\r\ns = list(map(int, input().split(' ')))\r\ncount = 0\r\nmax_money = max(s)\r\nfor i in s:\r\n count += max_money-i\r\nprint(count)", "n = input()\r\ns = list(map(int,input().split()))\r\nm = max(s)\r\nspend = 0\r\nfor i in s:\r\n spend += (m-i)\r\n\r\nprint(spend)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmmax=max(a)\r\nres=0\r\nfor i in range(n):\r\n res+=mmax-a[i]\r\nprint(res)", "def solve():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n mx=max(arr)\r\n sm=sum(arr)\r\n ans=(n*mx)-sm\r\n print(ans)\r\n\r\nsolve()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n s=s+max(l)-i\r\nprint(s)", "g=int(input())\r\n*l,=map(int,input().split())\r\nprint(g*max(l)-sum(l))", "q=int(input())\r\nc=0\r\nn=list(map(int,input().split()))\r\nx=max(n)\r\nfor j in n:\r\n c+=x-j\r\nprint(c)", "n = int (input())\na = list(map(int, input().split ()))\n\nmaximum = max(a)\nspend = 0\n\nfor i in range (n) :\n spend = spend + (maximum - a[i])\nprint(spend)\n\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\na.sort()\r\nx=a[len(a)-1]\r\nc=0\r\nfor i in a:\r\n t=x-i\r\n if(t>0):\r\n c=c+t\r\nprint(c)", "number=int(input())\r\ncounter=0\r\nlst=list(map(int,input().split()))\r\nwazly=max(lst)\r\n\r\nfor x in lst:\r\n counter += wazly - x\r\nprint(counter)", "from sys import stdin\n\nstream = None\ntry:\n stream = open('file.txt', 'r')\nexcept:\n stream = stdin\n\nt = int(stream.readline())\n\narr = [int(i) for i in stream.readline().split()]\n\nsumm = sum(arr)\nmaxx = max(arr)\nprint(t * maxx - summ)\n", "n = int(input())\na = list(map(int, input().split()))\nmx = max(a)\nans = 0\nfor i in range(n):\n ans += mx - a[i]\nprint(ans)# 1698352628.4174087", "n = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nmax_num = max(nums)\r\nres = 0\r\n\r\nfor num in nums:\r\n res += max_num - num\r\n \r\nprint(res)", "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 = int(input())\r\nl = list(getints())\r\nprint(n*max(l)-sum(l))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=[]\r\nm=max(a)\r\nfor i in a:\r\n s.append(abs(m-i))\r\nprint(sum(s))\r\n", "n=int(input())\r\nb=input().split()\r\nc=[int(i) for i in b]\r\nk=max(c)\r\nco=0\r\nfor i in c:\r\n co+=k-i\r\nprint(co)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=max(a)\r\nk=0\r\nfor i in a:\r\n if i!=b:\r\n k=k+(b-i)\r\nprint(k)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nco=0\r\nfor i in s:\r\n co+=max(s)-i\r\nprint(co)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmaxi = max(lst)\r\ns = 0\r\nfor i in lst:\r\n s += maxi - i\r\nprint(s)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nbiggest=max(a)\r\n\r\nall_citizens_wellfare=biggest*n\r\n\r\nsum_of_citizens=sum(a)\r\n\r\n#print(all_citizens_wellfare)\r\n#print(sum_of_citizens)\r\nprint(all_citizens_wellfare-sum_of_citizens)\r\n", "n=int(input())\narr=[int(i)for i in input().split()]\narr.sort()\nsum=0\nfor i in range(0,n-1):\n s=arr[n-1]-arr[i]\n sum+=s\nprint(sum)\n\n \t\t \t \t \t \t \t\t\t \t", "import sys\r\nsys.stdin.reconfigure(line_buffering=True)\r\nn=int(input())\r\nli=[int(i) for i in input().split()][:n]\r\nm=max(li)\r\nsum=0\r\nfor i in li:\r\n x=m-i\r\n sum+=x\r\nprint(sum)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl.sort(reverse=True)\r\nk=0\r\nfor i in range(len(l)):\r\n k=k+abs(l[0] - l[i])\r\nprint(k)", "n = int(input())\r\n\r\nwelfare = [int(i) for i in input().split()]\r\n\r\nshare = [max(welfare) - i for i in welfare]\r\n\r\nprint(sum(share))", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += arr[-1]-arr[i]\r\n\r\nprint(ans)", "a=int(input())\r\narr=list(map(int,input().split()))\r\nprint(a*max(arr)-sum(arr))", "def main():\r\n n, *a = map(int, open(0).read().split())\r\n m = max(a)\r\n print(sum([m-x for x in a]))\r\n\r\nmain()", "\r\ni=[]\r\nn=int(input())\r\nb=input()\r\nmax = 0\r\nm=0\r\nb = b.split(' ')\r\nfor x in range(0,n):\r\n if int(b[x]) >= max:\r\n max = int(b[x])\r\nfor h in b:\r\n m+= max - int(h)\r\nprint(m)\r\n\r\n\r\n", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\nmx = max(s)\r\nans = 0\r\nfor i in range(n):\r\n if s[i] != mx:\r\n ans += mx - s[i]\r\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nres = 0\nmx = max(a)\nfor i in a:\n if i < mx:\n res += mx - i\nprint(res)", "n = int(input())\nmas = list(map(int, input().split()))\nans = 0\nfor i in mas:\n ans += max(mas) - i\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmoney = 0\r\nfor i in a:\r\n money += (max(a) - i)\r\nprint(money)", "n=int(input())\r\nmoq=input().split()\r\nm=[]\r\nfor i in moq :\r\n m.append(int(i))\r\nM=max(m)\r\nN=sum(m)\r\nprint((M*n)-N)", "n=input()\r\nm=list(map(int,input().split(\" \")))\r\n# print(m)\r\nsum=0\r\nfor i in m:\r\n\tsum+=(max(m)-i)\r\nprint(sum)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)\r\nans=0\r\nfor i in range(0,len(l)):\r\n if l[i]<a:\r\n ans+=(a-l[i])\r\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nrich = max(a)\nresult = 0\nfor i in a:\n if i < rich:\n result += (rich-i)\nprint(result)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmaxi = max(a)\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(len(a)):\r\n \r\n if abs(maxi - a[i]) != 0:\r\n ans1 = ans1 + maxi - a[i]\r\n elif maxi - a[i] == 0:\r\n ans2 = 0\r\n \r\nprint(ans1+ans2)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in a:\r\n ans += max(a)-i\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nanswer:int = 0\r\nfor i in a:\r\n answer += max(a) - i\r\nprint(answer)", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\nc = 0\r\nfor i in arr:\r\n c += max(arr) - i\r\n\r\nprint(c)", "# -*- coding: utf-8 -*-\n\"\"\"1512A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn=int(input())\nl=list(map(int,input().split()))\nm=max(l)\ncount=0\nfor i in l:\n d=m-i\n count+=d\nprint(count)", "z=int(input())\r\nl=list(map(int,input().split()))\r\nmaximum=max(l)\r\ns=0\r\nl.remove(maximum)\r\nfor i in range(len(l)):\r\n s=s+(maximum-l[i])\r\nprint(s)", "n = int(input())\r\na = list(input().split())\r\ns = 0\r\nfor i in range(0,len(a)):\r\n a[i] = int(a[i])\r\nfor i in range(0,len(a)):\r\n s += max(a) - a[i]\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = [int(e) for e in input().split()]\r\nprint(max(a)*n - sum(a))", "n = int(input())\r\nmoney = sorted(list(map(int, input().split())))\r\n\r\ncount = 0\r\nfor i in range(len(money)):\r\n count += money[-1] - money[i]\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nb=0\r\nfor i in l:\r\n if(i<m):\r\n b=b+(m-i)\r\nprint(b)", "n = int(input())\r\n\r\ndata = input().split()\r\n\r\nmx = 0\r\n\r\nfor i in range(len(data)):\r\n\r\n if int(data[i]) > mx:\r\n mx = int(data[i])\r\n\r\ncount = 0\r\n\r\nfor i in range(len(data)):\r\n\r\n count += abs(mx - int(data[i]))\r\n\r\nprint(count)", "g=int(input())\r\ny=list(map(int,input().split()))\r\no=0\r\nfor i in range(g):\r\n o+=max(y)-y[i]\r\nprint(o) ", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nmax_wealth = max(a)\r\n\r\ntotal_spend = 0\r\n\r\nfor i in range(n):\r\n total_spend = total_spend + (max_wealth - a[i])\r\n\r\nprint(total_spend)", "n=int(input())\r\narr=input().split(' ')\r\narr=list(map(int,arr))\r\nm=max(arr)\r\ngive=0\r\nif n==1:\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n give+=m-arr[i]\r\n print(give)", "n=int(input())\nl=list(map(int,input().split()))\nm=max(l)\no=0\nfor i in l:\n o+=m-i\nprint(o)\n \t\t \t \t\t \t \t \t \t\t \t\t \t", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmx=max(arr)\r\nres=0\r\nfor i in arr:\r\n res+=mx-i\r\nprint(res)", "a=int(input())\r\nli=list(map(int,input().split()))\r\nm1=max(li)\r\ncnt=0\r\nfor i in li:\r\n if i!=m1:\r\n cnt=cnt+abs(m1-i)\r\nprint(cnt)", "n = int(input())\r\nk = list(map(int, input().split()))\r\nres = 0\r\nfor i in k:\r\n if i < max(k):\r\n res += max(k)-i\r\nprint(res)", "n = int(input())\r\nt = list(map(int,input().split()))\r\nz = max(t)\r\nl = []\r\nfor i in t:\r\n zz = z - i\r\n l.append(zz)\r\nprint(sum(l))", "num= int(input())\r\nlist_1= [int(num) for num in input().split(\" \", num)]\r\nlist_1.sort()\r\nmax= list_1[-1]\r\nsum= 0\r\n\r\nfor i in list_1:\r\n sum+= (max-i)\r\n\r\nprint(sum) ", "n = int(input())\r\ns = list(map(int, input().split()))\r\ncount = 0\r\nj = max(s)\r\nfor i in range(n):\r\n if s[i] < j:\r\n count += j - s[i]\r\nprint(count)", "n=int(input())\r\np=input().split()\r\nx=[]\r\nfor i in p:\r\n x.append(int(i))\r\nx.sort()\r\nsum=0\r\nfor i in range(len(x)-1):\r\n sum+=x[-1]-x[i]\r\nprint(sum)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nprint(sum([a[-1]-a[i] for i in range(len(a)-1)]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=max(a)\r\nt=0\r\nfor i in range(len(a)):\r\n t+=c-a[i]\r\nprint(t) ", "input()\r\nlst = list(map(int, input().split()))\r\nmax_in = max(lst)\r\nbyrl = 0\r\n\r\nfor i in lst:\r\n byrl += max_in - i\r\n\r\nprint(byrl)\r\n\r\n", "_ = input()\npeople = [int(i) for i in input().split()]\nhigh = max(people)\ncharge = 0\nfor person in people:\n charge += high - person\nprint(charge)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=max(l)\r\ne=sum(l)\r\nf=n*d-e\r\nprint(f)", "t = int(input())\r\na = list(map(int,input().split()))\r\nc=[]\r\ns=0\r\na.sort()\r\nx = max(a)\r\nfor i in a:\r\n b = x-i\r\n c.append(b)\r\nfor j in c:\r\n s+=j\r\nprint(s)\r\n", "n= int(input())\r\ncount=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n break\r\n\r\nx=max(l)\r\nfor j in range(len(l)):\r\n if(x>l[j]):\r\n r=x-l[j]\r\n count+=r\r\n\r\nprint(count)\r\n", "# 7586A\r\nt = int(input())\r\na = list(map(int, input().split()))\r\ns = max(a)\r\nf = 0\r\nfor i in range(t):\r\n f = f + (s - a[i])\r\nprint(f)", "n=int(input())\r\nscore = list(map(int,input().split(' ')))\r\nprint(max(score) * len(score) - sum(score))", "n = int(input())\r\ns=0\r\nx = input().split()\r\nfor i in range(len(x)):\r\n x[i] = int(x[i])\r\nmaxx = max(x)\r\n\r\nfor i in x:\r\n s+=abs(int(maxx) - int(i))\r\n\r\nprint(s)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = max(l)\r\ns = 0 \r\nfor i in l :\r\n s = s+(m-i)\r\nprint(s)\r\n \r\n", "n = int(input())\r\nf = [int(x) for x in input().split()]\r\nm = max(f)\r\nans = 0\r\nfor i in f:\r\n ans += (m - i)\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint(n*max(arr)-sum(arr))\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nm=max(s)\r\ng=[]\r\nfor x in s:\r\n g.append(m-x)\r\nprint(sum(g))", "n= int(input())\r\n\r\ns= list(input().split())\r\n\r\nmax= 0\r\n\r\nfor i in range(n):\r\n if int(s[i]) > max:\r\n max= int(s[i])\r\n\r\ncounter= 0\r\n\r\nfor i in range(n):\r\n counter+= max - int(s[i])\r\n\r\nprint(counter)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=max(l)\r\ny=0\r\nfor i in range(n):\r\n y+=x-l[i]\r\nprint(y)\r\n \r\n \r\n \r\n\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\nl=list(map(int,input().split()))\r\nm=max(l)\r\ns=0\r\nfor i in range(n):\r\n s=s+m-l[i]\r\nprint(s)\r\n", "c = int(input())\na = list(map(int, input().split()))\nb = max(a)\nt = 0\nfor elem in a:\n t += b - elem\nprint(t)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_a = max(a)\r\ntotal_cost = 0\r\n\r\nfor i in range(n):\r\n total_cost += (max_a - a[i])\r\n\r\nprint(total_cost)\r\n'''\r\nThe problem is asking us to find the minimum amount of money the king needs to spend in order to equalize the welfare of all\r\n the citizens in the kingdom. The idea is to find the maximum welfare among all citizens, and then calculate the difference \r\n between each citizen's welfare and the maximum welfare. The sum of all these differences will give us the minimum amount\r\n of money the king needs to spend to equalize the welfare of all citizens.\r\n\r\n'''", "n = int(input())\r\nsum = 0\r\nli = sorted(list(map(int, input().split())), reverse=True)\r\nfor i in li[1:]:\r\n sum += (li[0] - i)\r\nprint(sum)\r\n", "n = input()\r\nl = list(map(int, input().split()))\r\nk = max(l)\r\na = 0\r\nfor i in l:\r\n a+=(k-i)\r\nprint(a)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nb = 0\r\nfor i in range(n):\r\n if a[-1] - a[i]:\r\n b = b + a[-1] - a[i]\r\nprint(b)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=max(a)\r\ncount=0\r\nfor i in range(len(a)):\r\n if(a[i]<b):\r\n count=count+(b-a[i])\r\n \r\nprint(count)", "NOC = int(input())\r\n\r\nwelfare = [int(c) for c in input().split()]\r\n\r\nmaximum = max(welfare)\r\nans = 0\r\n\r\nfor w in welfare:\r\n ans+=(maximum-w)\r\n \r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif len(a)==1:\r\n print(0)\r\nelse:\r\n t=max(a)\r\n s=len(a)*t\r\n print(s-sum(a))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=max(b)\r\ns=sum(b)\r\nprint((a*c)-s)", "a=int(input())\r\nx=list(map(int,input().split()))\r\nm=max(x)\r\ns=0\r\nfor i in range(a):\r\n s=s+(m-x[i])\r\nprint(s)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na_max=max(a)\r\na_sum=sum(a)\r\nprint(n*a_max-a_sum)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_burles = max(a)\r\ntotal = 0\r\n\r\nfor i in a:\r\n total += abs(max_burles - i)\r\n\r\nprint(total)\r\n", "gr = int(input())\r\nz = 0\r\ncol = 0\r\na = list(map(int,input().split()))\r\nfor i in range(gr):\r\n if a[i]>z:\r\n z = a[i]\r\nfor i in range (gr):\r\n col +=(z - a[i])\r\nprint(col)\r\n", "n = int(input())\narr = [int(i) for i in input().split()]\narr.sort()\n\nans = 0\nfor i in range(n):\n ans += arr[n-1] - arr[i]\n\nprint(ans)\n\t \t \t\t \t \t\t \t\t \t \t", "a=int(input())\r\nb=[int (i) for i in input().split()]\r\nc=max(b)\r\nk=0\r\nx=0\r\nl=0\r\nb.remove(c)\r\nwhile k<=len(b)-1 :\r\n l=c-b[k] \r\n x=x+l\r\n k+=1\r\nprint(x)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = 0\r\nc = max(a)\r\nfor i in a:\r\n b+=c-i\r\nprint(b)", "t = int(input())\r\na = list(map(int, input().split()))\r\nmax1 = max(a)\r\nsum = 0\r\nfor i in a:\r\n sum += (max1-i)\r\n \r\nprint(sum)", "input()\r\ns = [x for x in map(int,input().split())]\r\nS = 0\r\nfor i in s:\r\n S += max(s)-i\r\nprint(S)", "n = int(input())\r\na =[int(x) for x in input().split()]\r\ncount = 0\r\nfor i in range(len(a)):\r\n c = max(a)-a[i]\r\n count = count + c\r\nprint(count)", "# Read input\r\nn = int(input())\r\nwealth = list(map(int, input().split()))\r\n\r\n# Calculate the total wealth of all citizens\r\ntotal_wealth = sum(wealth)\r\n\r\n# Find the maximum wealth among citizens\r\nmax_wealth = max(wealth)\r\n\r\n# Calculate the minimum charges required\r\nminimum_charges = (max_wealth * n) - total_wealth\r\n\r\n# Print the result\r\nprint(minimum_charges)\r\n", "k=int(input())\r\nman=list(map(int,input().split()))\r\nmax=0\r\ncount=0\r\nfor i in range(len(man)):\r\n\tif(man[i]>max):\r\n\t\tmax=man[i]\r\nfor i in range(len(man)):\r\n\tif(man[i]<max):\r\n\t\tcount+=(max-man[i])\r\n\t\tman[i]+=(max-man[i])\r\n\t\t\r\n\t\t\r\nprint(count)\r\n\t", "n = int(input())\r\narr = list(map(int,input().split()))\r\nc = max(arr)\r\nd = 0\r\nfor i in arr:\r\n d = d + abs(c - i)\r\nprint(d)", "n=int(input())\r\ns=list(map(int,input().split(\" \")))\r\ns.sort();s=list(s);c=0\r\nm=max(s)\r\nfor i in s:\r\n if i!=m:\r\n d=m-i\r\n c=c+d\r\nprint(c)", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nmax_val = arr[n-1]\r\nsum_diff = 0\r\n\r\nfor i in range(n-1):\r\n sum_diff += abs(max_val - arr[i])\r\n\r\nprint(sum_diff)", "number_of_citizens = int(input())\r\ncitizens = sorted(list(map(int, input().split())))\r\nc = 0\r\nfor e in citizens:\r\n c += citizens[-1] - e\r\n\r\nprint(c)", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nli.sort()\r\nans = 0\r\nfor i in range(len(li)):\r\n ans += li[len(li) - 1] - li[i]\r\nprint(ans)", "def solve(l):\r\n summ = 0\r\n mx = max(l)\r\n for i in range(len(l)):\r\n summ += (mx - l[i])\r\n return summ\r\n \r\n \r\n \r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nprint(solve(l))\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\nsum=0\r\nfor i in a:\r\n sum=sum+(m-i)\r\nprint(sum) ", "a=int(input())\r\nl=list(map(int,input().split()))\r\na = max(l)\r\ntotal=0\r\nfor i in l:total+=(a-i)\r\nprint(total)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nma = max(l)\r\ncount = 0\r\nfor i in l:\r\n count += ma - i\r\n\r\nprint(count)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\n\r\nmax_wealth = max(wealth)\r\nmin_charges = sum(max_wealth - w for w in wealth)\r\n\r\nprint(min_charges)\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\no = max(b)\r\ncnt = 0\r\nfor i in range(a):\r\n cnt += o - b[i]\r\nprint(cnt)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nh=0\r\nfor i in range(n):\r\n h+=(m-l[i])\r\nprint(h)\r\n \r\n \r\n ", "input()\r\nlst = [int(x) for x in input().split()]\r\nprint(max(lst) * len(lst) - sum(lst))", "def int_list_input():\r\n return(list(map(int,input().split())))\r\n\r\nn = int(input())\r\na = int_list_input()\r\n\r\nmx = max(a)\r\nres=0\r\nfor i in range(n):\r\n res+=mx-a[i]\r\nprint(res)", "n=int(input())\r\narr=list(map(int,input().split()))\r\np=max(arr)\r\nprint(sum(p-el for el in arr))", "a=int(input())\r\nentered_list = input().split()\r\nnum_list = list(map(int, entered_list))\r\n#print(num_list)\r\nc=max(num_list)\r\nresult=0\r\nfor i in num_list:\r\n result+=(c-i)\r\nprint(result)", "def main(list):\r\n maximum = max(list)\r\n res = 0\r\n for el in list:\r\n if el<maximum:\r\n c = maximum-el\r\n res+=c\r\n \r\n return res \r\n\r\ninput()\r\nprint(main([int(i) for i in input().split()]))", "maxi = 0\r\ns = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(maxi)\r\nelse:\r\n maxi = max(a);\r\n \r\n for i in a:\r\n s += maxi - i\r\n print(s)", "# Holiday of equality\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmax = a[0]\r\nfor i in range(1, n):\r\n if a[i] > max:\r\n max = a[i]\r\nsum = 0\r\nfor i in range(n):\r\n sum += max - a[i]\r\nprint(sum)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\na=max(list1)\r\nsum1=0\r\nfor x in list1:\r\n sum1+=a-x\r\nprint(sum1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(max(a)*n - sum(a))\r\n", "v1=int(input())\r\nv2=list(map(int,input().split()))\r\nif v1==1:\r\n print(0)\r\nelse:\r\n w=max(v2)\r\n c=0\r\n for i in v2:\r\n c+=(w-i)\r\n print(c)", "citnum = int(input())\r\nwelarr = input().split(\" \")\r\nfor i in range(citnum):\r\n welarr[i] = int(welarr[i])\r\ncost = 0\r\n\r\ndef get_largest_integer(arr):\r\n if len(arr) == 0:\r\n return None\r\n else:\r\n largest = arr[0]\r\n for num in arr:\r\n if num > largest:\r\n largest = num\r\n return largest\r\nbest = get_largest_integer(welarr)\r\nfor i in range(citnum):\r\n cost += best-welarr[i]\r\nprint(cost)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nb=0\r\nfor i in range(len(a)):\r\n b+=a[-1]-a[i]\r\nprint(b)", "n = input()\r\nsum = list(map(int,input().split()))\r\nr = 0\r\nm = max(sum)\r\nfor i in sum:\r\n r += m-i\r\n\r\nprint(r)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nsu=0\r\nfor i in range(n-1):\r\n su+=lst[-1]-lst[i]\r\nprint(su)\r\n", "t=int(input(\"\"))\r\nx=input(\"\")\r\nl=x.split(\" \")\r\nc,d=0,[]\r\nfor i in l:\r\n d.append(int(i))\r\nd.sort()\r\nfor j in d:\r\n c+=d[-1]-j\r\nprint(c)", "a=input()\r\ngor=list(sorted(map(int,input().split())))\r\nbogat=max(gor)\r\nscolko_dast=0\r\nfor money in gor:\r\n scolko_dast+=bogat-money\r\nprint(scolko_dast)\r\n", "n=input()\r\nn=list(map(int,input().split(\" \")))\r\ny=0\r\nfor x in n:\r\n\twhile x!=max(n):\r\n\t\ta=max(n)-x\r\n\t\ty=y+a\r\n\t\tx=x+a\r\nprint(y)", "citizens, welfare = int(input()), str(input())\r\nlist_welfare, res = [int(i) for i in welfare.split()], 0\r\n\r\nfor i in list_welfare: \r\n if i < max(list_welfare): res += (max(list_welfare) - i)\r\n\r\nprint(res)\r\n", "citizens = int(input())\r\nwelfare_list = list(map(int, input().split()))\r\nmax_number = 0\r\nsum_burls = 0\r\nfor citizen in welfare_list:\r\n if citizen >= max_number:\r\n max_number = citizen\r\nfor i in range(len(welfare_list)):\r\n if welfare_list[i] < max_number:\r\n sum_burls += (max_number - welfare_list[i])\r\nprint(sum_burls)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=max(set(a))\r\nprint(sum(b-i for i in a))\r\n", "n=int(input())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nx.sort()\r\nf=sum(x)\r\nf=f-x[len(x)-1]\r\nif len(x)==1:\r\n print(0)\r\nelse:\r\n print(x[len(x)-1]*(len(x)-1)-f)", "n = int(input())\r\na = input().split()\r\na = [int(i) for i in a]\r\nmx = max(a)\r\ncnt = 0\r\nfor i in range(len(a)):\r\n if a[i] < mx:\r\n cnt += (mx - a[i])\r\nprint(cnt)", "n=int(input())\r\nl=[]\r\nl=list(map(int,input().split()))\r\nma=0\r\nans=0\r\nfor x in l:\r\n ma=max(ma,x)\r\nfor x in l:\r\n ans+=(ma-x)\r\nprint(ans)", "n=int(input())\r\na=[int(s) for s in input().split()]\r\nmm=max(a)\r\ns=0\r\nfor i in a:\r\n s+=mm-i\r\nprint(s)\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 = list(map(int, input().split()))\r\nans = n * max(a) - sum(a)\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmx=max(a)\r\nc=0\r\nfor i in range(n):\r\n c=c+(mx-a[i])\r\nprint(c)", "n=int(input())\r\nmoney=list(map(int,input().split()))\r\ncount=0\r\nmoney.sort()\r\nt=money[-1]\r\n\r\nfor i in money:\r\n if i<t:\r\n count+=t-i\r\nprint(count)\r\n", "n=int(input())\r\nls=list(map(int,input().split()))\r\nk=max(ls)\r\nsum=0\r\nfor i in range(n):\r\n if(ls[i]!=k):\r\n sum+=(k-ls[i])\r\nprint(sum)", "t = int(input())\r\nl = list(map(int,input().strip().split()))\r\nmx = max(l)\r\nc = 0\r\nfor i in l:\r\n c += mx -i\r\nprint(c)", "r=int(input())\r\n*x,=map(int, input().split())\r\nprint(r*max(x)-sum(x))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nc=0\r\nfor e in range(n):\r\n for t in x: \r\n if x[-1]!=x[e]:\r\n a=x[-1]-x[e]\r\n c+=a\r\n e+=1\r\n if x[-1]==x[-1]:\r\n break\r\nprint(c) ", "f=int(input())\r\ng=list(map(int,input().strip().split()))[:f]\r\nprint(max(g)*f-sum(g))", "n = int(input())\r\nk = [int(x) for x in input().split()]\r\nk.sort()\r\nc = 0\r\nfor i in range(len(k)-1):\r\n c = c+(k[-1]-k[i])\r\n\r\nprint(c)\r\n", "n=int(input())\r\nx=list(map(int, input().split(\" \")))\r\nx1=max(x)\r\nsum=0\r\nfor i in range(len(x)):\r\n if x[i]!=x1:\r\n k=x1-x[i]\r\n sum+=k\r\n\r\nprint(sum)\r\n", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the welfare of each citizen and store it in a list\r\nwelfare = list(map(int, input().split()))\r\n\r\n# Find the maximum welfare among the citizens\r\nmax_welfare = max(welfare)\r\n\r\n# Calculate the total amount needed to equalize welfare\r\ntotal_expense = sum(max_welfare - w for w in welfare)\r\n\r\n# Print the total expense\r\nprint(total_expense)\r\n", "t = int(input())\na = list(map(int, input().split()))\nmax1 = max(a)\nsum = 0\nfor i in a:\n sum += (max1-i)\n \nprint(sum)\n \t\t\t\t \t\t \t \t \t \t\t \t\t \t", "n=int(input())\r\nx=list(map(int,input().split()))\r\nprint(max(x)*n-sum(x))\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nm=max(l)\r\nl1=[m-i for i in l]\r\nprint(sum(l1))", "n = int(input())\r\na = []\r\na += map(int, input().split())\r\nst, al = max(a), 0\r\nfor i in range(n):\r\n al += st - a[i]\r\nprint(al)\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nsum=0\r\na=max(y)\r\nfor i in y:\r\n sum=sum+(a-i)\r\nprint(sum)", "n=int(input())\r\nw=list(map(int,input().split()))\r\nwm=max(w)\r\nexp=0\r\n\r\nfor i in range(0,n):\r\n exp+=(wm-w[i])\r\n\r\nprint(exp)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=max(a)\r\nw=0\r\nfor i in a:\r\n w=w+i\r\nprint((b*n)-w)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_wealth = max(a)\r\ntotal_spent = sum(max_wealth - wealth for wealth in a if wealth < max_wealth)\r\n\r\nprint(total_spent)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\na=max(list1)\r\nu=0\r\nfor i in list1:\r\n if i<=a:\r\n r=a-i\r\n u+=r\r\nprint(u) \r\n", "m=int(input())\r\na=list(map(int,input().strip().split()))\r\nb=max(a)\r\nc=0\r\nfor i in a:\r\n d=b-i\r\n c=c+d\r\nprint(c)", "l = int(input())\r\nn = list(map(int, input().split()))\r\nmaxN = max(n)\r\nres = 0\r\nfor i in range(l):\r\n res += maxN-n[i]\r\nprint(res)", "n=int(input())\r\nlis=list(map(int,input().strip().split()))\r\nma=max(lis)\r\ns=0\r\nfor i in lis:\r\n s=s+(ma-i)\r\nprint(s)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=max(l)\r\nprint(n*k-sum(l))\r\n \r\n \r\n\r\n", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\nrex = max(a)\r\n\r\nc = 0\r\nfor i in a:\r\n if i < rex:\r\n c += rex-i\r\nprint(c)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=max(arr)\r\nc=0\r\nfor i in arr:\r\n c+=abs(i-m)\r\nprint(c)\r\n\r\n", "n = int(input())\r\nal = input().split()\r\nal = [int(x) for x in al]\r\nmax = -1\r\nfor a in al:\r\n if a>max:\r\n max = a\r\n\r\nsum = 0\r\nfor a in al:\r\n if a<max:\r\n sum += max - a\r\n\r\nprint(sum)", "n = int(input())\r\ncnt = 0\r\nx = [int(a) for a in input().split()]\r\nb = max(x)\r\nfor i in x:\r\n cnt += b - i\r\nprint(cnt)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_welfare = max(a)\r\ntotal_spent = sum(max_welfare - welfare for welfare in a)\r\nprint(total_spent)\r\n", "a=int(input())\r\nc=list(map(int,input().split()))\r\nprint(max(c)*(a)-sum(c))", "start=int(input())\r\n\r\nzz=list(map(int,input().split()))\r\nmac=(max(zz))\r\nto=0\r\nfinal=0\r\nfor i in range(start):\r\n final+=(mac-int(zz[i]))\r\n \r\nprint(final)", "while True:\r\n try:\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n sum = 0\r\n\r\n arr.sort()\r\n max_val = arr[-1]\r\n\r\n for i in range(n - 1):\r\n sum += abs(max_val - arr[i])\r\n\r\n print(sum)\r\n\r\n except EOFError:\r\n break\r\n", "n = int(input())\r\nm = list(map(int,input().split()))\r\nmax=0\r\ncost=0\r\nfor i in range(n):\r\n if m[i]>max:\r\n max=m[i]\r\nfor i in range(n):\r\n cost=max-m[i]+cost\r\n\r\nprint(cost)", "n = int(input())\r\nu = 0\r\ng = list(map(int,input().split()))\r\nc = max(g)\r\nfor i in g :\r\n u += c - i\r\nprint(u)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nma=max(l)\r\nsum=0\r\nfor i in l:\r\n sum+=abs(ma-i)\r\nprint(sum)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxb = max(a)\r\n\r\nprint(sum(map(lambda e: abs(maxb - e), a)))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nct=0\r\nfor i in l:\r\n ct+=m-i\r\nprint(ct) ", "n = int(input())\r\nw = input().split()\r\nfor i in range(n):\r\n w[i] = int(w[i])\r\ntarget_welfare = max(w)\r\nspend = 0\r\nfor i in w:\r\n spend += (target_welfare-i)\r\nprint(spend)\r\n", "t=int(input())\r\nlst=list(map(int,input().split()))\r\nm=max(lst)\r\nm*=t\r\ns=sum(lst)\r\nprint(m-s)", "#basically add till all equal \r\ndef berlandchad(lst):\r\n count=0\r\n g=max(lst)\r\n for x in lst:\r\n count+=(g-x)\r\n return count\r\nn=int(input())\r\nx=input()\r\nalist=[int(f) for f in x.split()]\r\nprint(berlandchad(alist))", "\r\n\r\nn = int(input())\r\na = list(map(int, input().split(\" \")))[:n]\r\nm = max(a)\r\nsum = 0\r\nfor i in a:\r\n x = m-i\r\n sum += x\r\n\r\nprint(sum)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n= int(input())\r\nl=[int(x) for x in input().split()]\r\nM=max(l)\r\nres=[M-x for x in l]\r\nprint(sum(res))", "n=int(input())\r\nwelfares=list(map(int,input().split()))\r\noutput=0\r\nfor i in welfares:\r\n output+=(max(welfares)-i)\r\nprint(output)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nburles = 0\r\nz = max(lis)\r\nfor i in lis:\r\n burles += z - i\r\nprint(burles)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a)\r\nprint(m * n - sum(a))\r\n", "\r\ndef spend():\r\n n = input()\r\n data = list(map(int, input().split()))\r\n mx = max(data)\r\n coin = []\r\n for x in data:\r\n coin.append(mx-x)\r\n return(sum(coin))\r\nprint(spend())", "\r\nn = int(input())\r\nmas = list(map(int,input().split()))\r\nmx = max(mas)\r\nans = 0 \r\nfor i in range(n):\r\n ans += abs(mas[i] - mx)\r\nprint(ans)", "n=int(input())\r\ncnt=0\r\n\r\nnumList = list(map(int, input().split()))\r\n\r\nmaxval = max(numList)\r\nfor x in range(n):\r\n cnt+=maxval-numList[x]\r\nprint(cnt)", "n = input()\r\ns = list(map(int,input().split()))\r\na = 0\r\nm = max(s)\r\n\r\nfor i in s :\r\n if i != m :\r\n a+=m-i\r\n \r\n else :\r\n continue\r\nprint(a) ", "n = int(input())\r\nwelfare_values = list(map(int, input().split()))\r\nmax_welfare = max(welfare_values)\r\ntotal_spent = 0\r\nfor welfare in welfare_values:\r\n total_spent += max_welfare - welfare\r\n\r\nprint(total_spent)", "def solve():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n max = 0\r\n for num in arr: \r\n if num > max: \r\n max = num\r\n \r\n total = 0 \r\n for num in arr: \r\n total += max - num \r\n \r\n print(total) \r\n\r\nsolve()", "n = input()\r\nw = list(map(int, input().split()))\r\n\r\nif len(set(w)) == 1:\r\n print(0)\r\nelse:\r\n print(sum([max(w) - i for i in w]))", "n=int(input())\r\ns=list(map(int,input().split()))\r\n\r\nm=max(s)\r\nsum=0\r\nfor elements in s:\r\n sum=sum+m-elements\r\n\r\nprint(sum)", "a=int(input())\r\nhitler=list(map(int,input().split()))\r\nc=max(hitler)\r\ncount=0\r\nfor i in hitler:\r\n count+= c-i\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=max(l)\r\nq=0\r\nfor i in l:\r\n q+=(a-i)\r\nprint(q)", "count_people = int(input())\r\nwelfare_list = list(map(int, input().split()))\r\n\r\nmax_welfare = welfare_list[0]\r\nfor cur_welfare in welfare_list:\r\n if cur_welfare > max_welfare:\r\n max_welfare = cur_welfare\r\n\r\nallowance_sum = 0\r\nfor cur_welfare in welfare_list:\r\n if cur_welfare < max_welfare:\r\n allowance_sum += max_welfare - cur_welfare\r\nprint(allowance_sum)\r\n\r\n", "n, a = int(input()), [int(i) for i in input().split()]\nres = sum(max(a) - i for i in a)\nprint(res)\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\ndef max(lst):\r\n if len(lst)==1:\r\n return lst[0]\r\n else:\r\n hd,tl=lst[0],lst[1:]\r\n if hd<lst[1]:\r\n return(max(tl))\r\n else:\r\n return(max([hd]+tl[1:]))\r\nk=max(x)\r\nr=0\r\nfor i in range(n):\r\n r=r+abs(k-x[i])\r\nprint(r)\r\n", "n = int(input())\r\nT = list(map(int, input().split()))\r\nm = max(T)\r\nsomme = 0\r\nfor i in range(n):\r\n if T[i]!=m:\r\n somme += m-T[i]\r\nprint(somme)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n b=max(a)-i\r\n c+=b\r\nprint(c)", "n = int(input(\"\"))\r\ninp = list(map(int,input(\"\").split()))\r\ninp = sorted(inp)\r\nt = inp[-1]\r\ncount = 0\r\nfor j in inp:\r\n if j<t:\r\n count+=(t-j)\r\n else:\r\n continue\r\nprint(count)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmx=max(l)\r\ns=0\r\nfor i in l:\r\n s=s+(mx-i)\r\nprint(s)", "n=int(input())\na=list(map(int,input().split()))\nc=0\nfor i in a:\n c=c+(max(a)-i)\nprint(c)\n \t\t \t\t\t \t \t \t\t \t\t\t \t\t \t\t", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nx = max(s)\r\nans = x*n - sum(s)\r\nprint(ans)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\n\r\nmax_wealth = max(wealth)\r\ntotal_spending = 0\r\nfor w in wealth:\r\n total_spending += max_wealth - w\r\n\r\nprint(total_spending)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=max(a)\r\ncount=0\r\nfor _ in a:\r\n x=b-_\r\n count+=x\r\nprint(count)", "gp=int(input())\r\nmad=list(map(int,input().split()))\r\nbf=mad[0]\r\nbn=0\r\nfor z in range(1,gp):\r\n bf=max(mad[z],bf)\r\nfor z in range(0,gp):\r\n bn+=(bf-mad[z])\r\nprint(bn)", "# https://codeforces.com/problemset/problem/758/A\r\n\r\ndef main():\r\n n = int(input())\r\n s = tuple(map(int, input().split(' ')))\r\n _max = max(s)\r\n result = 0\r\n for i in s:\r\n result += abs(i - _max)\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#https://codeforces.com/problemset/problem/758/A\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncont = 0\r\nfor k in range(len(a) - 1, -1, -1):\r\n cont += ((a[len(a) - 1]) - a[k] )\r\n\r\nprint(cont)", "t = int(input())\r\ns = input().split()\r\ndat = []\r\n\r\nfor char in s:\r\n dat.append(int(char))\r\n\r\ntot = max(dat)\r\n\r\nans = 0\r\n\r\nfor ele in dat:\r\n ans += tot - ele\r\n\r\nprint(ans)", "_len = int(input())\r\nc = [int(i) for i in input().split(\" \")]\r\n\r\nm = max(c)\r\nc.remove(m)\r\n\r\nt = 0\r\n\r\nfor i in c:\r\n t+=m-i\r\nprint(t)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = max(a)\r\nd = 0\r\nfor i in range(len(a)):\r\n if a[i] < b:\r\n d += b - a[i]\r\nprint(d)", "n=int(input())\r\na=[int(i) for i in input().split()][:n]\r\nif n==1:\r\n print(\"0\")\r\nelse:\r\n s=0\r\n b=max(a)\r\n for i in a:\r\n if i!=b:\r\n s+=(b-i)\r\n print(s)", "input() ; l = list(map(int,input().split())) ; m = max(l) ; print(sum([abs(m-i) for i in l]))", "def solution(n,arr):\r\n ans=0\r\n maxi=max(arr)\r\n for i in arr:\r\n ans+=(maxi-i)\r\n print(ans)\r\n return\r\n pass\r\n\r\nn=int(input())\r\narr=list(map(int, input().split()))\r\nsolution(n,arr)", "def min_charges_to_equalize_welfare(n, welfare):\n total_welfare = sum(welfare)\n max_welfare = max(welfare)\n min_charges = max_welfare * n - total_welfare\n return min_charges\n\n\nn = int(input())\nwelfare = list(map(int, input().split()))\n\nresult = min_charges_to_equalize_welfare(n, welfare)\nprint(result)\n\n \t \t \t \t\t \t\t\t\t\t \t \t\t\t\t\t\t\t", "input()\narray = input().split(\" \")\n\nfor i in range(len(array)):\n\tarray[i] = int(array[i])\n\naccumulator = 0\nmaximus = max(array)\n\nfor i in range(len(array)):\n\taccumulator += maximus - array[i]\n\nprint(accumulator)\n \t \t\t\t\t \t\t\t \t\t\t \t \t\t\t \t", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nm=l[-1]\r\nsum=0\r\nfor i in range(0,len(l)-1):\r\n sum+=m-l[i]\r\nprint(sum)\r\n", "l = int(input())\r\nlst = map(int, input().split())\r\n\r\nhighest = 0\r\ntotal = 0\r\nfor each in lst:\r\n highest = max(each, highest)\r\n total += each\r\nprint( (l*highest) - total)\r\n", "n = int(input())\r\nd = [int(i) for i in input().split()]\r\ns = max(d)\r\nf = 0\r\nfor i in d:\r\n f += s - i\r\nprint(f)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "tests = int(input())\r\n\r\nnumbers = list(map(int,input().split(\" \")))\r\n\r\nmax_num = max(numbers)\r\n\r\nprint(sum([max_num - i for i in numbers]))", "\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\nlarge=max(arr)\r\ntotal=0\r\nfor i in arr:\r\n total=total+(large-i) \r\n\r\nprint(total)", "def min_gift_cost(n, citizens):\r\n max_wealth = max(citizens)\r\n total_cost = sum(max_wealth - wealth for wealth in citizens)\r\n return total_cost\r\n\r\ndef main():\r\n n = int(input())\r\n citizens = list(map(int, input().split()))\r\n\r\n result = min_gift_cost(n, citizens)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nll=list(map(int,input().split()))\r\nprint(max(ll)*n-sum(ll))", "n = int(input())\r\nres = 0\r\nx = [int(x) for x in input().split()]\r\nx.sort(reverse=True)\r\nfor i in range(1, n):\r\n if x[i] < x[0]:\r\n tk = x[0] - x[i]\r\n res += tk\r\nprint(res)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nl=[]\r\nmaxi=max(arr)\r\narr.remove(maxi) \r\nfor i in arr:\r\n diff=maxi-i \r\n l.append(diff) \r\nsum=0 \r\nfor i in l:\r\n sum=sum+i \r\nprint(sum)", "t = int(input())\r\nl = list(map(int,input().split()))\r\nmn = max(l)\r\nsum = 0\r\nfor i in l:\r\n sum += mn-i\r\nprint(sum)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmx = max(a)\r\nprint(n * mx - sum(a))\r\n", "n = int(input())\nsum = 0\nv = list(map(int,input().split()))\n\nfor el in v:\n sum += abs(el-max(v))\n\nprint(sum)\n \t \t \t\t \t\t\t \t", "n=int(input()) ; b=list(map(int,input().split())) ; c=0\r\nfor i in b:\r\n if i !=max(b):\r\n c+=abs(i-max(b))\r\n else:\r\n continue\r\nprint(c)", "n = int(input())\nmass = list(map(int, input().split()))\nmax_man = max(mass)\nres = 0\nfor i in mass:\n res += max_man - i\nprint(res)", "n = int(input())\r\nls = list(map(int,input().split()))\r\na = max(ls)\r\nans = 0\r\nfor i in ls:\r\n ans += (a - i)\r\nprint(ans) ", "n=int(input())\nl=input().split(' ')\nb=0\ns=0\nfor i in l:\n s+=int(i)\n if int(i)>b:\n b=int(i)\nprint(n*b-s)\n", "n=int(input())\r\nlist=list(map(int, input().split()))\r\nk=max(list)\r\ncost=0\r\nfor i in range(n):\r\n cost+=(k-list[i])\r\nprint(cost)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = max(a)\r\nans = 0 \r\nfor x in a :\r\n ans+= (b - x )\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = sum(l)\r\nl.sort()\r\ns -= l[n-1]\r\nprint(l[n-1]*(n-1)-s)", "def intmap():\r\n return map(int, input().split())\r\nn = int(input())\r\nl = list(intmap())\r\nmx = max(l)\r\nresult = 0\r\nfor i in l:\r\n result += (mx -i) \r\nprint(result)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nmx= arr[0]\r\nfor i in arr:\r\n if i>mx: \r\n mx= i\r\n\r\nans = 0\r\nfor i in arr:\r\n ans+= mx-i\r\n\r\nprint(ans)\r\n\r\n \r\n ", "def holiday_of_equality(n, citizens):\r\n max_citizens = max(citizens)\r\n total_needed_coins = sum(max_citizens - citizen for citizen in citizens)\r\n return total_needed_coins\r\n\r\nn = int(input())\r\ncitizens = list(map(int, input().split())) \r\nresult = holiday_of_equality(n, citizens)\r\nprint(result)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+(m-l[i])\r\nprint(sum)", "n=int(input())\r\na = map(int, input().split())\r\na=list(a)\r\ns=[]\r\nb=0\r\nfor i in range (n):\r\n if a[i]<max(a):\r\n b=max(a)-a[i]\r\n s.append(b)\r\nprint(sum(s))", "n=int(input())\r\nq=[int(i) for i in input().split()]\r\nr=0;\r\nfor i in q:\r\n r+=max(q)-i\r\nprint(r)\r\n\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nlst=[]\r\ns = max(arr)\r\nans=0\r\nfor i in arr:\r\n lst.append(i)\r\nfor j in lst:\r\n s1 = abs(j-s)\r\n ans += s1\r\nprint(ans)", "n=int(input())\r\nliste=list(map(int,input().split()))\r\nmaximum=max(liste)\r\nliste.remove(max(liste))\r\nsomme=0\r\nfor element in liste:\r\n somme+=maximum-element\r\nprint(somme)", "n=int(input())\r\nt=list(map(int,input().split()))\r\nr=max(t)\r\ndengi=0\r\nj=0\r\nfor i in range(n):\r\n j+=(r-t[i])\r\nprint(j) ", "n=int(input())\r\na = list(map(int,input().split()))\r\nb = max(a)\r\ntotalL = 0\r\nfor i in a:\r\n totalL+=b-i\r\nprint(totalL)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmmax = max(arr)\r\nprint(sum([mmax - i for i in arr]))\r\n", "n = int(input())\r\np = input().split()\r\nr = int(p[0])\r\nq = 0\r\nfor i in range(n):\r\n if int(p[i])>r:\r\n r = int(p[i])\r\nfor j in range(n):\r\n q += r - int(p[j])\r\nprint(q)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nmm=max(a)\r\ns=0\r\nfor j in a:\r\n s+=mm-j\r\nprint(s)", "n = int(input())\r\ncit = list(map(int,input().split()))\r\nc = 0\r\ncit.sort()\r\nfor i in range(len(cit)-1):\r\n c += max(cit) - cit[i]\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\ns = 0\r\nfor i in a:\r\n s += a[-1]-i\r\nprint(s)\r\n", "def convert(l):\r\n l1=list()\r\n for i in l:\r\n l1.append(int(i))\r\n return(l1)\r\nx=int(input())\r\nch=input()\r\nl=ch.split(\" \")\r\nl1=convert(l)\r\nl2=list()\r\na=max(l1)\r\nfor i in l1:\r\n l2.append(a-i)\r\nprint(sum(l2))\r\n", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the welfare of each citizen and find the maximum welfare\r\nwelfare = list(map(int, input().split()))\r\nmax_welfare = max(welfare)\r\n\r\n# Calculate the total amount needed to equalize the welfare\r\ntotal_amount = sum(max_welfare - w for w in welfare)\r\n\r\n# Print the total amount\r\nprint(total_amount)\r\n", "n=int(input())\r\n\r\nwelfare=list(map(int,input().split()))\r\n\r\nm=max(welfare)\r\nS=0\r\n\r\nfor i in range(n):\r\n S+=m-welfare[i] \r\n\r\nprint(S)", "def solve():\r\n n = int(input())\r\n x = [int(x) for x in input().split(\" \", n)]\r\n temp = max(x)\r\n total = 0\r\n for i in range(len(x)):\r\n total += temp - x[i]\r\n return total\r\n\r\n\r\nprint(solve())\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = 0\r\nmax_x = max(x)\r\nfor i in x:\r\n if i < max_x:\r\n y += max_x - i\r\nprint(y)\r\n \r\n ", "a=int(input())\r\narr=list(map(int,input().split()))\r\nmx=max(arr)\r\nres=0\r\nfor i in range(a):\r\n res+=(mx-arr[i])\r\nprint(res)", "def main() -> None :\r\n print(burles_To_Spend(input_Welfares()))\r\n\r\n\r\ndef burles_To_Spend(welfares: list[int]) -> int :\r\n return sum(diffs(welfares, max(welfares)))\r\n\r\ndef diffs(array: list[int], base: int) -> list[int] :\r\n return list(map(lambda num: base-num, array))\r\n\r\n\r\ndef input_Welfares() -> list[int] :\r\n ignore_Line()\r\n return list(map(int, input().split()))\r\n\r\ndef ignore_Line() -> None :\r\n input()\r\n\r\n\r\nmain()", "count = int(input())\nfund = [int(num) for num in input().split()]\n\nmax1 = max(fund)\namount = 0\n\nfor val in fund:\n amount += (max1 - val)\n\nprint(amount)\n", "import sys\r\n\r\nelanikke = int(sys.stdin.readline())\r\n\r\nraha = list(map(int, sys.stdin.readline().split()))\r\n\r\nvastus = 0\r\nmaksimaalne = max(raha)\r\n\r\nfor i in range(len(raha)):\r\n vastus += maksimaalne - raha[i]\r\n\r\n#sys.stdout.write(\"\\n\".join(map(str, vastused)))\r\n\r\nsys.stdout.write(str(vastus))\r\n", "n = int(input())\r\nx = input().split()\r\nx = list(map(int, x))\r\nmaxn = max(x)\r\nit = 0\r\nfor i in range(n):\r\n it += maxn - x[i]\r\nprint(it)", "n=input()\r\ns=list(map(int,input().split()))\r\nprint(max(s)*len(s)-sum(s))", "def getmax(elements):\r\n max_val = elements[0]\r\n for i in elements:\r\n if i > max_val:\r\n max_val = i\r\n return max_val\r\n\r\ndef counter(elements, max_val):\r\n count = 0\r\n for i in elements:\r\n count += max_val - i\r\n return count\r\n\r\nn = int(input())\r\nelements = list(map(int, input().split(\" \")))\r\n\r\nmax_val = getmax(elements)\r\ncount = counter(elements, max_val)\r\nprint(count)", "import sys\nimport io,os\n\n\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n return(input().strip())\ndef invr():\n return(map(int,input().split()))\n\na=inp()\nb=inlt()\nmaximo=max(b)\ntot=0\nfor x in b:\n tot+=(maximo-x)\n \n#sys.stdout.write(str(tot) + \"\\n\")\nprint(tot)", "n = int(input())\r\ncount = 0\r\na = list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n maximum = max(a)\r\n count += maximum - a[i]\r\nprint(count)", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nm = max(b)\r\ncounter = 0\r\nfor i in b:\r\n counter += m - i\r\nprint(counter)\r\n\r\n\r\n", "spend = 0\r\nn = input()\r\ncitizens = list(map(int, input().split()))\r\nmax_value = max(citizens)\r\nfor citizen in citizens:\r\n if citizen < max_value:\r\n spend += max_value - citizen\r\nprint(spend)\r\n", "n = int(input())\r\ns = input().split()\r\nmx = 0\r\nans = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) > mx:\r\n mx = int(s[i])\r\nfor i in range(len(s)):\r\n ans = ans + mx - int(s[i])\r\nprint(ans)\r\n\r\n\r\n\r\n", "n = int(input())\r\nwalfares = list(map(int,input().split()))\r\nmax_walfare = max(walfares)\r\nmoney = 0\r\nfor i in walfares:\r\n money += max_walfare - i\r\nprint(money)", "p=int(input())\r\na=list(map(int,input().split()))\r\nk=max(a)\r\na.remove(k)\r\np=p-1\r\ns=p*k\r\nprint(s-(sum(a)))", "h=int(input())\r\nb=list(map(int,input().split()))\r\nq=[]\r\nfor i in range(len(b)):\r\n q+=[max(b)-b[i]]\r\nprint(sum(q))\r\n", "n = int(input())\r\nw = list(map(int,input().split()))\r\nb = w[:]\r\nfor i in range(len(w)):\r\n if w[i] != max(w):\r\n w[i] = w[i] + (max(w)-w[i])\r\nprint(sum(w)-sum(b))", "num = int(input())\nlista = list(map(int, input().split(' ')))\nm = max(lista)\n\nsum = 0\nfor num in lista:\n sum+= m-num\nprint(sum)", "t = int(input())\r\nx = list(map(int, input().split()))\r\na = 0\r\ns = 0\r\nfor i in range(t):\r\n if x[i] != max(x):\r\n s = max(x) - x[i]\r\n x[i] = x[i] + s\r\n a = a + s\r\n elif x[i] == max(x):\r\n continue\r\nprint(a)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nS = 0\r\na.sort()\r\na_max = a[len(a) - 1]\r\n\r\nfor i in a:\r\n S = S + (a_max - i)\r\nprint(S)", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\np = max(k)\r\nm = 0\r\nfor i in k:\r\n m += p-i\r\nprint(m)", "n = int(input())\na = list(map(int,input().split()))\nS = 0\nx = max(a)\nfor i in range(n):\n S += x-a[i]\nprint(S)\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\ntop = max(nums)\r\noutput = 0\r\nfor item in nums:\r\n output += top - item\r\nprint(output)", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=0\r\nfor a1 in a:\r\n if a1<max(a):\r\n q+=max(a)-a1\r\nprint(q)", "_ = input()\r\narr = list(map(int,input().split()))\r\na = max(arr) * len(arr) - sum(arr)\r\nprint(a)", "n = int(input())\r\nwelfare = [int(x) for x in input().split()]\r\nmaxi = max(welfare)\r\ntotal = 0\r\nfor item in welfare:\r\n if item < maxi:\r\n total += (maxi - item)\r\n\r\nprint(total)\r\n\r\n", "# Read the number of citizens\r\nn = int(input())\r\n\r\n# Read the welfare values of the citizens\r\nwelfare = list(map(int, input().split()))\r\n\r\n# Find the maximum welfare value\r\nmax_wealth = max(welfare)\r\n\r\n# Calculate the total expenses\r\ntotal_expenses = sum(max_wealth - wealth for wealth in welfare)\r\n\r\n# Print the total expenses\r\nprint(total_expenses)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nk=max(a)\r\ncount=0\r\nfor i in range(n):\r\n count=count+k-a[i]\r\nprint(count)", "input()\r\nls = list(map(int,input().split()))\r\nmx = max(ls)\r\nx = 0\r\nfor i in ls:\r\n x+=mx-i\r\nprint(x)", "# https://codeforces.com/problemset/problem/758/A\r\n\r\ncitizens = int(input())\r\nburles_per_citizen = list(map(int, input().split()))\r\n\r\nrichest_citizen_brules = max(burles_per_citizen)\r\n\r\nburles_required = (richest_citizen_brules * citizens) - sum(burles_per_citizen)\r\n\r\nprint(burles_required)\r\n", "n1=int(input())\r\nn2=[int(x) for x in input().split()]\r\nele=max(n2)\r\nsum=0\r\nfor i in n2:\r\n sum+=abs(i-ele)\r\nprint(sum)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 30 22:32:57 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\ny=list(map(int,input().split()))\r\nprint(n*max(y)-sum(y))", "T = int(input())\na = list(map(int, input().split()))\nn = 0\nm = max(a)\nprint(sum(m - i for i in a))\n \t \t \t \t\t \t \t \t\t\t \t \t \t", "ln = int(input())\r\na = list(map(int, input().split()))\r\nanswer = 0\r\n\r\na.sort()\r\nb = a[-1]\r\na.pop(-1)\r\nfor i in a:\r\n answer += b - i\r\nprint(answer)", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\ncount = 0\r\nfor i in range(n) :\r\n if s[i] == max(s) :\r\n continue \r\n else :\r\n count += (max(s)-s[i])\r\nprint(count)\r\n", "a = int(input())\ninp = input().split()\ntemp = 0\nsm = 0\n\n\nfor i in range(0, a):\n inp[i] = int(inp[i])\n sm = sm + inp[i]\n if inp[i] > temp:\n temp = inp[i]\n\nprint(a*temp-sm)", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\na=sorted(a)\r\nc=0\r\nfor i in range(n-1):\r\n c+=(a[-1]-a[i])\r\nprint(c)", "# LUOGU_RID: 135323254\nn = int(input())\r\nlis = list(map(int, input().split()))\r\ns = max(lis)\r\nprint(s * n - sum(lis))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmax_burley = max(a)\r\ncount = 0\r\nfor k in a:\r\n count += max_burley - k\r\nprint(count)", "# In the name of GOD\n\na = int(input())\n\nb = list(map(int, input().split()))\n\nmaxInput = 0\nans = 0\n\nfor i in range(a) : \n if maxInput < b[i] : \n ans += (b[i]-maxInput) * i\n maxInput = b[i]\n else :\n ans += (maxInput - b[i])\n\nprint(ans)\n", "citizens_num = int(input())\r\ncitizens_list = list(map(int, input().split()))\r\nsum = 0\r\nfor i in citizens_list:\r\n sum += max(citizens_list) - i\r\nprint(sum)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nc = 0\r\nfor i in A:\r\n c += max(A) - i\r\nprint(c)", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nsum = 0 \r\nfor i in li:\r\n sum+=(max(li)-i)\r\nprint(sum)", "input()\r\ncitizens = list(map(int, input().split()))\r\nmx = max(citizens)\r\nans = 0\r\nfor i in range(len(citizens)):\r\n ans += (mx - citizens[i])\r\nprint(ans)", "a=int(input())\r\nsum=0\r\nl=list(map(int,input().split(' ')))\r\nfor i in range(0,len(l)):\r\n a=max(l)\r\n sum=sum+(a-l[i])\r\nprint(sum)\r\n", "n=int(input())\r\nlst=[*map(int,input().split())]\r\nprint(max(lst)*n-sum(lst))", "n=int(input())\r\n\r\nl1=(list(map(int,input().split(' '))))\r\nmax=max(l1)\r\nsum=0\r\nfor i in range(len(l1)):\r\n\tsum+=max-l1[i]\r\nprint(sum)", "n = int(input())\r\ns = list(map(int, input().split(' ')))\r\nq = max(s)\r\nw = 0\r\nfor i in s:\r\n w += int(q) - int(i)\r\nprint(w)\r\n", "a = input()\n\n\nb = list(map(int, input().split()))\n\nb.sort()\n\nprint(sum([b[-1] - i for i in b]))", "a = int(input())\r\nc = input().split()\r\nfor i in range(len(c)):\r\n c[i] = int(c[i])\r\nc.sort()\r\nmaxc = c[len(c)-1]\r\nc = c[:len(c)-c.count(maxc):]\r\nk = 0\r\nfor i in c:\r\n k+= maxc-i\r\nprint(k)", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\ntotal = 0\r\n\r\nfor elem in lst:\r\n total += (max(lst) - elem)\r\n\r\nprint(total)\r\n", "num_of_people = int(input())\r\namt = list(map(int, input().split()))\r\nk = max(amt)\r\nif amt.count(k)!=0:\r\n amt.remove(k)\r\ns = 0\r\nfor i in amt:\r\n s+=k-i\r\nprint(s)", "length = int(input())\r\ncitizens = list(map(int, input().split()))\r\ngoal = max(citizens)\r\nx = 0\r\nfor i in range(length):\r\n x = x + (goal - citizens[i])\r\nprint(x)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nm = max(s)\r\ntotal = 0 \r\n\r\nfor i in s:\r\n x = m - i\r\n total += x\r\n\r\nprint(total)", "n = int(input()) \r\n# Read the number of citizens\r\nwelfare = list(map(int, input().split())) \r\n# Read the welfare of each citizen\r\n\r\nmax_welfare = max(welfare) \r\n# Find the maximum welfare\r\n\r\ntotal_spent = 0\r\n\r\nfor w in welfare:\r\n total_spent += max_welfare - w\r\n\r\nprint(total_spent)\r\n", "num = int(input())\r\nmoney = [int(x) for x in input().split()]\r\nmaximum = max(money)\r\ntotal = 0\r\nfor i in money:\r\n if i != maximum:\r\n total =total + maximum-i\r\nprint(total)", "n=input()\r\na=list(map(int,input().split()))\r\nm=max(a)\r\ncnt=0\r\nfor i in a:\r\n cnt+=m-i\r\nprint(cnt)", "# pega o max do vetor\n# vê o quando gasta pra igualar todos os elementos ao máx do vetor\n_ = input()\nentrada = input().split()\nentrada = [int(a) for a in entrada]\nmaximo = max(entrada)\ndiff = [abs(a-maximo) for a in entrada]\nprint(sum(diff))\n\n\t \t\t \t\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\nc=0\r\nif len(l)<2:\r\n print(0)\r\nelse:\r\n max=max(l)\r\n for i in l:\r\n if i<max:\r\n c+=max-i\r\n print(c)\r\n", "n=int(input())\r\nq=input().split()\r\nmx=0\r\nkol=0\r\nfor i in q:\r\n mx=max(mx,int(i))\r\nfor t in q:\r\n kol+=(mx-int(t))\r\nprint(kol)\r\n", "n=int(input())\r\na=input().split()\r\ncount=0\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\na=sorted(a)\r\nfor j in range(len(a)-1):\r\n count+=(a[-1]-a[j])\r\nprint(count)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=max(l)\r\ns=0\r\nfor i in l:\r\n s+=(k-i)\r\nprint(s)", "n = int(input())\r\nk = list(map(int,input().split()))\r\ncount = 0\r\n\r\nif n == len(k):\r\n for i in k:\r\n burles = max(k)-i\r\n count += burles\r\nprint(count)", "import sys\nimport io,os\ni=0\nnumbers=[[],[]]\nfor line in io.BytesIO(os.read(0,os.fstat(0).st_size)):\n numbers[i] = [int(x) for x in line.strip().split()]\n i+=1\n\nmaximo=max(numbers[1])\ntot=0\nfor x in numbers[1]: \n tot+=(maximo-x)\n\nsys.stdout.write(str(tot) + \"\\n\")", "input()\r\nl = list(map(int,input().split()))\r\nans = 0\r\nn = max(l)\r\nfor x in l: ans += n-x\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nma=max(l)\r\ns=0\r\nfor i in l:\r\n t=ma-i\r\n s=s+t\r\nprint(s)\r\n\r\n\r\n", "_ = input()\r\n\r\narr = list(map(int, input().split()))\r\n\r\nmax_amt = max(arr)\r\namount = 0\r\n\r\nfor v in arr:\r\n\tamount += (max_amt - v)\r\n\r\nprint(amount)", "import sys\r\nimport math\r\n\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #t = int(input())\r\n t = int(input())\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n result = 0\r\n if t>1:\r\n m = max(a)\r\n for i in range(0, t):\r\n if a[i]<m:\r\n result += m-a[i]\r\n print(result)\r\n \r\nmain()\r\n", "n = int(input())\nA = tuple(map(int, input().split(' ')))\n\nmax_a = max(A)\ns = 0\nfor a in A:\n s += max_a - a\nprint(s)\n", "s = int(input())\r\nsomething = sorted([int(x) for x in input().split()])\r\ntemp = something[-1] * (s-1)\r\nsomething = sum(something[:-1])\r\nprint(temp-something)\r\n\r\n", "# Sarievo.\r\n# URL: https://codeforces.com/problemset/problem/758/A\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n maxn = max(a)\r\n sum = 0\r\n for e in a:\r\n sum += maxn - e\r\n print(sum)\r\n\r\ncases = 1\r\n# cases = int(input())\r\nfor _ in range(cases):\r\n solve()", "n = int(input())\r\nnumbers = list(map(int, input().split(' ')))\r\n\r\nmax_element = max(numbers)\r\nli=[]\r\nfor num in numbers:\r\n difference = max_element-num\r\n li.append(difference)\r\nprint(sum(li))", "from collections import Counter\r\nimport math\r\n\r\ninput()\r\nls = list(map(int, input().split()))\r\nmx = ls[0]\r\nfor item in ls:\r\n mx = max(mx, item)\r\nans = 0\r\n\r\nfor item in ls:\r\n ans += mx - item\r\n\r\nprint(ans)", "n=int(input())\r\nl1=[]\r\nl1.append(input().split())\r\n\r\nl2=[]\r\nfor i in range(n):\r\n l2.append(int(l1[0][i]))\r\n\r\nl2.sort()\r\nsum=0\r\nfor i in range(n-1):\r\n sum=sum+l2[i]\r\nprint((n-1)*l2[-1]-sum)", "n = int(input())\r\na_lst = sorted(list(map(int,input().split())))\r\nmax_num = a_lst[-1]\r\nuse_money = max_num*n - sum(a_lst)\r\nprint(use_money)", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\nmax_wealth = max(wealth)\r\ntotal_cost = 0\r\nfor w in wealth:\r\n total_cost += max_wealth - w\r\nprint(total_cost)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmaxi=max(l)\r\nans=0\r\nfor i in l:\r\n ans=ans+maxi-i\r\nprint(ans)", "n = int(input())\nb = list(map(int, input().split()))\ncnt = 0\nlk = max(b)\nfor i in b:\n if i != lk:\n cnt += lk - i\nprint(cnt)", "n = int (input())\r\nl = list(map(int,input().split()))\r\nx = max(l)\r\nans = 0\r\nfor i in range(len(l)):\r\n if l[i] < x:\r\n ans+=x-l[i]\r\nprint(ans)", "x = int(input())\r\ny = [int(x) for x in input().split()]\r\nmx = max(y)\r\nbudget = 0\r\nfor citizen in y:\r\n if citizen < mx:\r\n diff = abs(citizen - mx)\r\n budget += diff\r\n\r\nprint(budget)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(len(a)):\r\n sum=sum+(max(a)-a[i])\r\nprint(sum)", "n = input()\r\na = [int(x) for x in input().split()]\r\n\r\nmx = max(a)\r\nres = 0\r\n\r\nfor i in a:\r\n res += (mx-i)\r\nprint(res)\r\n", "def main():\n\tn=int(input())\n\tarr = list(map(int,input().split()))\n\tarr.sort()\n\tres = 0\n\tmaxres = arr[len(arr)-1]\n\tfor i in arr:\n\t\tres += maxres - i\n\tprint(res)\n\nif __name__ == '__main__':\n\tmain()", "n = int(input()); count = 0\na = list(map(int, input().split()))\nb = max(a)\nfor i in a:\n count += (b - i)\n\nprint(count)", "# your code goes here\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\na=0\r\nfor i in range(len(l)):\r\n\tif(l[i]!=m):\r\n\t\ta=a+(m-l[i])\r\nprint(a)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = max(arr)\r\nc = 0\r\nfor i in arr:\r\n c = c + (m-i)\r\nprint(c)", "n = int(input())\r\ns = [i for i in map(int, input().split(maxsplit=n))]\r\nmax = max(s)\r\nsum = 0\r\nfor i in range(len(s)):\r\n sum += max - s[i]\r\nprint(sum)\r\n\r\n\r\n\r\n\r\n", "n = input()\r\na = list(map(int,input().split()))\r\nmaximum = max(a)\r\ntotal_cost = 0\r\nfor i in a:\r\n total_cost+=maximum-i\r\nprint(total_cost)", "i = int(input())\r\na = list(map(int, [*input().split(' ')]))\r\nmax = max(a)\r\nsum = sum(a)\r\nprint(max * i - sum)", "input()\na=[int(i) for i in input().split()]\nmaxi=max(a)\ncount=0\nfor i in a:\n count+=maxi-i\nprint(count)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=len(l)\r\nn=l[m-1]\r\nc=0\r\nfor i in range(0,m-1):\r\n if(l[i]<n):\r\n s=n-l[i]\r\n c=c+s\r\nprint(c)\r\n \r\n", "n = int(input())\r\nb = list(map(int, input().split()))\r\nc = max(b)\r\ncount = 0\r\nfor i in range(n):\r\n d = c - b[i]\r\n if d > 0:\r\n count += d\r\n b[i] += d\r\nprint(count)", "n = int(input())\r\npeople = list(map(int,input().split()))\r\nmaxi,money = int(max(people)),0\r\nfor i in people:\r\n money = money + abs(i-maxi)\r\nprint(money)", "def main(arr):\r\n return sum(max(arr) - arr[i] for i in range(len(arr)))\r\n\r\nif __name__ == \"__main__\":\r\n _ = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n print(main(arr))", "a=int(input())\r\nb=input()\r\nc=b.split()\r\nd=0\r\nmaxi=0\r\nfor i in range(len(c)):\r\n c[i]=int(c[i])\r\n maxi=max(maxi,c[i])\r\nfor n in range(len(c)):\r\n c[n]=int(c[n])\r\n d+=maxi-c[n]\r\nprint(d)", "n = int(input())\ndata = list(map(int, input().split(\" \")))\ncharge_for_each = data[0]\nfor i in range(n):\n if charge_for_each < data[i]:\n charge_for_each = data[i]\n\ncharges = 0\nfor i in range(n):\n charges += charge_for_each - data[i]\n\nprint(charges)", "def main():\r\n n = int(input())\r\n arr = list(map(int,input().split(' ')))\r\n arr.sort()\r\n diff = 0\r\n max_val = arr[-1]\r\n for i in arr:\r\n diff += max_val-i\r\n print(diff)\r\n\r\nmain()", "n = input()\r\nl = list(map(int,input().split()))\r\nm = max(l)\r\nc = 0\r\nl.remove(m)\r\nfor i in l:\r\n c+= m-i\r\nprint(c)", "input()\r\n\r\ns = list(map(int, input().split(\" \")))\r\n\r\nm = max(s)\r\n\r\nsum_ = 0\r\n\r\nfor i in s:\r\n sum_+= m-i\r\n\r\nprint(sum_)\r\n", "n = int(input())\r\nwelfare = list(map(int, input().split()))\r\n\r\n\r\ntotal_welfare = sum(welfare)\r\n\r\nmax_welfare = max(welfare)\r\n\r\nmin_burles = max_welfare * n - total_welfare\r\n\r\nprint(min_burles)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmx=max(l)\r\nres=0\r\nfor i in l:\r\n res+=(mx-i)\r\nprint(res)", "n = int(input())\nlst = list(map(int, input().split()))\nmaximum = max(lst)\nsum = 0\nfor i in lst:\n sum += i\nprint(maximum*n - sum)\n", "n, a = int(input()), list(map(int, input().split()))\r\nm = max(a)\r\nprint(sum([m - b for b in a]))", "n=int(input())\r\nwelfare = list(map(int,input().split()))\r\nmax_welfare = max(welfare)\r\ntotal_burles = 0\r\nfor w in welfare:\r\n total_burles += max_welfare-w\r\nprint(total_burles)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nmax=-999\r\nsum=0\r\nfor i in range(len(x)):\r\n if x[i]>max:\r\n max=x[i]\r\nfor i in range(len(x)):\r\n sum+=max-x[i]\r\nprint(sum)", "n=int(input())\r\nlt=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(len(lt)):\r\n s=max(lt)\r\n if lt[i]!=0 or lt[i]!=s:\r\n sum=sum+(s-lt[i])\r\nprint(sum)\r\n", "n = int(input())\r\na = [int(n) for n in input().split()]\r\nc = 0\r\nd = 0\r\n\r\nx = max(a)\r\n\r\nfor i in a:\r\n c = x - i\r\n d = d + c\r\n\r\nprint(d)", "input()\nS= 0\nA= list(map(int, input().split()))\nm= max(A)\nfor k in A:\n S+= m- k\nprint(S)\n", "n = int(input())\r\nl = [*map(int,input().split())]\r\nm = max(l)\r\nk = 0\r\nfor i in l:\r\n k+=(m-i)\r\nprint(k)", "import sys\r\nsys.stdin.reconfigure(line_buffering=True)\r\nn=int(input())\r\nans=0\r\nli=[i for i in map(int,input().split())][:n]\r\nfor i in li:\r\n ans+=max(li)-i\r\nprint(ans)", "n = int(input())\nW = list(map(int, input().split()))\n\nM = max(W)\nT = sum(M - w for w in W)\n\nprint(T)\n \t \t\t\t \t \t \t \t\t \t\t \t", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\ncnt=0\r\nfor i in a:\r\n cnt+=(a[-1]-i)\r\nprint(cnt)", "n = int(input())\r\nd = []\r\nburles = [int(i) for i in input().split()]\r\nmaximum = max(burles)\r\nfor j in range(len(burles)):\r\n d.append(maximum - burles[j])\r\ntotal = sum(d)\r\nprint(total)\r\n ", "N = int(input())\naux = 0\n\nlista = input().split()\n\nlista = list(map(int, lista))\n\nfor num in lista:\n maior = max(lista)\n if(num < maior):\n aux+=(maior-num)\n\nprint(aux)\n\t \t \t\t \t\t \t\t \t \t \t \t", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nm=max(x)\r\ns=0\r\nfor i in x:\r\n s+=m-i\r\nprint(s)", "n=int(input())\r\nwelfare=list(map(int,input().split()))\r\nmax_welfare=max(welfare)\r\ntotal_cost=sum(max_welfare - wealth for wealth in welfare)\r\nprint(total_cost)", "n = int(input())\r\nli = list(map(int, input().split()))\r\nx = max(li)\r\nc = 0\r\nfor i in li:\r\n c = c+ x-i \r\n\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nc=0\r\nfor i in l:\r\n c+=(m-i)\r\nprint(c)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncnt = 0\r\nfor x in arr:\r\n cnt += arr[n - 1] - x\r\nprint(cnt)", "n = int(input())\r\n\r\nwelfares = [int(n) for n in input().split()]\r\n\r\nhigher_welfare = max(welfares)\r\n\r\nmin_burles = 0\r\n\r\nfor welfare in welfares:\r\n min_burles += higher_welfare - welfare\r\n\r\nprint(min_burles)\r\n\r\n", "k=int(input())\r\nl=list(map(int,input().split()))\r\nd=0\r\nl.sort()\r\nm=l[k-1]\r\nfor i in range(k):\r\n d=d+abs(m-l[i])\r\nprint(d)", "def holiday_of_equality_a():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n print(max(a)*n - sum(a))\r\n\r\nif __name__ == '__main__':\r\n import math\r\n from collections import defaultdict\r\n mod = 10**9 + 7\r\n holiday_of_equality_a()", "p = int(input())\narr = list(map(int, input().split()))\nburles = 0\n\narr.sort()\n\nfor item in arr:\n burles += arr[len(arr) - 1] - item\n\nprint(burles)\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ncost, m = 0, max(l)\r\nfor i in l:\r\n cost += m - i\r\nprint(cost)", "n = int(input())\nm = list(map(int, input().split()))\n\nres = max(m)\nprint(sum([res - item for item in m]))\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nd=max(m)\r\nt=0\r\nfor i in m:\r\n if i<d:\r\n t+=d-i\r\nprint(t)", "d = int(input())\r\nl = list(map(int,input().split()))\r\nmax = max(l)\r\nans = 0\r\nfor i in l:\r\n ans+=max-i\r\nprint(ans)\r\n ", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst1 = []\r\nm = max(lst)\r\nfor i in range(len(lst)):\r\n a = m-lst[i]\r\n lst1.append(a)\r\nprint(sum(lst1))", "n= int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nmx=max(x)\r\nc=0\r\nfor i in x:\r\n if(mx>i):\r\n c+=mx-i\r\nprint(c)\r\n", "f=int(input())\r\nl=list(map(int,input().split()))\r\nn=max(l)\r\ns=0\r\nl.remove(n)\r\nfor i in range(len(l)):\r\n s=s+(n-l[i])\r\nprint(s)", "x=int(input())\r\nz=input().split(\" \")\r\nif x==1:\r\n print(0)\r\nelse:\r\n max=0\r\n sum=0\r\n for i in z:\r\n if int(i)>max:\r\n max=int(i)\r\n for j in z:\r\n sum+=(max-int(j))\r\n print(sum)", "T=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nx=0\r\nfor i in l:\r\n x+=m-i\r\nprint(x)", "n = int(input())\r\nL = list(map(int,input().split()))\r\nprint(max(L)*n-sum(L))\r\n", "n=int(input())\r\nll=list(input().split())\r\nl=[]\r\nfor t in ll:\r\n l.append(int(t))\r\nl.sort()\r\no=n*l[-1]-sum(l)\r\nprint(int(o))\r\n", "people = int(input())\r\namounts = [int(x) for x in input().split()]\r\nmaximum = max(amounts)\r\ncounter = 0\r\nfor i in range(people):\r\n counter += maximum - amounts[i]\r\nprint(counter)", "# A Holiday of Equality\r\nn = int(input()) # number of citizens\r\nwelfare = input().split()\r\nwelfare = [int(i) for i in welfare]\r\n\r\nS = sorted(welfare,reverse=True) \r\n\r\nsuma = 0\r\n\r\nfor i in range(1,n):\r\n suma += S[0] - S[i]\r\n \r\nprint(suma)\r\n", "n=int(input())\r\nli=list(map(int,input().strip().split()))\r\nm1=max(li)\r\ns1=m1*n\r\ns2=sum(li)\r\nprint(s1-s2)", "import sys\r\n\r\nfor line in sys.stdin:\r\n n = int(line)\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n max_val = arr[-1]\r\n sum_val = sum([abs(max_val - arr[i]) for i in range(n-1)])\r\n print(sum_val)", "def holidayOfInequality(welfares):\r\n\tmaxx = max(welfares)\r\n\tcount = 0\r\n\tfor i in welfares:\r\n\t\tcount += maxx - i\r\n\treturn count\r\n\r\nn = int(input())\r\nwelfares = [int(x) for x in input().split()]\r\nprint(holidayOfInequality(welfares))", "input()\r\nl=list(map(int,input().split()))\r\nprint(sum(max(l)-i for i in l))", "def holidayOfEquality():\r\n n = int(input())\r\n arr = [int(i) for i in input().split()]\r\n print(max(arr)*n - sum(arr))\r\n return\r\nholidayOfEquality()", "t = int(input());ans = 0\r\n*l, = map(int, input().split(' '))\r\nq = max(l)\r\n\r\nfor i in range(t):\r\n ans += q - l[i]\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\nbig = 0\r\nfor elem in l:\r\n if elem > big:\r\n big = elem\r\n\r\nans = 0\r\nfor elem in l:\r\n ans += (big - elem)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nsum=a[0]\r\ncount=0\r\nfor i in range(n):\r\n if(sum<a[i]):\r\n sum=a[i]\r\nfor i in range(n):\r\n count+=sum-a[i]\r\nprint(count)", "n = int(input())\r\nwelfare_values = list(map(int, input().split()))\r\n\r\nmax_welfare = max(welfare_values)\r\ntotal_expenses = 0\r\n\r\nfor welfare in welfare_values:\r\n total_expenses += max_welfare - welfare\r\n\r\nprint(total_expenses)\r\n", "n=int(input())\r\nelem=[int(i) for i in input().split()]\r\nsum=0\r\nif n==1:\r\n print(\"0\")\r\nelse:\r\n for i in range(n):\r\n sum=sum+(max(elem)-elem[i])\r\n print(sum)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nprint(n*max(l)-sum(l))\r\n", "n = int(input())\r\nwealth = list(map(int, input().split()))\r\nmax_wealth = max(wealth)\r\ntotal_burles = sum(max_wealth - w for w in wealth)\r\nprint(total_burles)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = max(arr)*n-sum(arr)\r\nprint(ans)" ]

[ "import math\r\nn = int(input())\r\nl = [int(p) for p in input().strip('\\n').split(' ')]\r\na = max(l)\r\nb = int(math.ceil(max(l)/2))\r\nc = int(math.floor(max(l)/2)) + 1\r\ntemp = -1 * (sum(l) - a - b - c)\r\nprint(str(temp))\r\n", "n = int(input())\nl = [int(x) for x in input().split()]\nl.sort()\nprint(2*l[n-1] + 1 - sum(l))\n\t\t\t \t\t \t \t \t \t \t\t \t \t \t\t\t", "n=int(input())\narr=list(map(int,input().split()))\nma=max(arr)\nsu=sum(arr)\nsu=su-ma\nans=ma-su\nans=ans+1\nprint(ans)\n\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\na.sort()\r\nx=a[-1]\r\ny=sum(a)-x\r\nprint(x-y+1)", "#!/usr/bin/env python3\r\n\r\ntry:\r\n while True:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = max(a)\r\n print((m << 1) - sum(a) + 1)\r\n\r\nexcept EOFError:\r\n pass\r\n", "mas = list(map(int, input().split()))\r\nt = mas[0]\r\nmas = list(map(int, input().split()))\r\ns = 0\r\nfor i in mas:\r\n s += i\r\nmas.sort()\r\nprint(2 * mas[-1] - s + 1)", "input()\nv = list(map(int, input().split()))\n\nprint(-sum(v) + 2 * max(v) + 1 )\n\n\t \t\t \t\t\t \t\t \t\t \t \t \t\t \t\t\t \t\t", "#----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\nl=list(map(int,input().split()))\r\nl.sort();p=sum(l)\r\nprint(2*l[-1]-p+1) \r\n", "import math\r\nimport string\r\n\r\ndef main_function():\r\n n = int(input())\r\n l = [int(i) for i in input().split(\" \")]\r\n sum_l = sum(l)\r\n mini = 1\r\n for i in l:\r\n if i - (sum_l - i) >= 1:\r\n mini = i - (sum_l - i) + 1\r\n print(mini)\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", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\ns = max(A)\r\nt=sum(A) - s\r\nprint(s - t+1)", "def main():\n input()\n l = list(map(int, input().split()))\n print(max(l) * 2 - sum(l) + 1)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\narr = []\r\nsum = 0\r\nfor x in input().split():\r\n arr.append(int(x))\r\n sum += int(x)\r\n\r\nln = 0\r\nfor i in range(0, len(arr)):\r\n if(ln<arr[i]):\r\n ln = arr[i]\r\n\r\nsn = sum - ln\r\n\r\nprint(str(ln-sn+1))", "n=int(input())\r\nz=list(map(int,input().split()))\r\nz.sort()\r\ns=sum(z)\r\nprint(2*z[-1]-s+1)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nif sum(l[:-1])<=l[-1]:\r\n print(l[-1]-sum(l[:-1])+1)\r\nelse:\r\n print(0)", "n = int(input())\r\n\r\nrods = [int(bruh) for bruh in input().split()]\r\n\r\nrods.sort()\r\n\r\nprint(rods[-1] - sum(rods[:-1]) + 1)\r\n\r\n", "n = int(input())\r\nL = [int(c) for c in input().split()]\r\n\r\nmx = max(L)\r\nside = sum(L) - mx\r\n\r\nans = mx - side + 1\r\n\r\nprint(ans)", "#!/usr/bin/python3\n\nfrom itertools import *\nfrom collections import Counter\n\nfrom operator import *\nfrom functools import reduce\n\nimport re, math\n\nfrom pprint import pprint\nfrom fractions import gcd\n\n\ndef sqr(x):\n return x*x\n\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\nA = list(reversed(sorted(inputarray())))\ndiff = A[0] - sum(A[1:]) + 1\nprint(diff)\n", "n=int(input())\r\nz=input().split()\r\nlengths=[]\r\ni=0\r\nwhile i<n:\r\n lengths.append(int(z[i]))\r\n i+=1\r\ni=0\r\ntotal=0\r\nwhile i<n:\r\n total+=lengths[i]\r\n i+=1\r\nx=max(lengths)\r\nprint(2*x-total+1)\r\n", "n = int(input())\n\nrods = input()\nrods = rods.split(' ')\n\na = 0\nb = 0\n\nfor i in range(n):\n\n if int(rods[i]) > a:\n b += a\n a = int(rods[i])\n\n else:\n b += int(rods[i])\n\nprint(a - b + 1)\n \t \t\t \t\t\t \t \t \t\t \t \t\t \t", "n = int(input())\nl = map(int, input().split())\nl = sorted(l)\nkid = l[:-2]\nmm = l[-2:]\nfor k in kid:\n mm[0] += k\n mm.sort()\nprint(mm[1] - mm[0]+1)\n", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nmi=l[-2]\r\nma=l[-1]\r\nfor i in range(n-2):\r\n if mi<ma: mi+=l[i]\r\n else: ma+=l[i]\r\nprint(abs(ma-mi)+1)", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nprint (l[n-1]-sum(l[:-1])+1)", "# coding: utf-8\n\nfrom __future__ import print_function\nfrom __future__ import unicode_literals\nfrom __future__ import division\nfrom __future__ import absolute_import\nimport math\nimport string\nimport itertools\nimport fractions\nimport heapq\nimport collections\nimport re\nimport array\nimport bisect\n\nn = int(input())\nlis = list(map(int, input().split(\" \")))\n\nmax_li = max(lis)\ntotal = sum(lis) - max_li\nprint(max_li - total + 1)\n", "kq = int(input())\r\nluv = list(map(int,input().split(' ')))\r\nluv.sort()\r\nluv.reverse()\r\nprint(max(0, luv[0]-sum(luv[1:])+1))", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nprint(l[-1]-sum(l[:-1])+1)", "a,b=input(),list(map(int,input().split()));print(2*max(b)+1-sum(b))\n \t\t \t\t\t\t \t\t\t\t \t\t \t \t\t \t\t\t", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nsum = 0\r\nfor i in range(0, n-1):\r\n sum += l[i]\r\nres = l[n-1]-sum+1\r\nprint(res)", "n = int(input())\r\nvals = list(map(int, input().split()))\r\nm = max(vals)\r\ns = sum(vals) - m\r\nprint(m - s + 1)", "n = int(input())\ns = [int(i) for i in input().split()]\na = max(s)\nb = min(s)\nc = sum(s)\nprint(a-b- (c-a-b)+1)\n", "a=int(input())\r\ns=[int(i) for i in input().split()]\r\ns.sort()\r\ns.reverse()\r\nans=2*s[0]-sum(s)+1\r\nprint(ans)", "while True:\r\n try:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n sum = 0\r\n for i in range(n-1):\r\n sum += a[i]\r\n print(a[n-1]-sum+1)\r\n except:\r\n break\r\n", "n = input()\r\nl = sorted(map(int, input().split()))\r\nm = sum(l[:-1])\r\nprint(l[-1] + 1 - m)\r\n", "n=input()\r\nliste=[ int(element) for element in input().split(\" \")]\r\nliste.sort()\r\n\r\nanswer=1+liste[-1]-(sum(liste)-liste[-1])\r\nprint(answer)", "n = int(input())\r\nli = list(map(int,input().split()))\r\nli.sort()\r\nn3 = sum(li)\r\nn2 = n3 // 2\r\ntemp = 0\r\ntemp2 = 0\r\nfor num in li:\r\n temp += num\r\n if temp > n2:\r\n temp2 = abs(temp - (n3 - temp))\r\n temp -= num\r\n temp2 = min(temp2,abs(temp - (n3 - temp)))\r\nprint(temp2+1)\r\n", "n=int(input())\nL=[int(x) for x in input().split()]\nprint(1+2*max(L)-sum(L))\n", "input()\r\n*L, x = sorted(map(int, input().split()))\r\n\r\nprint(max(0, x-sum(L)+1))", "n = int(input())\nl = list(map(int, input().split()))\nprint(l.pop(l.index(max(l))) - sum(l) + 1)\n", "_, edges = input(), list(map(int, input().split()))\n\n\nlongest = max(edges)\nothers = sum(edges) - longest\nprint(longest - others + 1)\n", "import math\r\nn=int(input())\r\nll=list(map(int,input().split()))\r\nll.sort()\r\ncount1,count2,i,j=0,0,0,n-1\r\nwhile i<=j:\r\n if count1==count2:\r\n count2+=ll[j]\r\n j-=1\r\n elif count1<count2:\r\n count1+=ll[i]\r\n i+=1\r\n else:\r\n count2+=ll[j]\r\n j-=1\r\nprint(abs(count1-count2)+math.factorial(0))\r\n", "n = int(input())\r\ns = 0\r\nrods = input().split()\r\nfor i in range(0,n):\r\n rods[i] = int(rods[i])\r\nrods = sorted(rods)\r\nfor i in range(n - 2,-1,-1):\r\n s = s + rods[i]\r\nprint(rods[n - 1] - s + 1)", "n=int(input())\r\narr=[int(num) for num in input().split()]\r\nm=max(arr)\r\ns=0\r\nfor val in arr:\r\n if(val!=m):\r\n s+=val\r\nprint(m+1-s)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nrequired_length = max(l)-(sum(l)-max(l))+1\r\nprint(required_length)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nprint(2*a[-1]-sum(a)+1)\r\n", "input()\r\narr = list(map(int, input().split()))\r\nans = 0\r\ntmp = sum(arr)\r\nfor i in arr:\r\n if i*2 >= tmp:\r\n ans = 2*i-tmp+1\r\n break\r\nprint(ans)\r\n", "_ = int(input())\r\nl = list(map(int,input().split()))\r\nprint( (max(l)<<1)+1-sum(l) )\r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\nl = list(read())\r\nS = sum(l)\r\nans = max(2 * i - S for i in l) + 1\r\nprint(ans)\r\n", "n = int(input())\nA = list(map(int, input().split()))\nprint(1 + 2 * max(A) - sum(A))\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn = ii()\nl = li()\n\nd = sum(l) - max(l)\nprint(max(l) + 1 - d)", "'''\r\nCreated on Apr 30, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn = int(input())\r\nArr = list(map(int,input().split()))\r\nArr.sort()\r\n#print(Arr)\r\nArr.reverse()\r\n#L = Arr[::-1]\r\n#print(L)\r\nbig = Arr[0]\r\nsum = 0\r\nfor i in range(1,len(Arr)):\r\n sum+=Arr[i]\r\n \r\nif sum>big:\r\n ans = sum-big+1\r\nelse:\r\n ans = big-sum+1\r\nprint(ans)", "n = int(input())\r\nls = list(map(int, input().split(' ')))\r\nls.sort()\r\nprint((ls[-1] - sum(ls[: n - 1]) + 1))\r\n", "import sys\nimport re\n\ndef main():\n a = int(input())\n b = input().split()\n bb = []\n for num in b:\n bb.append(int(num))\n b = bb\n b.sort()\n c = b.pop()\n d = 0\n for num in b:\n d += num\n e = c - d + 1\n print(e)\n return\n\nmain()\n", "input()\ns = list(map(int, input().split()))\nm = max(s)\nprint(max(0, 2*m+1 - sum(s)))\n\t \t\t\t \t\t\t \t \t \t \t \t \t\t\t \t", "I=input\r\nI()\r\na=list(map(int,I().split()))\r\nprint(2*max(a)-sum(a)+1)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n A.sort()\r\n max_val = A[n-1]\r\n other_sum_val = sum(A) - max_val\r\n return max_val - other_sum_val + 1\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n print(solve(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n n = int(input())\r\n ls = list(map(int, input().split()))\r\n total_sum = sum(ls)\r\n max_l = max(ls)\r\n sum_without_max = total_sum - max_l\r\n if sum_without_max > max_l:\r\n print(0)\r\n else:\r\n print(max_l - sum_without_max + 1)\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nsz = list(map(int, input().split()))\r\nmax_sz = max(sz)\r\nprint(2 * max_sz - sum(sz) + 1)", "n = int(input()) \narr = [int(e) for e in input().split()] \narr.sort()\nf = arr[-1]\ns = arr[-2]\nd = f - s\nrest = sum(arr[:-2])\nprint(d - rest + 1)", "n = int(input())\nv = [int(x) for x in input().split(\" \")]\n\nmaior = max(v)\nindex = v.index(maior)\nv.pop(index)\nsoma = 0\n\nfor i in v:\n soma += i\n\nif(soma > maior):\n print(soma-maior+1)\nelse:\n print(maior-soma+1)\n\t \t\t \t \t\t\t \t \t\t \t \t\t\t\t", "from sys import *\r\ninp = lambda : stdin.readline()\r\nimport math\r\ndef main():\r\n n,l = int(inp()),list(map(int,inp().split()))\r\n a = 2*max(l) - sum(l) + 1\r\n print(a)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\nsys.stderr = sys.stdout\n\n\ndef rods(n, L):\n m = max(L)\n s = sum(L)\n assert s <= 2*m\n return 2*m - s + 1\n\n\ndef main():\n n = readint()\n L = readintl()\n print(rods(n, L))\n\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 = int(input())\nvetor = list(map(int, input().split()))\n \nprint(-sum(vetor) + 2 * max(vetor) + 1 )\n\t\t\t\t \t\t \t \t \t\t\t\t\t \t\t \t \t \t", "n = int(input())\r\ns = list(map(int,input().split()))\r\na = max(s)\r\nb = sum(s)\r\nc = max(s)\r\n\r\nprint(a-(b-c)+1)\r\n", "input()\r\nX = list(map(int, input().split()))\r\nprint(abs(sum(X) - 2 * max(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 Bojnourd\r\n# Caption: Breaking news: Arpa is going to be here. \r\n# CodeNumber: 708\r\n", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nprint(2*max(w)-sum(w)+1)", "n=input()\r\nliste=[ int(element) for element in input().split(\" \")]\r\n\r\nmin=liste[0]\r\nsum_l=liste[0]\r\nfor element in liste[1:]:\r\n if element > min:\r\n min=element\r\n sum_l+=element\r\n\r\nanswer=1+2*min-sum_l\r\nprint(answer)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=sum(a[:-1])\r\ny=abs(a[-1]-x)+1\r\nprint(y)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nL=len(l)\r\nAns=l[L-1]+1\r\nfor i in range(L-1):\r\n Ans-=l[i]\r\nprint(Ans)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ns = sum(l)\r\na = 0\r\nans = 10**18\r\n\r\nfor li in l:\r\n a += li\r\n b = s-a\r\n ans = min(ans, abs(a-b)+1)\r\n\r\nprint(ans)", "n = int(input())\nl = input().split()\nllen = len(l)\nfor i in range(llen):\n\tl[i]=int(l[i])\nprint(2*max(l)+1-sum(l))\n\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\nl.sort()\r\nll = l[-1]\r\nl_sum = sum(l) - ll\r\nprint(ll - l_sum + 1)", "import math\r\nimport collections\r\n \r\ndef solve(n, l):\r\n return max(l) - (sum(l) - max(l)) + 1\r\n\r\nn = int(input())\r\nl = [int(s) for s in input().split()]\r\nresult = solve(n, l)\r\nprint(result)\r\n", "v = [ ]\r\nn = input ( )\r\nfor i in input ( ).strip ( ).split ( ' ' ) :\r\n v.append ( int ( i ) )\r\nv.sort ( )\r\nv = reversed ( v )\r\nunu = 0\r\ndoi = 0 \r\nfor i in v :\r\n if unu <= doi :\r\n unu += i\r\n else :\r\n doi += i\r\nprint ( abs ( unu - doi ) + 1 ) \r\n", "n = int(input())\nL = [int(i) for i in input().split()[:n]]\nprint(max(L)*2 - sum(L) + 1)\n \t \t\t\t \t\t \t \t \t\t\t\t\t", "n = int(input())\nl = list(map(int, input().split()))\n\nlengths_sum = sum(l)\nmax_l = max(l)\nrest_sum = lengths_sum - max_l\n\nif rest_sum >= max_l:\n print(1)\nelse:\n print(2*max_l+1-lengths_sum)\n", "n = int(input())\r\nmas = [int(x) for x in input().split()]\r\nz = max(mas)\r\nmas.remove(z)\r\nsumma = 0\r\nfor i in mas:\r\n\tsumma = summa+i\r\nprint(z-summa+1)", "import math\r\n\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\ndef ri():\r\n return int(input())\r\n\r\nn=ri()\r\n\r\nx=rl()\r\n\r\nx.sort()\r\n\r\na=0\r\n\r\nfor i in range(n-1):\r\n a+=x[i]\r\n\r\nprint(x[n-1]-a+1)", "n=int(input(''))\narr=input('').split(' ')\nfor i in range(n):\n\tarr[i]=int(arr[i])\narr.sort(reverse=True)\ntmp=0\nfor i in range(1,n):\n\ttmp+=arr[i]\nprint(max(0,arr[0]+1-tmp))", "a = int(input())\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\n\r\nf=[max(t),sum(t)-max(t)]\r\n\r\n\r\n\r\n\r\n\r\nprint(max(f)-min(f)+1)\r\n", "n = int(input())\nrods = list(map(int, input().split()))\nm = max(rods)\nprint(m - (sum(rods) - m) + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nz=max(a)\r\nans=z-(sum(a)-z)+1\r\nif ans<0: ans=0\r\nprint(ans)\r\n", "n = int(input())\nA = list(map(int, input().split()))\n\nprint(2 * max(A) - sum(A) + 1)\n", "import math\r\nif __name__ == \"__main__\":\r\n #n, m = list(map(int, input().split()))\r\n #s = list(input().split())\r\n n = int(input())\r\n l = sorted(list(map(int, input().split())))\r\n ans = l[-1] - l[0]\r\n for i in range(1, n - 1):\r\n if ans > 0:\r\n ans -= l[i]\r\n else:\r\n ans += l[i]\r\n print(abs(ans) + 1)\r\n ", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\nmx, box = 0, 0\r\nfor i in data:\r\n if i > mx:\r\n box += mx\r\n mx = i\r\n else:\r\n box += i\r\nprint(mx - box + 1)", "s=m=0\r\ninput()\r\nfor i in input().split():\r\n i = int(i)\r\n s+=i\r\n if i > m :\r\n m=i\r\nprint(m-(s-m)+1) ", "n = int(input())\r\n\r\nA = list(map(int, input().split()))\r\n\r\nS = sum(A)\r\nM = max(A)\r\nS -= M\r\n\r\nprint(M - S + 1)\r\n", "import math\nimport sys\nfrom collections import defaultdict\n#input = sys.stdin.readline\n\nUSE_FILE = False \n\ndef search(n, k):\n n = len(x)\n p = 0\n a = n\n while a >= 1:\n while p + a < n and x[p+a] <= k:\n p += a\n a //= 2\n return x[p] == k\n\n\ndef main():\n n = int(input())\n a = [int(i) for i in input().split()]\n a = sorted(a, reverse = True)\n sume = sum(a[1:])\n return a[0] - sume + 1\n\n\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n print(main())\n", "from math import pi\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(sorted([int(i) for i in input().split()]))\r\n s = sum(a[:-1])\r\n print(max(0, a[-1] + 1 - s))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "while True:\n try:\n n1 = int(input())\n a = list(map(int, input().split()))\n a.sort()\n sum = 0\n for i in range(n1-1):\n sum += a[i]\n print(a[n1-1]-sum+1)\n except:\n break\n\n \t \t \t \t \t \t\t \t \t\t \t \t \t", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nprint(2 * max(lst) - sum(lst) + 1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort(reverse=True)\r\nl = 0\r\nr = 0\r\nfor x in a:\r\n\tif l < r:\r\n\t\tl += x\r\n\telse:\r\n\t\tr += x\r\n\t\t\r\nprint(abs(l-r)+1)", "#!/usr/bin/env python3\n# 667B_coat.py - Codeforces.com/problemset/problem/667/B by Sergey 2016\n\nimport unittest\nimport sys\n\n###############################################################################\n# Coat Class (Main Program)\n###############################################################################\n\n\nclass Coat:\n \"\"\" Coat 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 a single line of multiple elements\n self.numl = list(map(int, uinput().split()))\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = 0\n lsum = sum(self.numl)\n lmax = max(self.numl)\n result = 2*lmax - lsum + 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 \"\"\" Coat class testing \"\"\"\n\n # Constructor test\n test = \"3\\n1 2 1\"\n d = Coat(test)\n self.assertEqual(d.n, 3)\n self.assertEqual(d.numl, [1, 2, 1])\n\n # Sample test\n self.assertEqual(Coat(test).calculate(), \"1\")\n\n # Sample test\n test = \"5\\n20 4 3 2 1\"\n self.assertEqual(Coat(test).calculate(), \"11\")\n\n # Sample test\n test = \"\"\n # self.assertEqual(Coat(test).calculate(), \"0\")\n\n # My tests\n test = \"\"\n # self.assertEqual(Coat(test).calculate(), \"0\")\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 = Coat(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(Coat().calculate())\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=max(l)\r\nsum=0\r\nfor i in l:\r\n\tsum+=i\r\nprint(2*p-sum+1)", "n = int(input())\r\na = [int(xx) for xx in input().split()]\r\nprint(max(1, 2 * max(a) - sum(a) + 1))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\ns = sum(a[:-1])\r\nprint(a[-1]-s+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ns = 0\r\nfor i in range(0, n - 1) :\r\n s += a[i]\r\nif s > a[-1] : print(1)\r\nelse : print(a[-1] - s + 1)\r\n", "n = int(input())\r\nxs = list(map(int, input().split()))\r\n\r\nxs.sort(reverse=True)\r\n\r\na = xs[0]\r\nb = xs[1]\r\n\r\nfor i in xs[2:]:\r\n if a + i - b > b + i - a:\r\n b += i\r\n else:\r\n a += i\r\n\r\nprint(abs(a - b) + 1)\r\n", "n = int(input())\n\nx = list(map(int, input().split()))\n\nx.sort()\n\naux = sum(x[0:n-1])\n\nprint(x[n-1] - aux + 1)\n \t \t\t \t\t \t \t \t \t\t\t \t", "__author__ = 'Andrey'\nn = int(input())\nm, s1 = (lambda x : (max(x), sum(x)))(list(map(int, input().split())))\ns = s1 - m\nprint(m - s + 1)", "#667B\n\nn = int(input())\n\narr = list(map(int, input().split(\" \")))\n\nm = max(arr)\ns = sum(arr)\n\nprint(2 * m - s + 1)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nprint(max(l)-(sum(l)-max(l))+1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\na = sum(w[:-1])\r\nif a <= w[-1]:\r\n print(w[-1]-a+1)\r\nelse:\r\n print(0)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nb = a.pop()\r\nprint(b - sum(a)+1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nres = 2 * max(arr) - sum(arr) + 1\r\nprint(res)\r\n", "import sys\nimport os\nimport math\nfrom sys import stdin, stderr, stdout, exit\n\nn = int(stdin.readline())\n\na = list(map(int, stdin.readline().strip().split()))\nprint(2*max(a) - sum(a) + 1)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\navg = sum(arr)/2\r\na,b = 0,0\r\nfor i in arr:\r\n if a + i > avg:\r\n b += i\r\n else:\r\n a += i\r\nprint(abs(b - a) + 1)", "n = int(input())\nrods = []\ns = input()\nfor l in s.split():\n rods.append(int(l))\nrods = sorted(rods)\nprint(rods[-1] - sum(rods[:-1]) + 1)\n", "n = int(input())\nA = [int(x) for x in input().split()]\nprint(2*max(A) - sum(A) + 1)\n", "# cook your dish here\nn = int(input())\ns = input()\nlst = list(map(int,s.split()))\nmax1 = max(lst)\nsumm = sum(lst)\nsumm = summ-max1\nmax1 = max1 - summ\nprint(max1+1)\n \t\t \t\t \t\t\t \t\t\t\t \t \t \t", "n = int(input())\r\ntemp = input().split(' ')\r\n\r\nrod = []\r\nfor i in range(n):\r\n\trod.append(int(temp[i]))\r\n\r\nrod.sort()\r\n\r\ns = sum(rod)\r\nts = s\r\ndelta = []\r\n\r\nfor i in range(n):\r\n\tts -= rod[i]\r\n\tdelta.append(abs(s/2 - ts))\r\n\t\r\nd = delta.index(min(delta))\r\n\r\nts = 0\r\n\r\nfor i in range(d+1):\r\n\tts += rod[i]\r\n\r\nprint(str(s-(2*ts)+1))", "def main():\n n = int(input())\n l = list(map(int, input().split()))\n print(2 * max(l) - sum(l) + 1)\n\nif __name__ == '__main__':\n main()\n\n\t \t \t \t \t\t \t \t \t\t \t", "n=int(input())\r\ntab=[int(i) for i in input().split()]\r\ntab.sort()\r\nx=tab[n-1]\r\ntab.pop()\r\ny=x-sum(tab)+1\r\nprint(y)", "import copy\n\ndef convex(val, count):\n \"\"\"Rudimentary convex calc by reducing to triangle\"\"\"\n val.sort(reverse=True)\n sumA = 0\n sortedVal = copy.deepcopy(val)\n sortedVal.sort(reverse=True)\n cap = 1\n accend = [0 for i in range(count)]\n accend[count - 1] = val[count - 1]\n\n for k in range(1, count):\n accend[count - 1 - k] = val[count - 1 - k] + accend[count - k]\n\n for i in range(1, count):\n sumA = sum(sortedVal[:i])\n if sumA >= accend[i]:\n minlength = sumA - accend[i] + 1\n break\n print(minlength)\n\ndef main():\n\n count = int(input())\n if count <= 10**5:\n stdata = input()\n data = list(map(int, stdata.split()))\n convex(data, count)\n\nif __name__ == '__main__':\n main()\n\n\n\n\n\n", "#!/usr/bin/python3\n\nn = int(input())\nv = list(map(int, input().split()))\n\nM = max(v)\nv.remove(M)\n\nprint(M - sum(v) + 1)\n\n\n\n", "n, l = int(input()), list(map(int, input().split()))\r\nprint(2 * max(l) - sum(l) + 1)", "__author__ = 'Utena'\r\nn=int(input())\r\nrods=sorted(list(map(int,input().split())))\r\ntotal=sum(rods)\r\nt=0\r\nj=0\r\nfor i in range(n-1):\r\n t+=rods[i]\r\n if t>=total-t:j=1\r\nif j==0:\r\n print(2*rods[-1]-total+1)\r\nelse:\r\n print(1)", "input()\r\nsides = list(map(int, input().split()))\r\nprint(2*max(sides) - sum(sides) + 1)", "input()\r\na = list(map(int, input().split()))\r\nprint(2 * max(a) - sum(a) + 1)\r\n", "n = int(input())\na = list(map(int, input().split()))\na.sort(reverse=True)\np = a[0]\nq = sum(a[1:])\nr = p - q + 1\nprint(r)\n\n", "n=int(input())\r\ns=list(map(int, input().split()))\r\nprint(2*max(s)-sum(s)+1)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nsf,sb=l[0],l[n-1]\r\ni,j=0,n-1\r\nwhile True:\r\n if j==i+1:\r\n break\r\n if sf<=sb:\r\n i+=1\r\n sf+=l[i]\r\n else: \r\n j-=1\r\n sb+=l[j]\r\nprint(abs(sb-sf)+1)", "n = int(input())\r\nL = []\r\ns = input().split()\r\n\r\nfor i in range(n):\r\n L.append(int(s[i]))\r\nL.sort()\r\n\r\nlast = L[n - 1]\r\nprev = L[n - 2]\r\n\r\nfor i in range(n - 3, -1, -1):\r\n if prev <= last:\r\n prev += L[i]\r\n else:\r\n last += L[i]\r\nprint(abs(last - prev) + 1)", "n=int(input())\r\nm=list(map(int,input().split(' ')))\r\nm.sort()\r\na=m.pop(-1)\r\nx=sum(m)\r\nprint(a-x+1)", "# http://codeforces.com/contest/667/problem/B\r\n\r\n# https://en.wikipedia.org/wiki/Triangle_inequality\r\n# 「Generalization to any polygon」参照。\r\n# 三角不等式の一般化が載っている。\r\n# ポリゴンができる条件は最長辺が残りすべての辺の長さの和より短いこと\r\n# longest< x+(total-longest)\r\n# ∴ x > 2*longest-total\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nprint(2 * max(lst) - sum(lst) + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(abs(sum(l)-2*max(l))+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=max(a)\r\nprint(x-(sum(a)-x)+1)\r\n", "n = int(input())\nl = list(map(int,input().split()))\nl.sort(reverse=True)\ntotal = sum(l)\nanswer = 2*l[0] - total +1\nprint(answer)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nsu=sum(l[:-1])\r\n\r\nprint(abs(l[-1]-su)+1)", "n = int(input())\nl = list(map(int, input().split()))\n\ntotal = sum(l)\n\ngap = 0\nfor rod in l:\n gap = max(gap, rod - (total - rod))\n\nprint(gap + 1)\n", "n=int(input())\r\nd=input().split()\r\nd=[int(x) for x in d ]\r\nm=max(d)\r\nd.remove(m)\r\nS=0\r\nfor i in d:\r\n S+=i\r\nprint(m-S+1)\r\n", "n = int(input())\r\nl = sorted([int(i)for i in input().split()])\r\nif max(l) % 2 == 0:\r\n SUM_SR =((max(l)+1)//2)*2 + 1\r\nelse:\r\n SUM_SR = ((max(l) + 1) // 2) * 2\r\ni = 0\r\nwhile i < len(l)-1:\r\n SUM_SR -= l[i]\r\n i+=1\r\nprint(SUM_SR)", "n = int(input())\r\nL = list(map(int, input().split()))\r\nmx = -1\r\nsum = 0\r\nfor i in range(n):\r\n mx = max(mx, L[i])\r\n sum += L[i]\r\nprint(2 * mx - sum + 1)", "import math\r\n\r\nn = int(input())\r\nt = []\r\nx = 0\r\nfor i in range(1):\r\n t = [int(x) for x in input().split()]\r\n t.sort()\r\n\r\nfor i in range (n-1):\r\n x = x + t[i]\r\n\r\nif x < t[n-1]:\r\n print (t[n-1]-x+1)\r\n\r\nif x == t[n-1]:\r\n print (1)\r\n\r\nif x > t[n-1]:\r\n print (0)", "n = int(input())\r\nk = 0\r\nmaxi = 0\r\nindex = 0\r\na = list(map(int,input().split(' ')))\r\nfor i in range(n):\r\n if(a[i]>maxi):\r\n maxi = a[i]\r\n index = i\r\nfor i in range(n):\r\n if(index!=i):\r\n maxi-=a[i]\r\n\r\nprint(maxi+1)\r\n \r\n", "def main():\r\n param = 0\r\n sum = 0\r\n geom = []\r\n maximum = 0\r\n index = 0\r\n n = int(input())\r\n geom = list(map(int, input().split()))\r\n for i in range(0, n):\r\n if geom[i] > maximum:\r\n maximum = geom[i]\r\n index = i\r\n geom = geom[:index] + geom[index+1:]\r\n for i in range(0, n - 1):\r\n sum += geom[i]\r\n param = maximum - sum + 1\r\n print(param)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n ", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += l[i]\r\nm = max(l)\r\ns1 = s - m\r\ndlina = m+1-s1\r\nprint(dlina)\r\n", "n = int(input())\r\nsides = list(map(int, input().split()))\r\nprint(2 * max(sides) - sum(sides) + 1)\r\n", "n = int(input())\r\nq = [int(x) for x in input().split()]\r\ns = 0\r\nm = 0\r\nfor i in range(n):\r\n s += q[i]\r\n m = max(m, q[i])\r\nanswer = 2*m - s + 1\r\nprint(answer)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nh=l.index(m)\r\nx=sum(l[0:h])++sum(l[h+1:n+1])\r\nprint(abs(m-x+1))", "n = int(input())\na = list(map(int,input().split()))\na.sort(reverse=True)\nx = 0\nfor i in range(1,n):\n x += a[i]\nans = abs(a[0] - x) + 1\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = max(a)\r\ns = 0\r\nfor x in a:\r\n s += x\r\ns -= m\r\nans = m - s + 1\r\nprint(ans)", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nlarge=max(list)\r\nsome=sum(list)-large\r\nprint(large-some+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nma = a[-1]\r\nsa = sum(a[:-1])\r\nif ma >= sa:\r\n print(ma - sa + 1)\r\nelse:\r\n print(0)", "n=input()\r\nn=list(map(int,input().split()))\r\nprint(2*max(n)-sum(n)+1)", "n = int(input())\n\narr = list(map(int, input().split()))\n\nmaxim = max(arr)\n\ntot = sum(arr)\n\nres = (2*maxim) - tot+1\n\nprint(res)", "\r\nn=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\nprint(abs(a[-1]-sum(a[:n-1]))+1)", "from math import *\r\n\r\nn=int(input())\r\narr=[int(z) for z in input().split()]\r\narr.sort()\r\ns1=sum(arr[:len(arr)-1])\r\ns2=arr[-1]\r\nassert s2>=s1\r\nprint(s2-s1+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort(reverse = True)\r\n\r\na, s, i = sum(l) // 2, 0, 0\r\n\r\nwhile s < a:\r\n\ts += l[i]\r\n\t\r\n\tif s < a:\r\n\t\ts += l[-1]\r\n\t\tl.pop(-1)\r\n\t\r\n\tl.pop(0)\r\n\ti += 1\r\n\t\r\nprint(s - sum(l) + 1)" ]

[ "f = lambda: map(int, input().split())\r\nn, w, v, u = f()\r\nk = t = 0\r\nv /= u\r\nfor i in range(n):\r\n x, y = f()\r\n d = x / v - y\r\n k |= d < 0\r\n t = max(t, d)\r\nif k: w += t\r\nprint(w / u)" ]

[ "def print_tube(a):\r\n\tprint(len(a),end = \" \")\r\n\tprint(\" \".join(map(lambda x: \" \".join(str(i) for i in x), a)))\r\nn, m, k = map(int, input().split())\r\nres = [(x+1,y+1) for x in range(n) for y in range(m)[::(1 if (x%2 == 0) else -1)]]\r\nfor i in range(k-1):\r\n\tprint_tube(res[2*i:2*i+2])\r\nprint_tube(res[2*k-2:])", "I=lambda : list(map(int,input().split(' ')))\nn,m,k=I()\nlst=[]\nmat=[]\nfor i in range(1,n+1):\n t=[]\n for j in range(1,m+1):\n t.append((i,j))\n if i%2==1:\n mat+=(t)\n else:\n mat+=(t[::-1])\n\ndef solve(mat,k):\n ind=0\n out=[]\n while len(out)!=k-1:\n out.append(mat[ind:ind+2])\n ind+=2\n out.append(mat[ind:])\n for i in range(k):\n print(str(len(out[i]))+' '+\" \".join([str(ele[0])+' ' +str(ele[1]) for ele in out[i]]))\nsolve(mat,k)", "n, m, k = [int(c) for c in input().split()]\r\n\r\nx, y = [1, 1]\r\n\r\ndef next_cell(x, y):\r\n if x % 2 == 1 and y < m:\r\n return [x, y + 1]\r\n elif x % 2 == 0 and y > 1:\r\n return [x, y - 1]\r\n else:\r\n return [x + 1, y]\r\n\r\nfor i in range(1, k):\r\n x2, y2 = next_cell(x, y)\r\n print(2, x, y, x2, y2)\r\n x, y = next_cell(x2, y2)\r\n\r\nlast = [x, y]\r\n\r\nreq_len = n*m - (k-1)*2\r\n\r\nwhile len(last) < req_len * 2:\r\n x, y = next_cell(x, y)\r\n last.append(x)\r\n last.append(y)\r\n\r\nprint(len(last) // 2, ' '.join(map(str,last)))", "import sys\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\nn, m, k = map(int,input().split())\r\n\r\npath = []\r\nfor i in range(n):\r\n if i & 1:\r\n for j in range(m-1, -1, -1):\r\n path.append((i+1, j+1))\r\n else:\r\n for j in range(m):\r\n path.append((i+1, j+1))\r\n\r\ntaken = 0\r\nans = []\r\nfor i in range(k-1):\r\n ans.append(path[taken:taken+2])\r\n taken += 2\r\nans.append(path[taken:])\r\n\r\nfor sub in ans:\r\n print(len(sub), end=' ')\r\n for subsub in sub:\r\n print(subsub[0], subsub[1], end=' ')\r\n print()", "n,m,k=map(int,input().split()) \r\nans=[]\r\ncurr=1 #fwd \r\nnow=[1,1]\r\ntr=[]\r\ntr.append(now)\r\nz=n*m\r\nwhile z : \r\n z-=1 \r\n x=now[0]\r\n y=now[1]\r\n if curr==1:\r\n if y+1>m:\r\n #y-=1 \r\n x+=1 \r\n curr=-1 \r\n else: \r\n x+=0 \r\n y+=1 \r\n #curr=-1 \r\n now=[x,y]\r\n else:\r\n if y==1: \r\n # y-=1 \r\n x+=1 \r\n curr=1 \r\n else:\r\n x+=0 \r\n y-=1 \r\n now=[x,y]\r\n tr.append(now)\r\nle=n*m \r\nj=0 \r\nans=tr[:]\r\nsm=0 \r\nwhile k>1: \r\n print(2,ans[j][0],ans[j][1],ans[j+1][0],ans[j+1][1])\r\n k-=1 \r\n j+=2 \r\n sm+=2 \r\nrem=n*m-sm \r\nprint(rem,end=' ')\r\nfor k in range(j,n*m):\r\n print(ans[k][0],ans[k][1],end=' ')\r\n", "n, m, k = list(map(int, input().split()))\nresult = []\n\nfor row in range(1, n+1):\n if row & 1:\n for col in range(1, m+1):\n result.append([row, col])\n else:\n for col in range(m, 0, -1):\n result.append([row, col])\ni = 0\nwhile i//2 < k-1:\n print(2, result[i][0], result[i][1], result[i+1][0], result[i+1][1])\n i += 2\n\nprint(len(result) - i, end =' ')\nwhile i < len(result):\n print(result[i][0], result[i][1], end =' ')\n i += 1\n \t\t \t \t\t\t\t \t\t\t \t\t\t \t\t\t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,M,K = map(int, input().split())\r\nt = (N*M)//K\r\n\r\nans = [[]]\r\ndr = 0\r\nfor i in range(N):\r\n if dr==0:\r\n for j in range(M):\r\n ans[-1].append((i+1,j+1))\r\n if len(ans)<K and len(ans[-1])==t:\r\n ans.append([])\r\n else:\r\n for j in range(M-1,-1,-1):\r\n ans[-1].append((i+1,j+1))\r\n if len(ans)<K and len(ans[-1])==t:\r\n ans.append([])\r\n dr = (dr+1)%2\r\n \r\nfor a in ans:\r\n tmp = []\r\n for t1,t2 in a:\r\n tmp.append(t1)\r\n tmp.append(t2)\r\n print(len(a), *tmp)\r\n \r\n\r\n\r\n\r\n", "def ValeraAndTubes(n,m,k):\r\n\tminCellsPerTube = (n*m)//k\r\n\tl=((n*m)%k)+minCellsPerTube\r\n\treqLength = minCellsPerTube\r\n\r\n\ti=1\r\n\tj=1\r\n\r\n\tresult=str(reqLength)+\" \"\r\n\t\r\n\twhile i<=n:\r\n\t\tif j>m:\r\n\t\t\tj=m\r\n\t\telif j==0:\r\n\t\t\tj=1\r\n\t\tif(i%2!=0):\r\n\t\t\twhile j<=m:\t\r\n\t\t\t\treqLength-=1\t\t\t\t\t\t\r\n\t\t\t\tresult+=str(i)+\" \"+str(j)+\" \"\t\r\n\t\t\t\tif(reqLength==0):\r\n\t\t\t\t\tprint(result)\r\n\t\t\t\t\tk-=1\r\n\t\t\t\t\tif k==1:\r\n\t\t\t\t\t\treqLength = l\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\treqLength = minCellsPerTube\r\n\t\t\t\t\tresult=str(reqLength)+\" \"\t\t\r\n\t\t\t\tj+=1\r\n\t\telse:\r\n\t\t\twhile j>0 and k>0:\r\n\t\t\t\treqLength-=1\t\t\t\t\t\t\r\n\t\t\t\tresult+=str(i)+\" \"+str(j)+\" \"\r\n\t\t\t\tif(reqLength==0):\r\n\t\t\t\t\tprint(result)\r\n\t\t\t\t\tk-=1\r\n\t\t\t\t\tif k==1:\r\n\t\t\t\t\t\treqLength = l\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\treqLength = minCellsPerTube\r\n\t\t\t\t\tresult=str(reqLength)+\" \"\t\r\n\t\t\t\tj-=1\r\n\t\ti+=1\r\n\r\n\r\nn,m,k = [int(x) for x in input().split()]\r\nValeraAndTubes(n,m,k)", "from itertools import chain\n\nr, c, n = map(int, input().split())\nans = []\nfor i in range(1, r + 1):\n x, y, z = (1, c + 1, 1) if i % 2 == 1 else (c, 0, -1)\n for j in range(x, y, z):\n ans.append((i, j))\nl = r * c // n\nsans = [ans[i : i + l] for i in range(0, (n - 1) * l, l)]\nsans.append(ans[l * len(sans) :])\nprint(\"\\n\".join(map(lambda x: \" \".join(map(str, [len(x)] + list(chain(*x)))), sans)))\n", "sizeI, sizeJ, n = map(int, input().split())\r\n\r\nturn = 0\r\ncurI = curJ = 1\r\na = [[] for _ in range(n)]\r\n\r\ndef paint(pos):\r\n global curI, curJ, turn\r\n a[pos].extend((curI, curJ))\r\n if turn == 0:\r\n if curJ == sizeJ:\r\n curI += 1\r\n turn ^= 1\r\n else:\r\n curJ += 1\r\n else:\r\n if curJ == 1:\r\n curI += 1\r\n turn ^= 1\r\n else:\r\n curJ -= 1\r\n\r\nfor i in range(n):\r\n while len(a[i]) < 4:\r\n paint(i)\r\nwhile curI <= sizeI:\r\n paint(-1)\r\nfor row in a:\r\n print('%d %s' % (len(row) // 2, ' '.join(map(str, row))))", "n,m,k=map(int, input().split())\r\n\r\ntubes=[[]]\r\nc=0\r\nfor i in range(1,n+1):\r\n if i%2:\r\n for j in range(1,m+1):\r\n if len(tubes[c])>=2 and c<k-1:\r\n c+=1\r\n tubes.append([])\r\n tubes[c].append((i,j))\r\n else:\r\n for j in range(m,0,-1):\r\n if len(tubes[c])>=2 and c<k-1:\r\n c+=1\r\n tubes.append([])\r\n tubes[c].append((i,j))\r\nfor tube in tubes:\r\n print(len(tube),end=\" \")\r\n for i in range(len(tube)):\r\n print(*tube[i],end=\" \")\r\n print()", "n, m, k = map(int, input().split())\r\n\r\nsize = (n * m) // k \r\n\r\ntemp = []\r\ntubes = []\r\ncount = 0\r\nflag = True\r\nfor i in range(n):\r\n if flag:\r\n for j in range(m):\r\n temp.append((i + 1, j + 1))\r\n count += 1 \r\n if count == size and len(tubes) < k - 1:\r\n tubes.append(temp)\r\n count = 0\r\n temp = []\r\n flag = False\r\n else:\r\n for j in reversed(range(m)):\r\n temp.append((i + 1, j + 1))\r\n count += 1 \r\n if count == size and len(tubes) < k - 1:\r\n tubes.append(temp)\r\n count = 0\r\n temp = []\r\n flag = True\r\nif temp:\r\n tubes.append(temp)\r\nfor t in tubes:\r\n s = str(len(t)) + ' '\r\n for p in t:\r\n s += str(p[0]) + ' ' + str(p[1]) + ' '\r\n print(s)", "from collections import deque\r\ndef solve(n,m,k):\r\n arr=[]\r\n for i in range(1,n+1):\r\n if i%2!=0:\r\n for j in range(1,m+1):\r\n arr.append(i)\r\n arr.append(j)\r\n else:\r\n for j in reversed(range(1,m+1)):\r\n arr.append(i)\r\n arr.append(j)\r\n arr=deque(arr)\r\n while k>1:\r\n print(2,arr.popleft(),arr.popleft(),arr.popleft(),arr.popleft())\r\n k-=1\r\n print(len(arr)//2,\" \".join(map(str,arr)))\r\n\r\nA=list(map(int,input().split()))\r\nsolve(A[0],A[1],A[2])", "#!/usr/bin/env python3\nimport collections, itertools, fractions, functools, heapq, math, queue\n\ndef solve():\n n, m, k = map(int, input().split())\n\n cells = []\n for i in range(n):\n if i%2 == 0:\n for j in range(m): # left to right\n cells.append((i+1, j+1))\n else:\n for j in range(m, 0, -1):\n cells.append((i+1, j))\n\n for _ in range(k-1):\n print(2, *cells[-1], *cells[-2])\n cells.pop()\n cells.pop()\n\n print(len(cells), end=' ')\n for c in cells:\n print(*c, end=' ')\n print()\n\nif __name__ == '__main__':\n solve()\n\n", "from math import *\r\nfrom itertools import *\r\n\r\np = [int(x) for x in input().split()]\r\nn, m, k = p[0], p[1], p[2]\r\n\r\ntb = []\r\n\r\nfor i in range(n):\r\n \r\n if i%2 == 0:\r\n for j in range(m):\r\n tb.append([i,j])\r\n else:\r\n for j in range(m-1, -1, -1):\r\n tb.append([i,j])\r\nc = 0\r\ncnt = 0\r\ni = 0\r\nwhile cnt < k-1:\r\n print(2, end=\" \")\r\n print(tb[i][0]+1, tb[i][1]+1, tb[i+1][0]+1, tb[i+1][1]+1)\r\n c+=2\r\n i+=2\r\n cnt+=1\r\nprint(n*m - 2*(k-1), end = \" \")\r\nfor i in range(c, len(tb)):\r\n print(tb[i][0]+1, tb[i][1]+1, end= \" \")\r\n ", "from math import *\r\nfrom collections import *\r\nfrom random import *\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\nn,m,k=ma()\r\ntu=0\r\nre=0\r\nan=[]\r\nmo=0\r\nloc=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(re!=k-1):\r\n if(i%2==0):\r\n mo+=1\r\n loc.extend([i+1,j+1])\r\n if(mo==2):\r\n mo=0\r\n re+=1\r\n an.append(loc)\r\n loc=[]\r\n else:\r\n mo+=1\r\n loc.extend([i+1,m-j])\r\n if(mo==2):\r\n mo=0\r\n re+=1\r\n an.append(loc)\r\n loc=[]\r\n else:\r\n if(i%2==0):\r\n loc.extend([i+1,j+1])\r\n else:\r\n loc.extend([i+1,m-j])\r\nan.append(loc)\r\nfor i in range(k):\r\n print(len(an[i])//2,*an[i])\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n", "n,m,k=[int(i) for i in input().split()]\nx=1\ny=1\narr=[[1,1]]\ninv=1\nz=n*m\nwhile z>1:\n\tz-=1\n\tif y<m and inv==1:\n\t\ty+=1\n\telif y>1 and inv==-1:\n\t\ty-=1\n\telse:\n\t\tx+=1\n\t\tinv=-inv\n\tarr.append([x,y])\n\n##All pipes are 2 length until the last\nwhile k>1:\n\tprint(2,*arr.pop(),end=' ')\n\tprint(*arr.pop())\n\tk-=1\nprint(len(arr),end=' ')\nfor i in arr:\n\tprint(*i,end=' ')\nprint()\n\n\n##Same length pipes\n# z=n*m\n# tLen=z//k\n# while z>0:\n# \ttemp=min(tLen, z)\n# \tprint(temp, end=' ')\n# \tfor _ in arr[:temp]:\n# \t\tprint(*arr.pop(0),end=' ')\n# \tprint()\n# \tz-=temp\n \t \t \t\t\t\t\t\t \t \t\t\t \t \t \t \t \t", "from collections import defaultdict\r\nn,m,k=map(int,input().split())\r\ng=[]\r\nfor i in range(n):\r\n g.append([0]*m)\r\nd=defaultdict(list)\r\nc=1\r\ni=0\r\nj=0\r\ninc=1\r\nwhile i<n:\r\n if inc==1:\r\n if j+1<m:\r\n g[i][j]=c\r\n g[i][j+1]=c\r\n d[c].append(i+1)\r\n d[c].append(j+1)\r\n d[c].append(i+1)\r\n d[c].append(j+2)\r\n c=min(c+1,k)\r\n j+=2\r\n elif j==m-1:\r\n g[i][j]=c\r\n d[c].append(i+1)\r\n d[c].append(j+1)\r\n if i+1<n:\r\n g[i+1][j]=c\r\n d[c].append(i+2)\r\n d[c].append(j+1)\r\n c=min(c+1,k)\r\n j=m-2\r\n i=i+1\r\n inc=-1\r\n else:\r\n j=m-1\r\n i=i+1\r\n inc=-1\r\n else:\r\n if j-1>=0:\r\n g[i][j]=c\r\n g[i][j-1]=c\r\n d[c].append(i+1)\r\n d[c].append(j+1)\r\n d[c].append(i+1)\r\n d[c].append(j)\r\n c=min(c+1,k)\r\n j-=2\r\n elif j==0:\r\n g[i][j]=c\r\n d[c].append(i+1)\r\n d[c].append(j+1)\r\n if i+1<n:\r\n g[i+1][j]=c\r\n d[c].append(i+2)\r\n d[c].append(j+1)\r\n c=min(c+1,k)\r\n j=1\r\n i=i+1\r\n inc=1\r\n else:\r\n j=0\r\n inc=1\r\n i+=1\r\n if i==n:\r\n break\r\nfor i in range(1,k+1):\r\n print(len(d[i])//2,*d[i])", "\r\nn,m,k=map(int,input().split());x=1;y=1;inc=1;tot=0\r\ndef check(x,y,inc):\r\n if(y<1):return [x+1,1,1]\r\n elif(y>m):return [x+1,m,-1]\r\n else: return [x,y,inc]\r\nwhile(k!=1):\r\n print(2,end=' ')\r\n l=check(x,y+inc,inc)\r\n x1=l[0];y1=l[1];inc=l[2]\r\n print(x,y,x1,y1)\r\n l=check(x1,y1+inc,inc)\r\n x=l[0];y=l[1];inc=l[2]\r\n k-=1;tot+=2\r\nif(n*m-tot>0):\r\n print(n*m-tot,end=' ')\r\n while(x<=n):\r\n print(x,y,end=' ')\r\n l=check(x,y+inc,inc)\r\n x=l[0];y=l[1];inc=l[2]\r\n ", "n,m,k=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\tfor j in range(m):\r\n\t\t\tarr.append((i+1,j+1))\r\n\telse:\r\n\t\tfor j in range(m-1,-1,-1):\r\n\t\t\tarr.append((i+1,j+1))\r\n\r\nfor i in range(0,2*(k-1),2):\r\n\tprint(2,arr[i][0],arr[i][1],arr[i+1][0],arr[i+1][1])\r\n\t\r\nprint(n*m-2*k+2,end=' ')\r\n\r\nfor i in range(2*k-2,n*m):\r\n\tprint(arr[i][0],arr[i][1],end=' ')\r\n\t\r\nprint()\r\n", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\n# sys.setrecursionlimit(999999999)\r\nINF = 10**18\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 10**9 + 7\r\n\r\n# MAX = 100001\r\n\r\n# def sieve():\r\n# \tisPrime = [True]*(MAX)\r\n# \tisPrime[0] = False\r\n# \tisPrime[1] = False\r\n\r\n# \tfor i in range(2,MAX):\r\n# \t\tif isPrime[i]:\r\n# \t\t\tfor j in range(i*i, MAX, i):\r\n# \t\t\t\tisPrime[j] = False\r\n \r\n# \tprimes = [2]\r\n# \tfor i in range(3,MAX,2):\r\n# \t\tif isPrime[i]: primes.append(i)\r\n# \treturn primes\r\n \r\ntest = 1\r\n# test = int(input())\r\nfor _ in range(test):\r\n n,m,k = get_ints()\r\n # a = get_array()\r\n path = []\r\n x,y,right = 0,0,1\r\n path.append([x+1,y+1])\r\n while True:\r\n y += right\r\n if y==m: \r\n right *= -1\r\n y = m-1\r\n x += 1\r\n if y==-1 :\r\n right *= -1\r\n y = 0\r\n x += 1\r\n if x==n: break\r\n path.append([x+1,y+1])\r\n \r\n for i in range(k-1):\r\n print(2, *path[2*i], *path[2*i + 1])\r\n\r\n rem = m*n - 2*(k-1)\r\n print(rem, end=\" \")\r\n for i in range(2*(k-1),len(path)):\r\n print(*path[i], end=\" \")\r\n print()\r\n \r\n\r\n\r\n", "n, m, k = map(int,input().split())\r\nx = 1\r\ny = 1\r\nadd = 1\r\nfor pNum in range(k-1):\r\n print(2, end = ' ')\r\n print(x, y, end = ' ')\r\n y += add\r\n if y == m+1:\r\n y = m\r\n add = -1\r\n x = x + 1\r\n if y == 0:\r\n y = 1\r\n add = 1\r\n x = x + 1\r\n print(x, y, end = ' ')\r\n y += add\r\n if y == m+1:\r\n y = m\r\n add = -1\r\n x = x + 1\r\n if y == 0:\r\n y = 1\r\n add = 1\r\n x = x + 1\r\n print()\r\nprint(n * m - 2 * (k-1), end = ' ')\r\nwhile x < n+1:\r\n print(x, y, end = ' ')\r\n y += add\r\n if y == m+1:\r\n y = m\r\n add = -1\r\n x = x + 1\r\n if y == 0:\r\n y = 1\r\n add = 1\r\n x = x + 1\r\nprint()", "n = input()\r\nn = n.split()\r\nm = int(n[1])\r\nk = int(n[2])\r\nn = int(n[0])\r\nkol = m * n\r\ns = str(kol - (k - 1) * 2) #kolvo v hvoste\r\ni = 1; j = 1 # начальная точка таблицы\r\nki = 0 # направление прироста i (-1,1)\r\nc = n*m\r\nwhile k > 1:\r\n i = ki // m + 1\r\n j = abs((-m+1)*((i+1)%2) + ki % m)+1\r\n print(2,i,j,end=' ')\r\n ki += 1\r\n i = ki // m + 1\r\n j = abs((-m+1)*((i+1)%2) + ki % m)+1\r\n print( i, j)\r\n ki += 1\r\n k -= 1\r\n# остался хвост\r\nprint(s, end=' ')\r\nwhile ki < c:\r\n i = ki // m + 1\r\n j = abs((-m + 1) * ((i + 1) % 2) + ki % m) + 1\r\n print( i, j, end=' ')\r\n ki += 1\r\n\r\nprint()", "n, m, k = map(int, input().split())\r\nd, s, p = 0, [], [list(map(str, range(1, m + 1)))]\r\np.append(list(reversed(p[0])))\r\nfor i in map(str, range(1, n + 1)):\r\n s += [i + ' ' + j for j in p[d]]\r\n d = 1 - d\r\nd = 2 * k - 2\r\nfor i in range(0, d, 2): print(2, s[i] + ' ' + s[i + 1])\r\nprint(n * m - d, ' '.join(s[d: ]))", "n,m,d=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n p=[]\r\n if i%2==0:\r\n for j in range(m):\r\n p.append([i+1,j+1])\r\n else:\r\n for j in range(m-1,-1,-1):\r\n p.append([i+1,j+1])\r\n a.append(p)\r\nf=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n f.append(a[i][j])\r\nj=0\r\nfor i in range(d-1):\r\n print(2,*f[j],*f[j+1],sep=\" \")\r\n j+=2\r\nprint(n*m-j,end=\" \")\r\nwhile j<n*m:\r\n print(*f[j],end=\" \")\r\n j+=1\r\n ", "n,m,k=map(int,input().split(\" \"))\r\nans=[]\r\ntemp=[]\r\nchk=1\r\nk-=1\r\nfor x in range(n):\r\n if chk==1:\r\n for y in range(m):\r\n if len(temp)==0:\r\n temp.append(x+1)\r\n temp.append(y+1)\r\n elif k<=0:\r\n temp.append(x+1)\r\n temp.append(y+1)\r\n else:\r\n k-=1\r\n temp.append(x+1)\r\n temp.append(y+1)\r\n ans.append(temp)\r\n temp=[]\r\n chk^=1\r\n elif chk==0:\r\n for y in range(m-1,-1,-1):\r\n if len(temp)==0:\r\n temp.append(x+1)\r\n temp.append(y+1)\r\n elif k<=0:\r\n temp.append(x+1)\r\n temp.append(y+1)\r\n else:\r\n k-=1\r\n temp.append(x+1)\r\n temp.append(y+1)\r\n ans.append(temp)\r\n temp=[]\r\n chk^=1\r\nans.append(temp)\r\nfor x in ans:\r\n print(len(x)//2,end=\" \")\r\n print(*x)\r\n", "# 441C\r\n\r\n__author__ = 'artyom'\r\n\r\nn, m, k = map(int, input().split())\r\ni, j, d, t = 1, 1, 1, 1\r\nans = ''\r\n\r\n\r\ndef get_next(x, y, dir):\r\n y += dir\r\n if y > m:\r\n y = m\r\n x += 1\r\n dir = -1\r\n if y == 0:\r\n y = 1\r\n x += 1\r\n dir = 1\r\n return x, y, dir\r\n\r\n\r\nwhile t < k:\r\n ans += '2 ' + str(i) + ' ' + str(j)\r\n i, j, d = get_next(i, j, d)\r\n ans += ' ' + str(i) + ' ' + str(j) + '\\n'\r\n i, j, d = get_next(i, j, d)\r\n t += 1\r\nrem = n * m - (t - 1) * 2\r\nans += str(rem)\r\nwhile rem > 0:\r\n ans += ' ' + str(i) + ' ' + str(j)\r\n i, j, d = get_next(i, j, d)\r\n rem -= 1\r\n\r\nprint(ans)", "from sys import stdin\nfirstline = stdin.readline().rstrip().split()\nrows = int(firstline[0])\ncols = int(firstline[1])\nk = int(firstline[2])\n\nflip = True\nflat_matrix=[]\nfor row in range(rows):\n col_traversal = (range(cols-1, -1, -1), range(cols))[flip]\n for col in col_traversal:\n flat_matrix.append((row+1, col+1))\n flip = not flip\n\npoint = 0\nfor tube in range(k):\n if tube != k-1:\n print(\"2 \", end='')\n for cell in range(2):\n point + cell\n print(str(flat_matrix[point+cell][0]) + \" \" + str(flat_matrix[point+cell][1]) + \" \", end='')\n point += 2\n print()\n else:\n print(str(len(flat_matrix)-point) + \" \", end='')\n for cell in range(len(flat_matrix)-point):\n print(str(flat_matrix[point+cell][0]) + \" \" + str(flat_matrix[point+cell][1]) + \" \", end='')\nprint()\n", "from sys import stdin, stdout\r\nn,m,k = map(int, stdin.readline().split())\r\nrt=[]\r\nfor i in range(1,n+1):\r\n lt=[]\r\n if i%2==1:\r\n for j in range(1,m+1):\r\n lt.extend([i,j])\r\n else:\r\n for j in range(m,0,-1):\r\n lt.extend([i,j])\r\n rt.extend(lt)\r\n#print(rt)\r\nans=[]\r\np=0\r\nfor i in range(0,4*k-7,4):\r\n ans.append(rt[i:i+4])\r\n p=i+4\r\nans.append(rt[p:])\r\nfor x in ans:\r\n print(len(x)//2, *x)\r\n ", "R = lambda: map(int, input().split())\r\nn, m, k = R()\r\n\r\ndef nxtLoc(r, c):\r\n if c == m - 1 and r % 2 == 0 or c == 0 and r % 2:\r\n return (r + 1, c)\r\n return (r, c + 1) if r % 2 == 0 else (r, c - 1)\r\n\r\nloc = (0, -1)\r\nfor t in range(k):\r\n if t < k - 1:\r\n print(2, end=' ')\r\n for i in range(2):\r\n loc = nxtLoc(loc[0], loc[1])\r\n print(loc[0] + 1, loc[1] + 1, end=' ')\r\n print()\r\n else:\r\n rem = n * m - 2 * (k - 1)\r\n print(rem, end=' ')\r\n for i in range(rem):\r\n loc = nxtLoc(loc[0], loc[1])\r\n print(loc[0] + 1, loc[1] + 1, end=' ')\r\n print()", "n, m, k = map(int, input().split())\r\ndef z():\r\n for i in range(n):\r\n for j in range(m):\r\n if i % 2 == 0:\r\n yield i + 1, j + 1\r\n else:\r\n yield i + 1, m - j\r\ndef p(a):\r\n print(len(a), ' '.join(\"{} {}\".format(x, y) for x, y in a))\r\na = list(z())\r\nl = n * m // k\r\nfor i in range(k - 1):\r\n p(a[i * l : (i + 1) * l])\r\np(a[l * (k - 1):])", "(n, m, k) = map(int, input().split())\r\na = []\r\nfor i in range(1,n+1):\r\n if i% 2 == 1:\r\n for j in range(1,m+1):\r\n a.append([i,j])\r\n else:\r\n for j in range(m,0,-1):\r\n a.append([i,j])\r\n\r\n\r\nx = 1\r\ni = 0\r\nwhile x < k:\r\n print(2, end=' ')\r\n for j in range(i,i+2):\r\n print(*a[j], end=' ')\r\n i += 2\r\n x += 1\r\n print()\r\nprint(len(a)-i, end=' ')\r\nfor j in a[i:]:\r\n print(*j,end=' ')", "n, m, k = [int(j) for j in input().split()]\r\na = []\r\nc = k\r\nfor i in range(1, n + 1):\r\n if i % 2 != 0:\r\n for j in range(1, m + 1):\r\n a.append((i, j))\r\n else:\r\n for j in range(m, 0, -1):\r\n a.append((i, j))\r\nfor i in range(0, n * m, 2):\r\n if k > 1:\r\n print(2, *a[i], *a[i + 1])\r\n else:\r\n print(n * m - 2 * (c - 1), end=' ')\r\n for j in range(i, n * m):\r\n print(*a[j], end=' ')\r\n exit()\r\n k -= 1", "import sys\r\nfrom math import log2,floor,ceil,sqrt,gcd\r\n# import bisect\r\n# from collections import deque\r\n# sys.setrecursionlimit(7*10**4)\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\n\r\n\r\n\r\nn,m,k= Ri()\r\nroute = []\r\n\r\nd = 1\r\ni = 0\r\nj = 0\r\nwhile(i < n and j < m):\r\n # print(i,j)\r\n if d== 1 :\r\n if j + 1 < m:\r\n route.append([i,j])\r\n route.append([i,j+1])\r\n j+=2\r\n if j >= m:\r\n i+=1\r\n j = m-1\r\n d= -1\r\n else:\r\n route.append([i,j])\r\n i+=1\r\n j= m-1\r\n route.append([i,j])\r\n j-=1\r\n d = -1\r\n \r\n else:\r\n if j - 1 >= 0:\r\n route.append([i,j])\r\n route.append([i,j-1])\r\n j-=2\r\n if j < 0:\r\n i+=1\r\n j = 0\r\n d= 1\r\n else:\r\n route.append([i,j])\r\n i+=1\r\n j= 0\r\n route.append([i,j])\r\n j+=1\r\n d = 1\r\n if not ((0<= i < n) and (0<= j < m)):\r\n break\r\ni,j = route[-1]\r\nif not ((0<= i < n) and (0<= j < m)):\r\n route.pop()\r\nfor i in route:\r\n i[0]+=1\r\n i[1]+=1\r\nite = 0\r\nfor i in range(k-1):\r\n print(\"2\",end = \" \")\r\n print(*route[ite],end=\" \")\r\n ite+=1\r\n print(*route[ite],end = \" \")\r\n ite+=1\r\n print()\r\nprint(n*m - (k-1)*2,end = \" \")\r\nfor i in range(ite,len(route)):\r\n print(*route[i],end = \" \")\r\n \r\n \r\n ", "n,m,k = input().split()\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\nl = []\r\ni = 1\r\nj = 1\r\nwhile(i<n+1):\r\n\tif(j == 1):\r\n\t\twhile(j<m+1):\r\n\t\t\tl.append((i,j))\r\n\t\t\tj+=1\r\n\t\ti+=1\r\n\telif(j == m+1):\r\n\t\tj-=1;\r\n\t\twhile(j>0):\r\n\t\t\tl.append((i,j))\r\n\t\t\tj-=1\r\n\t\tj+=1\r\n\t\ti+=1\r\nt = n*m\r\nj = 0\r\nc = 0\r\nfor i in range(k-1):\r\n\tprint(int(t/k),end = ' ')\r\n\twhile(j<int(t/k)+c):\r\n\t\tprint(l[j][0],l[j][1],end = ' ')\r\n\t\tj+=1\r\n\tc +=int(t/k)\r\n\tprint(\"\\n\",end = \"\")\r\nprint(n*m-c,end = ' ')\r\nwhile(j<n*m):\r\n\tprint(l[j][0],l[j][1],end = ' ')\r\n\tj+=1", "n,m,k=[int(x) for x in input().split()]\r\ni=0\r\ncurrx=1\r\ncurry=1\r\nx=1\r\nwhile i<k:\r\n if i==k-1:\r\n ans=[]\r\n while currx<=n and curry<=m:\r\n ans.append([currx,curry])\r\n if curry==1 and x==-1:\r\n currx+=1\r\n x=1\r\n elif curry==m and x==1:\r\n currx+=1\r\n x=-1\r\n else:\r\n curry+=x\r\n print(len(ans),end=' ')\r\n for i in ans:\r\n print(i[0],i[1],end=' ')\r\n break\r\n else:\r\n \r\n print(2,end=' ')\r\n print(currx,curry,end=' ')\r\n \r\n if curry==1 and x==-1:\r\n \r\n currx+=1\r\n x=1\r\n elif curry==m and x==1:\r\n \r\n currx+=1\r\n x=-1\r\n else:\r\n curry+=x\r\n print(currx,curry)\r\n if curry==1 and x==-1:\r\n currx+=1\r\n x=1\r\n elif curry==m and x==1:\r\n \r\n currx+=1\r\n x=-1\r\n else:\r\n curry+=x\r\n i+=1\r\n ", "from collections import Counter\r\nimport itertools\r\nfrom functools import lru_cache\r\nimport sys\r\nimport math\r\n###############################################################################\r\n#Helper\r\ndef helper():\r\n pass\r\n###############################################################################\r\n#Solver\r\ndef solve():\r\n n, m, k = map(int, input().split(' '))\r\n perCell, last = (n * m) // k, (n * m) % k\r\n points = []\r\n turn = 0\r\n for i in range(1, n + 1):\r\n if turn == 0:\r\n for j in range(1, m + 1):\r\n points.append((i, j))\r\n else:\r\n for j in range(m, 0,-1):\r\n points.append((i, j))\r\n turn^=1\r\n index = 0\r\n for i in range(k-1):\r\n print(perCell, end=\" \")\r\n for j in range(perCell):\r\n print(points[index][0], points[index][1], end=\" \")\r\n index += 1\r\n print()\r\n print(perCell + last, end=\" \")\r\n for i in range(perCell + last):\r\n print(points[index][0], points[index][1], end=\" \")\r\n index += 1\r\n###############################################################################\r\n#Driver\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n###############################################################################", "n, m, k=[int(v) for v in input().split()]\r\nc, d=1, 1\r\nfor j in range(k-1):\r\n iota=[2]\r\n iota.extend([c, d])\r\n if c%2==1:\r\n if d<m:\r\n d+=1\r\n else:\r\n c+=1\r\n else:\r\n if d>1:\r\n d-=1\r\n else:\r\n c+=1\r\n iota.extend([c, d])\r\n if c%2==1:\r\n if d<m:\r\n d+=1\r\n else:\r\n c+=1\r\n else:\r\n if d>1:\r\n d-=1\r\n else:\r\n c+=1\r\n print(\" \".join([str(v) for v in iota]))\r\niota=[]\r\nif n%2==1:\r\n z=m\r\nelse:\r\n z=1\r\nwhile c!=n or d!=z:\r\n iota.extend([c, d])\r\n if c%2==1:\r\n if d<m:\r\n d+=1\r\n else:\r\n c+=1\r\n else:\r\n if d>1:\r\n d-=1\r\n else:\r\n c+=1\r\niota.extend([c, d])\r\nprint(len(iota)//2, \" \".join([str(v) for v in iota]))", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\ndef new_point_generator(n, m):\r\n i, j = 0, 0\r\n yield f\"{i + 1} {j + 1}\"\r\n while True:\r\n if j + 1 < m and i % 2 == 0:\r\n j += 1\r\n elif j - 1 >= 0 and i % 2 == 1:\r\n j -= 1\r\n yield f\"{i + 1} {j + 1}\"\r\n if j == m - 1 or j == 0:\r\n i += 1\r\n yield f\"{i + 1} {j + 1}\"\r\n\r\ndef solve():\r\n n, m, k = read_tuple(int)\r\n cells = n * m\r\n cells_for_pipe = [cells // k for _ in range(k)]\r\n cells_for_pipe[0] += cells % k\r\n cells_for_pipe = iter(cells_for_pipe)\r\n filled = 0\r\n point_generator = new_point_generator(n, m)\r\n while filled < cells:\r\n _len = next(cells_for_pipe)\r\n print(_len, end=' ')\r\n for _ in range(_len):\r\n print(next(point_generator), end=' ')\r\n filled += _len\r\n print()\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, m, k = [int(x) for x in input().split()]\n\ndef walk(n, m):\n\tfor i in range(n):\n\t\tif i%2==0:\n\t\t\tfor j in range(m):\n\t\t\t\tyield (i+1, j+1)\n\t\telse:\n\t\t\tfor j in range(m-1, -1, -1):\n\t\t\t\tyield (i+1, j+1)\n\nw = walk(n, m)\nfor s in range(k-1):\n\tprint(\"2 \", end=\"\")\n\tprint(\"{} {} \".format(*next(w)), end=\"\")\n\tprint(\"{} {}\".format(*next(w)), end=\"\")\n\tprint()\n\nr = []\nwhile True:\n\ttry:\n\t\tr.append(next(w))\n\texcept StopIteration as e:\n\t\tbreak\nprint(\"{} \".format(len(r)), end=\"\")\nfor i in r:\n\tprint(\"{} {} \".format(*i), end=\"\")\nprint()\n\n", "n, m, k = [int(x) for x in input().split()]\r\ntubes = n * m // k\r\nremainder = n * m % k\r\nx = 1\r\ny = 1\r\nflag = 0\r\nflag2 = 0\r\nflag3 = 0\r\nfor i in range(k):\r\n print(tubes+remainder, end=\" \")\r\n for j in range(tubes+remainder):\r\n print(x, y, end=\" \")\r\n if y == m and not flag3:\r\n flag = 1\r\n x += 1\r\n y += 1\r\n flag3 = 1\r\n elif y == 1 and flag2:\r\n flag = 0\r\n x += 1\r\n y -= 1\r\n flag2 = 0\r\n elif y == 1 and not flag2:\r\n flag2 = 1\r\n elif y == m and flag3:\r\n flag3 = 0\r\n\r\n # Changing the value of y depending on flag.\r\n\r\n if flag == 0:\r\n y += 1\r\n else:\r\n y -= 1\r\n\r\n # After loop is over.\r\n\r\n remainder = 0\r\n print()\r\n", "N, M, K = map(int, input().split())\r\n\r\nA = []\r\n\r\ncount = 0\r\n\r\ni = 0\r\nj = 0\r\n\r\nOPP = False\r\n\r\nwhile count != M * N:\r\n if K > 1:\r\n K -= 1\r\n count += 2\r\n\r\n temp = [2]\r\n\r\n temp.append((i + 1, j + 1))\r\n\r\n if OPP == False and j == M - 1:\r\n i += 1\r\n OPP = True\r\n temp.append((i + 1, j + 1))\r\n elif OPP == True and j == 0:\r\n i += 1\r\n OPP = False\r\n temp.append((i + 1, j + 1))\r\n else:\r\n if OPP == False:\r\n j += 1\r\n else:\r\n j -= 1\r\n\r\n temp.append((i + 1, j + 1))\r\n\r\n # Push to next cell\r\n\r\n if OPP == False and j == M - 1:\r\n i += 1\r\n OPP = True\r\n elif OPP == True and j == 0:\r\n i += 1\r\n OPP = False\r\n else:\r\n if OPP == False:\r\n j += 1\r\n else:\r\n j -= 1\r\n\r\n A.append(temp)\r\n\r\n else:\r\n temp = [M * N - count]\r\n\r\n temp.append((i + 1, j + 1))\r\n\r\n for x in range(M * N - count - 1):\r\n\r\n\r\n if OPP == False and j == M - 1:\r\n i += 1\r\n OPP = True\r\n temp.append((i + 1, j + 1))\r\n elif OPP == True and j == 0:\r\n i += 1\r\n OPP = False\r\n temp.append((i + 1, j + 1))\r\n else:\r\n if OPP == False:\r\n j += 1\r\n else:\r\n j -= 1\r\n\r\n temp.append((i + 1, j + 1))\r\n\r\n count = M * N\r\n\r\n A.append(temp)\r\n\r\nfor segment in A:\r\n print(segment[0], end = \" \")\r\n\r\n for i in range(1, segment[0] + 1):\r\n print(*segment[i], end = \" \")\r\n\r\n print(\"\")", "import sys\r\n# sys.setrecursionlimit(1000000)\r\ninput = sys.stdin.readline\r\n\r\ndef solve(n, m, k):\r\n ans = []\r\n left = n*m\r\n x, y = 0, 0\r\n flag = True\r\n k -= 1\r\n while k >= 0:\r\n curr = []\r\n while left > 2*k:\r\n if y == m:\r\n x += 1\r\n y = m-1\r\n flag = False\r\n if y == -1:\r\n x += 1\r\n y = 0\r\n flag = True\r\n curr.append(x+1)\r\n curr.append(y+1)\r\n if flag:\r\n y += 1\r\n else:\r\n y -= 1\r\n left -= 1\r\n ans.append(curr)\r\n k -= 1\r\n \r\n return ans\r\n\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n, m, k = map(int, input().split())\r\n \r\n res = solve(n, m, k)\r\n for each in res:\r\n print(len(each) // 2, end=\" \")\r\n print(*each)\r\n ", "n, m, k = map(int, input().split())\r\n\r\ndef printTube(tube):\r\n print(len(tube), end=' ')\r\n for cell in tube:\r\n print(cell[0] + 1, cell[1] + 1, end=' ')\r\n print()\r\n\r\nnbTubes = 0\r\ncurrTube = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n jDomain = range(m)\r\n else:\r\n jDomain = reversed(range(m))\r\n\r\n for j in jDomain:\r\n currTube.append((i, j))\r\n if len(currTube) >= 2 and nbTubes < k-1:\r\n printTube(currTube)\r\n currTube = []\r\n nbTubes += 1\r\nprintTube(currTube)", "n,m,k=map(int,input().split())\r\nx=1\r\ny=1\r\na=[[1,1]]\r\ninv=1\r\nz=n*m\r\nwhile z>1:\r\n z-=1\r\n if y<m and inv==1:\r\n y+=1\r\n elif y>1 and inv==-1:\r\n y-=1\r\n else:\r\n x+=1\r\n inv=-inv\r\n a.append([x,y])\r\nwhile k>1:\r\n print(2,*a.pop(),end=' ')\r\n print(*a.pop())\r\n k-=1\r\nprint(len(a),end=' ')\r\nfor i in a:\r\n print(*i,end=' ')\r\nprint()", "n, m, k = list(map(int, input().split(\" \")))\n\ns = False\n\ndef nex(x, y, s):\n\tif (y == 1 or y == m) and s:\n\t\treturn x + 1, y, False\n\tif x % 2:\n\t\treturn x, y + 1, True\n\treturn x, y - 1, True\n\nxc = 1\nyc = 1\nfor i in range(k - 1):\n\tprint(2, end = \" \")\n\tprint(xc, yc, end = \" \")\n\txc, yc, s = nex(xc, yc, s)\n\tprint(xc, yc)\n\txc, yc, s = nex(xc, yc, s)\n\nprint(n * m - (k - 1) * 2, end = \" \")\nfor i in range(n * m - (k - 1) * 2):\n\tprint(xc, yc, end=\" \")\n\txc, yc, s = nex(xc, yc, s)\n\n", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 11 May 2022\r\ndef exe():\r\n lst=[]\r\n for i in range(n):\r\n if i%2==0:\r\n for j in range(m):\r\n lst.append([i+1,j+1])\r\n else:\r\n for j in range(m-1,-1,-1):\r\n lst.append([i+1,j+1])\r\n index=0\r\n for i in range(k-1):\r\n print(2,end=\" \")\r\n for j in range(2):\r\n print(*lst[index],end=\" \")\r\n index+=1\r\n print()\r\n print(n*m-2*(k-1),end=\" \")\r\n while index<n*m:\r\n print(*lst[index],end=\" \")\r\n index+=1\r\n return\r\nn,m,k=map(int,input().split())\r\nexe()", "# Template 1.0\r\nimport sys, re, math\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\r\nfrom heapq import heappush, heappop, heapify, nlargest, nsmallest\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))\r\ndef sortDictWithVal(passedDic):\r\n temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))[::-1]\r\n toret = {}\r\n for tup in temp:\r\n toret[tup[0]] = tup[1]\r\n return toret\r\ndef sortDictWithKey(passedDic):\r\n return dict(OrderedDict(sorted(passedDic.items())))\r\nsys.setrecursionlimit(10 ** 9)\r\nINF = float('inf')\r\nmod = 10 ** 9 + 7\r\n\r\nn, m, k = MAP()\r\n\r\ntotal = n*m\r\nfoo = total//k\r\n\r\nleft = total - (k-1)*foo\r\nl = [foo]*(k-1)\r\nl.append(left)\r\n\r\nx = y = 1\r\nflag = 0\r\nfor el in l:\r\n print(el, end = \" \")\r\n for temp in range(1, el+1):\r\n if(y>m):\r\n x+=1\r\n y-=1\r\n flag = 1\r\n if(y<1):\r\n x+=1\r\n y+=1\r\n flag = 0\r\n print(x, y, end = \" \")\r\n if(flag==0):\r\n y+=1\r\n else:\r\n y-=1\r\n print()", "# -*- coding: utf-8 -*-\r\nimport sys\r\nf = sys.stdin\r\n#f = open('H:\\\\Portable Python 3.2.5.1\\\\test_248B1.txt') \r\nn, m, k = map(int, f.readline().strip().split())\r\n\r\n\r\n\r\nki = 1 \r\nps = []\r\nl = 0\r\np = []\r\nfor i in range(1,n+1): \r\n if i % 2 == 0:\r\n r = range(m,0,-1)\r\n else :\r\n r = range(1,m+1)\r\n for j in r:\r\n p.append(str(i))\r\n p.append(str(j))\r\n l += 1\r\n if ki<k and l==2:\r\n ps.append( '2 '+' '.join(p) )\r\n l = 0\r\n p = []\r\n ki += 1\r\nps.append( str(l) + ' ' + ' '.join(p) )\r\n\r\nprint('\\n'.join(ps))", "n,m,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n for j in range(m)[::[1,-1][i%2]]:\r\n l+=[str(i+1),str(j+1)]\r\np=m*n//k\r\nfor i in range(k-1):print(p,' '.join(l[2*p*i:2*p*(i+1)]))\r\nprint(m*n-p*(k-1),' '.join(l[2*p*(k-1):]))", "n, m, num = map(int, input().split(\" \"))\r\nx = 1\r\nxx = -1\r\ny = 0\r\nfor i in range(num - 1):\r\n j = 0\r\n s = \"2 \"\r\n while j < 2:\r\n if x == n and xx == 1:\r\n y += 1\r\n xx *= -1\r\n elif x == 1 and xx == -1:\r\n y += 1\r\n xx *= -1\r\n else:\r\n x += xx\r\n s += \"{} {} \".format(str(x), str(y))\r\n j += 1\r\n print(s)\r\ns = str(n * m - 2 * (num - 1)) + \" \"\r\nfor i in range(n * m - 2 * (num - 1)):\r\n if x == n and xx == 1:\r\n y += 1\r\n xx *= -1\r\n elif x == 1 and xx == -1:\r\n y += 1\r\n xx *= -1\r\n else:\r\n x += xx\r\n s += \"{} {} \".format(str(x), str(y))\r\nprint(s)\r\n", "import sys\r\nimport math\r\nimport bisect\r\ninput = sys.stdin.readline\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)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\ndef printlist(var) : sys.stdout.write(' '.join(map(str, var))+'\\n')\r\n\r\nn,m,k=invr()\r\nd=[]\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n for j in range(1,m+1):\r\n d.append(i)\r\n d.append(j)\r\n else:\r\n for j in range(m,0,-1):\r\n d.append(i)\r\n d.append(j)\r\nr=0\r\nfor i in range(k-1):\r\n print(2,d[r],d[r+1],d[r+2],d[r+3])\r\n r+=4\r\nprint((len(d)-r)//2,*d[r:])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m, k = map(int, input().split())\r\nans = []\r\ni = j = 1\r\nwhile i <= n:\r\n if j < 1 or j > m:\r\n i += 1\r\n j += [-1, 1][i % 2]\r\n if i > n:\r\n break\r\n ans.append(\"{} {}\".format(i, j))\r\n j += [-1, 1][i % 2]\r\ndiv = len(ans) // k\r\ni = -1\r\nfor i in range(k - 1):\r\n print(div, \" \".join(ans[i * div: (i + 1) * div]))\r\nans = ans[(i + 1) * div:]\r\nprint(len(ans), \" \".join(ans))", "from collections import deque\r\nr,c,k=map(int,input().split())\r\n#traverce\r\nlst=deque()\r\nfor i in range(r):\r\n for j in range(c):\r\n if i%2==0:\r\n lst.append([i+1,j+1])\r\n else:\r\n lst.append([i+1,c-j])\r\nfor i in range(k-1):\r\n print(2,*lst.popleft(),*lst.popleft())\r\ntemp=[]\r\nl=len(lst)\r\nwhile len(lst)>0:\r\n a,b=lst.popleft()\r\n temp.append(a)\r\n temp.append(b)\r\nprint(l,*temp)", "import math\r\na=[]\r\nn,m,k=map(int,input().split())\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n for j in range(1,m+1):\r\n a.append([i,j])\r\n else:\r\n for j in range(m,0,-1):\r\n a.append([i,j])\r\nx=1\r\ni=0\r\n#print(a)\r\nwhile x<=k-1:\r\n print(2,end=' ')\r\n for j in range(i,i+2):\r\n print(*a[j],end=' ')\r\n i+=2\r\n x+=1\r\n print()\r\nprint((n*m)-(2*(k-1)),end=' ')\r\nfor j in range(i,len(a)):\r\n print(*a[j],end=' ')\r\n #print(*a[j+1],end=' ')", "if __name__ == '__main__':\r\n\tn, m, k = map(int, input().split())\r\n\tlast_block_size = (m * n) - 2 * (k - 1)\r\n\r\n\tval = 1;\r\n\ttable = dict()\r\n\tfor i in range(1, n+1):\r\n\t\tif i%2:\r\n\t\t\tfor j in range(1, m+1):\r\n\t\t\t\ttable[val] = (i, j)\r\n\t\t\t\tval += 1\r\n\t\telse:\r\n\t\t\tfor j in range(m, 0, -1):\r\n\t\t\t\ttable[val] = (i,j)\r\n\t\t\t\tval += 1\r\n\r\n\tval = 1\r\n\tfor _ in range(1, k):\r\n\t\tprint(2, end=\" \")\r\n\t\tfor i in range(2):\r\n\t\t\tfor coord in table[val]:\r\n\t\t\t\tprint(coord, end=\" \")\r\n\t\t\tval += 1\r\n\t\tprint('')\r\n\r\n\tprint(last_block_size, end = \" \")\r\n\twhile val <= m*n:\r\n\t\tfor coord in table[val]:\r\n\t\t\tprint(coord, end=\" \")\r\n\t\tval += 1", "n, m, k = map(int, input().split())\r\nr = []\r\nfor i in range(n):\r\n for j in range(m)[::-(i % 2) * 2 + 1]:\r\n r += [str(i+1), str(j+1)]\r\n\r\nchunk = m*n//k\r\nfor i in range(k-1):\r\n print(chunk, ' '.join(r[2*i*chunk:2*(i+1)*chunk]))\r\n\r\nprint((len(r)- 2*(k-1)*chunk)//2, ' '.join(r[2*(k-1)*chunk:]))", "# import sys\r\n# sys.stdin = open(\"F:\\\\Scripts\\\\input\",\"r\")\r\n# sys.stdout = open(\"F:\\\\Scripts\\\\output\",\"w\")\r\n\r\n\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\n\r\nn,m,k=list(map(int,input().split()))\r\npipes=[[]]\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,m+1)[::(i%2)*2-1]:\r\n\t\tif(len(pipes)<k and len(pipes[-1])>=2):\r\n\t\t\tpipes.append([])\r\n\t\tpipes[-1].append((i,j))\r\n\r\nfor pipe in pipes:\r\n\tprint (len(pipe),end = ' ')\r\n\tfor x in pipe:\r\n\t\tprint ( x[0],x[1],end = ' ')\r\n\tprint (\"\")", "n,m,k=map(int,input().split())\r\nans=[]\r\nf=1\r\nfor i in range(1,n+1):\r\n if(f):\r\n for j in range(1,m+1):\r\n ans.append((str(i),str(j)))\r\n f=0\r\n else:\r\n for j in range(m,0,-1):\r\n ans.append((str(i),str(j)))\r\n f=1\r\n\r\nfor i in range(k-1):\r\n print(str(2),' '.join(ans.pop()),' '.join(ans.pop()))\r\nprint(len(ans),end=' ')\r\nfor i in ans:\r\n print(i[0],i[1],end=' ')\r\nprint()", "#https://codeforces.com/problemset/problem/441/C\r\n#1500\r\n\r\nn, m, k = list(map(int, input().split()))\r\n#print(n, m, k)\r\nif n * m < 2 * k:\r\n print(-1)\r\nelse:\r\n left = 0\r\n right = m - 1\r\n up = 0\r\n down = n - 1\r\n #螺旋矩阵\r\n res = []\r\n while up <= down and left <= right:\r\n #往右\r\n if left <= right:\r\n for i in range(left, right + 1):\r\n res.append([up, i])\r\n up += 1\r\n else:\r\n break\r\n #往下\r\n if up <= down:\r\n for i in range(up, down + 1):\r\n res.append([i, right])\r\n right -= 1\r\n else:\r\n break\r\n #往左\r\n if left <= right:\r\n for i in range(right, left - 1, -1):\r\n res.append([down, i])\r\n down -= 1\r\n else:\r\n break\r\n #往上\r\n if up <= down:\r\n for i in range(down, up - 1, -1):\r\n res.append([i, left])\r\n left += 1\r\n else:\r\n break\r\n i = 0\r\n ans = []\r\n #print(res)\r\n while i < k:\r\n if i != k - 1:\r\n ans.append([2, res[2 * i][0] + 1, res[2 * i][1] + 1, res[2 * i + 1][0] + 1, res[2 * i + 1][1] + 1])\r\n else:\r\n left = len(res) - 2 * i\r\n j = 2 * i\r\n tmp = [left]\r\n for t in range(j, len(res)):\r\n tmp.append(res[t][0] + 1)\r\n tmp.append(res[t][1] + 1)\r\n ans.append(tmp)\r\n i += 1\r\n for item in ans:\r\n print(*item)", "import sys\r\nimport math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nfrom heapq import heappop, heappush, heapify\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,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\nn,m,k = inum()\r\nl = [(n*m)//k for i in range(k)]\r\n\r\nfor i in range((n*m)%k):\r\n l[i] += 1\r\n\r\nans = [[] for i in range(k)]\r\n\r\nk = 0\r\ni,j = 1,1\r\nright = True\r\n\r\nfor p in range(n):\r\n for q in range(m):\r\n if not l[k]:\r\n k += 1\r\n ans[k].append(i)\r\n ans[k].append(j)\r\n l[k] -= 1\r\n\r\n if right:\r\n if j < m:\r\n j += 1\r\n else:\r\n i += 1\r\n right = False \r\n else:\r\n if j > 1:\r\n j -= 1\r\n else:\r\n i += 1\r\n right = True \r\nfor i in ans:\r\n print(len(i)//2,*i)\r\n \r\n\r\n", "def nex(x, y):\r\n if x%2==1:\r\n if y==m:\r\n return x+1, y\r\n else:\r\n return x, y+1\r\n else:\r\n if y==1:\r\n return x+1, y\r\n else:\r\n return x, y-1\r\n\r\nn, m, k = map(int, input().split())\r\nans = []\r\nx, y = 1, 1\r\n\r\nfor i in range(k):\r\n if i<k-1:\r\n c = 2\r\n else:\r\n c = n*m-2*(k-1)\r\n \r\n ans_i = [c]\r\n \r\n for _ in range(c):\r\n ans_i.append(x)\r\n ans_i.append(y)\r\n x, y = nex(x, y)\r\n \r\n ans.append(ans_i)\r\n\r\nfor ans_i in ans:\r\n print(*ans_i)", "n,m,k = map(int,input().split())\r\nans=[]\r\ni=1\r\nj=1\r\ngg = (n*m)//2\r\nfor g in range(gg):\r\n if i%2!=0:\r\n if j!=m:\r\n ans.append([i,j,i,j+1])\r\n j+=2\r\n if j==m+1:\r\n j=m\r\n i+=1\r\n else:\r\n ans.append([i,j,i+1,m])\r\n i+=1\r\n j=m-1 \r\n else:\r\n if j!=0:\r\n ans.append([i,j,i,j-1])\r\n j-=2\r\n if j==0:\r\n j=1\r\n i+=1\r\n else:\r\n ans.append([i,j,i+1,1])\r\n j=2\r\n i+=1\r\nx,y,z,q =ans[-1]\r\nif n%2!=0 and q!=m:\r\n ans[-1]+=[n,m]\r\nelif n%2==0 and q!=1:\r\n ans+=[n,1] \r\naa=[]\r\nc=1 \r\n \r\nfor i in ans[:k-1]:\r\n print(len(i)//2,end=' ')\r\n print(*i)\r\nfor i in ans[k-1:]:\r\n aa+=i\r\nprint(len(aa)//2,end=' ')\r\nprint(*aa) \r\n\r\n\r\n\r\n", "n, m, k = map(int, input().split())\r\nc = k\r\ndir = \"right\"\r\nstart_x = 1\r\nstart_y = 1\r\nans = []\r\nwhile c > 0:\r\n\r\n if c == 1:\r\n r = m*n-2*(k-1)\r\n s = str(r)+' '\r\n pos = []\r\n while r > 0:\r\n pos.append((start_y, start_x))\r\n move = 1 if dir == \"right\" else -1\r\n start_x += move\r\n if start_x == m+1:\r\n start_x = m\r\n start_y += 1\r\n dir = \"left\"\r\n if start_x == 0:\r\n start_x = 1\r\n start_y += 1\r\n dir = \"right\"\r\n r -= 1\r\n s += ' '.join([\"{} {}\".format(x[0],x[1]) for x in pos])\r\n ans.append(s)\r\n else:\r\n move = 2 if dir == \"right\" else -2\r\n if dir == \"right\":\r\n if start_x + move > m+1:\r\n ans.append(\"2 {} {} {} {}\".format(start_y, start_x, start_y+1, start_x))\r\n start_x = m\r\n start_y += 1\r\n move -= 1\r\n dir = \"left\"\r\n start_x -= 1\r\n else:\r\n ans.append(\"2 {} {} {} {}\".format(start_y, start_x, start_y, start_x+1))\r\n start_x += 2\r\n if start_x > m:\r\n start_y += 1\r\n start_x = m\r\n dir = \"left\"\r\n else:\r\n if start_x + move < 0:\r\n ans.append(\"2 {} {} {} {}\".format(start_y, start_x, start_y+1, start_x))\r\n start_x = 1\r\n start_y += 1\r\n move -= 1\r\n dir = \"right\"\r\n start_x += 1\r\n else:\r\n ans.append(\"2 {} {} {} {}\".format(start_y, start_x, start_y, start_x-1))\r\n start_x -= 2\r\n if start_x < 1:\r\n start_y += 1\r\n start_x = 1\r\n dir = \"right\"\r\n c -= 1\r\n\r\n\r\nprint(*ans, sep='\\n')", "from collections import defaultdict,deque,Counter,OrderedDict\r\n\r\ndef main():\r\n n,m,k = map(int,input().split())\r\n l,ans = [],[]\r\n for i in range(1,n+1):\r\n if i%2 == 0:\r\n for j in range(m,0,-1):\r\n l.append((i,j))\r\n else:\r\n for j in range(1,m+1):\r\n l.append((i,j))\r\n curr = 0\r\n while k > 1:\r\n ans.append([l[curr][0], l[curr][1], l[curr + 1][0], l[curr + 1][1]])\r\n curr += 2\r\n k -= 1\r\n ans.append([])\r\n for i in range(curr,len(l)):\r\n ans[-1].append(l[i][0])\r\n ans[-1].append(l[i][1])\r\n for i in ans:\r\n print(len(i)//2,\" \".join(map(str,i)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\nif __name__ == '__main__':\r\n n, m, k = [int(x) for x in input().split()];\r\n cells = n * m\r\n direction, x, y = 1, 1, 1\r\n for i in range(k - 1):\r\n s = \"2 \"\r\n\r\n for j in range(2):\r\n s += str(x) + \" \" + str(y)\r\n y += direction\r\n cells -= 1\r\n if (j == 0):\r\n s += \" \"\r\n if (not (y <= m and y > 0)):\r\n direction = 1 if direction == -1 else -1\r\n y += direction\r\n x += 1\r\n\r\n print(s)\r\n\r\n s = str(cells) + \" \"\r\n while (cells > 0):\r\n s += str(x) + \" \" + str(y)\r\n y += direction\r\n cells -= 1\r\n if (cells > 0):\r\n s += \" \"\r\n if (not (y <= m and y > 0)):\r\n direction = 1 if direction == -1 else -1\r\n y += direction\r\n x += 1\r\n print(s)", "n,m,k=list(map(int,input().split()))\r\ng=[]\r\nrever=1\r\nfor i in range(1,n+1):\r\n if rever==1:\r\n rever=0\r\n else:\r\n rever=1\r\n for j in range(1,m+1):\r\n if rever==0:\r\n g.append(i)\r\n g.append(j)\r\n if rever==1:\r\n g.append(i)\r\n g.append(m+1-j)\r\nl=0\r\nfor i in range(k-1):\r\n\r\n print(2,g[l],g[l+1],g[l+2],g[l+3])\r\n l+=4\r\nprint((len(g)-l)//2,end=' ')\r\nfor i in range(l,len(g)):\r\n print(g[i],end=' ')\r\n \r\n\r\n \r\n \r\n ", "n,m,k=map(int,input().split())\r\npath=[]\r\nfor i in range(1,n+1):\r\n\tif i%2==1:\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tpath.append((i,j))\r\n\telse:\r\n\t\tfor j in range(m,0,-1):\r\n\t\t\tpath.append((i,j))\r\nfor i in range(k-1):\r\n\tprint(2,path[2*i][0],path[2*i][1],path[(2*i)+1][0],path[(2*i)+1][1])\r\nrem = (n*m)-(2*(k-1))\r\nprint(rem,end =\" \")\r\nfor i in range(2*(k-1),n*m):\r\n\tprint(path[i][0],path[i][1],end = \" \")", "# t=int(input())\n# for _ in range(t):\nrows,cols,k=map(int,input().split())\n# arr=list(map(int,input().split()))\n# # rows,cols=4,4\n# # arr=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 ,15, 16]\n# mat=[]\nspiralMat=[]\n# for i in range(rows):\n# li=arr[i*cols:i*cols+cols]\n# mat.append(li)\n# print(mat)\n\nleft=0\nright=cols-1\nup=0\ndown=rows-1\n\nwhile(left<=right and up<=down):\n for i in range(left,right+1):\n # print(mat[up][i],end=\" \")\n\n # spiralMat.append(mat[up][i])\n spiralMat.append((up+1,i+1))\n up+=1\n for i in range(up,down+1):\n # print(mat[i][right],end=\" \")\n # spiralMat.append(mat[i][right])\n spiralMat.append((i+1,right+1))\n right-=1\n\n if(left<=right and up<=down):\n for i in range(right,left-1,-1):\n # print(mat[down][i],end=\" \")\n # spiralMat.append(mat[down][i])\n spiralMat.append((down+1,i+1))\n down-=1\n\n for i in range(down,up-1,-1):\n # print(mat[i][left],end=\" \")\n # spiralMat.append(mat[i][left])\n spiralMat.append((i+1,left+1))\n left+=1\n# print(spiralMat)\n\nn=rows*cols\nindex=0\nfor i in range(k-1):\n print(2,end=\" \")\n for j in range(2):\n print(*spiralMat[index],end=\" \")\n index+=1\n # print(*spiralMat[i*2:i*2+2])\n # index+=2\n print()\n# print(n,index)\n\nprint((n- index),end=\" \")\nfor i in range(index,n):\n print(*spiralMat[i],end=\" \")\nprint()\n# print((n- index-1),*spiralMat[index:n])\n", "n,m,k=map(int,input().split())\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n if(i%2==0):\r\n for j in range(m):\r\n x.append(i+1)\r\n y.append(j+1)\r\n else:\r\n for j in range(m-1,-1,-1):\r\n x.append(i+1)\r\n y.append(j+1)\r\nj=0\r\np=n*m\r\n#print(x,y)\r\nfor i in range(k-1):\r\n p1=str(x[j])+\" \"+str(y[j])\r\n j+=1\r\n p2=str(x[j])+\" \"+str(y[j])\r\n j+=1\r\n p-=2\r\n print(\"2\",p1,p2)\r\nl=[]\r\nfor i in range(j,len(x)):\r\n l.append(x[i])\r\n l.append(y[i])\r\ns=str()\r\nfor i in l:s+=(str(i)+\" \")\r\nprint(p,s)\r\n\r\n", "n,m,k = map(int,input().split())\r\nval = n*m-2*(k-1)\r\nprint(val,end=' ')\r\ncnt = 0\r\nturn = 1\r\nlst = []\r\nwhile turn<=n:\r\n if turn%2==0:\r\n j = m\r\n else:\r\n j = 1\r\n while j<=m and j>=1:\r\n if cnt==val:\r\n lst.append([turn,j])\r\n if turn%2==0:\r\n j -= 1\r\n else:\r\n j += 1\r\n else:\r\n cnt += 1\r\n if cnt==val:\r\n print(turn,j)\r\n else:\r\n print(turn,j,end=' ')\r\n if turn%2==0:\r\n j -= 1\r\n else:\r\n j += 1\r\n turn += 1\r\nc = 0\r\nitert = 2*(k-1)\r\nwhile c<2*(k-1):\r\n print(2,*lst[c],*lst[c+1])\r\n c += 2\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nn, m, k = map(int, input().split())\r\nd = deque()\r\nfor i in range(1, n+1):\r\n if i & 1:\r\n for j in range(m, 0, -1):\r\n d.appendleft((i, j))\r\n else:\r\n for j in range(1, m+1):\r\n d.appendleft((i, j))\r\new = []\r\nwhile k > 1:\r\n a, b = d.pop()\r\n a1, b1 = d.pop()\r\n ew.append((2, a, b, a1, b1))\r\n k -= 1\r\n\r\nx = len(d)\r\ne = []\r\nfor i in d:\r\n e.extend(i)\r\n\r\new.append((x, *e))\r\nfor i in ew:\r\n print(' '.join(map(str, i)))\r\n", "n,m,k = map(int,input().split())\r\ni = 0\r\nj = 1\r\na = 1\r\ncheck = 0\r\nfor _ in range(k-1):\r\n print(2,end=\" \")\r\n for _ in range(2):\r\n if j == m and check == 0:\r\n check = 1\r\n a = -1\r\n i += 1\r\n elif j == 1 and check == 0:\r\n a = 1\r\n i += 1\r\n check = 1\r\n else:\r\n check = 0\r\n if check == 0:\r\n j += a\r\n print(i,j,end=\" \")\r\n print()\r\nk = n*m - 2*(k-1)\r\nprint(k,end=\" \")\r\nfor h in range(k):\r\n if j == m and check == 0:\r\n check = 1\r\n a = -1\r\n i += 1\r\n elif j == 1 and check == 0:\r\n a = 1\r\n i += 1\r\n check = 1\r\n else:\r\n check = 0\r\n if check == 0:\r\n j += a\r\n print(i,j,end=\" \")\r\n\r\n\r\n", "lst = list(map(int, input().split(' ')))\nn, m, k = lst\n\ncoors = []\ncol = 1\nmode = 1 # 1 == inc, 0 == dec\nfor i in range(1, n + 1):\n\tif(col > m):\n\t\tcol = m\n\tif(col < 1):\n\t\tcol = 1\n\twhile(col <= m and col >= 1):\n\t\tcoors.append([i, col])\n\t\tif(mode == 1):\n\t\t\tcol += 1\n\t\telse:\n\t\t\tcol -= 1\n\tif(mode == 0):\n\t\tmode = 1\n\telse:\n\t\tmode = 0\nquo = (n * m) // k\nrem = (n * m) % k\nt = 0\nfor i in range(k - 1):\n\tprint(quo, end=' ', sep = ' ')\n\tfor i in range(quo):\n\t\tprint(coors[i + t][0], end=' ', sep = ' ')\n\t\tprint(coors[i + t][1], end=' ', sep = ' ')\n\tt += quo\n\tprint()\n\nprint(quo + rem, end=' ', sep = ' ')\nfor i in range(quo + rem):\n\tprint(*coors[i + t], end=' ', sep = ' ')\n", "n,m,k=map(int,input().split())\r\na=[]\r\nc=True\r\nfor i in range(1,n+1):\r\n t=[(i,y) for y in range(1,m+1)]\r\n if c:\r\n a.extend(t)\r\n if not c:\r\n a.extend(t[::-1])\r\n c=not c\r\ns=0\r\nfor i in range(0,len(a),len(a)//k):\r\n s+=1\r\n if s==k:\r\n t=a[i:]\r\n print(len(t), end=' ')\r\n for x, y in t:\r\n print(x, y, end=' ')\r\n break\r\n else:\r\n t=a[i:i+len(a)//k]\r\n print(len(t),end=' ')\r\n for x,y in t:\r\n print(x,y,end=' ')\r\n print()", "def main():\n\tn, m, k = [int(x) for x in input().split()]\n\n\tcnt, t = 0, 0\n\tfor i in range(n):\n\t\tif i % 2:\n\t\t\tfor j in range(m-1, -1, -1):\n\t\t\t\tif k > 1:\n\t\t\t\t\tif cnt < 1:\n\t\t\t\t\t\tprint(2, i+1, j+1, end = ' ')\n\t\t\t\t\t\tcnt += 1\n\t\t\t\t\telse:\n\t\t\t\t\t\tprint(i+1, j+1)\n\t\t\t\t\t\tcnt = 0\n\t\t\t\t\t\tk -= 1\n\t\t\t\telif k == 1:\n\t\t\t\t\tprint(m*n-t, i+1, j+1, end = ' ')\n\t\t\t\t\tk -= 1\n\t\t\t\telse:\n\t\t\t\t\tprint(i+1, j+1, end = ' ')\n\t\t\t\tt += 1\n\t\telse:\n\t\t\tfor j in range(m):\n\t\t\t\tif k > 1:\n\t\t\t\t\tif cnt < 1:\n\t\t\t\t\t\tprint(2, i+1, j+1, end = ' ')\n\t\t\t\t\t\tcnt += 1\n\t\t\t\t\telse:\n\t\t\t\t\t\tprint(i+1, j+1)\n\t\t\t\t\t\tcnt = 0\n\t\t\t\t\t\tk -= 1\n\t\t\t\telif k == 1:\n\t\t\t\t\tprint(m*n-t, i+1, j+1, end = ' ')\n\t\t\t\t\tk -= 1\n\t\t\t\telse:\n\t\t\t\t\tprint(i+1, j+1, end = ' ')\n\t\t\t\tt += 1\n\tprint('')\n\nif __name__ == '__main__':\n\tmain()", "n,m,k = map(int , input().split())\r\ns = n*m//k\r\ns1 = s + n*m - s*k\r\nl = []\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if i%2==1:\r\n l.append((i,j))\r\n else:\r\n l.append((i,m+1-j))\r\nc = 0\r\nwhile k>0:\r\n if k==1:\r\n print(s1,end=' ')\r\n k-=1\r\n for i in range(c,n*m):\r\n print(l[i][0],l[i][1],end=' ')\r\n else:\r\n print(s,end=' ')\r\n k-=1\r\n if k>=1:\r\n for i in range(s):\r\n print(l[c][0],l[c][1],end=' ')\r\n c+=1\r\n print(' ')", "def solve():\r\n n, m, k = map(int, input().split())\r\n\r\n l = n * m // k # Lenght of each tube\r\n lf = n * m - (l * (k - 1)) # Lenght of the first tube\r\n\r\n # print(f\"First Tube Length: {lf}\")\r\n # print(f\"Next Tubes Length: {l}\")\r\n # print(f\"Total Number of Tubes: {k}\")\r\n\r\n direction = 1 # 1 means moving right; -1 means moving left;\r\n\r\n position = [1, 1]\r\n ti = 0 # tube index\r\n tube = []\r\n sizes = [lf]\r\n for _ in range(k - 1):\r\n sizes.append(l)\r\n\r\n filled_cells = 0\r\n\r\n while filled_cells < n * m:\r\n tube.append(list(position))\r\n filled_cells += 1\r\n\r\n if len(tube) == sizes[ti]:\r\n print(f\"{len(tube)} {' '.join(f'{t[0]} {t[1]}' for t in tube)}\")\r\n tube = []\r\n ti += 1\r\n\r\n position[1] += direction\r\n\r\n if position[1] > m:\r\n position[1] = m\r\n position[0] += 1\r\n direction = -1\r\n\r\n if position[1] < 1:\r\n position[1] = 1\r\n position[0] += 1\r\n direction = 1\r\n\r\n\r\nsolve()\r\n", "import sys\r\n\r\n#sys.stdin, sys.stdout = open(\"input.txt\", \"r\"), open(\"output.txt\", \"w\")\r\n\r\nn, m, k = map(int, input().split())\r\nsolution = []\r\n\r\nfor i in range(1, n + 1):\r\n r = range(1, m + 1) if i % 2 == 1 else reversed(range(1, m + 1))\r\n for j in r:\r\n solution.append((i, j))\r\n\r\ni = 0\r\nfor __ in range(k - 1):\r\n print(\"2 %d %d %d %d\" % (solution[i][0], solution[i][1], solution[i+1][0], solution[i+1][1]))\r\n i += 2\r\n\r\nprint(n*m - (k-1)*2, end=\" \")\r\n\r\nwhile i < n*m:\r\n print(\"%d %d\" % (solution[i][0], solution[i][1]), end=\" \")\r\n i += 1\r\n\r\n\r\n", "n,m,k = list(map(int,input().split()))\r\nunit_tube = (n * m) // k\r\nlong_tube = (n * m) % k + unit_tube\r\n\r\nprint(long_tube,end='')\r\ni = 0\r\nj = 0\r\nref = 0\r\nfor _ in range(long_tube):\r\n print(' {0} {1}'.format(i + 1,abs(j + 1 - ref)),end='')\r\n if((j + 1) % (m) == 0):\r\n i+=1\r\n ref = 0 if(ref) else m + 1\r\n j = (j + 1) % m\r\nprint()\r\nfor _ in range(k - 1):\r\n print(unit_tube,end='')\r\n for _ in range(unit_tube):\r\n print(' {0} {1}'.format(i + 1,abs(j + 1 - ref)),end='')\r\n if((j + 1) % (m) == 0):\r\n i+=1\r\n ref = 0 if(ref) else m + 1\r\n #j = abs((j + 1) % (m) - ref)\r\n j = (j + 1) % m\r\n print()\r\n ", "def calcPos(x):\r\n div = (x - 1) // n + 1\r\n pos = (x - 1) % n + 1\r\n if div & 1:\r\n return (div, pos)\r\n return (div, n - pos + 1)\r\n\r\n\r\nm, n, k = map(int, input().split())\r\n\r\nfor i in range(1, k):\r\n print(2, end=\" \")\r\n pair = calcPos((i << 1) - 1)\r\n print(*pair, end=\" \")\r\n pair = calcPos(i << 1)\r\n print(*pair, end=\"\\n\")\r\nprint(n * m - ((k - 1) << 1), end=\" \")\r\n\r\ni = (k << 1) - 1\r\nwhile i <= n * m:\r\n pair = calcPos(i)\r\n print(*pair, end=\" \")\r\n i = i + 1\r\nprint(\"\\n\", end=\"\")\r\n", "def fucn(x,y,c):\r\n if x%2:\r\n y= y+1\r\n if y>c:\r\n x=x+1\r\n y=c\r\n else:\r\n y= y-1\r\n if y<1:\r\n x=x+1;\r\n y=1;\r\n return x,y\r\n\r\nscann=input()\r\nx=1\r\ny=1\r\nacum=0\r\narr=[]\r\nnumbers=scann.split()\r\nrow= numbers[0]\r\ncolumn= numbers[1]\r\ntube = numbers [2]\r\nr= int(row)\r\nc= int(column)\r\nt= int(tube)\r\ntable= r*c\r\naux= (int(table))/t\r\nfor i in range(t-1):\r\n arr.append(int(aux))\r\n for j in range(int(aux)):\r\n arr.append(int(x))\r\n arr.append(int(y))\r\n x,y= fucn(x,y,c)\r\n acum=acum+1\r\n print(*arr)\r\n arr=[]\r\narr.append(table-acum)\r\nnew= table-acum\r\nfor k in range(int(new)):\r\n arr.append(int(x))\r\n arr.append(int(y))\r\n x,y= fucn(x,y,c)\r\nprint(*arr)", "n, m, k = map(int, input().split())\r\n\r\nc = []\r\nr = [2] * (k - 1) + [n * m - 2 * (k - 1)]\r\n\r\nno = 0\r\nf = 1\r\nx = 1\r\ny = 1\r\nfor i in range(1, k):\r\n c.append([])\r\n for j in range(2):\r\n if y > m:\r\n f = -1\r\n y = m\r\n x += 1\r\n if y < 1:\r\n y = 1\r\n f = 1\r\n x += 1\r\n c[no] += [(x, y)]\r\n y += f\r\n no += 1\r\n\r\nc.append([]) \r\nfor j in range(r[-1]):\r\n if y > m:\r\n f = -1\r\n y = m\r\n x += 1\r\n if y < 1:\r\n y = 1\r\n f = 1\r\n x += 1\r\n c[no] += [(x, y)]\r\n y += f\r\nfor i in range(k):\r\n print(r[i],end=' ')\r\n for x, y in c[i]:\r\n print(x, y,end=' ') \r\n print()\r\n", "def generateNext(i,j,c):\r\n if i%2==1:\r\n if j==c:\r\n return [i+1,j]\r\n else:\r\n return [i,j+1]\r\n else:\r\n if j==1:\r\n return [i+1,j]\r\n else:\r\n return [i,j-1]\r\n\r\n\r\n\r\ndef main():\r\n r,c,k = list(map(int,input().split()))\r\n left = r*c\r\n i=1\r\n j=1\r\n while k>0:\r\n if k!=1:\r\n print(2,end=\" \")\r\n print(i, j, end=\" \")\r\n i,j = generateNext(i,j,c)\r\n print(i, j, end=\" \")\r\n i,j = generateNext(i,j,c)\r\n left=left-2\r\n else:\r\n print(left,end=\" \")\r\n while left>0:\r\n print(i, j, end=\" \")\r\n i,j = generateNext(i,j,c)\r\n left = left-1\r\n print(\"\")\r\n k=k-1\r\n\r\nmain()", "n,m,k=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n+1): \r\n if i%2: \r\n for j in range(1,m+1): \r\n l.append([i,j])\r\n else: \r\n for j in range(m,0,-1): \r\n l.append([i,j])\r\ni = 0\r\nwhile i//2 < k-1:\r\n print(2, l[i][0],l[i][1], l[i+1][0], l[i+1][1])\r\n i += 2\r\n \r\nprint(len(l) - i, end =' ')\r\nwhile i < len(l):\r\n print(l[i][0], l[i][1], end =' ')\r\n i += 1", "from 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\ndef solution():\r\n n, m, k = [int(num) for num in input().split()]\r\n points = []\r\n dj = -1\r\n j = -1\r\n for i in range(n):\r\n dj = -dj\r\n j += dj\r\n while 0 <= j <= m - 1:\r\n points.append((i, j))\r\n j += dj\r\n for i in range(k - 1):\r\n print(2, points[2 * i][0] + 1, points[2 * i][1] + 1, points[2 * i + 1][0] + 1, points[2 * i + 1][1] + 1)\r\n print(len(points) - 2 * (k - 1), end=' ')\r\n for i in range(2 * k - 2, len(points)):\r\n print(points[i][0] + 1, points[i][1] + 1, end=' ')\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,m,k = [int(i) for i in input().split()]\nimport sys\nseq = []\nrev = False\nfor i in range(n):\n l = list(zip([i+1]*m,range(1,m+1)))\n if rev:\n l.reverse()\n seq += l\n rev = not rev\n\nfor i in range(k-1):\n sys.stdout.write('2 ' + str(seq[i*2][0]) + ' ' + str(seq[i*2][1]) + ' ' + str(seq[i*2+1][0]) + ' ' + str(seq[i*2+1][1]) + '\\n')\n\nprint(len(seq) - k*2 + 2,end=' ')\nfor a,b in seq[k*2-2:]:\n sys.stdout.write(str(a) + ' ' + str(b) + ' ')\n", "from sys import stdin, exit, setrecursionlimit\r\nsetrecursionlimit(100000000)\r\nfrom math import *\r\nfrom bisect import bisect_left\r\nfrom collections import deque\r\n\r\ninput = stdin.readline\r\nlmi = lambda: list(map(int, input().split()))\r\nmi = lambda: map(int, input().split())\r\nsi = lambda: input().strip('\\n')\r\nssi = lambda: input().strip('\\n').split()\r\n\r\n\r\nn, m, k = mi()\r\narr = [[] for i in range(k)]\r\nfor i in range(1, n+1):\r\n if i % 2 == 0:\r\n for j in range(1, m+1):\r\n arr[0].append((i, j))\r\n else:\r\n for j in range(m, 0, -1):\r\n arr[0].append((i, j))\r\nfor i in range(1, k):\r\n arr[i].append(arr[0].pop())\r\n arr[i].append(arr[0].pop())\r\nfor i in arr:\r\n print(len(i),end=\" \")\r\n for j in i:\r\n print(str(j[0])+\" \"+str(j[1]),end=\" \")\r\n print()", "def addX(x, y):\n if y % 2 == 0:\n x += 1\n if x == m:\n y += 1\n x -= 1\n else:\n x -= 1\n if x == -1:\n y += 1\n x += 1\n return x, y\n\nn, m, k = [int(x) for x in input().split()]\nres = []\ncurx, cury, curk, curlen = 0, 0, 0, 0\nfor i in range(k-1):\n res.append([])\n for j in range(2):\n res[i].append([cury+1, curx+1])\n curx, cury = addX(curx, cury)\nres.append([])\nwhile cury < n:\n res[k-1].append([cury+1, curx+1])\n curx, cury = addX(curx, cury)\nprint('\\n'.join(str(len(x)) + ' ' + ' '.join(' '.join(list(map(str, y))) for y in x) for x in res))\n#print(res)\n", "# n,m,k=3,3,4\r\nn,m,k=map(int, input().split(\" \"))\r\ndef maketubes(n,m):\r\n a=[]\r\n i=1\r\n while(i<n and i<m):\r\n for j in range(i,m-(i-1)+1):\r\n a.append([i,j])\r\n for j in range(i+1,n-(i-1)+1):\r\n a.append([j,m-(i-1)])\r\n for j in range(m-i,i-1,-1):\r\n a.append([n-(i-1),j])\r\n for j in range(n-i,i,-1):\r\n a.append([j,i])\r\n i+=1\r\n return a\r\narr=maketubes(n,m)\r\ndef printf(i,j):\r\n a=\"\"\r\n for k in range(i,j):\r\n c,d=arr[k]\r\n a+=str(c)+ \" \" + str(d) + \" \" \r\n return a[:-1]\r\ntube=(n*m)//k\r\ntubes=[tube]*k\r\ntubes[k-1]+=n*m -tube*k\r\nstart=0\r\nfor i in tubes:\r\n end=start+i\r\n print(i,printf(start,end))\r\n start=end", "n, m, k = map(int, input().split())\r\nmat = [[0 for i in range(m)]for i in range(n)]\r\nl = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n for j in range(m):\r\n l.append(str(i + 1) + ' ' + str(j + 1))\r\n else:\r\n for j in range(m - 1, -1, -1):\r\n l.append(str(i + 1) + ' ' + str(j + 1))\r\nstart = 0\r\nfor i in range(k - 1):\r\n print(2, ' '.join(l[start: start + 2]))\r\n start += 2\r\nprint(n*m - (2*(k - 1)), ' '.join(l[start:]))\r\n" ]

[ "n = int(input())\r\na = list(map(int,input().split()))\r\nrs = min(a)\r\nfor i in a:\r\n if i%rs!=0:\r\n print(-1)\r\n exit()\r\nprint(rs)", "garbage = int(input())\r\nl = list(map(int, input().rstrip().split(\" \")))\r\nm = min(l)\r\nr = m\r\nfor i in l:\r\n if i%m !=0:\r\n r = -1\r\nprint(r)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=min(a)\r\nfor r in a:\r\n if r%c!=0:\r\n print('-1')\r\n quit()\r\nprint(c)\r\n\r\n", "n = int(input())\r\nmm = list(map(int, input().split()))\r\nmm.sort()\r\nd = mm[0]\r\nfor i in range(n):\r\n if mm[i] % d != 0:\r\n print(-1)\r\n break\r\nelse: print(d)", "n = int(input())\r\narr = sorted(map(int, input().split()))\r\n\r\nmn = arr[0]\r\n\r\ndivs = sum(1 for i in arr if i%mn == 0)\r\n\r\nif divs == n:\r\n print(mn)\r\nelse:\r\n print(-1)", "n = int(input())\ndata = list(map(int, input().split()))\nsmall = min(data)\nfor x in data:\n if x % small != 0:\n print(-1)\n import sys; sys.exit()\nprint(small)\n", "from fractions import gcd\r\nn, a = int(input()), list(map(int, input().split()))\r\nv = a[0]\r\nfor ai in a:\r\n v = gcd(v, ai)\r\nprint(v if v in a else -1)", "input()\r\nls = sorted(map(int, input().split()))\r\nif all(map(lambda x: x % ls[0] == 0, ls)):\r\n print(ls[0])\r\nelse:\r\n print(-1)\r\n\r\n", "a = int(input())\r\nd = list(map(int,input().split()))\r\nd.sort()\r\npr = d[0]\r\nm = 0\r\nfor i in d:\r\n if i % pr != 0:\r\n m = 1\r\nif m == 0:\r\n print(pr)\r\nelse:\r\n print(-1)\n# Tue Jan 03 2023 11:53:56 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = min(A)\r\nfor x in A:\r\n if x % m:\r\n print('-1')\r\n exit(0)\r\nprint(m)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif 1 in l:\r\n print(\"1\")\r\nelse:\r\n s=set(l)\r\n for i in s:\r\n for j in s:\r\n if j%i==0:\r\n pass\r\n else:\r\n break\r\n else:\r\n print(i)\r\n break\r\n else:\r\n print(\"-1\")\r\n ", "n=int(input())\nl=list(map(int, input().split()))\nl.sort()\nfor i in l:\n if i%l[0]!=0:\n print(\"-1\")\n exit()\nprint(l[0])", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = min(a)\r\nc = 0\r\na.sort()\r\nif 1 in a:\r\n print(1)\r\nelse:\r\n for i in a:\r\n if i % m == 0:\r\n c += 1\r\n if c == n:\r\n print(m)\r\n else:\r\n print(-1)", "a=sorted(map(int,[*open(0)][1].split()))\r\nprint([a[0],-1][any(x%a[0] for x in a)])", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nlist.sort()\r\nif(list[0]==1):\r\n print(1)\r\n exit()\r\nfor i in range(n):\r\n if(list[i]%list[0]!=0):\r\n print(\"-1\")\r\n exit()\r\nprint(list[0])", "q = int(input())\r\nw = list(map(int, input().split()))\r\ne = min(w)\r\nfor i in w:\r\n if i % e > 0:\r\n print(-1)\r\n break\r\nelse:\r\n print(e)", "import math\r\n\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(a[0])\r\nelse:\r\n g = math.gcd(a[0], a[1])\r\n for i in range(2, n):\r\n g = math.gcd(g, a[i])\r\n\r\n for d in range(1, int(math.sqrt(g)) + 1):\r\n if g % d == 0:\r\n if d in a:\r\n print(d)\r\n break\r\n elif g // d in a:\r\n print(g // d)\r\n break\r\n else:\r\n print(-1)\r\n", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nmin = 10 ** 9 + 1\r\nfor i in range(len(a)):\r\n if a[i] < min:\r\n min = a[i]\r\n\r\nfor i in range(len(a)):\r\n if a[i] % min != 0:\r\n print(-1)\r\n quit()\r\n\r\nprint(min)\r\n\r\n", "input()\r\nm, *a = sorted(map(int, input().split()))\r\nprint((m, -1)[any(i % m for i in a)])", "import sys\r\ninput=sys.stdin.readline\r\nt=int(input())\r\nls=[int(i) for i in input().split()]\r\nmini=min(ls)\r\nfor i in range(len(ls)):\r\n if ls[i]%mini!=0:\r\n mini=-1\r\n break\r\nprint(mini)", "import math\r\n\r\ndef gcd_list(a):\r\n result = a[0]\r\n for num in a[1:]:\r\n result = math.gcd(result, num)\r\n return result\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nres=gcd_list(a)\r\nif res in a:\r\n print(res)\r\nelse:\r\n print(-1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\n\\r\")\r\n\r\ndef solve():\r\n n = int(input()) \r\n a = list(map(int, input().split()))\r\n m = min(a)\r\n for i in a:\r\n if i % m > 0:\r\n print(-1)\r\n return\r\n print(m)\r\n\r\nfor _ in range(1):\r\n solve()\r\n\r\n ", "# For taking integer inputs.\r\nimport math\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\n# For taking List inputs.\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\n# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\n# For taking space seperated integer variable inputs.\r\ndef invr():\r\n return(map(int, input().split()))\r\n\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\n\r\nn = inp()\r\na = inlist()\r\ng = a[0]\r\nfor i in range(1, n):\r\n g = gcd(g, a[i])\r\nif g in a:\r\n print(g)\r\nelse:\r\n print(-1)\r\n", "from math import *\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nif n==1:\r\n print(a[0])\r\nelse:\r\n res=gcd(a[0],a[1])\r\n for i in range(2,n):\r\n res=gcd(res,a[i])\r\n if res==min(a):\r\n print(res)\r\n else:\r\n print(-1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nminn=min(arr)\r\nc=0\r\nfor i in range(0,n):\r\n \r\n if(arr[i]%minn==0):\r\n continue\r\n else:\r\n c=c+1\r\nif(c==0):\r\n print(minn)\r\nelse:\r\n print(\"-1\")\r\n \r\n", "import math as f\r\ndef cout(n):\r\n return print(n)\r\ndef cin():\r\n return int(input())\r\ndef lcin():\r\n return list(map(int,input().split()))\r\ndef scin():\r\n return input()\r\ndef fcin():\r\n return float(input())\r\n\r\nn = cin()\r\nl = lcin()\r\nx = l[0]\r\nfor i in range(1,n):\r\n x = f.gcd(x,l[i])\r\nif x in l:\r\n print(x)\r\nelse:\r\n print('-1')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nans = True\r\nm = a[0]\r\nfor i in range(1, n):\r\n if not(a[i]%m):\r\n continue\r\n else:\r\n print(\"-1\")\r\n exit()\r\n\r\nprint(m)\r\n", "fast=lambda:stdin.readline().strip()\nzzz=lambda:[int(i) for i in fast().split()]\nz,zz=input,lambda:list(map(int,z().split()))\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\nfrom re import *\nfrom sys import *\nfrom math import *\nfrom heapq import *\nfrom queue import *\nfrom bisect import *\nfrom string import *\nfrom itertools import *\nfrom collections import *\nfrom math import factorial as f\nfrom bisect import bisect as bs\nfrom bisect import bisect_left as bsl\nfrom collections import Counter as cc\nfrom itertools import accumulate as ac\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\ndef output(answer):stdout.write(str(answer))\ndef take():input=open('input.txt', 'r');stdout=open('output.txt', 'w')\n###########################---Test-Case---#################################\n\"\"\"\n\n If you think, You Know me, Then you probably don't know me !\n\n\n\"\"\"\n###########################---START-CODING---##############################\n\nz()\narr=szzz()\n\ng=arr[0]\nfor i in arr[1:]:\n g=gcd(g,i)\n\nif arr[0]!=g:\n print(-1)\n exit()\nprint(g)\n\n\n\n\n\n\n\n\n\n\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ncount=0\r\nfor x in range(len(l)):\r\n if l[x]%l[0]==0:\r\n count+=1\r\nif count==len(l):\r\n print(l[0])\r\nelse:\r\n print(-1)", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\n\nt = a[0]\nfor x in a:\n if x % a[0] != 0:\n t = -1\n\nprint(t)", "n =int(input())\r\nl = list(map(int , input().split())) \r\nnumber = -1\r\nmn = min(l)\r\nif all( i % mn == 0 for i in l):\r\n number = mn\r\nprint(number)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nrez = min(arr)\r\nif all(x % rez == 0 for x in arr):\r\n print(rez)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\nm=sorted(list(map(int,input().split())))\r\nfor i in range(1,n):\r\n\tif m[i]%m[0]!=0:\r\n\t\tprint(-1)\r\n\t\texit()\r\nprint(m[0])\t\t", "n, a = int(input()), [int(i) for i in input().split()]\nmi = min(a)\nres = mi if all(i % mi == 0 for i in a) else -1\nprint(res)\n", "N = int(input())\r\nS = list(map(int, input().split()))\r\n\r\nd = min(S)\r\nval = d\r\n\r\nfor s in S:\r\n if s % val != 0:\r\n val = -1\r\n break\r\nprint(val)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nmas = sorted(mas)\r\nrez = -1\r\nif 1 in mas:\r\n rez = 1\r\nelse:\r\n divisor = mas[0]\r\n s = 0\r\n for e in mas:\r\n if e % divisor != 0:\r\n break\r\n s += 1\r\n if s == len(mas):\r\n rez = divisor\r\n\r\nprint(rez)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = min(l)\r\nfor i in range(len(l)):\r\n if l[i]% a != 0:\r\n print(-1)\r\n break\r\nelse:\r\n print(a)\r\n \r\n ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nm=a[0]\r\nfor i in range(1,n):\r\n if (a[i]%m!=0):\r\n m=-1\r\n break\r\nprint(m)\r\n", "n = int(input().strip())\r\na = input().strip().split(' ')\r\nj = 0\r\nfor i in a:\r\n\ta[j] = int(i)\r\n\tj = j + 1\r\nd = min(a)\r\ndiv = True\r\nfor i in a:\r\n\tif i % d != 0:\r\n\t\tdiv = False\r\n\t\tbreak\r\nif div: print(d)\r\nelse: print(-1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nminimum = min(arr)\r\nans = minimum\r\nfor i in set(arr):\r\n if i % minimum != 0:\r\n ans = -1\r\n break\r\nprint(ans)\r\n", "def gcd(a,b):\r\n if(a==0):\r\n return b\r\n return gcd(b%a,a)\r\n\r\ndef getfctrlist(a):\r\n F = [1,a]\r\n for i in range(2,int(a**0.5)+1):\r\n if(a%i==0):\r\n if(a//i==i):\r\n F.append(i)\r\n else:\r\n F.append(i);F.append(a//i)\r\n F.sort()\r\n return F\r\n\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\na = A[0]\r\nfor i in range(1,n):\r\n a = gcd(a,A[i])\r\nF = getfctrlist(a)\r\nans = -1\r\nfor i in A:\r\n if(i in F):\r\n ans = i\r\n break\r\nprint(ans)", "n=int(input())\r\nL=list(map(int,input().split()))\r\na=min(L)\r\nfor i in range(len(L)):\r\n if L[i]%a :\r\n i-=1\r\n break\r\nif i < len(L)-1:\r\n print(-1)\r\nelse:\r\n print(a)", "a = int(input())\r\nli = list(map(int, input().split()))\r\nli = list(set(li))\r\nli.sort()\r\nif li[0] ==1: print(1);exit()\r\n\r\nfor i in li[1:]:\r\n if i%li[0] != 0: print(-1);exit()\r\nelse: print(li[0]) \r\n", "import sys,atexit\nfrom io import BytesIO\ninp = BytesIO(sys.stdin.buffer.read())\ninput = lambda:inp.readline().decode('ascii')\nbuf = BytesIO()\nsys.stdout.write = lambda s: buf.write(s.encode('ascii'))\natexit.register(lambda:sys.__stdout__.buffer.write(buf.getvalue()))\nn = int(input())\na = list(map(int,input().split()))\nm = min(a)\nfor i in range(n):\n if a[i] % m != 0:\n print(-1)\n exit()\nprint(m)", "import math\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\ngcd = data[0]\r\nfor i in range(1, n):\r\n gcd = math.gcd(gcd, data[i])\r\nif gcd in data:\r\n print(gcd)\r\nelse:\r\n print(-1)", "from sys import stdin\r\nfrom math import gcd\r\nn = int(stdin.readline())\r\narr = list( map(int, stdin.readline().split() ) )\r\nans = arr[0]\r\nfor x in arr:\r\n\tans = gcd(ans, x)\r\nflag = False\r\nfor x in arr:\r\n\tflag |= (x == ans)\r\nif( flag ): print(ans)\r\nelse: print(-1)", "n = int(input())\narr = sorted([int(p) for p in input().split()])\nnum = arr[0]\nfor i in range(len(arr)):\n if arr[i] % num != 0:\n print(-1)\n exit()\nprint(num)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nfor i in range(n):\r\n if a[i]%m!=0:\r\n print(-1)\r\n exit()\r\nprint(m)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\ns=-1\r\nfor i in l:\r\n if(i%m!=0):\r\n s=abs(i)\r\n break\r\nif(s==-1):\r\n print(m)\r\nelse:\r\n print(-1)\r\n\r\n ", "from fractions import gcd\n\nn = int(input())\na = input().split()\na = [int(i) for i in a]\n\ng = a[0]\n\nfor i in a:\n\tg = gcd(i, g)\n\nif g in a:\n\tprint(g)\nelse:\n\tprint(-1)", "''' author: Priyank Koul, PES University, Bengaluru'''\r\nn= int(input())\r\nli= list(map(int, input().strip().split()))\r\nli.sort()\r\na,first,c=set(li),li[0],0\r\nfor i in a:\r\n\tif(i%first==0):\r\n\t\tc+=1\r\nif(c==len(a)):\r\n\tprint(first)\r\nelse:\r\n\tprint(-1)\r\n\t", "from math import gcd\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ng = gcd(a[0], a[-1])\r\n\r\nfor i in range(1, n - 1):\r\n g = gcd(g, a[i])\r\n\r\nif g in set(a):\r\n print(g)\r\nelse:\r\n print(-1)\r\n", "input()\r\nm,*a=sorted(map(int, input().split()))\r\nprint((m,-1)[any(i % m for i in a)])", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = min(a)\r\nfor i in a:\r\n if i%k!=0:\r\n exit(print(-1))\r\nprint(k)\r\n \r\n\r\n", "from sys import stdin\n\ndef read():\n line = stdin.readline();\n if line == \"\":\n exit();\n return line;\n\ndef main():\n while True:\n read();\n a = list( map( int, read().split() ) );\n x = min( a );\n for y in a:\n if (y%x) > 0:\n x = -1\n break;\n print( x );\n\nmain();\n", "def main():\n input()\n numbers = [int(_) for _ in input().split()]\n numbers.sort()\n\n if 1 == numbers[0]:\n print(1)\n else:\n no = False\n\n for number in numbers[1:]:\n if number % numbers[0] != 0:\n no = True\n break\n\n print(-1 if no else numbers[0])\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\na=min(ar)\r\nk=False\r\nfor x in range(n):\r\n if ar[x]%a!=0:\r\n k=True\r\n break\r\nif k:\r\n print('-1')\r\nelse:\r\n print(a)\r\n", "input()\r\nA = set(map(int, input().split()))\r\nx = min(A)\r\n\r\nprint(-1 if any(a%x for a in A) else x)", "import math\r\ntotal=input()\r\nstring = input()\r\nnumber = string.split(\" \")\r\nlist=[]\r\nfor i in number:\r\n list.append(int(i))\r\n\r\nis_done = False\r\nmin = min(list)\r\nfor i in list:\r\n if(i%min!=0):\r\n print(-1)\r\n is_done = True\r\n break\r\n\r\nif(not is_done):\r\n print(min)", "n = int(input())\r\narr = input().split()\r\nfinal = []\r\nfor i in arr:\r\n final.append(int(i))\r\nsmallest = min(final)\r\nanswer = smallest\r\nfor i in final:\r\n if i % smallest != 0:\r\n answer = -1\r\nprint(answer)\r\n", "_ = input()\na = list(map(int, input().split()))\nm = min(a)\n\nfor i in a:\n if i % m != 0:\n print(-1)\n exit(0)\nprint(m)\n", "a = int(input())\r\nlissy = list(map(int,input().split()))\r\nk = min(lissy)\r\nfor i in lissy:\r\n if i % k != 0 : \r\n print('-1')\r\n break\r\nif i % k == 0 : print(k)", "import sys\r\nimport 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\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\ng = lst[0]\r\nfor i in range(1,n):\r\n g = math.gcd(g,lst[i]) \r\nif g in lst:\r\n print(g)\r\nelse:\r\n print(-1)", "n=int(input())\r\nlis=input().split()\r\nfor i in range(len(lis)):\r\n lis[i]=int(lis[i])\r\nm=min(lis)\r\ncheck=1\r\nfor i in range(len(lis)):\r\n if lis[i]%m!=0:\r\n check=0\r\nif check==0:\r\n print(-1)\r\nelse:\r\n print(m)\r\n", "#!/usr/bin/env python3\n\nfrom math import gcd\n\ndef ans(A):\n g = A[0]\n for a in A:\n g = gcd(g, a)\n if g in A:\n return g\n return -1\n\ninput()\nA = input().split(' ')\nA = list(map(int, A))\n\nprint(ans(A))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nx = min(arr)\r\nfor el in arr:\r\n if el % x != 0:\r\n print(-1)\r\n break\r\nelse:\r\n print(x)", "s = int(input())\r\na = list(map(int,input().split()))\r\nb = -1\r\nk = 0\r\na.sort()\r\nfor i in a:\r\n\tif i % a[0] == 0:\r\n\t\tb = a[0]\r\n\t\tk += 1\r\nif k == len(a):\r\n\tprint(b)\r\nelse:\r\n\tb = -1 \r\n\r\n\tprint(b)", "n = int(input())\r\nb = True\r\ns = list(map(int, input().split()))\r\ng = min(s)\r\nfor i in s:\r\n if i%g != 0:\r\n b = False\r\nprint(-1 if not b else g)", "input()\na = [int(x) for x in input().split()]\nb = min(a)\nprint(-1 if any(x % b for x in a) else b)\n", "\r\nn = int(input())\r\nset_ = set(list(map(int, input().split())))\r\nsetLen = len(set_)\r\nfor i in set_:\r\n\tco = 0\r\n\tfor j in set_:\r\n\t\tif j % i != 0:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tco += 1\r\n\r\n\tif co == setLen:\r\n\t\tprint(i)\r\n\t\texit()\r\n\r\nprint(-1)\r\n\r\n", "num = input()\r\nlist1 = list(map(int, input().split(' ')))\r\n\r\nlist1.sort()\r\nisDivisable = list1[0]\r\nfor i in range(1,len(list1)):\r\n if list1[i] % list1[0] != 0:\r\n isDivisable = -1\r\n break\r\n\r\nprint(isDivisable)", "n = input()\r\na = map(int, input().split())\r\na = sorted(a)\r\nv = a[0]\r\nok = True\r\nfor i in a:\r\n if i % v > 0:\r\n ok = False\r\n break\r\n\r\nif ok:\r\n print(v)\r\nelse:\r\n print(-1)", "n = int(input())\r\narr = list(map(int , input().split()))\r\narr = list(set(arr))\r\narr.sort()\r\ntest=0\r\nans = -1\r\nfor i in arr:\r\n j=0\r\n while j<len(arr):\r\n if arr[j]%i!=0:\r\n test = 1\r\n break\r\n j = j +1\r\n if test==0:\r\n ans = i\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\na.sort()\r\nm = a[0]\r\nk = 1\r\nfor i in range(0,len(a)):\r\n if(a[i]%m != 0):\r\n k = 0\r\n break\r\nif(k):\r\n print(m)\r\nelse:\r\n print(\"-1\")", "size=int(input())\r\nnums=list(map(int,input().split()))\r\nnums.sort()\r\nc=0\r\nfor i in range(1,len(nums)):\r\n if nums[i]%nums[0]==0:\r\n c+=1\r\nif c==len(nums)-1:\r\n print(nums[0])\r\nelse:\r\n print(-1)", "from collections import defaultdict, deque, Counter, OrderedDict\r\nfrom math import gcd\r\ndef main():\r\n n = int(input())\r\n g,d = 0,set()\r\n for i in map(int,input().split()):\r\n if g == 0: g = i\r\n else:\r\n g = gcd(g,i)\r\n d.add(i)\r\n print(g if g in d else -1)\r\n\r\n\r\n\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()\"\"\"\r\n main()", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nfor i in a:\r\n if i % a[0] != 0:\r\n print(-1)\r\n exit(0)\r\nprint(a[0])\r\n", "n = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\n \r\nmi = min(numbers)\r\n \r\nfor x in numbers:\r\n if x % mi != 0:\r\n print(-1)\r\n exit()\r\n \r\nprint(mi)", "I=input\r\nI()\r\na=list(map(int,I().split()))\r\nx=min(a)\r\nprint([x,-1][any(i%x for i in a)])", "a = int(input())\r\ns = [int(x) for x in input().split()]\r\nkey = True\r\nc = min(s)\r\nfor i in s:\r\n if i % c != 0:\r\n key = False\r\n print(-1)\r\n break\r\nif key:\r\n print(c)", "c=0; input(); l=sorted(map(int,input().split()))\r\nfor i in l:\r\n\tif i%l[0]!=0:c=1;break\r\nprint([-1,l[0]][c==0])", "a = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ndef x(a,l):\r\n l.sort()\r\n for i in range(a):\r\n if l[i]%l[0]!=0:\r\n return -1\r\n else : return l[0]\r\n \r\nprint(x(a,l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nflag=1\r\nfor i in l:\r\n\tif i%m!=0:\r\n\t\tflag=0\r\n\t\tprint(-1)\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(m)\t\t", "n = input()\r\nli = list(map(int,input().split()))\r\nm = min(li)\r\nfor item in li:\r\n if item % m != 0:\r\n m=-1\r\n break;\r\nprint (m)", "def f():\r\n liste = list(map(int,input().split()))\r\n m = min(liste)\r\n if m == 1:\r\n return m\r\n else:\r\n for el in liste:\r\n if el%m!=0:\r\n return -1\r\n return m\r\n\r\ninput()\r\nprint(f())", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=min(l)\r\nt=0\r\nfor i in range(n):\r\n\tif l[i]%k==0:\r\n\t\tt+=1\r\nif t==n:\r\n\tprint(k)\r\nelse:\r\n\tprint(-1)", "def solve():\r\n n=int(input())\r\n lst=list(map(int,input().split(\" \")))\r\n a=min(lst)\r\n for i in range(n):\r\n if lst[i]%a==0:\r\n pass\r\n else:\r\n print(-1)\r\n return\r\n print(a)\r\n\r\n \r\n\r\nsolve()", "n = int(input())\r\narr = list(map(int, input(). split()))\r\nans = min(arr)\r\nfor i in arr:\r\n if i % ans:\r\n ans = -1\r\n break\r\nprint(ans)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nflag=0\r\nfor i in range(1,n):\r\n if a[i]%a[0]:\r\n flag=1\r\n break\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(a[0])", "input()\r\na = list(map(int, input().split()))\r\nb = min(a)\r\nfor i in a:\r\n if i % b:\r\n print(-1)\r\n break\r\nelse:\r\n print(b)", "n, t = int(input()), list(map(int, input().split()))\r\nk = min(t)\r\nprint(-1 if any(i % k for i in t) else k)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nar = sys.stdin.readline().split()\r\nar = [int(x) for x in ar]\r\nar.sort()\r\n\r\nmn = ar[0]\r\nmx = ar[-1]\r\n\r\nfounded = True\r\n\r\nlast = mn\r\nfor i in range(1,len(ar)):\r\n if last!=ar[i]:\r\n last = ar[i]\r\n if ar[i]%mn!=0:\r\n founded = False\r\n break\r\n\r\nif founded:\r\n print(mn)\r\nelse:\r\n print(-1)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nn = int(input())\r\na = list(map(int, input(). split()))\r\nans = min(a)\r\nfor i in a:\r\n if i % ans:\r\n ans = -1\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nt = 0\r\nm = min(a)\r\nfor i in range(n):\r\n if a[i] % m != 0:\r\n t = -1\r\n break\r\nif t == -1:\r\n print(-1)\r\nelse:\r\n print(m)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nrez = min(arr)\r\nfor i in range(len(arr)):\r\n if arr[i] % rez != 0:\r\n rez = -1\r\n break\r\nprint(rez)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nmin_num = min(a)\n\nfor num in a:\n if num % min_num != 0:\n print(-1)\n break\nelse:\n print(min_num)\n", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nj=min(l)\r\nfor x in range(n):\r\n\tif l[x]%j!=0:\r\n\t\tprint(-1)\r\n\t\tbreak\r\nelse:print(j)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\na.append(m)\r\nfor i in range (n + 1):\r\n if a[i] % m != 0:\r\n print(-1)\r\n break\r\n if i == n:\r\n print(m)", "n = int(input())\r\na = sorted(list(set([int(a) for a in input().split(\" \")])))\r\n\r\nfound = True\r\nfor i in range(len(a)):\r\n\tfor j in range(i+1, len(a)):\r\n\t\tif a[j]%a[i] != 0 :\r\n\t\t\tfound = False\r\n\t\t\tbreak\r\n\tif found:\r\n\t\tprint(a[i])\r\n\t\tbreak\r\n\r\nif not found:\r\n\tprint(-1)\r\n\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nl=min(s)\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]%l==0:\r\n k+=1\r\nif k==n:\r\n print(l)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nc=0\r\nfor i in range(1,n):\r\n if(l[i]%l[0]!=0):\r\n c=1\r\n break\r\nif(c==0):\r\n print(l[0])\r\nelse:\r\n print(-1)", "def fex(l,s):\r\n ast=0\r\n for i in range(len(l)):\r\n if(l[i]%s==0):\r\n ast+=1\r\n if(ast==len(l)):\r\n return True\r\n else:\r\n return False\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(fex(l,l[0])):\r\n a=l[0]\r\nelse:\r\n a=-1\r\nprint(a)", "from math import gcd\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=a[0]\r\ne=set(a)\r\nfor i in range(1,n):\r\n d=gcd(d,a[i])\r\nif d in e:\r\n print(d)\r\nelse:\r\n print(-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\nimport sys\r\nimport math as mth\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nfrom math import factorial as fct\r\nfrom collections import Counter as CNT\r\nfrom math import log\r\nfrom math import floor as fl\r\nmod = 10**9 + 7\r\nmonths = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ndef ii():\r\n return int(input())\r\ndef fi():\r\n return float(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 input().split()\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n############################################\r\ninput = lambda : sys.stdin.readline().strip()\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\ndef gcd_of_array(arr):\r\n x = arr[0]\r\n for i in arr:\r\n x = mth.gcd(x,i)\r\n return x\r\nn = ii()\r\narr = lii()\r\ng = gcd_of_array(arr)\r\nans = -1\r\nfor i in arr:\r\n if g%i == 0 :\r\n ans = i\r\n break\r\nprint(ans)\r\n", "import math\r\n\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\ngc = 0\r\nisOne = False\r\n\r\nfor i in range(n):\r\n if arr[i] == 1:\r\n isOne = True\r\n break\r\n gc = math.gcd(gc, arr[i])\r\n\r\n\r\nif isOne:\r\n print(1)\r\nelif gc == 1:\r\n print(-1)\r\nelse:\r\n ans = -1\r\n for i in arr:\r\n if gc%i == 0:\r\n ans = i\r\n break\r\n print(ans)\r\n\r\n\r\n", "a=int(input())\r\nb=list((map(int,input().split())))\r\nl=0\r\nj=min(b)\r\nfor i in range(a):\r\n if b[i]%j!=0:\r\n j=-1\r\n break\r\nprint(j)", "def gcd(a,b):\n if(b == 0):\n return a\n t =a\n a = b\n b= t%a\n return gcd(a,b)\n\ndef main():\n n = input()\n l = list(map(int,input().split()))\n g = 0\n for i in l:\n g = gcd(g,i)\n if(g in l):\n print(g)\n else:\n print(-1)\nmain()\n \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\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nx = min(a)\r\nfor i in a:\r\n if i % x > 0:\r\n print(-1)\r\n break\r\nelse:\r\n print(x)", "n=int(input())\r\na=list(map(int ,input().split()))\r\nk=min(a)\r\ny=0\r\nfor i in range(n):\r\n if a[i]%k==0:\r\n y+=1\r\nif y==n:\r\n print(k)\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n ", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmi = min(lst)\r\nif all(x % mi == 0 for x in lst):\r\n print(mi)\r\nelse:\r\n print(-1)", "n = int(input())\r\nsp = list(map(int, input().split()))\r\nch = min(sp)\r\nf1 = True\r\nfor i in range(n):\r\n\tif sp[i] % ch != 0:\r\n\t\tf1 = False\r\n\t\tbreak\r\nif f1:\r\n\tprint(ch)\r\nelse:\r\n\tprint(-1)\t\t\r\n\t\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Find the minimum element of the array\r\nmin_element = min(a)\r\n\r\n# Check if all elements of the array are divisible by the minimum element\r\ndivisible = True\r\nfor ai in a:\r\n if ai % min_element != 0:\r\n divisible = False\r\n break\r\n\r\n# Print the result\r\nif divisible:\r\n print(min_element)\r\nelse:\r\n print(-1)\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())\nn=int(input())\nl=L()\nl.sort()\nfor i in range(n):\n if(l[i]%l[0]!=0):\n print(-1)\n exit()\nprint(l[0])\n", "def solve(a):\r\n a.sort()\r\n if a[0] == 1:\r\n return 1\r\n l = len(a)\r\n divisor = a[0]\r\n for i in range(l):\r\n if a[i]%divisor!=0:\r\n return -1\r\n return divisor\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().strip().split()))\r\nprint(solve(a))\r\n", "a=int(input())\r\nb=list(map(int, input().split()))\r\nb = sorted(b)\r\nz = b[0]\r\nfor i in range(1, len(b)):\r\n if b[i] % b[0] != 0:\r\n z = -1\r\n break\r\nprint(z)", "N=int(input())\r\nx=[int(x) for x in input().split()]\r\na=min(x)\r\nfor item in x:\r\n if item%a==0:\r\n ans=1 \r\n else:\r\n ans=-1\r\n break\r\nif ans==1:\r\n print(a)\r\nelse:print(-1) \r\n ", "from fractions import gcd\r\n\r\ndef findGcd(data):\r\n g = data[0]\r\n for i in range (len(data)-1):\r\n g = gcd(g , data[i+1])\r\n \r\n return g\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\ngc = findGcd(a)\r\nif gc in a:\r\n print(gc)\r\nelse:\r\n print(-1)\r\n", "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\nvmin = 1000000001\r\n\r\nfor i in an:\r\n if(i < vmin):\r\n vmin = i\r\n\r\nfor i in an:\r\n if(i % vmin != 0):\r\n print(-1)\r\n exit()\r\n \r\nprint(vmin) ", "n = int(input())\r\na = list(map(int , input().split()))\r\na = sorted(a)\r\n\r\nc = 0 \r\nel0 = a[0]\r\nfor el in a:\r\n if(el % el0 == 0):\r\n continue\r\n else:\r\n c += 1 \r\n\r\nif(c == 0):\r\n print(el0)\r\nelse:\r\n print(-1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nd = a[0]\r\nyes = True\r\nfor i in a:\r\n if i % d != 0:\r\n yes = False\r\n break\r\n\r\nprint(d if yes else -1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmini=min(l)\r\nfor i in l:\r\n if(i%mini!=0):\r\n print(-1)\r\n break\r\nelse:\r\n print(mini)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nmn = min(a)\r\nfor i in a:\r\n\tif(i%mn != 0):\r\n\t\tmn = -1\r\n\t\tbreak\r\nprint(mn)", "from sys import stdin\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\n\r\nn = iinput()\r\na = linput()\r\nd = min(a)\r\nfor e in a:\r\n if e%d != 0:\r\n print(-1)\r\n break\r\nelse: print(d)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nif m==1:\r\n print(1)\r\nelse:\r\n c=0\r\n for i in range(n):\r\n if l[i]%m==0:\r\n c+=1\r\n if c==n:\r\n print(m)\r\n else:\r\n print(-1)\r\n \r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nx = arr[0]\r\nf = 0\r\nfor i in range(n):\r\n if arr[i]%x!=0:\r\n f = 1\r\nif f==1:\r\n print(-1)\r\nelse:\r\n print(x)", "# cook your dish here\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nx = a[0]\r\nf = True\r\nfor i in range(1,n):\r\n if a[i]%x!=0:\r\n print(\"-1\")\r\n f = False\r\n break\r\nif f==True:\r\n print(x)", "from math import gcd\r\nn = int(input())\r\narr = [int(x) for x in input().split()];g = arr[0]\r\nfor i in arr:\r\n g = gcd(g,i)\r\nif g in arr:\r\n print(g)\r\nelse:\r\n print(-1)", "n=int(input())\r\nl=[int(j) for j in input().split()]\r\nl.sort()\r\nt=l[0]\r\nflag=1\r\nfor i in l:\r\n if i%t!=0:\r\n flag=0\r\n break\r\nif flag:\r\n print(t)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc,x=0,0\r\na.sort()\r\n#rint(a)\r\nfor i in range(n):\r\n if a[i]%a[0]!=0:\r\n x=1\r\nif x==0:\r\n print(a[0])\r\nif x==1:\r\n print(\"-1\")", "from math import *\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 in l):\r\n print(g)\r\nelse:\r\n print(-1)", "\r\nn = int(input())\r\nset_ = set(list(map(int, input().split())))\r\nsetLen = len(set_)\r\nminElement = min(set_)\r\nfor i in set_:\r\n\tif i % minElement != 0:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\r\n\r\nprint(minElement)\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=a[0]\r\nans=x\r\nif n==1:\r\n print(a[0])\r\nelse:\r\n for i in range(1,n):\r\n if a[i]%x!=0:\r\n ans=-1\r\n break\r\n print(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nans = a[0]\r\nfor i in range(1, n):\r\n if a[i] % ans != 0:\r\n ans = -1\r\n break\r\nprint(ans)", "def gcd(a,b):\n\tif b>a:\n\t\ta=a+b\n\t\tb=a-b\n\t\ta=a-b\n\tif a%b==0:\n\t\treturn b\n\treturn gcd(b,a%b)\ndef solve(A):\n\tn=len(A)\n\tP=[A[0]] #prefix gcd \n\tS=[A[-1]]*(n+1) #suffix gcd\n\tfor i in range(1,n):\n\t\tP.append(gcd(P[-1],A[i]));\n\tfor i in range(n-1,-1,-1):\n\t\tS[i]=gcd(S[i+1],A[i])\n\t\n\tfor i in range(n):\n\t\tif gcd(S[i],P[i])==A[i]:\n\t\t\treturn A[i]\n\treturn -1;\n\nn= input()\nA=list(map(int,input().strip().split()))\n\nprint(solve(A))\n\t\t\n\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=min(l)\r\nc=0\r\nfor i in range(len(l)):\r\n if l[i]%a==0:\r\n c+=1\r\nif c==len(l):\r\n print(a)\r\nelse:\r\n print(\"-1\")", "n=int(input())\nx=list(map(int,input().split()))\nm=min(x)\ncnt=0\nfor i in x:\n if i%m==0:\n cnt+=1\nif cnt==n: print(m)\nelse: print(-1)\n \t\t \t \t\t \t\t \t\t\t\t\t \t \t\t\t", "from math import gcd\r\nimport sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n ans = gcd(ans, a[i])\r\nif ans in a:\r\n print(ans)\r\nelse:\r\n print(-1)", "n = int(input())\r\nans = True\r\nlst = list(map(int, input().split()))\r\nmn = min(lst)\r\n\r\nif mn != 1:\r\n for i in lst:\r\n if (i % mn != 0):\r\n ans = False\r\n break\r\nif ans:\r\n print(mn)\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\na = min(s)\r\nc = True\r\n\r\nfor i in range(n):\r\n\tif s[i]%a!=0:\r\n\t\tc = False\r\n\t\tbreak\r\n\r\nif c:\r\n\tprint(a)\r\nelse:\r\n\tprint(-1)", "n=int(input())\r\nL=[int(x) for x in input().split()]\r\nL.sort()\r\nx=L[0]\r\nf=0\r\nfor i in L:\r\n if(i%x!=0):\r\n f=1\r\n break\r\nif(f==0):\r\n print(x)\r\nelse:\r\n print(-1)", "f,n,l=0,int(input()),sorted(map(int,input().split()))\r\nfor x in range(n):\r\n\tif l[x]%l[0]!=0:f=1;break\r\nprint([l[0],-1][f==1])", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nv.sort()\r\nfor x in v:\r\n if(x % v[0] != 0):\r\n print(-1)\r\n exit(0)\r\n\r\nprint (v[0])\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\nd=min(a)\r\ne=0\r\nfor i in range(0,len(a)):\r\n if(a[i]%d==0):\r\n e=e+1\r\nif(e==len(a)):\r\n print(d)\r\nelse:\r\n print(-1)", "import math\r\n\r\n\r\ndef main() -> None:\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n res = a[0]\r\n for x in a:\r\n res = math.gcd(res, x)\r\n found = False\r\n for x in a:\r\n if x == res:\r\n found = True\r\n print(res if found else '-1')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\nminimum = min(ls)\r\nanswer = True\r\nfor l in ls:\r\n if l % minimum != 0:\r\n answer = False\r\n break\r\nif answer:\r\n print(minimum)\r\nelse:\r\n print(-1)\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\nmin_num = min(a)\nif all([x % min_num == 0 for x in a]):\n print(min_num)\nelse:\n print(-1)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor i in range(1,n):\r\n if l[i]%l[0]!=0:\r\n print('-1')\r\n break\r\nelse:\r\n print(l[0])", "input()\r\nX = sorted(list(map(int, input().split())))\r\nif X[0] == 1:\r\n print(1)\r\n exit()\r\nfor i in range(len(X)):\r\n if X[i] % X[0] != 0:\r\n print(-1)\r\n exit()\r\nprint(X[0])\r\n\r\n# UB_CodeForces\r\n# Advice: Love everyone in the world\r\n# Location: Where I belong to\r\n# Caption: Happy with family\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmi = min(a)\r\nfor i in a:\r\n if(i%mi != 0):\r\n print(-1)\r\n exit()\r\n \r\nprint(mi)", "n=int(input())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\nz=li[0]\r\nfor i in li:\r\n\tif i%z!=0:\r\n\t\tprint(-1)\r\n\t\tbreak\r\nelse:\r\n\tprint(z)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-12 23:29:09\nLastEditTime: 2021-11-12 23:42:29\nDescription: Ksusha and Array\nFilePath: CF299A.py\n'''\n\n\ndef func():\n n = int(input())\n num = list(set(map(int, input().strip().split())))\n for i in range(len(num)):\n for j in range(len(num)):\n if num[j] % num[i] != 0:\n break\n else:\n return num[i]\n return -1\n \n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n ", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom math import ceil\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\nimport math\r\n\r\nai = lambda: list(map(int, stdin.readline().split()))\r\nei = lambda: map(int, stdin.readline().split())\r\nip = lambda: int(stdin.readline().strip())\r\n\r\nn = ip()\r\nli = sorted(list(set(ai())))\r\nn = len(li)\r\nc = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i == j: continue\r\n\t\tif li[j]%li[i] != 0:\r\n\t\t\tbreak\r\n\t\tc += 1\r\n\tif c == n-1:\r\n\t\texit(print(li[i]))\t\r\nprint(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ninput()\r\nw = sorted(map(int, input().split()))\r\nfor i in w[1:]:\r\n if i%w[0] != 0:\r\n print(-1)\r\n break\r\nelse:\r\n print(w[0])\r\n", "def f():\r\n\tinput()\r\n\ta = list(map(int,input().split(' ')))\r\n\tm = min(a)\r\n\tfor i in a:\r\n\t\tif i % m != 0:\r\n\t\t\tprint(-1)\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(m)\r\nf()", "def main():\r\n n = int(input())\r\n array = [int(c) for c in input().split()]\r\n _min = min(array)\r\n \r\n for e in array:\r\n if e % _min != 0:\r\n print(-1)\r\n return\r\n else:\r\n print(_min)\r\n return\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()] \r\nfrom math import gcd \r\ng=0 \r\nfor i in l: g=gcd(g,i) \r\nif g in l: \r\n print(g)\r\nelse:\r\n print(-1)", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ngc=l[0]\r\nfor i in range(1,n):\r\n gc=math.gcd(gc,l[i])\r\nprint(gc if gc in l else \"-1\")\r\n", "l=int(input())\r\narr=sorted(list(map(int,input().split())))\r\nfor i in range(l):\r\n if arr[i]%arr[0]!=0:\r\n print(-1)\r\n quit()\r\nprint(arr[0])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nif 1 in a:\r\n print(1)\r\nelse:\r\n s = a[0]\r\n f = 0\r\n for i in range(1,n):\r\n if a[i]%s != 0:\r\n f = 1\r\n break\r\n if f == 0:\r\n print(s)\r\n else:\r\n print(-1)", "n=int(input())\na=list(map(int,input().split()))\na.sort()\nx=a[0]\nsum=0\nfor i in a:\n if i%x==0:\n sum=sum+1\nif sum==n:\n print(x)\nelse:\n print(\"-1\")\n \n\t \t\t \t\t\t \t \t\t\t\t\t \t \t\t \t\t\t", "import math\r\nn=int(input())\r\nll=list(map(int,input().split()))\r\ng=ll[0]\r\ni=0\r\nwhile i<n:\r\n g=math.gcd(g,ll[i])\r\n i+=1\r\nif g in ll:\r\n print(g)\r\nelse:\r\n print(-1)", "a=int(input())\r\nc=list(map(int,input().split()))\r\nk=0\r\nm=min(c)\r\nfor j in c:\r\n if j%m==0:\r\n k+=1\r\n else:\r\n m=-1\r\n break\r\nprint(m)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = min(a)\r\nf = 1\r\nfor i in a:\r\n if i % m != 0:\r\n print(-1)\r\n f = 0\r\n break\r\nif f == 1:\r\n print(m)", "def main():\n from math import gcd\n input()\n s = set(map(int, input().split()))\n x = a = s.pop()\n for b in s:\n a = gcd(a, b)\n if a == 1:\n break\n s.add(x)\n print(a if a in s else -1)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = min(a)\r\nfor i in range(len(a)):\r\n if a[i] % k != 0: print(-1); exit()\r\nprint(k)\r\n", "a = int(input())\r\narray = list(map(int, input().split()))\r\narray.sort()\r\ncount = 0\r\nfor i in array[1:]:\r\n if i % array[0] == 0:\r\n count += 1\r\n continue\r\n else:\r\n break\r\nif count == len(array) - 1:\r\n print(array[0])\r\nelse:\r\n print(-1)", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\nif 1 in l:\r\n print(1)\r\nelse:\r\n l.sort()\r\n for x in range(1,len(l)):\r\n if l[x]%l[0]!=0:\r\n print(-1)\r\n break\r\n \r\n \r\n else:\r\n print(l[0])", "def gcd(a, b):\r\n\tfactor = a\r\n\twhile b%factor != 0:\r\n\t\ttemp = factor\r\n\t\tfactor = b%factor\r\n\t\tb = temp\r\n\treturn(factor)\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tarr = list(map(int, input().split(\" \")))\r\n\r\n\tif n == 1:\r\n\t\tprint(arr[0])\r\n\t\treturn\r\n\tfactor = gcd(arr[0], arr[1])\r\n\tfound = 1 if factor in (arr[0], arr[1]) else 0\r\n\t# print(factor, found)\r\n\tcount = 2\r\n\twhile count < n:\r\n\t\tif factor != 1:\r\n\t\t\tcd = gcd(factor, arr[count])\r\n\t\t\tif cd != factor and cd != arr[count]:\r\n\t\t\t\tfound = 0\r\n\t\t\telse:\r\n\t\t\t\tfound = 1\r\n\t\t\tfactor = cd\r\n\t\telse:\r\n\t\t\tif arr[count] == 1:\r\n\t\t\t\tfound = 1\r\n\t\t\t\tbreak\r\n\t\tcount += 1\r\n\t\t# print(factor, found)\r\n\r\n\tif found:\r\n\t\tprint(factor)\r\n\telse:\r\n\t\tprint(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=min(b)\r\nd=0\r\nfor x in b:\r\n\tif x%c==0 :\r\n\t\td=1\r\n\telse:\r\n\t\td=0\r\n\t\tprint(-1)\r\n\t\tbreak\r\nif d==1:\r\n\tprint(c)", "# LUOGU_RID: 101474088\nfrom math import gcd\r\nn, *a = map(int, open(0).read().split())\r\ng = a[0]\r\nfor x in a:\r\n g = gcd(g, x)\r\nprint(g in a and g or -1)", "input()\r\nl = list(map(int,input().split())); l.sort()\r\nfor i in range(1,len(l)):\r\n if l[i] % l[0] != 0:\r\n print(-1)\r\n raise SystemExit\r\nprint(l[0])", "n=int(input())\na=list(map(int,input().split()))\nx=min(a)\ncount=0\nfor i in range(0,n):\n if a[i]%x==0:\n count+=1\nif count==n:\n print(x)\nelse:\n print(-1)\n\t\t \t \t\t \t\t\t\t\t \t\t \t\t\t\t\t\t \t\t \t", "int(input())\r\n\r\na = sorted(map(int, input().split()))\r\n\r\nif all([j % a[0] == 0 for j in a]):\r\n print(a[0])\r\nelse:\r\n print(-1)\r\n", "n = int(input())\na = sorted(list(map(int, input().split())))\nif all([x % a[0] == 0 for x in a]):\n print(a[0])\nelse:\n print(-1)\n", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nMin=min(x)\r\nfor i in x:\r\n if i%Min!=0:\r\n print(-1)\r\n exit()\r\nprint(Min)", "from math import gcd\r\n\r\ndef factors(n):\r\n res = set()\r\n for i in range(1, n+1):\r\n if n % i == 0:\r\n res.add(i)\r\n\r\n return res\r\n\r\ndef main():\r\n n = int(input())\r\n array = [int(c) for c in input().split()]\r\n array_set = set(array)\r\n\r\n for e in array_set:\r\n for a in array_set:\r\n if a % e != 0:\r\n break\r\n else:\r\n print(e)\r\n return\r\n \r\n print(-1)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input());arr=list(map(int,input().split()))\r\nsmall_d=min(arr)\r\nfor i in arr:\r\n if i%small_d!=0:exit(print(-1))\r\nprint(small_d)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=min(a)\r\ncount=0\r\nfor i in range(0,n):\r\n if a[i]%x==0:\r\n count+=1\r\nif count==n:\r\n print(x)\r\nelse:\r\n print(-1)", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nm = min(nums)\r\noutput = m\r\nfor j in range(n):\r\n if nums[j] % m != 0:\r\n output = -1\r\n break\r\nprint(output)\r\n", "a=int(input())\r\n\r\nt=list(map(int,input().split()))\r\nt.sort()\r\n\r\n\r\n\r\nif 1 in t:\r\n print(1)\r\nelse:\r\n s=t[0]\r\n u=0\r\n for k in range(a):\r\n if t[k]%s==0:\r\n pass\r\n else:\r\n print(-1)\r\n u+=1\r\n break\r\n if u==0:\r\n print(s)\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\na=sorted(map(int,[*open(0)][1].split()))\r\nprint([a[0],-1][any(x%a[0] for x in a)])", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\ns = min(a)\r\nfor i in a:\r\n if i%s==0:\r\n continue\r\n else:\r\n print(-1)\r\n exit()\r\nprint(s)", "n = int(input())\r\na = [int(x) for x in input().split(' ')]\r\na.sort()\r\nans = a[0]\r\nfor b in a:\r\n if b % a[0] != 0:\r\n ans = -1\r\n break\r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmin_ = arr[0]\r\nfor i in range(1, n):\r\n min_ = min(min_, arr[i])\r\nfor ele in arr:\r\n if(ele % min_ != 0):\r\n print(-1)\r\n break\r\nelse:\r\n print(min_)", "n = int(input())\r\narray=input().split()\r\na=0\r\nwhile a<n:\r\n array[a]=int(array[a])\r\n a+=1\r\nsmallest=min(array)\r\narray.sort()\r\ni=1\r\nt_or_f=True\r\nwhile i<n:\r\n if array[i]/smallest!=int(array[i]/smallest):\r\n t_or_f=False\r\n i+=1\r\nif t_or_f==True:\r\n print(smallest)\r\nelse:\r\n print(-1)", "from math import sqrt\n\n\ndef divisors(number):\n divs = set()\n for i in range(2, int(sqrt(number) + 1)):\n if number % i == 0:\n divs.add(i)\n divs.add(number // i)\n divs.add(number)\n return divs\n\n\nn = int(input())\nx = list(map(int, input().split()))\nminimum = min(x)\ndivs = divisors(minimum)\ncandidates = []\nfor divisor in divs:\n for _ in range(n):\n if x[_] % divisor != 0:\n break\n if _ == n - 1:\n candidates.append(divisor)\nfor item in candidates:\n if item in x:\n print(item)\n exit()\nprint(-1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = min(a)\r\nif all(x % k == 0 for x in a):\r\n print(k)\r\nelse:\r\n print(-1)" ]

[ "#!/usr/bin/env python3\n\n# solution after hint\n# (instead of best hit/mana spell store convex hull of spells)\n# O(n^2) instead of O(n log n)\n\n\n[q, m] = map(int, input().strip().split())\nqis = [tuple(map(int, input().strip().split())) for _ in range(q)]\n\nmod = 10**6\n\nj = 0\nspell_chull = [(0, 0)] # lower hull _/\n\ndef is_right(xy0, xy1, xy):\n\t(x0, y0) = xy0\n\t(x1, y1) = xy1\n\t(x, y) = xy\n\treturn (x0 - x) * (y1 - y) >= (x1 - x) * (y0 - y)\n\ndef in_chull(x, y):\n\ti = 0\n\tif x > spell_chull[-1][0]:\n\t\treturn False\n\twhile spell_chull[i][0] < x:\n\t\ti += 1\n\tif spell_chull[i][0] == x:\n\t\treturn spell_chull[i][1] <= y\n\telse:\n\t\treturn is_right(spell_chull[i - 1], spell_chull[i], (x, y))\n\t\n\n\ndef add_spell(x, y):\n\tglobal spell_chull\n\tif in_chull(x, y):\n\t\treturn\n\ti_left = 0\n\twhile i_left < len(spell_chull) - 1 and not is_right(spell_chull[i_left + 1], spell_chull[i_left], (x, y)):\n\t\ti_left += 1\n\ti_right = i_left + 1\n\twhile i_right < len(spell_chull) - 1 and is_right(spell_chull[i_right + 1], spell_chull[i_right], (x, y)):\n\t\ti_right += 1\n\tif i_right == len(spell_chull) - 1 and x >= spell_chull[-1][0]:\n\t\ti_right += 1\n\tspell_chull = spell_chull[:i_left + 1] + [(x, y)] + spell_chull[i_right:]\n\n\nfor i, qi in enumerate(qis):\n\t(k, a, b) = qi\n\tx = (a + j) % mod + 1\n\ty = (b + j) % mod + 1\n\tif k == 1:\n\t\tadd_spell(x, y)\n\telse: #2\n\t\tif in_chull(y / x, m / x):\n\t\t\tprint ('YES')\n\t\t\tj = i + 1\n\t\telse:\n\t\t\tprint ('NO')\n" ]

[ "#!/usr/bin/env python3\n\nimport itertools\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nwinner = a[-1]\nlooser = 3 - winner\nserve_win_cnt, serve_loose_cnt, win_pos, loose_pos, result = [0], [0], [-1], [-1], []\nwin_cnt = a.count(winner)\n\nfor i in range(n):\n if a[i] == winner:\n win_pos.append(i)\n else:\n loose_pos.append(i)\n serve_win_cnt.append(serve_win_cnt[-1] + (a[i] == winner))\n serve_loose_cnt.append(serve_loose_cnt[-1] + (a[i] == looser))\n\nwin_pos += [n * 10] * n\nloose_pos += [n * 10] * n\nserve_win_cnt += [0] * n\nserve_loose_cnt += [0] * n\n\nfor t in itertools.chain(range(1, 1 + win_cnt // 2), [win_cnt]):\n s = l = i = 0\n sw = sl = 0\n while i < n:\n xw = win_pos[serve_win_cnt[i] + t]\n xl = loose_pos[serve_loose_cnt[i] + t]\n if xw < xl:\n s += 1\n else:\n l += 1\n i = min(xw, xl) + 1\n if s > l and i <= n and serve_win_cnt[i] == win_cnt:\n result.append((s, t))\n\nprint(len(result))\nfor (x, y) in sorted(result):\n print(x, y)\n" ]

[ "n,k=map(int,input().split())\r\nm=0\r\nif n==k or k==0:\r\n print(0,0)\r\nelif 3*k<=n:\r\n print(1,2*k)\r\nelif k<=n:\r\n print(1,n-k)\r\nelse:\r\n print(0,0)", "# LUOGU_RID: 132834153\nn,k=map(int,input().split())\r\nprint(1-(k==0 or k==n),min(n-k,k*2))\r\n", "a=[int(x) for x in input().split()]\r\nn, k=a[0], a[1]\r\nif 3*k<=n:\r\n m=2*k\r\nelse:\r\n m=n-k\r\nif n==k:\r\n print(0, 0)\r\nelif k==0:\r\n print(0, 0)\r\nelse:\r\n print(1, m)\r\n \r\n ", "\r\nn,k=map(int,input().split())\r\nif k==0 or n==k:\r\n print(0,0)\r\nelse:\r\n print(1,min(n-k,k*2))\r\n", "n, k = map(int, input().split())\n\nfirst = min(1, n - k)\nsecond = min(2 * k, n - k)\n\nif k == 0:\n\tprint('0 0')\nelse:\n\tprint('{} {}'.format(first, second))", "n, k = map(int, input().split())\r\n\r\nif k == 0 or k == n:\r\n print(\"0 0\")\r\n \r\nelse:\r\n if 3*k <= n:\r\n print(f\"1 {2 * k}\")\r\n else:\r\n print(f\"1 {n - k}\")", "n,k=map(int,input().split())\r\nif k==0 or k==n:\r\n\tprint(0,0)\r\nelse:\r\n\ta=1\r\n\tx=n//3\r\n\tif k<=x:\r\n\t\tb=2*k\r\n\telse:\r\n\t\tb=n-k\r\n\tprint(a,b)", "n, k = map(int,input().split())\r\nprint(0 if (k==0 or n==k) else 1, min(k*2, n-k))", "n=input()\r\nn1=n.split()\r\nn=int(n1[0])\r\nk=int(n1[1])\r\nstr1=\"\"\r\nstr2=\"\"\r\nif(k==0 or k==n):\r\n\tstr1=\"0 \"\r\nelse:\r\n\tstr1=\"1 \"\r\nif(k==0):\r\n\tstr2=\"0\"\r\nelse:\r\n\tif(k<=n/3):\r\n\t\tstr2=str(2*k)\r\n\telse:\r\n\t\tstr2=str(n-k)\r\nprint(str1+str2)", "n ,k = map(int,input().split())\r\nminumum = min(1,k,n-k)\r\nmaximum = min(2*k,n-k)\r\nprint(minumum,maximum)", "n,k=map(int,input().split())\r\nmi=1\r\nif k==0:\r\n print(0,0)\r\n exit()\r\nif k==n:\r\n print(0,0)\r\n exit()\r\nif 3*k <=n:\r\n ma=2*k\r\nelse:\r\n ma=n-k\r\nprint(mi,ma)\r\n", "l = input()\r\nl = l.split()\r\n\r\nn = int(l[0])\r\nk = int(l[1])\r\n\r\nif k == n or k == 0:\r\n\tprint('0 0')\r\nelse:\r\n\tif n / k <= 3:\r\n\t\tx = n - k\r\n\t\tprint('1', x)\r\n\telse:\r\n\t\tprint (1, (k * 2))", "n, k = (int(x) for x in input().split())\r\n\r\nprint(min(int(bool(k)), n - k), min(k * 2, n - k))\r\n", "n, k = map(int, input().split())\r\n\r\nres = min(n - k, k * 2)\r\nprint(min([1, k, n - k]), res)\r\n", "n, k = map(int, input().split())\r\nprint(min(n-k, 1, k), min(n-k, 2*k))", "\nimport sys\nimport os\nimport math\nimport re\n\n\nn,k = map(int,input().split())\n\nminP = 1\nmaxP = 0\ninhabited = 0\nopt = [2,5,8]\n\nif (k ==n or k == 0):\n minP = 0\n maxP = 0\nmaxP = min(2*k,n-k)\n\nprint(minP,maxP)\n", "n, k = map(int, input().split())\r\ns = 0\r\nif k == n:\r\n minkv = 0\r\n maxkv = 0\r\nelif k == 0:\r\n minkv = 0\r\n maxkv = 0\r\nelse:\r\n minkv = 1\r\n s = n - k\r\n if n % 3 != 0:\r\n t = n // 3 + 1\r\n else:\r\n t = n // 3\r\n if k == t:\r\n maxkv = n - t\r\n elif k < t:\r\n maxkv = k * 2\r\n else:\r\n maxkv = n - t - (k - t)\r\nprint(minkv,maxkv)", "from itertools import permutations\nm,n=map(int,input().split())\nif(m<=n or n==0):\n\tprint(\"0 0\")\nelse:\n\tif n<=(m//3):\n\t\ts=2*n\n\t\tprint(\"1\",s)\n\telse:\n\t\ts=m-n\n\t\tprint(\"1\",s)\n", "import sys, math\r\n\r\n\r\ndef arrayInput(TYPE):\r\n return [TYPE(x) for x in input().split()]\r\n\r\n\r\ndef CF():\r\n n, k= arrayInput(int)\r\n\r\n if n == k or k == 0:\r\n print(0, 0)\r\n return\r\n\r\n mn = 1\r\n mx = n-k\r\n\r\n if mx >= 2*k: mx = 2*k\r\n\r\n print(mn, mx)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin = open('F:/input.txt', 'r')\r\n CF()\r\n", "n,k=map(int,input().split())\r\nprint(0 if n==k or k==0 else 1,k*2 if k*2<n-k else n-k)\r\n", "import math\r\ninp = input()\r\nn,k = inp.split()\r\nn = int(n)\r\nk = int(k)\r\nminn = 1\r\nif (n-k==0) or (k==0):\r\n minn = 0\r\n maxx = 0\r\n\r\nmaxx = k*2\r\nif (n-maxx-k<0):\r\n maxx = n-k\r\n\r\n\r\nprint(minn,end=\" \")\r\nprint(maxx)", "n,k=map(int,input().split())\r\nif n==k or k==0:print(0,0)\r\nelse:print(1,min(n-k,2*k))\r\n", "n,k=map(int,input().split())\r\nif k==0:print(0,0)\r\nelse:print(min(n-k,1),min((k-1)*2+2,n-k))", "n,k=map(int,input().split())\r\nif n==k:\r\n\tprint(0,0)\r\nelif k==0:\r\n\tprint(0,0)\r\nelif 2*k>=n:\r\n\tprint(1,n-k)\r\nelif (n//3)<k<=(n//2):\r\n\tprint(1,n-k)\r\nelif k<=(n//3):\r\n\tprint(1,2*k)", "n,k=map(int,input().split())\r\n\r\nif k==0 or k==n:\r\n ans=[0,0]\r\n print(*ans)\r\nelse:\r\n ans=[1,1]\r\n if 3*k<=n:ans[1]=2*k\r\n else:\r\n a=(3*k-n)//3\r\n b=(3*k-n)%3\r\n if b==0:\r\n ans[1]=2*k-2*a-a\r\n elif b==1:\r\n ans[1]=2*k-2*a-1-a\r\n elif b==2:\r\n ans[1]=2*k-2*a-1-(a+1)\r\n print(*ans)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nif(n==k or k==0):\r\n print(0,0)\r\nelse:\r\n m=n//3\r\n if(m>=k):\r\n print(1,2*k)\r\n else:\r\n print(1,n-k)\r\n", "n,k=map(int,input().split())\r\nx=min(n-k,2*k);print(min(1,x),x)", "n, k = map(int, input().split())\r\nif n == k or k == 0:\r\n print(0, 0)\r\n exit()\r\nprint(1, min(n - k, k * 2))", "while True:\r\n try:\r\n n,k=map(int, input().split())\r\n n = int(n)\r\n k = int(k)\r\n if(n == k or k == 0):\r\n print(\"0 0\")\r\n else:\r\n ans = min(2 * k,n - k)\r\n print(\"{0} {1}\".format(1,ans))\r\n except:\r\n break", "#http://codeforces.com/problemset/problem/854/B\nn, k = map(int,input().split())\nif(n<=k or k==0):\n\tprint(0,0)\nelse:\n\tprint(1,min(k+(k+1//2),n-k))", "n, k = map(int, input().split())\r\nprint(1 if 1<=k<n else 0, min(2*k, n-k))", "n, k = map(int, input().split())\r\nmn = 0 if k == 0 or k == n else 1\r\nmx = 2 * k\r\nif 3 * k > n:\r\n a, b = n // 3, n % 3\r\n good = 2 * a + 1 if b == 2 else 2 * a\r\n k = (k - a) if b == 0 else (k - a - 1)\r\n mx = good - k\r\nprint(mn, mx)", "n, k = map(int, input().split())\r\nif n==k or k==0:\r\n print(0, 0)\r\nelse:\r\n x = min(n-k, 2*k)\r\n print(1, x)", "n, k = map(int, input().split())\n\nif k == 0 or k == n:\n minimum = 0\n maximum = 0\nelse:\n minimum = 1\n if k*2 <= (n-k):\n maximum = k*2\n elif k >= 1 and k <= (n-1):\n maximum = n - k\n\nprint(minimum, maximum)\n\n\n\n", "n,k=map(int,input().split())\r\nif k==0:\r\n print(0,0)\r\n exit()\r\nx=min(n-k,1)\r\ny=min(n-k,2*k)\r\nprint(x,y)\r\n", "n,k=map(int,input().split())\r\nprint(min(1,k,n-k),min(n-k,2*k))", "n, k = map(int, input().split())\r\nif n == k:\r\n print(0, 0)\r\nelif k == 0:\r\n print(0, 0)\r\nelse:\r\n if n < 3 * k + 1:\r\n print(1, n - k)\r\n else:\r\n print(1, k * 2)\r\n", "n,k=[int(f)for f in input().split()]\na=(0 if n==k or k==0 else 1)\nb=(k*2 if n//3>=k else n-k)\nprint(a,(b if k!=0 else 0))\n", "n, k = (int(x) for x in input().split())\r\n\r\nif k == n:\r\n print(0, 0)\r\nelse:\r\n if 3 * k <= n:\r\n print(min(1, k), 2 * k)\r\n else:\r\n print(min(1, k), n - k)", "n,k = list(map(int, input().strip().split()))\n\nif (k == 0 or k == n):\n print(0, end=\" \")\nelse:\n print(1, end=\" \")\n \nprint(min(n-k,2*k))\n", "n,k=map(int,input().split())\nprint(min(k,1,1-(k==n)),min(k*2,n-k))", "#!/usr/bin/env python3\n\n#Written in Python 3\n#Programmer: NMG\n\n'''Between k consecutive filled boxes there are k-1 places and 2 empty boxes can be placed at each place. Also 1 empty box can be placed at start and one at end of k consecutive filled boxes. So a maximum of 2k good boxes can be made out of empty boxes.\n\nCase 1st: When k==0, both minimum and maximum number of good boxes are 0 as number of filled boxes are 0.\nCase 2nd: When k==n, both minimum and maximum number of good boxes are 0 an number of empty boxes are 0.\nCase 3rd: When n-k>2k, minimum number of good boxes = 1 and maximum number of good boxes = 2k.\nCase 3rd: When n-k<2k, minimum number of good boxes = 1 and maximum number of good boxes = n-k.\n'''\n\nn, k = map(int, input().split())\nprint((0 if k==0 or k==n else 1), min(n-k, 2*k))\n", "n,k=map(int,input().split())\nprint(min(n-k,1,k),min(n-k,2*k))\n \t \t\t \t \t\t \t \t\t\t\t\t \t\t\t\t\t", "from math import ceil\r\nn ,k=[int(i) for i in input().split()]\r\nif (k==0 or k==n):\r\n print (0,0)\r\nelse:\r\n print (1,end=\" \")\r\n if (k>=ceil(n/3)):\r\n print (n-k)\r\n else:\r\n print (2*k)", "n,m=map(int,input().split())\r\nmxx=min(n-m,(m*2))\r\nmnn=int(1)\r\nif n==m or m==0:\r\n mnn=int(0)\r\nprint(mnn,mxx)", "import math\r\n\r\nn , k = map(int,input().split())\r\n\r\nif k == 0 or n == k :\r\n print('0 0')\r\n exit(0)\r\n\r\nif k >= math.ceil(n / 3):\r\n print(1 ,n - k)\r\n\r\nelse:\r\n print(1 , 2*k)\r\n\r\n\r\n", "n, k = list(map(int, input().split()))\r\nif k == 0 or k == n:\r\n print(0, 0)\r\nelif k * 2 < n - k:\r\n print(1, k * 2)\r\nelse:\r\n print(1, n - k)\r\n", "n,k=map(int,input().split())\r\nmini = min(1,k,n-k)\r\nmaxi = min(n-k,2*k)\r\nprint(mini,maxi)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nif(k>=n or k==0):\r\n min1=0\r\n max1=0\r\nelse:\r\n min1=1\r\n if(k*3<=n):\r\n max1=k*2\r\n else:\r\n x=k*3-n\r\n max1=k*2-x\r\nprint(min1,end=\" \")\r\nprint(max1)", "n, k = list(map(int, input().split()))\r\n\r\nmn = 1 if 0 < k < n else 0\r\nmx = min(2 * k, n - k)\r\n\r\nprint(mn, mx)\r\n", "n, k = map(int, input().split())\r\nif 1 <= k < n:\r\n print(1,min(n-k,2*k))\r\nelse:\r\n print(0, min(n - k, 2 * k))", "n, k = map(int, input().split())\r\nprint(0 if k == 0 else min(1, n - k), min(n - k, k * 2))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nprint(min(1,k,n-k),min(n-k,2*k))", "n,m=map(int,input().split())\nmxx=min(n-m,(m*2))\nmnn=int(1)\nif n==m or m==0:\n mnn=int(0)\nprint(mnn,mxx)\n\n\t\t\t\t\t\t \t\t \t\t \t\t", "n, k = map(int, input().split())\r\nif k == 0:\r\n print(0, 0)\r\nelse:\r\n if n != k:\r\n mn = 1\r\n else:\r\n mn = 0\r\n mx = min(n - k, k * 2)\r\n print(mn, mx)", "n,k=map(int,input().split())\r\nif(n==k or k==0):\r\n print(0,0)\r\nelse:\r\n if(3*k>=n):\r\n print(1,n-k)\r\n else:\r\n print(1,2*k)", "n,k = map(int,input().split())\r\nx = (n//3)\r\nif k==0 or k==n:\r\n print(0,end=' ')\r\n print(0)\r\nelif x >= k:\r\n print(1,end=' ')\r\n print(k*2)\r\nelif k>x:\r\n print(1,end=' ')\r\n print(n-k)\r\n", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\nif((k==n) or (k==0)):\r\n\tL=[0,0]\r\nelse:\r\n\tL=[1,0]\r\n\tif(k>n//3):\r\n\t\tL[1]=n-k\r\n\telse:\r\n\t\tL[1]=2*k\r\n\t\r\nprint(*L)\r\n", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\nprint(int(k < n and k != 0), end = \" \")\r\nprint(min(n - k, k * 2))", "n,k=(input().split(' '))\r\nn,k=int(n),int(k)\r\nif n==k:\r\n print(\"0 0\")\r\nelif k==0:\r\n print(\"0 0\")\r\nelse:\r\n x=int(n/3)\r\n if k<=x:\r\n print(\"1 \"+str(2*k))\r\n else:\r\n print(\"1 \"+str(n-k))", "n,k=map(int, input().split())\r\na=0\r\nb=0\r\nif k==n or k==0:\r\n a=0\r\nelse:\r\n a=1\r\nif k==1:\r\n b=min(2,(n-k))\r\nelif k==0:\r\n b=0\r\nelse:\r\n b=min(k*2, (n-k))\r\nprint(a,b,sep=' ')", "n, k = list(map(int, input().split()))\r\nif n == 1:\r\n print(0,0)\r\nelif k == 0 or k == n:\r\n print(0, 0)\r\nelse:\r\n print(1, min(2*k, n-k))", "n,k = [int(i) for i in input().split()]\n\n# n apartments\n# k inhabited\n\nm = min(2*k, n-k)\n\n#output min & max good apartments\nif k < n and k > 0:\n print(1, m)\nelse:\n print(0,m)\n", "n, k = tuple(map(int, input().split()))\r\nif k == 0 or k == n:\r\n print(\"0 0\")\r\nelif n // 3 >= k:\r\n print(\"1\", 2*k)\r\nelse:\r\n print(\"1\", n-k)", "n, k = map(int, input().split())\r\nif k == 0 or k == n:\r\n print(0, 0)\r\n exit(0)\r\nif 3 * k <= n:\r\n print(1, 2 * k)\r\n exit(0)\r\na = (n // 3)\r\nb = n % 3\r\nans = 2 * a + 1 if b == 2 else 2 * a\r\nk = (k - a) if b == 0 else (k - a - 1)\r\n\r\nb = max(0, b - 1)\r\nwhile k > 0:\r\n if b > 0:\r\n ans -= 1\r\n k -= 1\r\n b = 0\r\n else:\r\n ans -= k\r\n k = 0\r\nprint(1, ans)", "def solve(apartment,inhabited) :\r\n freeRooms = apartment - inhabited\r\n if freeRooms == 0:\r\n print (0,0)\r\n \r\n else :\r\n mini = min(1,inhabited)\r\n if inhabited*2 >= freeRooms :\r\n print (mini,freeRooms)\r\n else :\r\n print (mini,inhabited*2)\r\n \r\n \r\na,i = list(map(int,input().split()))\r\n\r\nsolve(a,i)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "n,k=map(int,input().split())\r\nprint(min(k,1,n-k),min(k*2,n-k))\r\n", "n,k=map(int,input().split(' '))\r\nif(n==k or k==0):\r\n print(\"0 0\")\r\nelse:\r\n if(k<=(n//3)):\r\n print(\"1 \"+str(k*2))\r\n else:\r\n print(\"1 \"+str(n-k))\r\n", "n,k = map(int,input().split())\r\nmn = 1\r\nif k==0 or k==n:\r\n print(0,0)\r\n exit()\r\ncn,cy = divmod(n,3)\r\nmx = 0\r\nif cy==0:\r\n if k<=cn:\r\n mx = 2*k\r\n else:\r\n mx = 2*cn-(k-cn)\r\nelif cy==1:\r\n if k<=cn:\r\n mx = 2*k\r\n else:\r\n k-=1\r\n mx = 2*cn-(k-cn)\r\nelse:\r\n if k<=cn:\r\n mx = 2*k\r\n else:\r\n k-=1\r\n mx = 2*cn+1\r\n mx-=(k-cn)\r\nprint(mn,mx)", "n, k= map(int, input().split())\r\n\r\nif k==n:\r\n print(0,0)\r\nelif k==0:\r\n print(0,0)\r\nelif n//3>=k:\r\n print(1, k*2)\r\nelse:\r\n print(1, n-k)\r\n", "n, a=map(int, input().split())\r\nif(n==a or a==0):\r\n print(0,0)\r\n exit()\r\nmx=min(n-a,a*2)\r\nprint(1,mx)\r\n", "n, k = map(int, input().split())\r\na = 1 if k and k < n else 0\r\nb = 2 * k if k <= n // 3 else n - k\r\nprint(a, b)", "#Python 3.6.1\r\nl = input().split(' ')\t\t\t#storing input in list\r\nn,k = int(l[0]),int(l[1])\r\n#checking conditions\r\nif k == 0 or k == n:\t\t\t\r\n\tprint('0','0')\r\nelif k <= n/3:\r\n\tprint('1',str(2*k))\r\nelse:\r\n\tprint('1',str(n-k))\r\n", "n,k=map(int,input().split())\r\n\r\nif k==0 or k==n:\r\n ans=[0,0]\r\n print(*ans)\r\nelse:\r\n ans=[1,1]\r\n if 3*k<=n:ans[1]=2*k\r\n else:\r\n a=(3*k-n)//3\r\n b=(3*k-n)%3\r\n ans[1]=2*k-3*a-b\r\n print(*ans)\r\n\r\n\r\n", "n,m = map(int,input().split())\r\nif m==0 or m==n:\r\n print(0,0)\r\nelse:\r\n x = n//3\r\n if m<=x:\r\n print(1,2*m)\r\n else:\r\n print(1,n-m)\r\n", "n, k = map(int, input().split())\nx = n // 3\nif n == k or k == 0:\n print('0 0')\nelif k <= x:\n print(1, k * 2)\nelif k > x:\n print(1, n - k)\n", "#R1 D\na = input().split()\nn = int(a[0])\nk = int(a[1])\ndef f(n,k):\n ans1 = 0\n ans2 = 0\n if (k == 0):\n print(ans1, ans2)\n return\n if (k < n):\n ans1 = 1\n if (k <= n/3):\n ans2 = k*2\n elif (k > n/3):\n ans2 = n-k\n else:\n pass\n print(ans1, ans2)\n if (k == n):\n print(ans1, ans2)\n return \nf(n,k)", "n,k=map(int,input().split())\r\nif k==0 or k==n:\r\n min=0\r\n max=0\r\nelse:\r\n min=1\r\n if 3*k<=n:\r\n max=2*k\r\n else:\r\n max=n-k\r\nprint(min,max)\r\n\r\n", "n,k=map(int,input().split())\r\nif k==0:mi=ma=0\r\nelse:\r\n if n>=3*k:\r\n ma=2*k;mi=1\r\n elif n==k:\r\n ma=mi=0\r\n else:\r\n mi=1;ma=n-k\r\nprint(mi,ma)", "n, k = map(int, input().split())\r\nprint(min(1, k, n - k), min(n - k, 2 * k))\r\n", "n, k = map(int, input().split())\r\n\r\nprint(min(int(bool(k)),n-k), min(n-k,2*k))", "n, k = map(int, input().split())\r\n\r\nprint(str(min(1, n-k, k)) + \" \" + str(min(2*k, n-k)))\r\n" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\n\r\np = 10**9+7 \r\ndef process(A):\r\n n = len(A)\r\n fact_dict = [1]\r\n for i in range(1, n+1):\r\n x = fact_dict[-1]\r\n fact_dict.append((i*x) % p)\r\n A.sort()\r\n m = A[-1]\r\n curr = 0\r\n answer = 0\r\n for i in range(n):\r\n if i==0 or A[i] > A[i-1]:\r\n smaller = curr\r\n if A[i] < m:\r\n entry = fact_dict[n]*pow(n-smaller, p-2, p)\r\n answer = (answer+entry*A[i]) % p\r\n curr+=1\r\n print(answer)\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprocess(A)\r\n \r\n ", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nmod=10**9+7\r\n\r\nM=(10**6)+10 \r\nfac=[1]*M\r\nninv=[1]*M\r\nfinv=[1]*M\r\nfor i in range(2,M):\r\n fac[i]=fac[i-1]*i%mod\r\n ninv[i]=(-(mod//i)*ninv[mod%i])%mod\r\n finv[i]=finv[i-1]*ninv[i]%mod\r\n\r\ndef binom(n,k):\r\n if n<0 or k<0:\r\n return 0\r\n if k>n:\r\n return 0\r\n return (fac[n]*finv[k]%mod)*finv[n-k]%mod\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nK=0\r\nfor i in range(n-1):\r\n if i!=n-1 and a[i]==a[i+1]:\r\n K+=1\r\n continue\r\n K+=1\r\n X=n-1-i\r\n Y=n-K-X\r\n res=binom(X+K-1,X)\r\n ans+=res*binom(n,Y)%mod*fac[X]%mod*fac[Y]%mod*fac[K]%mod*a[i]\r\n ans%=mod\r\n K=0\r\nprint(ans)", "import sys\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = Counter(a)\r\n\r\nans = 0\r\nmod = 10**9 + 7\r\nb = sorted(cnt.keys(), reverse=True)\r\nm = cnt[b[0]]\r\n\r\nfor key in b[1:]:\r\n m += cnt[key]\r\n ans = (ans + pow(m, mod-2, mod) * key * cnt[key]) % mod\r\n\r\nfor i in range(2, n+1):\r\n ans = ans * i % mod\r\n\r\nprint(ans)" ]

[ "def judge(lists, x):\n ans = 0\n for i in lists:\n t = i//x\n d = i%x\n if d == 0:\n ans += t\n elif t+d >= x-1:\n ans += t+1\n else:\n return -1\n\n return ans\n\nwhile True:\n try:\n n = input()\n balls = list(map(int, input().split()))\n minn = min(balls)\n for i in range(1, minn+1):\n if judge(balls, minn//i + 1) >= 0:\n ans = judge(balls, minn//i + 1)\n break\n elif judge(balls, minn//i) >= 0:\n ans = judge(balls, minn//i)\n break\n \n print(ans)\n except EOFError:\n break\n\n\t \t \t\t\t \t\t \t\t \t\t\t\t \t\t\t \t", "from math import sqrt\r\n\r\ndef divide_into_p(p, a):\r\n q = a // (p+1)\r\n r = a % (p+1)\r\n if r == 0:\r\n return q\r\n elif q + r >= p:\r\n return q+1\r\n else:\r\n return None\r\n\r\ndef divisible_into_p(p, lst):\r\n lgth = 0\r\n for l in lst:\r\n dp = divide_into_p(p, l)\r\n if dp == None:\r\n return None\r\n else:\r\n lgth += dp\r\n return lgth\r\n\r\ndef index_lst(a,sqrta):\r\n lst = []\r\n for i in range(1, sqrta + 1):\r\n p = a//i\r\n lst.append(p)\r\n if not a%p:\r\n lst.append(p-1)\r\n for i in range(sqrta+1,0,-1):\r\n lst.append(i)\r\n return lst\r\n\r\ndef check_all_p(balls):\r\n a = balls[0]\r\n sqrt_a = int(sqrt(a))\r\n indices = index_lst(a,sqrt_a)\r\n for i in indices:\r\n dp = divisible_into_p(i, balls)\r\n if dp != None:\r\n return dp\r\n \r\n \r\ninput()\r\nballs = sorted([int(x) for x in input().split()])\r\n\r\nprint(check_all_p(balls))\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\n\r\nans=10**18\r\n\r\ndef check(x):\r\n res=0\r\n for ai in a:\r\n l=(ai+x)//(x+1)\r\n r=ai//x\r\n if l<=r:\r\n res+=l\r\n else:\r\n return\r\n global ans\r\n ans=min(ans,res)\r\n\r\nx=1\r\nwhile x*x<=a[0]:\r\n check(x)\r\n m=a[0]//x\r\n if a[0]%x==0 and 1<=m-1:\r\n check(m-1)\r\n check(m)\r\n x+=1\r\n\r\nprint(ans)", "_n=int(input())\r\na=list(map(int,input().split()))\r\nn,i,r=a[0],1,[]\r\nwhile i<=n:\r\n\te=n//i\r\n\tj=n//e\r\n\tr.append(e)\r\n\tif e>1:r.append(e-1)\r\n\ti=j+1\r\nr=sorted(list(set(r)))\r\nans=10**18\r\nfor x in r:\r\n\tcur=0\r\n\tfor v in a:\r\n\t\ty=(v+x)//(x+1)\r\n\t\tif y*x>v or y<v-y*x:\r\n\t\t\tcur=ans\r\n\t\t\tbreak\r\n\t\tcur+=y\r\n\tans=min(ans,cur)\r\nprint(ans)", "import math\r\nn = int(input())\r\ns = input().split(' ')\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\nm = min(s)\r\ndef try_sz(x):\r\n for thing in s:\r\n if thing%x > math.floor(thing/x):\r\n return False\r\n return True\r\ngood = False\r\nsz = 0\r\nfor i in range(1,math.ceil(m**0.5)+1):\r\n if try_sz(math.floor(m/i)):\r\n good = True\r\n sz = math.floor(m/i)\r\n break\r\n if m%i == 0:\r\n if try_sz(math.floor(m/i)-1):\r\n good = True\r\n sz = math.floor(m/i)-1\r\n break\r\nans = 0\r\nfor thing in s:\r\n ans += math.ceil(thing/(sz+1))\r\nprint(str(ans))\r\n" ]

[ "def lbt(x):return 0 if x&1 else lbt(x>>1)+1\r\nx,k,p=map(int,input().split())\r\np,m=p/100,k>>1\r\nf=[lbt(x+i) for i in range(k+1)]\r\nfor i in range(k):\r\n\tg=[0]*(k+1)\r\n\tfor j in range(k+1):\r\n\t\tif j>=1:g[j-1]+=(1-p)*f[j]\r\n\t\tif j<=m:g[j<<1]+=p*(f[j]+1)\r\n\tf=g\r\nprint('%.8f'%f[0])" ]

[ "import sys\r\n \r\ndef solve():\r\n n = int(sys.stdin.readline())\r\n a = [0] + [int(i) for i in sys.stdin.readline().split()]\r\n \r\n dp = [[0]*(n + 1) for i in range(n + 1)]\r\n ans = 0\r\n \r\n maxnum = [0] * (10**5 + 2)\r\n maxmod = [0] * 7\r\n \r\n for y in range(n + 1):\r\n maxmod = [0] * 7\r\n \r\n for ai in a:\r\n maxnum[ai] = 0\r\n \r\n for i in range(y):\r\n maxmod[a[i] % 7] = max(maxmod[a[i] % 7], dp[i][y])\r\n maxnum[a[i]] = max(maxnum[a[i]], dp[i][y])\r\n \r\n for x in range(y + 1, n + 1):\r\n dp[x][y] = max(maxmod[a[x] % 7], maxnum[a[x] + 1], maxnum[a[x] - 1], dp[0][y]) + 1\r\n dp[y][x] = dp[x][y]\r\n maxmod[a[x] % 7] = max(maxmod[a[x] % 7], dp[x][y])\r\n maxnum[a[x]] = max(maxnum[a[x]], dp[x][y])\r\n ans = max(ans, dp[x][y])\r\n \r\n print(ans)\r\n \r\nif __name__ == '__main__':\r\n solve()" ]

[ "n, m, v = map(int, input().split())\r\ndef main(n, m, v):\r\n if m < n - 1 or m > (n - 3) * (n - 2) // 2 + n - 1:\r\n print(-1)\r\n return\r\n for i in range(1, n+1):\r\n if i == v:\r\n continue\r\n print(i, v)\r\n edges = n - 1\r\n for i in range(1, n):\r\n if i == v:\r\n continue\r\n for j in range(1, i):\r\n if j == v:\r\n continue\r\n if edges == m:\r\n return\r\n print(i, j)\r\n edges += 1\r\nmain(n, m, v)\r\n", "n, m, v = [int(i) for i in input().split()]\r\nif m < n-1 or m > (n-1) * (n-2) / 2 + 1:\r\n print(-1)\r\nelse:\r\n tmp_list = [i for i in range(1,1+n) if i != v]\r\n for i in tmp_list:\r\n print(v, i)\r\n m -= n-1\r\n for i in range(n-2):\r\n if m:\r\n for j in range(i+1, n-2):\r\n if m:\r\n print(tmp_list[i], tmp_list[j])\r\n m -= 1\r\n else:\r\n exit()", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 22C\n\"\"\"\nimport sys\n\nn, m, v = input().split(' ')\nn = int(n)\nm = int(m)\nv = int(v)\n\narr = [int(x) for x in range(n+1)]\n\nif n - 1 > m or m > ( (n - 1) * (n - 2) / 2 + 1 ):\n print(-1)\n sys.exit()\nelse:\n arr[1] = v\n arr[v] = 1\n\nfor i in range(2, n + 1):\n print(arr[i], arr[1])\n\nm = m - n + 1\n\nfor x in range(3, n + 1):\n for y in range(x + 1, n + 1):\n if m > 0:\n print(arr[x], arr[y])\n m = m - 1\n else:\n break\n \n", "import sys\r\n\r\nints, strs, maps, ranges, lens = int, str, map, range, len\r\nfout = []\r\n\r\ndef sumation(target):\r\n\tcount = 0\r\n\tfor i in range(target):\r\n\t\tcount += target - i\r\n\treturn count\r\n\r\nservers, connections, dead = maps(ints, input().split())\r\n\r\nif not((connections < servers - 1) or (connections > sumation(servers - 2) + 1)):\r\n\tserver_list = []\r\n\tfor i in ranges(servers):\r\n\t\tserver_list.append(i + 1)\r\n\r\n\tif dead != 2:\r\n\t\tserver_list[1], server_list[dead - 1] = server_list[dead - 1], server_list[1]\r\n\telse:\r\n\t\tserver_list[1], server_list[0] = server_list[0], server_list[1]\r\n\r\n\tfout.append(\"{} {}\".format(server_list[0], server_list[1]))\r\n\r\n\tfor i in ranges(lens(server_list[2:])):\r\n\t\tfout.append(\"{} {}\".format(server_list[1], server_list[i + 2]))\r\n\r\n\t# Standard connections\r\n\r\n\tcount = connections - (lens(fout))\r\n\r\n\tnew_server_list = server_list[2:]\r\n\r\n\tif count > 0:\r\n\r\n\t\tfor i in ranges(lens(new_server_list)):\r\n\t\t\tfor e in ranges(i + 1, len(new_server_list)):\r\n\t\t\t\tfout.append(\"{} {}\".format(new_server_list[i], new_server_list[e]))\r\n\t\t\t\tcount -= 1\r\n\r\n\t\t\t\tif count == 0:\r\n\t\t\t\t\tprint(\"\\n\".join(fout))\r\n\t\t\t\t\tsys.exit()\r\n\r\nelse:\r\n\tfout.append(\"-1\")\r\n\r\nprint(\"\\n\".join(fout))", "from itertools import combinations, islice, chain\n\n\nn, m, v = map(int, input().split())\nif m < n - 1:\n print(-1)\nelse:\n edges = chain(islice(combinations(range(1, n), 2), m - 1), [(1, n)])\n res = [(v if e[0] == 1 else 1 if e[0] == v else e[0], 1 if e[1] == v else e[1]) for e in edges]\n print(\"\\n\".join(f\"{edge[0]} {edge[1]}\" for edge in res) if len(res) == m else -1)\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, m, v = map(int, input().split())\r\nif m < n-1 or m > ((n-1)*(n-2))//2+1:\r\n print(-1)\r\nelse:\r\n c = n - 1\r\n if n == v:\r\n n -= 1\r\n for i in range(1, n+1):\r\n if v != i:\r\n print(i, v)\r\n\r\n x, y = 1, 1\r\n\r\n while c != m:\r\n if x == n-1:\r\n y += 1\r\n x = y+1\r\n else:\r\n x += 1\r\n if x != v and y != v:\r\n print(x, y)\r\n c += 1\r\n", "server, connect, failturePoint = map(int, input().split(' '))\r\n\r\ndef main():\r\n\tglobal connect\r\n\tif connect > (server - 1) * (server - 2) / 2 + 1 or connect < server - 1:\r\n\t\treturn -1\r\n\r\n\tfor i in range(1, server + 1):\r\n\t\tif i != failturePoint:\r\n\t\t\tprint(str(i) + ' ' + str(failturePoint))\r\n\tconnect -= server - 1\r\n\r\n\tparent = 1 if failturePoint != 1 else 2\r\n\r\n\tfor i in range(1, server + 1):\r\n\t\tif i != parent and i != failturePoint:\r\n\t\t\tfor j in range(i + 1, server + 1):\r\n\t\t\t\tif j != parent and j != failturePoint:\r\n\t\t\t\t\tif connect == 0:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tprint(str(i) + ' ' + str(j))\r\n\t\t\t\t\t\tconnect -= 1\r\nnum = main()\r\nif num == -1:\r\n\tprint(num)", "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, m, v = map(int, input().split())\r\n\r\nif m < n - 1 or m > (n - 1) * (n - 2) // 2 + 2:\r\n print(-1)\r\n exit()\r\n\r\n\r\ndef ok(edges):\r\n sys.stdout.buffer.write('\\n'.join(edges).encode('utf-8'))\r\n exit()\r\n\r\n\r\np = v - 1 if v > 1 else n\r\nvs = [p, v] + [i for i in range(1, n + 1) if i != v and i != p]\r\n\r\nedges = [f'{vs[i]} {vs[i+1]}' for i in range(n - 1)]\r\nm -= n - 1\r\nif m == 0:\r\n ok(edges)\r\n\r\nfor i in range(1, n - 2):\r\n for j in range(i + 2, n):\r\n edges.append(f'{vs[i]} {vs[j]}')\r\n m -= 1\r\n if m == 0:\r\n ok(edges)\r\nprint(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, v = map(int, input().split())\r\nif m < n - 1 or (n - 1) * (n - 2) // 2 + 1 < m:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nx = [i for i in range(1, n)] if v ^ n else [i for i in range(2, n + 1)]\r\nans = [(v, n)] if v ^ n else [(1, v)]\r\nfor i in range(1, n):\r\n for j in range(n - 1 - i):\r\n ans.append((x[j], x[i + j]))\r\n if not len(ans) ^ m:\r\n break\r\n if not len(ans) ^ m:\r\n break\r\nfor i in range(m):\r\n ans[i] = \" \".join(map(str, ans[i]))\r\nsys.stdout.write(\"\\n\".join(ans))", "n,m,v=map(int,input().split())\r\nif m<n-1 or m>(n-1)*(n-2)//2+1:\r\n\tprint(-1)\r\n\texit()\r\nif v==1:\r\n\tprint(1,2)\r\n\tt=[1]+[i for i in range(3,n+1)]\r\n\ts=1\r\n\ti,j=0,1\r\n\tk=len(t)\r\n\twhile s<m and i<k-1:\r\n\t\tprint(t[i],t[j])\r\n\t\tj+=1\r\n\t\tif j==k:\r\n\t\t\ti+=1\r\n\t\t\tj=i+1\r\n\t\ts+=1\r\nelse:\r\n\tprint(1,v)\r\n\tt=[i for i in range(v,n+1)]+[i for i in range(2,v)]\r\n\ts=1\r\n\ti,j=0,1\r\n\tk=len(t)\r\n\twhile s<m and i<k-1:\r\n\t\tprint(t[i],t[j])\r\n\t\tj+=1\r\n\t\tif j==k:\r\n\t\t\ti+=1\r\n\t\t\tj=i+1\r\n\t\ts+=1", "\r\nn,m,v=map(int,input().split())\r\nif m<n-1 or m>(n-1)*(n-2)//2+1:\r\n print(-1)\r\n exit()\r\nk=n-1 \r\nif n==v: n-=1\r\nfor i in range(1,n+1):\r\n if v!=i: print(i,\" \",v)\r\nx,y=1,1\r\nwhile k!=m:\r\n if x==n-1:\r\n y+=1\r\n x=y+1\r\n else:\r\n x+=1\r\n if x!=v and y!=v:\r\n print(x,\" \",y)\r\n k+=1\r\n", "n, m, v = list(map(int, input().split()))\r\nif n - 1 <= m <= ((n - 3) * (n - 2) >> 1) + n - 1:\r\n net = list(range(1, n + 1))\r\n net = net[:v - 1] + net[v:]\r\n print(\"\\n\".join(list(f\"{v} {i}\" for i in net)))\r\n net = net[1:]\r\n m -= n - 1\r\n len_net = len(net)\r\n i = 0\r\n j = 1\r\n while m:\r\n print(f\"{net[i]} {net[j]}\")\r\n switch = True if j + 1 == len_net else False\r\n j = i + 2 if switch else j + 1\r\n i += 1 if switch else 0\r\n m -= 1\r\nelse:\r\n print(-1)" ]

[ "import sys\r\nfrom math import *\r\nfrom fractions import gcd\r\nfrom random import * # randint(inclusive,inclusive)\r\nreadints=lambda:map(int, input().strip('\\n').split())\r\nfrom itertools import permutations, combinations\r\ns = \"abcdefghijklmnopqrstuvwxyz\"\r\n# print('', end=\" \")\r\n# for i in {1..5}; do echo \"hi\"; done\r\n\r\n\r\n\r\n\r\nn,k=readints()\r\ns=input()\r\n\r\nlo=-1\r\nhi=n+1\r\n\r\nhop = [0]*n\r\nfor i in range(n):\r\n if s[i]=='0':\r\n hop[i]=i\r\n else:\r\n hop[i]=hop[i-1]\r\n\r\ndef test(jump):\r\n at=0\r\n used=0\r\n\r\n while used < k-2:\r\n if at+jump<n:\r\n to = hop[at+jump]\r\n if to == at:\r\n break\r\n at = to\r\n used += 1\r\n else:\r\n break\r\n \r\n\r\n\r\n if n-1-at>jump:\r\n return False\r\n return True \r\n\r\n\r\n\r\nwhile hi-lo>1:\r\n mid=(lo+hi)//2\r\n if test(mid):\r\n hi=mid\r\n else:\r\n lo=mid\r\n\r\n\r\nprint(hi-1)\r\n", "def check(p):\r\n cur = k - 2\r\n p+=1\r\n lastfree = 0\r\n lasteat = 0\r\n for i in range(1, n-1):\r\n if tm[i] == '0':\r\n lastfree = i\r\n if i - lasteat >= p:\r\n if lasteat == lastfree or cur <= 0:\r\n return False\r\n lasteat = lastfree\r\n cur -= 1\r\n return True\r\n\r\n\r\ndef bs(l, r):\r\n while(l < r):\r\n mid = (l + r) >> 1\r\n if check(mid):\r\n r = mid\r\n else:\r\n l = mid + 1\r\n return l\r\n\r\nn, k = map(int, input().split())\r\ntm = input()\r\n\r\nprint(bs(0, n))", "def ch(j, p, k):\r\n i = 1\r\n kk = k - 1\r\n while i < len(j):\r\n t = -1\r\n for ii in range(min(i + p, len(j) - 1), i - 1, -1):\r\n if j[ii] == '0':\r\n t = ii + 1\r\n break\r\n if t == -1:\r\n return False\r\n i = t\r\n kk -= 1\r\n return kk >= 0\r\nn, k = map(int, input().split())\r\nj = input()\r\nq = -1\r\nw = n - 2\r\nwhile q + 1 < w:\r\n p = (q + w) // 2\r\n if ch(j, p, k):\r\n w = p\r\n else:\r\n q = p\r\nprint(w)#moondance bobfut.near\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nlevo = [0] * n\r\nfor i in range(1, n):\r\n\tif s[i] == '0':\r\n\t\tlevo[i] = i\r\n\telse:\r\n\t\tlevo[i] = levo[i-1]\r\n\r\nl = 1\r\nr = n-1\r\no = n-1\r\n\r\ndef probaj(w):\r\n\tx = 0\r\n\tjumps = 0\r\n\twhile jumps < k-2:\r\n\t\tif x+w < n:\r\n\t\t\ty = levo[x+w]\r\n\t\t\tif y == x:\r\n\t\t\t\tbreak\r\n\t\t\tx = y\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\t\tjumps += 1\r\n\r\n\tif n-1-x > w:\r\n\t\treturn False\r\n\r\n\treturn True\r\n\r\nwhile l <= r:\r\n\tm = (l+r) // 2\r\n\r\n\tif probaj(m):\r\n\t\to = m\r\n\t\tr = m-1\r\n\telse:\r\n\t\tl = m+1\r\n\r\nprint(o-1)", "def check(mn, n, k, s):\r\n\tcur = 0\r\n\tk -= 1\r\n\twhile cur + 1 < n:\r\n\t\tprv = cur\r\n\t\tcur = min(n - 1, cur + mn)\r\n\t\twhile s[cur] == '1':\r\n\t\t\tcur -= 1\r\n\t\tif prv == cur:\r\n\t\t\treturn False\r\n\t\tk -= 1\r\n\treturn k >= 0\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\nL = 1\r\nR = n - 1\r\nwhile L < R:\r\n\tmid = (L + R) // 2\r\n\tif not check(mid, n, k, s):\r\n\t\tL = mid + 1\r\n\telse:\r\n\t\tR = mid\r\nprint(L - 1)", "import sys\r\nfrom math import *\r\nfrom fractions import gcd\r\nfrom random import * # randint(inclusive,inclusive)\r\nreadints=lambda:map(int, input().strip('\\n').split())\r\nfrom itertools import permutations, combinations\r\ns = \"abcdefghijklmnopqrstuvwxyz\"\r\n# print('', end=\" \")\r\n# for i in {1..5}; do echo \"hi\"; done\r\n\r\n\r\n\r\n\r\nn,k=readints()\r\ns=input()\r\n\r\ng=[0]*n\r\nfor i in range(n):\r\n if s[i]=='0':\r\n g[i]=i\r\n else:\r\n g[i]=g[i-1]\r\n\r\n\r\ndef f(hop):\r\n at=0\r\n used=0\r\n while used<k-2 and at+hop<n:\r\n to=g[at+hop]\r\n if to==at:\r\n break\r\n used+=1\r\n at=to\r\n\r\n if n-1-at>hop:\r\n return False\r\n return True\r\n\r\n\r\nlo=-1\r\nhi=n+1\r\n\r\nwhile hi-lo>1:\r\n mid=(lo+hi)//2\r\n if f(mid):\r\n hi=mid\r\n else:\r\n lo=mid\r\n\r\nprint(hi-1)\r\n", "import sys\r\nfrom math import *\r\nfrom fractions import gcd\r\nfrom random import * # randint(inclusive,inclusive)\r\nreadints=lambda:map(int, input().strip('\\n').split())\r\nfrom itertools import permutations, combinations\r\ns = \"abcdefghijklmnopqrstuvwxyz\"\r\n# print('', end=\" \")\r\n# for i in {1..5}; do echo \"hi\"; done\r\n\r\n\r\n\r\n\r\nn,k=readints()\r\ns=input()\r\n\r\nlo=-1\r\nhi=n+1\r\n\r\n\r\n\r\ndef test(x):\r\n have=k-1\r\n last=0\r\n arr=[]\r\n for i in range(n):\r\n if s[i]=='0':\r\n arr.append(i)\r\n\r\n arr.append(10**9)\r\n\r\n for i in range(1,len(arr)):\r\n if arr[i]-last-1>x:\r\n if arr[i-1]==last:\r\n return False\r\n if have==0:\r\n return False\r\n if arr[i-1]-last-1>x:\r\n return False\r\n last=arr[i-1]\r\n have-=1\r\n\r\n return True\r\n\r\n\r\n\r\nwhile hi-lo>1:\r\n mid=(lo+hi)//2\r\n if test(mid):\r\n hi=mid\r\n else:\r\n lo=mid\r\n\r\n\r\nprint(hi)\r\n" ]

[ "kl=\"\";\r\nfor i in range(3):\r\n kl+=input();\r\nprint(['NO','YES'][kl==kl[::-1]]);", "s=input()\ns+=input()\ns+=input()\nflag=True\nfor i in range(5):\n if(s[i]!=s[8-i]):\n flag=False\n break;\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nif a==c[::-1] and b==b[::-1]:print(\"YES\")\r\nelse:print(\"NO\")", "r=[list(input()) for _ in range(3)];print('NYOE S'[r[0][0]==r[2][2] and r[0][1]==r[2][1] and r[1][0]==r[1][2] and r[2][0]==r[0][2]::2])", "m = []\r\nl = input()\r\nm.append(list(l))\r\nl = input()\r\nm.append(list(l))\r\nl = input()\r\nm.append(list(l))\r\nc = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if m[i][j] != m[2-i][2-j]:\r\n c = False\r\nprint(\"YES\" if c else \"NO\")", "ar = [input() for _ in range(3)]\r\nprint('YES' if ar[0] == ar[2][::-1] and ar[1] == ar[1][::-1] and ar[2] == ar[0][::-1] else 'NO')\r\n", "c = []\nfor i in range(3):\n lst = input()\n tmp = []\n for ch in lst:\n tmp.append(ch)\n c.append(tmp)\nflag = 0\nfor i in range(3):\n for j in range(2):\n if c[i][j] != c[2-i][2-j]:\n flag = 1\nif flag:\n print(\"NO\")\nelse: print(\"YES\")\n \t \t \t \t \t\t \t\t \t \t\t \t", "arr = []\r\nfor _ in range(3):\r\n s = list(input())\r\n arr.extend(s)\r\nif arr[0] == arr[8] and arr[1] == arr[7] and arr[2] == arr[6] and arr[3] == arr[5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[]\r\nflag=1\r\nfor _ in range(3):\r\n p=input()\r\n l.append(p)\r\nfor i in range(3):\r\n if l[0][i]!=l[2][2-i]:\r\n flag=0\r\n break\r\nif l[1][0]!=l[1][2]:\r\n flag=0\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "a=[]\r\nfor i in range(3):\r\n a.append(input())\r\nans=\"YES\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if i==0:\r\n i1=2\r\n elif i==2:\r\n i1=0\r\n else:\r\n i1=1\r\n if j==0:\r\n j1=2\r\n elif j==2:\r\n j1=0\r\n else:\r\n j1=1\r\n if a[i][j]!=a[i1][j1]:\r\n ans=\"NO\"\r\nprint(ans)\r\n", "s = \"0\"\r\n\r\nfor _ in range(3):\r\n s+= input()\r\n\r\n\r\nif all(s[i]==s[10-i] for i in range(1,5)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1=input()\r\na2=input()\r\na3=input()[::-1]\r\nif (a1==a3)and (a2[0]==a2[2]):\r\n print(\"YES\")\r\nelse: print(\"NO\")\r\n \r\n", "flag = 0\nrows = 3\ncolumns = 3\nstr1=str(input())\n\n\n\n\nstr2=str(input())\n\n\n\n\nstr3=str(input())\n\n\nif str1[0] == str3[2] and str1[1] == str3[1] and str1[2] == str3[0] and str2[0] == str2[2]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\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()) for _ in range(3)]\r\nans = \"YES\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if s[i][j] ^ s[2 - i][2 - j]:\r\n ans = \"NO\"\r\nprint(ans)", "q=[]\r\nz=[]\r\nw=3\r\nwhile w>0 :\r\n a=str(input())\r\n q+=a;\r\n z+=a;\r\n w-=1\r\n\r\n\r\nq[0],q[2]=q[2],q[0]\r\nq[6],q[8]=q[8],q[6]\r\nq[5],q[3]=q[3],q[5]\r\nq[0],q[6],q[1],q[7],q[2],q[8]=q[6],q[0],q[7],q[1],q[8],q[2]\r\nif(z==q):print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n \r\n", "grid = [input() for _ in range(3)]\r\nis_super_agent = \"YES\" if (grid[0][0] == grid[2][2] and\r\n grid[0][1] == grid[2][1] and\r\n grid[0][2] == grid[2][0] and\r\n grid[1][0] == grid[1][2]) else \"NO\"\r\nprint(is_super_agent)", "\r\n\r\ng=[]\r\n\r\nfor j in range(3):\r\n g.append(list(input()))\r\n\r\nh=0\r\n\r\n\r\nfor j in range(3):\r\n for k in range(3):\r\n if g[j][k] != g[abs(2-j)][abs(2-k)]:\r\n print('NO')\r\n h+=1\r\n break\r\n if h>0:\r\n break\r\n\r\nif h==0:\r\n print('YES')\r\n", "sse=\"\"\r\nfor j in range(3):\r\n num=input()\r\n sse=sse+num\r\nif sse==sse[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a,b,c=input(),input(),input()\r\nif a==c[::-1] and b!='..X' and b!='X..': print('YES')\r\nelse: print('NO')", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nif (s1 == s3[::-1]) and (s2[0] == s2[2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = input()\r\nc = input()\r\nk = input()\r\nif t[0] == k[2] and t[1] == k[1] and t[2] == k[0] and c[0] == c[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = []\nfor i in range(3):\n a.append(input())\nb = ''.join(a)\nif(b == b[::-1]):\n print('YES')\nelse:\n print('NO')", "key = ''\r\nfor i in range(3):\r\n key += input()\r\nprint([\"No\", \"Yes\"][key == key[::-1]])", "# -*- coding: utf-8 -*-\r\n\r\nk = str(input()) + str(input()) + str(input())\r\n\r\nif k == k[::-1]: print('YES')\r\nelse: print('NO')\r\n\r\n", "def main():\r\n pw = []\r\n for i in range(3):\r\n pw += input()\r\n\r\n sym = \"YES\"\r\n for i in range(4):\r\n if pw[i] != pw[8 - i]:\r\n sym = \"NO\"\r\n break\r\n\r\n print(sym)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=[*open(0)]\r\nprint('YNEOS'[a[0][0]!=a[2][2]or a[0][1]!=a[2][1]or a[0][2]!=a[2][0]or a[1][0]!=a[1][2]::2])", "L=[0,0,0]\r\nfor i in range(3):\r\n L[i] = input()\r\nans = \"YES\"\r\nfor i in range(3):\r\n if L[0][i]!=L[2][2-i]:\r\n ans = \"NO\"\r\nif L[1][0]!=L[1][2]:\r\n ans = \"NO\"\r\nprint(ans)\r\n", "m= input()+input()+input()\r\nprint('YES' if m==m[::-1] else 'NO')", "a=input()\r\nb=input()\r\nc=input()\r\ns=[]\r\nfor i in a:\r\n s+=[i]\r\nfor j in b:\r\n s+=[j]\r\nfor k in c:\r\n s+=[k]\r\nif s==s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "t = ''\r\nfor i in range(3):\r\n t += input()\r\nif t == t[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=[list(input()),list(input()),list(input())]\r\nfor i in range(2):\r\n for j in range(3):\r\n if a[i][j]!=a[2-i][2-j]:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")", "i= input()\r\nj= input()\r\nk= input()\r\n\r\nd= i+j+k\r\nf =d[::-1]\r\nif f==d:\r\n print(\"YES\")\r\nif f!=d:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nif a[0]==c[2] and a[1]==c[1] and a[2]==c[0] and b[0]==b[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n s = [input() for i in range(3)]\r\n if s[1][0] != s[1][2]:\r\n print('NO')\r\n return\r\n for i in range(3):\r\n if s[0][i] != s[2][2-i]:\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\nif __name__ == '__main__':\r\n main()", "pad = [input() for _ in range(3)]\r\nsym = True\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if pad[i][j] != pad[2 - i][2 - j]:\r\n sym = False\r\n\r\nprint(\"YES\" if sym else \"NO\")\r\n", "a = [ input() for i in range(3)]\r\nb = \"YES\"\r\nfor i in range(3):\r\n if a[0][i] != a[2][2-i]:\r\n b = \"NO\"\r\nif a[1][0] != a[1][2]:\r\n b = \"NO\"\r\nprint(b)", "s=\"\"\r\nfor i in range(3):\r\n\ts+=input()\r\nprint([\"NO\",\"YES\"][s==s[::-1]])", "matrix = []\r\nfor x in range(3):\r\n a = input()\r\n matrix.append(a) \r\n\r\nresult = 0\r\nfor x in range(3):\r\n for y in range(3):\r\n if matrix[x][y] == matrix[2-x][2-y]:\r\n result += 1 \r\n\r\nif result == 9:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "mas = [input() for i in range(3)]\r\nflag = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if mas[i][j]=='X':\r\n if mas[2-i][2-j]=='X':\r\n continue\r\n else:\r\n print('NO')\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nelse:\r\n print('YES')", "t=1\r\n # t = int(input())\r\nfor i in range(t):\r\n #n = int(input())\r\n a = input()\r\n b = input()\r\n c = input()\r\n f1 = a == c[::-1]\r\n f2 = b[0] == b[2]\r\n if f1 and f2:\r\n print('Yes')\r\n else:\r\n print('No')", "def symmetric(password):\r\n password[2].reverse()\r\n if password[0] == password[2]:\r\n password[2].reverse()\r\n return True\r\n password[2].reverse()\r\n return False\r\n\r\n\r\n\r\ndef main():\r\n password = []\r\n i = 0\r\n while i < 3:\r\n password.append(list(input()))\r\n i += 1 \r\n LeftRightSymmetric = symmetric(password)\r\n #change columns with rows\r\n reversedPassword = list(map(list, zip(*password)))\r\n TopBottomSymmetric = symmetric(reversedPassword)\r\n\r\n if LeftRightSymmetric and TopBottomSymmetric:\r\n print('YES')\r\n else:\r\n print('NO')\r\nmain()", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nmatrix = []\r\nfor _ in range(3):\r\n matrix.append(list(input()))\r\nflag = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] != matrix[3 - i - 1][3 - j - 1]:\r\n print('NO')\r\n flag = False\r\n break\r\n if not flag:\r\n break\r\nif flag:\r\n print('YES')\r\n", "s=[];\r\nfor _ in range(3):\r\n s.append(input());\r\n\r\nif s[0][0]==s[2][2] and s[0][1]==s[2][1] and s[0][2]==s[2][0] and s[1][0]==s[1][2]:\r\n print('YES');\r\nelse:\r\n print('NO');\r\n\r\n", "sl=\"\";\r\nfor i in range(3):\r\n sl+=input();\r\nprint(['NO','YES'][sl==sl[::-1]]);\r\n", "def is_symmetric_password(matrix):\r\n \r\n \r\n\r\n \r\n symmetric = (matrix[0][0] == matrix[2][2]) and \\\r\n (matrix[0][2] == matrix[2][0]) and \\\r\n (matrix[2][1] == matrix[0][1]) and \\\r\n (matrix[1][0] == matrix[1][2])\r\n\r\n return \"YES\" if symmetric else \"NO\"\r\n\r\n\r\nmatrix = []\r\nfor _ in range(3):\r\n row = input().strip()\r\n matrix.append(row)\r\n\r\nresult = is_symmetric_password(matrix)\r\nprint(result)", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nA = a+b+c\r\nif A == A[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nm=list(a)+list(b)+list(c)\r\nif m==m[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# https://codeforces.com/problemset/problem/12/A\r\n\r\none = input()\r\ntwo = input()\r\nthree = input()\r\n\r\nif one != three[::-1]:\r\n print(\"NO\")\r\nelse:\r\n if two != two[::-1]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "str1 = input()\r\nstr2 = input()\r\nstr3 = input()\r\n\r\nif str1[0] == str3[2] and str1[2] == str3[0] and str1[1] == str3[1] and str2[0] == str2[2]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "line = \"\"\r\nfor _ in range(3):\r\n line += input()\r\n\r\nprint(\"YES\" if line == line[::-1] else \"NO\")\r\n", "N = []\r\nfor _ in range(3):\r\n n = list(input())\r\n N.append(n)\r\nif N[0][0] == N[2][2] and N[0][1] == N[2][1] and N[0][2] == N[2][0] and N[1][0] == N[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f(a):\r\n for i in range(3):\r\n for j in range(3):\r\n if(a[i][j] != a[2-i][2-j]):\r\n return \"NO\"\r\n return \"YES\"\r\na = []\r\nfor i in range(3):\r\n a.append(input())\r\nprint(f(a))\r\n", "a = input()\nb = input()\nc = input()\n\ns = a+b+c\n\nif s == s[::-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\t \t\t\t", "x= input()\r\ny= input()\r\nz= input()\r\n\r\nif x[0]==z[2] and y[0]==y[2] and z[0]==x[2] and z[1]==x[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "grid = []\r\nfor i in range(3):\r\n s = input()\r\n rows = list(s)\r\n grid.append(rows)\r\n\r\nans = 'YES'\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j] == 'X':\r\n if i == 0 and j == 0:\r\n if grid[i+2][j+2] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 0 and j == 1:\r\n if grid[i+2][j] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 0 and j == 2:\r\n if grid[i+2][j-2] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 1 and j == 0:\r\n if grid[i][j+2] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 1 and j == 2:\r\n if grid[i][j-2] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 2 and j == 0:\r\n if grid[i-2][j+2] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 2 and j == 1:\r\n if grid[i-2][j] != 'X':\r\n ans = 'NO'\r\n break\r\n elif i == 2 and j == 2:\r\n if grid[i-2][j-2] != 'X':\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n", "matrix = []\r\nfor i in range(3):\r\n matrix.append(input())\r\n\r\n\r\ndef judge():\r\n for i in range(3):\r\n for j in range(3):\r\n x = 2 - i\r\n y = 2 - j\r\n if matrix[i][j] != matrix[x][y]:\r\n return False\r\n return True\r\n\r\nif judge():\r\n print('YES')\r\nelse:\r\n print('NO')", "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\nZ=3\r\na1,a2=[],[]\r\nfor _ in range(Z):\r\n ss=input()\r\n a1.append(ss);a2.insert(0,ss[::-1])\r\nif a1==a2:print('yes')\r\nelse:print('no') \r\n ", "def check(arr, i):\r\n arr.reverse()\r\n\r\n if arr[i] == \"X\":\r\n arr.reverse()\r\n return True\r\n\r\n arr.reverse()\r\n return False\r\n\r\n\r\ncode = []\r\n\r\nfor i in range(3):\r\n n = list(str(input()))\r\n n = list(n)\r\n for i in n:\r\n code.append(i)\r\n\r\nfor i in range(9):\r\n if code[i] == \"X\":\r\n if not check(code, i):\r\n print(\"NO\")\r\n raise SystemExit\r\n\r\nprint(\"YES\")\r\n", "s = \"\"\r\nfor _ in range(3):\r\n s += input()\r\nprint('YES') if s==s[::-1] else print('NO')", "I = []\r\nfor i in range(3):\r\n s = list(input())\r\n I.append(s)\r\n\r\ncoordinates = []\r\nfor i in range(3):\r\n for j in range(3):\r\n if I[i][j] == \"X\":\r\n x = j\r\n y = i\r\n coordinates.append((x, y))\r\n\r\nrun = True\r\nfor i in coordinates:\r\n x = i[0]\r\n y = i[1]\r\n\r\n x_ = 2 - x\r\n y_ = 2 - y\r\n\r\n if (x_, y_) not in coordinates:\r\n run = False\r\n\r\nif run:\r\n print(\"YES\")\r\nif not run:\r\n print(\"NO\")", "arr = []\nfor _ in range(3):\n line = list(input().strip())\n arr.append(line)\nresult = True\nfor i in range(3):\n for j in range(3-i):\n centri, centrj = 1, 1\n reli = i-centri\n relj = j-centrj\n opi = centri - reli\n opj = centrj - relj\n if arr[i][j] != arr[opi][opj]:\n result = False\n break\n if not result:\n break\n\nif result:\n print(\"YES\")\nelse:\n print(\"NO\")\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\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nimport math as mt\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nmod = 10**9 + 7 \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\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nx=ss();y=ss();z=ss()\r\nprint(\"YES\" if x[0]==z[2] and x[1]==z[1] and x[2]==z[0] and y[0]==y[2] else \"NO\")\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "a = list(input() for _ in range(3))\nfor i in range(2):\n if a[i][::-1] != a[2 - i]:\n print('NO')\n break\nelse:\n print('YES')\n", "a = [str(i) for i in input()]\r\nb = [str(i) for i in input()]\r\nc = [str(i) for i in input()]\r\n\r\nprint(\"YES\" if a == c[::-1] and b[0] == b[-1] else \"NO\")", "a, res = [input() for x in range(3)], \"YES\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if i == 1 and j == 1: continue\r\n if a[i][j] != a[2 - i][2 - j]: res = \"NO\"\r\nprint(res)", "rowa=input()\r\nrowb=input()\r\nrowc=input()\r\ncola,colb,colc=rowa[0]+rowb[0]+rowc[0],rowa[1]+rowb[1]+rowc[1],rowa[2]+rowb[2]+rowc[2]\r\nif (rowa==rowc or rowa==rowc[::-1]) and (cola==colc or cola==colc[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "y=\"\"\r\nfor i in range(3):\r\n y=y+input()\r\nif(y==y[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ns += input()\r\ns += input()\r\nfor i in range(4):\r\n if s[i] != s[8 - i]:\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n", "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(a):\r\n d1 = {0:2,1:1,2:0}\r\n d2 = {0:2,1:1,2:0}\r\n for i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if a[i][j] == \"X\" and i in d1 and j in d2:\r\n if a[d1[i]][d2[j]] != \"X\":\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\na = []\r\nfor i in range(3):\r\n s = str(input())\r\n a.append(list(s)[:-1])\r\nsolve(a)\r\n", "def code(w1,w2,w3):\r\n if w1==w3[::-1]:\r\n if w2[0]==w2[2]:\r\n return \"YES\"\r\n return \"NO\"\r\nw1=input()\r\nw2=input()\r\nw3=input()\r\nprint(code(w1,w2,w3))", "data = []\nfor i in range(3):\n data.append(list(input()))\n\nverdict = \"YES\"\nfor i in range(3):\n for j in range(3):\n if data[i][j] != data[2 - i][2 - j]:\n verdict = \"NO\"\nprint(verdict)\n", "# LUOGU_RID: 113769891\ns = input() + input() + input()\nss = True\nfor i in range(5):\n if s[i] != s[8 - i]:\n ss = False\n break\nif ss:\n print('YES')\nelse:\n print('NO')", "x=[]\r\nfor i in range(3):\r\n x.append(input())\r\n\r\nif (x[0][0]==x[2][2] and x[0][1]==x[2][1] and x[2][0]==x[0][2] and x[1][0]==x[1][2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=\"\"\r\nfor i in range(3):\r\n a+=input()\r\nif a==a[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport copy\r\nfrom itertools import permutations as pm\r\ninput=sys.stdin.readline\r\nd={}\r\n\r\nt=1\r\nwhile t>0:\r\n t-=1\r\n a=[]\r\n for i in range(3):\r\n p=list(input().rstrip())\r\n a.append(p)\r\n flag=0\r\n for i in range(3):\r\n for j in range(3):\r\n if a[i][j]!=a[2-i][2-j]:\r\n flag=1\r\n break\r\n print(\"YES\" if flag==0 else \"NO\") ", "a = input()\r\nb = input()\r\nc = input()\r\nans = a + b + c\r\nif ans == ans[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "matrix = [input() for _ in range(3)]\r\nsymmetric = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] != matrix[2-i][2-j]:\r\n symmetric = False\r\n break\r\nif symmetric:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()+input()+input()\r\nfor i in range(0,9):\r\n if string[i]!=string[-(i+1)]:\r\n ans = 'NO'\r\n break\r\n else:\r\n ans = 'YES'\r\nprint(ans)", "abcc = input()\r\nbcac = input() \r\ncabc = input()\r\nif abcc[0] == cabc[2] and abcc[1] == cabc[1] and bcac[0] == bcac[2] and abcc[2] == cabc[0]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "x,y,z=[x for x in input()]\r\na,b,c=[x for x in input()]\r\nA,B,C=[x for x in input()]\r\nif x==C and y==B and z==A and a==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = list(input())\r\ny = list(input())\r\nz = list(input())\r\n\r\nx.reverse()\r\n\r\nif x == z and y[0] == y[2]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "str=[\"\"]*3\r\nfor i in range(0,3):\r\n str[i]=input()\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n if str[i][j] != str[2-i][2-j] :\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "a1 = input()\r\na2 = input()\r\na3 = input()\r\nb1 = a1[::-1]\r\nb2 = a2[::-1]\r\nb3 = a3[::-1]\r\nif a1 == b3 and a2 == b2 and a3 == b1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ne = input()\r\nf = input()\r\nfinal = str(s + e + f)\r\nf = 0\r\nl = len(final)-1\r\n\r\nfor i in range(len(final)):\r\n\r\n if final[i] != final[l-i]:\r\n f = 1\r\nif f == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "a=input()\r\ns=input()\r\nd=input()\r\nif a==d[::-1] and s[0]==s[-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "code = [list(input()) for _ in range(3)]\nprint('YES' if (code[0], code[1][0]) == (code[2][::-1], code[1][2]) else 'NO')\n", "a = []\r\nc=0\r\nfor x in range (1,4):\r\n b=input(\"\")\r\n for y in b:\r\n a.append(y) \r\nfor i in range (0,9):\r\n if a[i] == a[8-i]:\r\n c += 1\r\nif c == 9:\r\n print('YES')\r\nelse:\r\n print('NO')", "l1 = input()\nl2 = input()\nl3 = input()\n\nif l1[0] == l3[2] and l1[1] == l3[1] and l1[2] == l3[0] and l2[0] == l2[2]:\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", "x=input()\r\ny=input()\r\nz=input()\r\nif x[0]==z[2] and x[1]==z[1] and x[2]==z[0] and y[0]==y[2]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "# https://codeforces.com/problemset/problem/12/A\r\n\r\ncode_list = []\r\nfor i in range(3):\r\n code_list += list(input().strip())\r\n# print(code_list)\r\nif (code_list == code_list[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "terminal = []\n\nfor i in range(3):\n terminal += list(input())\n\nterminal_rev = list(reversed(terminal))\n\nprint('YES' if terminal == terminal_rev else 'NO')\n", "li1 = list(input().split())[0]\r\nli2 = list(input().split())[0]\r\nli3 = list(input().split())[0]\r\n\r\nif li1[0] == li3[2] and li1[1] == li3[1] and li1[2] == li3[0] and li2[0] == li2[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# for z in range(int(input())):\r\n# excel_input = list(input().split())\r\n# excel_input = excel_input[0]\r\n# if excel_input[0] == 'R' and excel_input[1].isdigit():\r\n# # R__C__\r\n# idx = 1\r\n# while excel_input[idx].isdigit():\r\n# idx += 1\r\n# row_num = idx\r\n# col_num = int(excel_input[idx+1:])\r\n# col_num = 731\r\n# # while col_num >= 26:\r\n# # print(col_num//26)\r\n# # print(col_num%26)\r\n# # col_num = col_num - 26*col_num//26\r\n# print(col_num%26)\r\n# print(excel_input[1:row_num])\r\n# else:\r\n# # Alphabets Digits\r\n# idx = 0\r\n# column_num = 0\r\n# while excel_input[idx].isalpha():\r\n# column_num = ord(excel_input[idx])-64 + column_num\r\n# column_num *= 26\r\n# idx += 1\r\n# print('R' + excel_input[idx:] + 'C' + str(int(column_num/26)))\r\n", "s=\"\"\r\nfor i in range(3):\r\n s+=input()\r\nprint(\"YES\" if s==s[::-1] else \"NO\")", "import sys\r\na=input()+input()+input()\r\nfor i in range(1,5):\r\n if a[i-1]!=a[-i]:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nm=[a,b,c]\r\nk=True\r\nfor i in range(3):\r\n for j in range(2):\r\n if not m[i][j]==m[2-i][2-j]:\r\n k=False\r\nif k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nsim1 = False\r\nsim2 = False\r\nif s1 == s3[::-1]:\r\n sim1 = True\r\narr1 = [s1[0],s2[0],s3[0]]\r\narr2 = [s1[2],s2[2],s3[2]]\r\nif arr1 == arr2[::-1]:\r\n sim2 = True\r\nif sim1 and sim2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "x1 = input()\r\nx2 = input()\r\nx3 = input()\r\narr = [x1, x2, x3]\r\nif arr[0][0] == arr[2][2] and arr[0][1] == arr[2][1] and arr[0][2] == arr[2][0] and arr[1][0] == arr[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()+input()+input()\nfor i in range(5):\n if s[i]!=s[8-i]:\n print('NO')\n exit()\nprint('YES')", "a1=input()\r\na2=input()\r\na3=input()\r\na=[a1,a2,a3]\r\n#for i in range(3):\r\n# print(a[i])\r\n#print(a[2][::-1],a[0]==a[2][::-1])\r\nif a[0]==a[2][::-1] and a[1][0]==a[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n#for i in range(3):\r\n# print(a[i])\r\n\r\n#a[1][0]==a[1][2]\r\n", "a, b, c = input(), input(), input()\r\nprint('YNEOS'[b[0] != b[2] or a != c[:: -1] :: 2])", "def main():\r\n f1 = []\r\n f2 = []\r\n f3 = [] \r\n \r\n for i in input(): f1.append(i)\r\n for i in input(): f2.append(i)\r\n for i in input(): f3.append(i)\r\n \r\n c1 = [f1[0], f2[0], f3[0]]\r\n c3 = [f1[2], f2[2], f3[2]]\r\n \r\n f3.reverse()\r\n c3.reverse()\r\n \r\n if f1 == f3 and c1 == c3: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "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\ndef ans(lst):\r\n\tdici = {0 : 2, 1 : 1, 2 : 0}\r\n\tdicj = {0 : 2, 1 : 1, 2 : 0}\r\n\tflag = 1\r\n\tfor i in range(len(lst)):\r\n\t\tif flag:\r\n\t\t\tfor j in range(len(lst)):\r\n\t\t\t\tif lst[i][j] == 'X' and i in dici and j in dicj:\r\n\t\t\t\t\tif lst[dici[i]][dicj[j]] == 'X':\r\n\t\t\t\t\t\tpass\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tflag = 0\r\n\t\t\t\t\t\tprint('NO')\r\n\t\t\t\t\t\tbreak\r\n\tif flag:\r\n\t\tprint('YES')\r\n\r\n\r\n\r\n\r\nlst = []\r\n#for _ in range(int(input())):\r\nfor i in range(3):\r\n\ts = str(input())\r\n\tlst.append(s)\r\nans(lst)\r\n", "line_0 = input()\r\nline_1 = input()\r\nline_2 = input()\r\n\r\nflag = 1\r\nfor i in range(3):\r\n if line_0[i] != line_2[3-i-1]:\r\n flag = 0\r\nif flag == 1:\r\n for i in range(3):\r\n if line_1[i] != line_1[3-i-1]:\r\n flag = 0\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 116375472\na=input()\nb=input()\nc=input()\nif a[::-1]==c and b[::-1]==b:\n print(\"YES\")\nelse:\n print(\"NO\")", "m = [input() for _ in range(3)]\r\nif m[0][0] == m[2][2] and m[0][1] == m[2][1] and m[0][2] == m[2][0] and m[1][0] == m[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "st = input()+input()+input()\r\n \r\nif(st==st[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "li = []\nfor i in range(3):\n li += list(input())\nfor i in range(5):\n if li[i] != li[8-i]:\n print('NO')\n break\nelse:\n print('YES')", "list1 = input()\r\nlist2 = input()\r\nlist3 = input()\r\n\r\nif list1[0] == list3[2] and list1[1] == list3[1] and list1[2] == list3[0] and list2[0] == list2[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[]\r\nc=[]\r\nfor _ in range(3):\r\n a=input()\r\n l.append(a)\r\nfor i in range(2):\r\n for j in range(3):\r\n if (l[i][j]==l[2-i][2-j]):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\nif all(i==1 for i in c):\r\n print('YES')\r\nelse:\r\n print('NO') ", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\nif line2[0]==line2[2] and (line1[1]==line3[1] and line1[0]==line3[2]) and (line1[2]==line3[0]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=input(),input(),input()\r\nprint([\"NO\",\"YES\"][a[0]==c[2] and a[1]==c[1] and a[2]==c[0] and b[0]==b[2]])", "a, b, c = input()\nd, e, f = input()\ng, h, i = input()\n\nl = [a, b, c, d, e, f, g, h, i]\nsymmetry = {\n 0 : 8,\n 1 : 7,\n 2 : 6,\n 3 : 5,\n 4 : 4,\n 5 : 3,\n 6 : 2,\n 7 : 1,\n 8 : 0\n}\n\n\nfor i, item in enumerate(l):\n if item == 'X':\n if l[symmetry[i]] != 'X':\n print(\"NO\")\n break\nelse:\n print(\"YES\")", "a = input()\r\nb = input()\r\nc = input()\r\nd = a + b + c\r\n\r\nif a[0] == c[2] and a[1] == c[1] and b[0] == b[2] and a[2] == c[0]:\r\n print('YES')\r\nelse:\r\n print('NO')", "st=[]\r\nfor i in range(3):\r\n st1=input()\r\n st.append(st1)\r\n\r\nif(st[0][0]==st[2][2] and st[0][1]==st[2][1] and st[0][2]==st[2][0] and st[1][0]==st[1][2]):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "a, b, c = input(), input(), input()\r\nprint([\"NO\",\"YES\"][b[0] == b[2] and a == c[::-1]])", "password = []\nfor _ in range(3):\n password.append(list(input()))\n\nif (\n password[0][0] == password[2][2]\n and password[0][1] == password[2][1]\n and password[0][2] == password[2][0]\n and password[1][0] == password[1][2]\n):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = 3\r\na = []\r\n\r\nfor _ in range(n):\r\n a.append(list(input()))\r\n\r\ngood = True\r\n\r\nbn = n - 1\r\n\r\nh = n >> 1\r\n\r\nfor r in range(h):\r\n for c in range(n):\r\n if a[r][c] != a[bn - r][bn - c]:\r\n good = False\r\n break\r\n if not good:\r\n break\r\n\r\nif good:\r\n for c in range(h + 1):\r\n if a[h][c] != a[h][bn - c]:\r\n good = False\r\n break\r\n\r\nif good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\ns = a + b + c\r\nif s == s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nif (a[0]==c[2] and a[1]==c[1] and a[2]==c[0] and b[0]==b[2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str = \"\"\r\ncnt = 3\r\nwhile(cnt):\r\n s = input()\r\n str+= s\r\n cnt -= 1\r\n \r\nprint(\"YES\") if (str[:4] == str[-1:-5:-1]) else print(\"NO\")\r\n\r\n\r\n", "in1=list(map(str,input().split()))\r\nin2=list(map(str,input().split()))\r\nin3=list(map(str,input().split()))\r\n \r\nif(in1[0][0]==in3[0][2] and in1[0][2]==in3[0][0] and in1[0][1]==in3[0][1] and in2[0][0]==in2[0][2]):\r\n print('YES')\r\nelse:\r\n print('NO')", "l = []\r\nfor i in range(3):\r\n for j in input():\r\n l.append(j)\r\n\r\nfor i in range(4):\r\n if l[i] != l[8-i]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "\r\nfirst = input() #rows\r\nsec = input()\r\nthird = input()\r\n \r\nf = list(first) #creating arrays of symbols needed in rows\r\ns = list(sec)\r\nt = list(third)\r\n \r\nif f[0] == t[2] and f[1] == t[1] and f[2] == t[0] and s[0] == s[2]: #simpl comparing values for the initial scheme\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "matrix = [input() for _ in range(3)]\npassword_is_symmetric = True\nif matrix[0][0] != matrix[2][2]:\n password_is_symmetric = False\nif matrix[0][1] != matrix[2][1]:\n password_is_symmetric = False\nif matrix[0][2] != matrix[2][0]:\n password_is_symmetric = False\nif matrix[1][0] != matrix[1][2]:\n password_is_symmetric = False\nif password_is_symmetric:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t\t\t \t\t\t \t \t \t\t\t", "s=input().strip()+input().strip()+input().strip()\r\nk=0\r\nfor i in range(5):\r\n if s[i]!=s[8-i]:\r\n print('NO')\r\n k=1\r\n break\r\nif k==0:print('YES')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = [input().rstrip() for _ in range(3)]\r\n\r\nans = True\r\nfor i in range(3):\r\n if data[0][i] != data[2][3 - i - 1]:\r\n ans = False\r\n\r\nif data[1][0] != data[1][2]:\r\n ans = False\r\n\r\nprint(\"YES\" if ans else \"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nmatrix = [input() for _ in range(3)]\r\n\r\nprint('YES' if all([matrix[0][i] == matrix[2][2 - i] for i in range(3)]) and matrix[1][0] == matrix[1][2] else 'NO')\r\n", "grid = [list(input()) for _ in range(3)]\r\n\r\n# Check if the grid can be rotated 180 degrees to make it symmetric\r\nis_symmetric = True\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j] != grid[2 - i][2 - j]:\r\n is_symmetric = False\r\n break\r\n\r\nif is_symmetric:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "row_1 = input()\r\nrow_2 = input()\r\nrow_3 = input()\r\n\r\nif row_1[0] != row_3[2] or row_1[1] != row_3[1] or row_1[2] != row_3 [0] or row_2[0] != row_2[2]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "l=[]\r\nfor jk in range(0,3):\r\n line=input()\r\n l.append(line)\r\nchl1=l[2][::-1]\r\nchl2=l[1][::-1]\r\nchl3=l[0][::-1]\r\nif chl1==l[0] and chl2==l[1] and chl3==l[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[[None]*3 for i in range(3)]\nfor i in range(3):\n n=input()\n for j in range(3):\n a[i][j]=n[j]\nz=0\nfor i in range(3):\n for j in range(3):\n if a[i][j]!=a[2-i][2-j]:\n z=1\nif z==0:\n print(\"YES\")\nelse:\n print(\"NO\")", "# LUOGU_RID: 98298006\na=input()\nb=input()\nc=input() \nf=0\nif a[2]+b[2]==c[0]+b[0]:\n if a[1]==c[1]:\n if a[0]+b[0]==c[2]+b[2]:\n f=1 \nif f==1:\n print('YES')\nelse:\n print('NO')", "ListaA = input()\nListaB = input()\nListaC = input()\n \nflag=0\n\nif ListaA[0] == ListaC[2] and ListaA[1] == ListaC[1]:\n flag+=1\n \nif ListaA[2] == ListaC[0] and ListaB[0] == ListaB[2]:\n flag+=1\n\nif flag == 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t \t\t\t\t \t \t \t\t\t \t \t", "s1 = list(input())\r\ns2 = list(input())\r\ns3 = list(input())\r\not = \"NO\"\r\nf1 = [\"1\", \"1\", \"1\"]\r\nf2 = [\"1\", '1', \"1\"]\r\nf3 = [\"1\", \"1\", \"1\"]\r\nfor i in range(3):\r\n f1[i] = s3[2-i]\r\n f2[i] = s2[2-i]\r\n f3[i] = s1[2-i]\r\nif s1 == f1 and s2 == f2 and s2 == f2:\r\n ot = \"YES\" \r\nprint(ot)\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "a=[str(x) for x in input().split()]\nb=[str(x) for x in input().split()]\nc=[str(x) for x in input().split()]\n# if c==c[::-1] and a[::-1]==c:\n# print(\"YES\")\n# else:\n# print(\"NO\")\nl1=[]\nl2=[]\nl3=[]\nfor i in a:\n for _ in i:\n l1.append(_)\nfor i in b:\n for _ in i:\n l2.append(_)\n\nfor i in c:\n for _ in i:\n l3.append(_)\nif l1[::-1]==l3 and l2[::-1]==l2:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "terminal = input() + input() + input()\n\ncan = True\nfor i in range(4):\n if terminal[i] != terminal[8-i]:\n can = False\n break\n\nprint(\"YES\" if can else \"NO\")\n", "# LUOGU_RID: 133558055\ns = ''\r\nfor i in range(3):\r\n s += input()\r\nprint(\"YES\" if s == s[::-1] else \"NO\")\r\n\r\n", "u=input()\r\nm=input()\r\nd=input()\r\nif u[0]==d[2] and u[1]==d[1] and u[2]==d[0] and m[0]==m[2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\r\n\r\n\r\ndef solve():\r\n s = input() + input() + input()\r\n\r\n for i in range(5):\r\n if s[i] != s[8 - i]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n \r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n for i in range(t):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = [input() for _ in '012']\r\nprint('YES' if s[0] == s[2][::-1] and s[1] == s[1][::-1] else 'NO')\r\n", "x=input()+input()+input()\nfor i in range(0,5):\n if x[i]!=x[8-i]:\n print('NO')\n exit()\nprint('YES')", "inp = []\r\nfor i in range(3):\r\n inp.append(input())\r\nif inp[0][0] == inp[2][2] and inp[0][1] == inp[2][1] and inp[0][2] == inp[2][0] and inp[1][0] == inp[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p1 = input()\np2 = input()\np3 = input()\n# https://en.wikipedia.org/wiki/Centrosymmetric_matrix\nans = 'YES' if (p1[0] == p3[2] and p2[0] ==p2[2] and p3[0] == p1[2] and p3[1] == p1[1]) else 'NO'\nprint(ans)\n \t \t \t\t \t \t\t\t\t \t \t", "data = []\n\nfor i in range(3):\n line = input()\n data.append(line)\n\nif data[0][0] != data[2][2] or data[0][1] != data[2][1] or data[0][2] != data[2][0] or data[1][0] != data[1][2]:\n print(\"NO\")\nelse: print(\"YES\")\n \t\t \t\t \t \t \t \t\t\t\t \t\t", "board = []\r\nfor i in range(3):\r\n board.append(input())\r\n\r\nans = \"YES\"\r\nif board[0][0] != board[2][2]:\r\n ans = \"NO\"\r\nif board[0][1] != board[2][1]:\r\n ans = \"NO\"\r\nif board[0][2] != board[2][0]:\r\n ans = \"NO\"\r\nif board[1][2] != board[1][0]:\r\n ans = \"NO\"\r\n\r\nprint(ans)", "I = input\r\n\r\ns = I()+I()+I()\r\n\r\nprint('YES' if s==s[::-1] else 'NO')", "x=input()\r\na=input()\r\nk=input()\r\nx1=x[0:1]\r\nx2=x[1:2]\r\nx3=x[2:3]\r\na1=a[0:1]\r\na2=a[1:2]\r\na3=a[2:3]\r\nk1=k[0:1]\r\nk2=k[1:2]\r\nk3=k[2:3]\r\nrow1=[x1,x2,x3]\r\nrow2=[a1,a2,a3]\r\nrow3=[k1,k2,k3]\r\n\r\nmatrix=[row1,\r\n row2,\r\n row3]\r\nif(matrix[1][0]==matrix[1][2] and matrix[0][2]==matrix[2][0] and matrix[0][1]==matrix[2][1] and matrix[0][0]==matrix[2][2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "flag = True\r\nsymbols = list()\r\nfor i in range(3):\r\n symbols.append(input())\r\nfor i in range(4):\r\n if i == 0:\r\n if symbols[0][0] == ' ' or symbols[2][2] == ' ' or symbols[0][0] != symbols[2][2]:\r\n flag = False\r\n break\r\n elif i == 1:\r\n if symbols[0][1] == ' ' or symbols[2][1] == ' ' or symbols[0][1] != symbols[2][1]:\r\n flag = False\r\n break\r\n elif i == 2:\r\n if symbols[0][2] == ' ' or symbols[2][0] == ' ' or symbols[0][2] != symbols[2][0]:\r\n flag = False\r\n break\r\n else:\r\n if symbols[1][0] == ' ' or symbols[1][2] == ' ' or symbols[1][0] != symbols[1][2]:\r\n flag = False\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "#%%\r\n\r\nrow1=input()\r\nrow2=input()\r\nrow3=input()\r\n\r\nif row1[0]==row3[2] and row1[1]==row3[1] and row1[2]==row3[0] and row2[0]==row2[2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "arr = []\nfor i in range(3):\n lst = list(map(str,input().split()))\n for i in lst:\n for j in i:\n arr.append(j)\nrevarr = arr[::-1]\n# print(arr,revarr)\nif arr==revarr:\n print('YES')\nelse:\n print('NO')\n\t \t \t\t\t \t \t\t \t \t \t \t", "a = [list(input()) for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] == \"X\" and a[2-i][2-j] != \"X\": print(\"NO\"); exit()\r\nprint(\"YES\")", "I = input\r\n\r\ns = I()+I()+I()\r\n\r\nprint('YES' if s[:3]==s[8:5:-1] and s[0::3]==s[8::-3] else 'NO')", "a=input()\r\nb=input()\r\nc=input()\r\nans=\"NO\"\r\nif a[0]==c[2] and a[1]==c[1] and a[2]==c[0] and b[0]==b[2]:\r\n ans=\"YES\"\r\nprint(ans)", "matrix = [list(input()) for _ in range(3)]\r\nfor i,j in [(-1,-1),(0,-1),(-1,0),(-1,1)]:\r\n if matrix[1+i][1+j] != matrix[1-i][1-j]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a=input()+input()+input()\nif a==\"\".join(reversed(a)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "a = input()+input()+input()\nsymmetric = True\nfor i in range(4):\n if a[i]!= a[8-i]:\n symmetric = False\n break\nprint(\"YES\" if symmetric else \"NO\")\n", "line1 = input()\r\nline2 = input()\r\nline3 = input()\r\n\r\n# 判断对称 \r\nif line1[0] == line3[2] and line1[1] == line3[1] and line1[2] == line3[0] and line2[0] == line2[2]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "a=[]\r\nb=[3,3]\r\nfor k in range (int(b[0])):\r\n a.append([0]*int(b[1]))\r\nfor f in range (int(b[0])):\r\n x=input()\r\n y=0\r\n for e in range (int(b[1])):\r\n a[f][e]=x[y]\r\n y=y+1\r\n\r\nif a[0][0]==a[2][2] and a[0][1]==a[2][1] and a[0][2]==a[2][0] and a[1][0]==a[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[]\r\nfor i in range(3):\r\n a.append(input())\r\nc=0\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]!=a[3-1-i][3-1-j]:\r\n c=1\r\nprint('YES' if c==0 else 'NO')", "a = []\r\nfor i in range(3):\r\n s = input()\r\n a.append([s[0],s[1],s[2]])\r\n\r\n\r\n\r\n\r\nif a[0][0] == a[2][2] and a[0][1] == a[2][1] and a[0][2]==a[2][0] and a[1][0] == a[1][2]:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n", "# Danny Garcia\r\n# 7/18/2020\r\n\r\nMAT_SIZE = 3\r\nlock = [input() for row in range(MAT_SIZE)]\r\nsymetric = \"YES\"\r\n\r\nfor row in range(MAT_SIZE):\r\n for column in range(MAT_SIZE):\r\n if lock[row][column] != lock[MAT_SIZE - row - 1][MAT_SIZE - column - 1]:\r\n symetric = \"NO\"\r\n break\r\n\r\nprint(symetric)", "s=\"\"\r\nfor i in range(3):\r\n n=input()\r\n s=s+n\r\nif s==s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "p = ''\r\nfor _ in range(3):\r\n p = p + input()\r\n\r\nflag = True\r\nfor i in range(4):\r\n if not p[i] == p[8-i]:\r\n flag = False\r\n break\r\n\r\nprint('YES' if flag else 'NO')\r\n", "a = [input() for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] == \"X\" != a[-1 - i][-1 - j]:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "matrix = [input() for _ in range(3)]\r\npassword_is_symmetric = True\r\nif matrix[0][0] != matrix[2][2]:\r\n password_is_symmetric = False\r\nif matrix[0][1] != matrix[2][1]:\r\n password_is_symmetric = False\r\nif matrix[0][2] != matrix[2][0]:\r\n password_is_symmetric = False\r\nif matrix[1][0] != matrix[1][2]:\r\n password_is_symmetric = False\r\nif password_is_symmetric:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "matrica = []\r\nfor i in range(3):\r\n st = input()\r\n mass = list(st)\r\n matrica.append(mass)\r\nflag = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrica[i][j]!=matrica[2-i][2-j]:\r\n flag = False\r\n break\r\nif flag:\r\n print('YES')\r\nelse: print('NO')", "s = input() + input() + input()\r\nprint(\"YES\" if s == s[::-1] else \"NO\")", "l=[]\ng=[]\nfor i in range(3):\n l.append(input())\nfor i in range(3):\n s=''\n for j in range(2,-1,-1):\n s=s+l[i][j]\n g.append(s)\ng.reverse() \nif \"\".join(l)==\"\".join(g):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "sym1, sym2, sym3 = input(), input(), input()\r\nif (sym1 == sym3 or sym1 == sym3[::-1]) and sym2[0] == sym2[2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = input()\r\nans = 'no'\r\nwhile a[0] == c[2] and a[1] == c[1] and a[2] == c[0] and b[0] == b[2]:\r\n ans = 'yes'\r\n break\r\nprint(ans)", "# LUOGU_RID: 98251501\nl1 = input()\r\nl2 = input()\r\nl3 = input()\r\nif l1[0] == l3[2] and l1[1] == l3[1] and l1[2] == l3[0] and l2[0] == l2[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nq = a + b + c\r\nif q == q[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO') ", "n = 3\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\nif b[0] == b[2][::-1] and b[1][0] == b[1][2]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b,c=[i for i in input()]\r\nd,e,f=[i for i in input()]\r\ng,h,i=[i for i in input()]\r\nif a==i and c==g and d==f and b==h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def cs(s):\r\n\t\"\"\"check symmetry\"\"\"\r\n\tfor c in range(4):\r\n\t\tif s[c]!=s[8-c]:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\t\t\r\ns=''\r\nfor c in range(3):\r\n\ts+=input()\r\nr='YES' if cs(s) else 'NO'\r\nprint(r)", "str1=input(); str2=input(); str3=input()\r\nif str1[0]==str3[2] and str1[1]==str3[1] and str1[2]==str3[0] and str2[0]==str2[2]: print(\"YES\")\r\nelse: print(\"NO\")", "# Hydro submission #64698a328710066d92cd440d@1684638259361\nl,no = [],False\nfor i in range(3):\n l.append(list(input()))\nfor i in range(3):\n for j in range(3):\n if l[i][j] != l[2-i][2-j]:\n no = True\nif no:\n print('NO')\nelse:\n print('YES')", "a=list(input())\r\nb=input()\r\nc=list(input())\r\ne=list(b)\r\nb=list(b)\r\na.reverse()\r\ne.reverse()\r\nif c==a and e==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "L=list(input())\r\nL1=list(input())\r\nL2=list(input())\r\nif (L[0]==L2[2])and (L[1]==L2[1])and(L[2]==L2[0])and(L1[0]==L1[2]):\r\n print('YES')\r\nelse: print('NO')\r\n", "# https://codeforces.com/problemset/problem/12/A\r\n\r\ndef func_sol(raw_data):\r\n a = raw_data.split('\\n')[:-1]\r\n n = len(a)\r\n for i in range(n):\r\n for j in range(i + 1):\r\n if a[i][j] != a[n - i - 1][n - j - 1]:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "n = []\r\n[n.append(input()) for i in range(3)]\r\nflag = True\r\nif 'X' in n[0]:\r\n if n[0] != n[2][::-1]:\r\n flag = False\r\nif 'X' in n[1]:\r\n if n[1] != n[1][::-1]:\r\n flag = False\r\nif 'X' in n[2]:\r\n if n[2] != n[0][::-1]:\r\n flag = False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "M,a=[list(input()) for _ in range(3)],True\nfor i in range(3):\n for j in range(3):\n if M[i][j] != M[2-i][2-j]:\n a=False\n break\nprint(\"YES\") if a else print(\"NO\")\n", "'''Problem 12A - Super Agent'''\r\ns = input()+input()+input()\r\n# s = sirul care trebuie sal verificam daca e simetric\r\n# s are 9 caractere (0 la 8)\r\n# aplicam conditiile de simetrie\r\nif s[:3]==s[8:5:-1] and s[0::3]==s[8::-3] :\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nlst=[]\r\nfor i in range(3):\r\n if s1[i]=='X':\r\n lst.append(i+1)\r\n if s2[i]=='X':\r\n lst.append(i+4)\r\n if s3[i]=='X':\r\n lst.append(i+7)\r\nlst.sort()\r\nif (len(lst)-lst.count(5))%2!=0:\r\n print('NO')\r\nelse:\r\n check=1\r\n for i in range(len(lst)//2):\r\n if lst[i]+lst[-1-i]!=10:\r\n check=0 \r\n break\r\n if check==1:\r\n print('YES') \r\n else:\r\n print('NO')", "Primary = [input()] + [input()] + [input()]\r\nRotated = [Primary[2][::-1]] + [Primary[1][::-1]] + [Primary[0][::-1]]\r\nprint(\"YES\" if Primary == Rotated else \"NO\")\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: 645\r\n", "a1 = list(input())\r\nb1, b2, b3 = [i for i in input()]\r\nc1 = list(input())\r\nc1.reverse()\r\nif a1 == c1 and b1 == b3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "sx = []\r\nfor i in range(3):\r\n s = input()\r\n sx.append(s)\r\nif sx[0][0] == sx[2][2] and sx[0][1] == sx[2][1] and sx[0][2] == sx[2][0] and sx[1][0] == sx[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n\tmatrix = []\r\n\tfor i in range(3):\r\n\t\tmatrix.append(input())\r\n\tif isSymmetric(matrix):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\ndef isSymmetric(matrix):\r\n\treturn matrix[0][0] == matrix[2][2] and \\\r\n\tmatrix[0][1] == matrix[2][1] and \\\r\n\tmatrix[0][2] == matrix[2][0] and \\\r\n\tmatrix[1][0] == matrix[1][2]\r\n\r\n#print(isSymmetric([\"XX.\", \"...\", \".XX\"]))\r\n#print(isSymmetric([\"X.X\", \"X..\", \"...\"]))\r\n\r\nmain()", "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\nmat1, mat2 = [['.'] * 3 for _ in range(3)], [['.'] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n row = input().rstrip()\r\n for j in range(3):\r\n mat1[i][j] = mat2[2 - i][2 - j] = row[j]\r\n\r\nif all(mat1[i] == mat2[i] for i in range(3)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "key = []\r\nfor i in range(3):\r\n key.append(input())\r\nif key[0][0] == key[2][2] and key[0][1] == key[2][1] and key[0][2] == key[2][0] and key[1][0] == key[1][2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "map = input() + input() + input()\r\ns1 = 0\r\nfor c1 in range(0,round(len(map)/2-.1)):\r\n if not(map[c1] == map[8-c1]):\r\n s1 = 1\r\nif s1 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pass1 = input() ; pass2 = input() ; pass3 = input()\nallp = pass1 + pass2 + pass3\nif allp == allp[::-1]:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "lst=[]\r\nfor i in range(3):\r\n a=input()\r\n lst.append(a)\r\nif (lst[0][0]==lst[2][2] and lst[0][2]==lst[2][0] and lst[0][1]==lst[2][1] and lst[1][0]==lst[1][2]):\r\n print('YES')\r\nelse:\r\n print('NO')", "arr=[]\r\nfor i in range(3):\r\n arr.append(list(input()))\r\nif(arr[0][0]==arr[2][2] and arr[1][0]==arr[1][2] and arr[0][1]==arr[2][1] and arr[2][0]==arr[0][2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-01 23:45:35\nLastEditTime: 2021-11-05 23:25:05\nDescription: \nFilePath: CF12A.py\n'''\n\n\ndef func():\n matrix = []\n for _ in range(3):\n matrix.extend(list(input().strip()))\n\n for i in range(len(matrix) // 2):\n if matrix[i] != matrix[8 - i]:\n return \"NO\"\n return \"YES\"\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "line1 = input()\nline2 = input()\nline3 = input()\n\nif line1 == line3[::-1] and line2 == line2[::-1]:\n\tprint (\"YES\")\nelse:\n\tprint (\"NO\")", "# The same file will be used throughout Problem Set by saving after writing different codes\r\n#Ques URL - https://codeforces.com/contest/25/problem/B\r\n'''def printkey(A, i, j):\r\n try:\r\n print(f\"{i}, {j}, {A[i][j]}\");\r\n except:\r\n print(\"error\");'''\r\nkeys = [];\r\nfor _ in range(3):\r\n keys.append(list(input()));\r\nsymetry = True;\r\n'''for x in range(3):\r\n for y in range(3):\r\n printkey(keys, x, y);'''\r\nfor x in range(3):\r\n if keys[0][x] != keys[2][2 - x]:\r\n symetry = False;\r\n break;\r\nif keys[1][0] != keys[1][2]:\r\n symetry = False;\r\nif symetry == True:\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\");\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na = [[i for i in input()[:-1]] for _ in range(3)]\r\nans = \"YES\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] == \"X\":\r\n if a[3 - i - 1][3 - j - 1] != 'X':\r\n ans = \"NO\"\r\nprint(ans)\r\n", "s = ''.join([input() for _ in range(3)]); print ('YES' if (s[:4] == s[5::][::-1]) else 'NO')", "l=\"\";\r\nfor i in range(3):\r\n l+=input();\r\nprint(['NO','YES'][l==l[::-1]]);", "a=input()\r\nb=input()\r\nc=input()\r\nd=a[0]\r\nw=c[2]\r\nv=b[0]\r\ns=b[2]\r\nh=a[2]\r\ng=c[0]\r\nr=a[1]\r\nt=c[1]\r\nif w==d and v==s and h==g and r==t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a1=''\r\nfor i in range(3):\r\n\ta1+=input()\r\nprint(['NO','YES'][a1==a1[::-1]])", "a=[[None]*3 for i in range(3)]\r\nfor i in range(3):\r\n n=input()\r\n for j in range(3):\r\n a[i][j]=n[j]\r\nz=0\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]!=a[2-i][2-j]:\r\n z=1\r\nif z==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nif s1[0] == s3[2]:\r\n if s1[1] == s3[1]:\r\n if s1[2] == s3[0]:\r\n if s2[0] == s2[2]:\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\")\r\n", "a=input()\r\nb=input()\r\nc=input()\r\ndef isSymetr():\r\n\tfor i in range(0,3):\r\n\t\tif(a[i]!=c[2-i]):\r\n\t\t\treturn False\r\n\t\t\r\n\treturn True\r\n\t\r\nif(b[0]==b[2]):\r\n\tif isSymetr():\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse :\r\n\tprint(\"NO\")\r\n", "ans = ''\r\nfor i in range(3):\r\n s = input()\r\n ans += s\r\nif ans[0:4] == ans[5:9][::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=''.join([*open(0)]).replace('\\n','')\r\nprint('YNEOS'[a!=a[::-1]::2])", "a = []\nfor i in range(3):\n\ta.append(input())\nfor i in range(3):\n\tfor j in range(3):\n\t\tif a[i][j] != a[2 - i][2 - j]:\n\t\t\tprint('NO')\n\t\t\texit()\nprint('YES')\n", "a= input()+input()+input()\r\nprint('YES' if a==a[::-1] else 'NO')", "\r\ne = str(input()) + str(input()) + str(input())\r\nrpta = 'YES'\r\nfor i in range(4):\r\n if e[i] != e[8-i]:\r\n rpta = 'NO'\r\n break;\r\nprint(rpta)", "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 s(f):\r\n for i in range(3):\r\n for j in range(3):\r\n if f[i][j] == \"X\":\r\n if f[2 - i][2 - j] != \"X\":\r\n return False\r\n return True\r\n\r\n f = [str(input()) for i in range(3)]\r\n\r\n if s(f):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\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", "a=input()\r\nb=input()\r\nc=input()\r\nif b[0]==b[2] and a[::-1]==c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "I = input\r\ns = I()+I()+I()\r\nprint('YES' if s==s[::-1] else 'NO')", "L=[]\r\nfor i in range(0,3):\r\n L.append(list(input()))\r\nflag=0\r\nfor i in range(0,3):\r\n for j in range(0,3-i):\r\n if L[i][j]!=L[2-i][2-j]:\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s = input() + input() + input()\r\nfor i in range(5):\r\n if s[i] != s[8 - i]:\r\n print('NO')\r\n exit()\r\nprint('YES')", "t = \"\".join([input() for i in range(3)])\r\nprint(\"YES\" if t == t[::-1] else \"NO\")\r\n", "import sys\n\npassward = list(sys.stdin.read().strip().split())\npairs=[(0,0,2,2),(0,1,2,1),(0,2,2,0),(1,0,1,2)]\nif all(passward[i1][j1] == passward[i2][j2] for i1,j1,i2,j2 in pairs):\n print('YES')\nelse:\n print('NO')", "a = [input() for i in range(3)]\nsym = True\nfor i in range(3):\n for j in range(3):\n if a[i][j] != a[2 - i][2 - j]:\n sym = False\nif sym:\n print(\"YES\")\nelse:\n print(\"NO\")", "x = [0,0,0]\r\ny = 0\r\nfor a in range(3):\r\n\tx[a] = input()\r\nif x[0][0]==x[2][2]:\r\n\tif x[0][1]==x[2][1]:\r\n\t\tif x[0][2]==x[2][0]:\r\n\t\t\tif x[1][0]==x[1][2]:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\ty=1\r\nif y==0:\r\n\tprint(\"NO\")", "s=input()+input()+input()\r\nbl=True\r\nfor it in range(5):\r\n bl=bl and (s[it]==s[8-it])\r\nif bl:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "arr = [input(), input(), input()]\nif arr[0] == arr[2][::-1] and arr[1] == arr[1][::-1]:\n print('YES')\nelse:\n print('NO')\n\n\n", "a = input()\r\nb = input()\r\nc = input()\r\nsym = \"NO\"\r\nif b[0] == b[2] and a[1] == c[1] and a[0] == c[2] and a[2] == c[0] :\r\n sym = 'YES'\r\nprint(sym)", "a = input();b = input();c = input()\r\nd = [];d = [a,b,c];e = []\r\nfor i in d:\r\n for j in i:\r\n e += [j]\r\ndd = e[::-1]\r\nif dd == e:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from sys import stdin, stdout\r\ns = []\r\nfor i in range(3):\r\n s.append(stdin.readline())\r\n\r\nif s[0][0] == s[2][2] and s[0][1] == s[2][1] and s[0][2] == s[2][0] and s[1][0] == s[1][2]:\r\n stdout.write('YES\\n')\r\nelse:\r\n stdout.write('NO\\n')", "def rotate(board):\r\n ans = [['', '', ''] for _ in range(3)]\r\n ans[0][0] = board[0][2]\r\n ans[0][1] = board[1][2]\r\n ans[0][2] = board[2][2]\r\n ans[1][0] = board[0][1]\r\n ans[1][1] = board[1][1]\r\n ans[1][2] = board[2][1]\r\n ans[2][0] = board[0][0]\r\n ans[2][1] = board[1][0]\r\n ans[2][2] = board[2][0]\r\n return ans\r\nflag = False\r\nboard = [[], [], []]\r\nfor i in range(3):\r\n row = input()\r\n for j in range(3):\r\n board[i].append(row[j])\r\nnew_board = board\r\nfor i in range(3):\r\n new_board = rotate(new_board)\r\n if new_board == board:\r\n flag = True\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "a1 = input()\r\na2 = input()\r\na3 = input()\r\nif a1[0]!=a3[2] or a1[1]!=a3[1] or a1[2]!=a3[0] or a2[0]!=a2[2]:\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "def main():\n b1 = input()\n b2 = input()\n b3 = input()\n if b1[0] == b3[2] and b1[1] == b3[1] and b1[2] == b3[0] and b2[0] == b2[2]:\n print ('YES')\n else:\n print ('NO')\nmain()\n", "s = [input() for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if s[i][j] != s[-i - 1][-j - 1]:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "# LUOGU_RID: 129034933\n'''\nAuthor: KasperFan && [email protected]\nDate: 2023-10-13 00:22:13\nLastEditTime: 2023-10-13 01:02:22\nFilePath: /Python/OJ/LuoGu/速刷(大一)/Super_Agent.py\ndescribes: This file is created for learning Python to deal OJ problems.\nCopyright (c) 2023 by KasperFan in WFU, All Rights Reserved. \n'''\nimport sys\ndef input(): return sys.stdin.readline()\n\n\nmatrix = []\nans: bool = True\ndx: list = [-1, -1, -1, 0]\ndy: list = [-1, 0, 1, -1]\n\nif __name__ == \"__main__\":\n try:\n matrix: list = [[0, 0, 0, 0, 0]] + \\\n [([0] + [i for i in input()]) for n in range(3)]\n # [([0] + [i for i in line]) for line in sys.stdin]\n except ValueError:\n pass\n for i in range(len(dx)):\n ans = matrix[2+dx[i]][2+dy[i]] == matrix[2-dx[i]][2-dy[i]]\n if not ans:\n break\n print(('YES' if ans else \"NO\"))\n", "b=[]\r\nfor i in range(3):\r\n a=str(input())\r\n for j in range(3):\r\n if a[j]==\"X\":\r\n b=b+[1]\r\n else:\r\n b=b+[0]\r\nif b[0]==b[8] and b[1]==b[7] and b[2]==b[6] and b[3]==b[5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "rows = [] \r\na = 0\r\nfor x in range(3):\r\n row = input()\r\n rows.append(row)\r\n \r\nfor y in range(3):\r\n if rows[0][y] != rows[2][2-y]:\r\n a += 1\r\nif rows[1][0] != rows[1][2]:\r\n a += 1\r\n\r\nif a == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=list(input())\r\nb=list(input())\r\nc=list(input())\r\nrev=c[::-1]\r\nif a==rev and b[0]==b[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = \"\"\r\nfor i in range(3):\r\n\ta = input()\r\n\tl += a\r\nfs = l[:4]\r\nls = l[5:]\r\nR = ls[::-1]\r\nif fs == R :\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")", "grid=[]\r\nfor i in range(3):\r\n grid.append(list(input()))\r\nif(grid[0][0]==grid[2][2] and grid[0][1]==grid[2][1] and grid[0][2]==grid[2][0] and grid[1][0]==grid[1][2]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = ''.join([input() for _ in range(3)])\r\nprint('YES') if s == s[::-1] else print('NO')\r\n", "board = []\r\ncount_ = 0\r\nfor i in range(3):\r\n list_ = list(input().strip())\r\n board.append(list_)\r\nif board[1][0] == board[1][2] and board[0][0] == board[2][2] and \\\r\n board[0][1] == board[2][1] and board[0][2] == board[2][0]:\r\n print('YES')\r\nelse:\r\n print('NO')", "str1, str2, str3 = input(), input(), input()\r\nif (str1 == str3 or str1 == str3[::-1]) and str2[0] == str2[2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = []\r\nc = 0\r\nfor x in range(1,4):\r\n b = input()\r\n for y in b:\r\n a.append(y)\r\nfor z in range(0,9):\r\n if a[z] == a[8-z]:\r\n c=c+1 \r\nif c == 9:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = ''\r\n\r\nfor _ in range(3):\r\n s += input()\r\n\r\nflag = True\r\nfor i in range(4):\r\n if s[i] != s[8-i]: \r\n flag = False\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "r=''\r\nfor u in range(3):\r\n r+=input()\r\nif(r==r[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g = [input() for _ in range(3)]\r\npass_word = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if g[i][j] == 'X':\r\n if g[2-i][2-j] != 'X':\r\n pass_word = False\r\n break\r\n if pass_word == False:\r\n break\r\n\r\nif pass_word:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\nstatus = True\r\nfor i in range(3):\r\n if (s1[i] != s3[-(i+1)]):\r\n status = False\r\nif s2[0] != s2[2]:\r\n status = False\r\nif status:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a1=str(input())\r\na2=str(input())\r\na3=str(input())\r\nif a1[0]==a3[2] and a1[1]==a3[1] and a1[2]==a3[0] and a2[0]==a2[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=''\r\nfor i in range(3):\r\n\ta+=input()\r\nprint(['NO','YES'][a==a[::-1]])", "import re\r\nstr = ''\r\nfor i in range(3):\r\n str = str + input()\r\n \r\ncode = list(str)\r\n\r\nreversed_code = code.copy()\r\nreversed_code.reverse()\r\n# print(reversed_code)\r\n\r\nif code == reversed_code:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = [list(input()) for _ in range(3)]\r\n\r\nif s[0][0] != s[2][2]:\r\n print('NO')\r\nelif s[0][1] != s[2][1]:\r\n print('NO')\r\nelif s[0][2] != s[2][0]:\r\n print('NO')\r\nelif s[1][0] != s[1][2]:\r\n print('NO')\r\nelse:\r\n print('YES')", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\ngrid = [input(), input(), input()]\r\n\r\nif grid[0][0] != grid[2][2]:\r\n\tprint('NO')\r\nelif grid[0][1] != grid[2][1]:\r\n\tprint('NO')\r\nelif grid[0][2] != grid[2][0]:\r\n\tprint('NO')\r\nelif grid[1][2] != grid[1][0]:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n", "def solve():\n a, b, c = input(), input(), input()\n\n mat = [list(a), list(b), list(c)]\n rot = [row[::-1] for row in mat[::-1]]\n\n print(\"YES\" if mat == rot else \"NO\")\n\n\nif __name__ == \"__main__\":\n solve()\n", "str1=\"\"\r\nfor i in range(3):\r\n str1+=input()\r\nif str1==str1[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[]\r\nfor i in range(3):\r\n s=input()\r\n l.append(s)\r\nif(l[0]==l[2][::-1] and l[1][0]==l[1][2]):\r\n print('YES')\r\nelse:\r\n print('NO')", "M = []\r\nfor _ in range(3):\r\n M += [ input().strip() ]\r\nans = 'YES'\r\nfor i in range(3):\r\n for j in range(3):\r\n if M[i][j] == 'X' and M[2-i][2-j] != 'X':\r\n ans = 'NO'\r\n break\r\nprint(ans)", "# Read input\r\nmatrix = [list(input()) for _ in range(3)]\r\n\r\n# Check symmetry\r\nif matrix[0][0] == matrix[2][2] and matrix[0][1] == matrix[2][1] and matrix[0][2] == matrix[2][0] and matrix[1][0] == matrix[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def input_matrix(n, f=int):\r\n matrix = []\r\n for i in range(n):\r\n matrix.append(input())\r\n return matrix\r\n\r\n\r\ndef is_sim3_3(a):\r\n if a[0] == a[2][::-1] and a[1][0] == a[1][2]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nis_sim3_3(input_matrix(3))", "code = [input() for i in range(3)]\n\npassword = []\n\nfor i in code :\n for j in i :\n password.append(j)\n\nif password[:4] == password[5:][::-1] :\n print(\"YES\")\nelse :\n print(\"NO\")\n\n\n", "bb = [[i for i in input()] for _ in range(3)]\r\nflag = 0\r\nbb[2] = bb[2][::-1]\r\nfor i in range(3):\r\n if bb[0][i] != bb[2][i]:\r\n flag = 1 \r\n break\r\nif bb[1][0] != bb[1][-1]:\r\n flag = 1\r\nprint([\"YES\", 'NO'][flag])", "from audioop import reverse\r\n\r\n\r\ndef solve():\r\n string = \"\"\r\n for i in range(0,3):\r\n input_str = str(input())\r\n string += input_str\r\n if list(string) == list(reversed(string)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n return\r\n\r\nif __name__=='__main__':\r\n solve()", "s1 = input()\r\ns2 = input()\r\ns3 = input()\r\n\r\nprint(('NO', 'YES')[s1 == s3[::-1] and s2 == s2[::-1]])\r\n", "t = [input().strip() for i in range(3)]\r\nprint(\"YES\" if \"\".join(t) == \"\".join([i[::-1] for i in t[::-1]]) else \"NO\")\r\n", "def ans():\r\n if board[0][0] != board[2][2]: return False\r\n if board[0][1] != board[2][1]: return False \r\n if board[0][2] != board[2][0]: return False\r\n if board[1][0] != board[1][2]: return False\r\n return True\r\n\r\n\r\nboard = []\r\nfor i in range(3):\r\n board.append(input())\r\nprint('YES' if ans() else 'NO')", "matrix = [ input() for _ in range(3)]\n\nis_valid = True\nfor i in range(len(matrix)):\n for j in range(len(matrix[0])):\n is_valid &= matrix[i][j] == matrix[-i-1][-j-1]\n # if you want to optimzie the algorithm, you can break the loop\nanswer = \"YES\" if is_valid else \"NO\"\nprint(answer)", "symbols = [input() for _ in range(3)]\r\n\r\nif symbols[0] == symbols[2][::-1] and symbols[1][0] == symbols[1][2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ns += input()\r\ns += input()\r\nif s[0] != s[8] or s[1] != s[7] or s[2] != s[6] or s[3] != s[5]:\r\n print('NO')\r\nelse:\r\n print('YES')", "keypad = input() + input() + input()\r\nprint('YES' if keypad == keypad[::-1] else 'NO')", "p1=input()\r\np2=input()\r\np3=input()\r\nl1=[]\r\nif p1[0]==p3[-1]:\r\n l1.append(1)\r\nelse :\r\n l1.append(0)\r\n\r\nif p1[1]==p3[1]:\r\n l1.append(1)\r\nelse :\r\n l1.append(0)\r\n\r\nif p1[-1]==p3[0]:\r\n l1.append(1)\r\nelse :\r\n l1.append(0)\r\n\r\nif p2[0]==p2[-1]:\r\n l1.append(1)\r\nelse :\r\n l1.append(0)\r\n\r\nif l1.count(1)==4:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nA=\"\"\r\nfor i in range(3):\r\n A+=input().strip()\r\n\r\nfor i in range(9):\r\n if A[i]!=A[8-i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "code = [[x for x in input()],\r\n [x for x in input()],\r\n [x for x in input()]]\r\nr = [[],[],[]]\r\nfor x in range(2,-1,-1):\r\n for y in range(2,-1,-1):\r\n r[2 - x].append(code[x][y])\r\nif code == r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nc = input()\r\nprint(\"NYOE S\"[a==c[::-1] and b==b[::-1]::2])\r\n", "#12A\r\nmass = []\r\nx = 0\r\ny = 0\r\nxy = 2\r\ntrig = 0\r\nfor _ in range(3):\r\n mass.append(list(input()))\r\nfor x in range(3):\r\n for y in range(3):\r\n if mass[x][y] != mass[xy - x][xy - y]:\r\n trig += 1\r\nif trig >= 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "i = input\r\n\r\ns = i() + i() + i()\r\nprint(\"Yes\" if s==s[::-1] else \"No\")", "a = [input() for i in range(3)]\nprint(\"YES\" if a[0]==a[2][::-1] and ''.join(a[i][0] for i in range(3))==''.join(a[i][2] for i in range(3))[::-1] else \"NO\")", "l = [i for i in input()]\r\nl += [i for i in input()]\r\nl += [i for i in input()]\r\n\r\nresult = 'YES'\r\nfor i in range(4):\r\n if l[i] != l[8-i]:\r\n result = 'NO'\r\n break\r\n\r\nprint(result)", "a=input()\r\nb=input()\r\nc=input()\r\nflag=0\r\nif b[0]!=b[2]:\r\n\tflag=1\r\nif a[1]!=c[1]:\r\n\tflag=1\r\nx=[a[0],b[0],c[0]]\r\ny=[a[2],b[2],c[2]]\r\nif x==y or x==y[::-1]:\r\n\tpass\r\nelse:\r\n\tflag=1\r\nif flag==0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a=input()\r\nb=input()\r\nc=input()\r\nd=[]\r\ne=[]\r\nd.append(a)\r\nd.append(b)\r\nd.append(c)\r\ne.append(c[::-1])\r\ne.append(b[::-1])\r\ne.append(a[::-1])\r\nif d==e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nif(a[0] == c[2] and a[1] == c[1] and a[2] == c [0] and b[0] == b[2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "r=input()\r\nr=r+input()\r\nr=r+input()\r\nif r==r[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 133558250\ns = ''\r\nfor i in range(3):\r\n s += input()\r\nprint(\"YES\" if s == s[::-1] else \"NO\")", "mas = []\r\nfor i in range(3):\r\n mas.append(list(input()))\r\nif mas[0][0] == mas[2][2] and mas[0][1] == mas[2][1] and mas[0][2] == mas[2][0] and mas[1][0] == mas[1][2]:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "\"\"\"\ncodeforces central symmetry 12A\n\"\"\"\n\nx = input()\ny = input()\nz = input()\n\nvrai = True\n\nfor i in range(3):\n if x[i] != z[2 - i]:\n vrai = False\n break\nif y[0] != y[2]:\n vrai = False\nif vrai:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# LUOGU_RID: 112699413\ns=input()+input()+input()\r\nfor i in range(5):\r\n if s[i]!=s[8-i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "matrix = [list(input()) for _ in range(3)]\r\n\r\n# find middle row and middle column\r\nmiddlerow = len(matrix)//2\r\nmiddlecol = len(matrix[0])//2\r\n\r\n# check if password is symmetric to the center\r\nres = \"YES\"\r\nfor row in range(3):\r\n for col in range(3):\r\n if matrix[row][col] == 'X' and matrix[middlerow-row+middlerow][middlecol-col+middlecol] != 'X':\r\n res = \"NO\"\r\n break\r\n \r\n#output\r\nprint(res)", "matrix=[[],[],[],[]]\r\n\r\nfor i in range(1,4):\r\n x=list(input())\r\n x.insert(0,'')\r\n matrix[i]=x\r\n\r\nif(matrix[1][1] == matrix[3][3] and matrix[1][3] == matrix[3][1] and matrix[1][2] == matrix[3][2] and matrix[2][1] == matrix[2][3]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# 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\n\r\ns = \"\"\r\nfor i in range(3):\r\n x = input()\r\n s += x\r\nif s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "password = [input() for i in range(3)]\r\nsym = True\r\n\r\nif password[0] != password[2][::-1]:\r\n sym = False\r\nif password[1][0] != password[1][2]:\r\n sym = False\r\n\r\nif sym:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "# LUOGU_RID: 116627847\na=[list(input()) for b in range(3)]\nif a[0][0]!=a[2][2]:\n print('NO')\nelif a[0][1]!=a[2][1]:\n print('NO')\nelif a[0][2]!=a[2][0]:\n print('NO')\nelif a[1][0]!=a[1][2]:\n print('NO')\nelse:\n print('YES')", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\n\ndef function(*args):\n one = input()\n two = input()\n three = input()\n arr = []\n if two[0] == two[-1] and one == three[::-1]:\n print('YES')\n return\n print('NO')\n\nif __name__ == '__main__':\n\tfunction()\t\n", "s = \"\"\nfor _ in range(0, 3):\n s += input()\nprint([\"NO\", \"YES\"][all([s[i] == s[~i] for i in range(0, 4)])])\n", "m = []\n\nfor i in range(3):\n m.append(input())\n \nif m[0] != m[2][::-1]: print('NO')\nelse: \n if(m[1][0] == m[1][2]):\n print('YES')\n else:\n print('NO')\n ", "# https://codeforces.com/problemset/problem/12/A\r\n\r\nimport sys\r\n\r\ndef solution(lines):\r\n for i in range(3):\r\n for j in range(3):\r\n if lines[i][j] == 'X': \r\n if lines[2-i][2-j] != 'X':\r\n return \"NO\"\r\n return \"YES\"\r\n\r\ninp = [line.strip() for line in sys.stdin]\r\nprint(solution(inp))", "a=[]\r\nfor i in range(3):\r\n a.append(input())\r\nif (a[0][0]!=a[2][2] or a[0][1]!=a[2][1] or a[0][2]!=a[2][0] or a[1][0]!=a[1][2]):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "ar=input()\r\nbr=input()\r\ncr=input()\r\n \r\na = list(ar)\r\nb = list(br)\r\nc = list(cr)\r\n \r\ndef symmetry(a,b,c):\r\n for i in range(3):\r\n if(a[i]!=c[2-i] or b[i]!=b[2-i]):\r\n return 'NO'\r\n return 'YES'\r\n \r\nprint(symmetry(a,b,c))", "a = [input(), input(), input()]\r\nans = \"YES\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] != a[~i][~j]:\r\n ans = \"NO\"\r\n break\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 30 19:32:51 2021\r\n\r\n@author: nehas\r\n\"\"\"\r\nr1=input()\r\nr2=input()\r\nr3=input()\r\nif(r1[0]==r3[2] and r1[1]==r3[1] and r1[2]==r3[0] and r2[0]==r2[2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = []\r\nfor _ in range(3):\r\n s.append(input().strip())\r\n\r\nif (s[0][0] == s[2][2]) and (s[0][1] == s[2][1]) and (s[0][2] == s[2][0]) and (s[1][0] == s[1][2]):\r\n print(\"YES\")\r\nelif (s[0][0] == s[2][2]) and (s[0][1] == s[2][1]) and (s[0][2] == s[2][0]) and (s[1][0] == s[1][2]):\r\n print(\"YES\")\r\nelif (s[0][0] == s[2][0]) and (s[0][1] == s[2][1]) and (s[0][2] == s[2][2]) and (s[1][0] == s[1][2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = list(input())\r\nx.extend(list(input()))\r\nx.extend(list(input()))\r\n\r\n#90\r\nif((x[1] == x[3] == x[5] == x[7]) and (x[0] == x[2] == x[6] == x[8])):\r\n\tprint(\"YES\")\r\n\r\n#180\r\nelif((x[0] == x[8] and x[1] == x[7]) and (x[2] == x[6] and x[3] == x[5])):\r\n\tprint(\"YES\")\r\n\r\n#fail\r\nelse:\r\n\tprint(\"NO\")", "matrix = []\r\n\r\nfor i in range(3):\r\n matrix.append(input())\r\n\r\nif(matrix[0] == matrix[2][::-1] and matrix[0][0] == matrix[2][2] and matrix[1][0] == matrix[1][2] and matrix[2][0] == matrix[0][2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "__author__ = 'Obriel Muga'\r\n\r\nif __name__ == '__main__':\r\n linea_1 = input()\r\n linea_2 = input()\r\n linea_3 = input()\r\n A = linea_1.replace('X',\"1\")\r\n A = A.replace('.',\"0\")\r\n B = linea_2.replace('X',\"1\")\r\n B = B.replace('.',\"0\") \r\n C = linea_3.replace('X',\"1\")\r\n C= C.replace('.',\"0\")\r\n A = A + B[0]\r\n C = B[2] + C\r\n if (A == C[::-1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nc=0\r\nfor i in range(0,3):\r\n if s1[i]!=s3[-1-i] or s2[i]!=s2[-1-i]:\r\n c=1\r\n break\r\nif c==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "lock = []\r\nfor _ in range(3):\r\n lock += input()\r\n\r\nfor i in range(4):\r\n if lock[i] != lock[8 - i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a = input()\r\nb = input()\r\nc = input()\r\nif a[0] == c[2]:\r\n if a[1] == c[1]:\r\n if a[2] == c[0]:\r\n if b[2] == b[0]:\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\")", "password = []\r\nfor i in range(3):\r\n password.append(list(input()))\r\n\r\ncheck = [[0, 0], [0, 1], [0, 2], [1, 0]]\r\nsymmetric = \"YES\"\r\nfor i, j in check:\r\n if password[i][j] != password[2-i][2-j]:\r\n symmetric = \"NO\"\r\n\r\nprint(symmetric)", "def check(password):\r\n password[2].reverse()\r\n if password[0] == password[2]:\r\n password[2].reverse()\r\n return True\r\n password[2].reverse()\r\n return False\r\n\r\npassword = []\r\ni = 0\r\nwhile i < 3:\r\n\tpassword.append(list(input()))\r\n\ti += 1 \r\n\r\n# check for symmetry\r\nhorizontal_s = check(password)\r\n# mirror diagonaly\r\nrear_pass = list(map(list, zip(*password)))\r\n# check for symmetry\r\nvertical_s = check(rear_pass)\r\n\r\nif horizontal_s and vertical_s:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "i = input\r\ns = i()+i()+i()\r\nprint(\"YES\" if s == s[::-1] else \"NO\")\r\n\r\n", "I=input\r\ns=I()+I()+I()\r\nprint(['NO','YES'][s==s[::-1]])", "r1=[(1 if i==\"X\" else 0) for i in input()]\r\nr2=[(1 if i==\"X\" else 0) for i in input()]\r\nr3=[(1 if i==\"X\" else 0) for i in input()]\r\n\r\nr2[1]=0\r\n\r\ns1=sum(r1)\r\ns2=sum(r2)\r\ns3=sum(r3)\r\n\r\nif (s1+s2+s3)%2!=0:\r\n print(\"NO\")\r\nelse:\r\n if r1[0]==r3[~0] and r1[1]==r3[~1] and r1[2]==r3[~2] and r2[0]==r2[~0]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a = input()\nb = input()\nc = input()\nflag = 1\nif a[0] != c[2]:\n flag = 0\nif a[1] != c[1]:\n flag = 0\nif a[2] != c[0]:\n flag = 0\nif b[0] != b[2]:\n flag = 0\nprint(\"YES\" if flag else \"NO\")", "arr = []\nfor i in range(3):\n s = input()\n arr.append(s)\nif arr[0]==arr[2][::-1] and arr[1]==arr[1][::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "class Solve:\r\n \r\n def __init__(self) -> None:\r\n self.dauVao = [];\r\n\r\n def vao(self) -> None:\r\n self.dauVao = [input() for _ in range(3)];\r\n\r\n def lam(self) -> None:\r\n tmp = 0;\r\n for i in range(3):\r\n if(self.dauVao[0][i] != self.dauVao[2][2 - i]): tmp += 1;\r\n if(self.dauVao[1][0] != self.dauVao[1][2]): tmp += 1;\r\n if(tmp > 0): print(\"NO\");\r\n else: print(\"YES\");\r\n\r\n def ra(self) -> None:\r\n pass;\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\nmain();\r\n", "l1 = input()\nl2 = input()\nl3 = input()\n\nif l1[::-1] != l3 or l2 != l2[::-1]:\n print(\"NO\")\nelse: print(\"YES\")\n\t \t\t \t\t \t \t\t \t \t \t\t \t \t", "# LUOGU_RID: 133557187\nl = [[0 for i in range(3)] for j in range(3)]\r\nfor i in range(3):\r\n l[i] = list(input())\r\nif l[0][0] == l[2][2] and l[0][1] == l[2][1] and l[0][2] == l[2][0] and l[1][0] == l[1][2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()+input()+input()\r\nf=1\r\nfor i in range(8):\r\n if f==1 and a[i]!=a[8-i]:\r\n print(\"NO\\n\")\r\n f=0\r\nif f==1:\r\n print(\"YES\\n\")", "L = []\r\nfor i in range(3):\r\n st = input()\r\n L.append(st)\r\n\r\ndef check(L):\r\n for row,line in enumerate(L):\r\n for column,ch in enumerate(line):\r\n if ch == 'X':\r\n if L[2 - row][2 - column] != 'X':\r\n return False\r\n\r\n if row == 2 and column == 2:\r\n return True\r\n\r\nif check(L):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input\r\ns = n() + n() + n()\r\n\r\nif s == s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "pw = \" \"+input()+input()+input()\r\nprint(\"YES\" if (pw[1]==pw[9] and pw[2]==pw[8] and pw[3]==pw[7] and pw[4]==pw[6]) else \"NO\")", "str= input()+input()+input()\r\nprint('YES' if str==str[::-1] else 'NO')\r\n", "def solve(s):\r\n for i in range(9):\r\n if s[i] != s[8 - i]:\r\n print('NO')\r\n return\r\n print('YES')\r\ns = ''\r\nfor i in range(3):\r\n s += input()\r\nsolve(s)", "a,b,c=input(),input(),input()\r\nif b==b[::-1] and a==c[::-1]:print('YES')\r\nelse:print('NO')\r\n", "strm1=input()\r\nstrm2=input()\r\nstrm3=input()\r\nif strm1==strm3[::-1] and strm2[0]==strm2[-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = []\r\nfor i in range(3):\r\n b = list(input())\r\n for i in b:\r\n a.append([i])\r\n\r\n\r\nfor c in range(len(a)):\r\n if a[c] != a[(c+1)*-1]:\r\n print('NO')\r\n break\r\n if c == 5:\r\n print('YES')\r\n break", "import re\nimport itertools\nfrom collections import Counter\n\nclass Task:\n one, two, three = \"\", \"\", \"\"\n answer = \"\" \n\t\n def getData(self):\n self.one = input()\n self.two = input()\n self.three = input()\n #self.x, self.y = [int(x) for x in input().split(' ')]\n #inFile = open('input.txt', 'r')\n #inFile.readline().rstrip()\n #self.childs = inFile.readline().rstrip()\n\n def solve(self):\n if self.one == self.three[::-1] and self.two == self.two[::-1]:\n self.answer = 'YES'\n else:\n self.answer = 'NO'\n\n def printAnswer(self):\n print(self.answer)\n #outFile = open('output.txt', 'w')\n #outFile.write(self.answer)\n\ntask = Task()\ntask.getData()\ntask.solve()\ntask.printAnswer()\n", "s1=input()\r\ns2=input()\r\ns3=input()\r\nss1=s1+s2+s3\r\nss2=s3[2]+s3[1]+s3[0]+s2[2]+s2[1]+s2[0]+s1[2]+s1[1]+s1[0]\r\nprint(\"YES\" if ss1==ss2 else \"NO\")\r\n" ]

[ "a,b,c=map(int,input().split())\r\nif(b==a//2 or b==a//2+1) and (c==a//2 or c==a//2+1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")" ]

[ "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\njauap=0\r\nfor i in a:\r\n while i>k*2:\r\n jauap+=1\r\n k=k*2\r\n k=max(k,i)\r\nprint(jauap)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\ncurr = 0\r\nans = 0\r\nwhile curr < len(a):\r\n if k >= a[curr] / 2:\r\n k = max(k, a[curr])\r\n curr += 1\r\n else:\r\n ans += 1\r\n k *= 2\r\n\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n while (k * 2 < a[i]):\r\n k *= 2\r\n ans += 1\r\n k = max(k, a[i])\r\nprint(ans)\r\n \r\n", "n,k = [int(a) for a in input().split()]\r\n\r\nar = [int(a) for a in input().split()]\r\n\r\nar.sort()\r\nct = 0\r\ni = 0\r\n\r\nwhile i < n:\r\n if ar[i] > k:\r\n if ar[i] > 2*k:\r\n k *= 2\r\n ct += 1\r\n else:\r\n k = ar[i]\r\n i += 1\r\n else:\r\n i += 1\r\n\r\nprint(ct)\r\n", "import sys\n\ndef main():\n n, k = map(int,sys.stdin.readline().split())\n a = list(map(int,sys.stdin.readline().split()))\n \n a = sorted(a)\n\n ans = 0\n for i in range(n):\n if k*2>=a[i]:\n k = max(k,a[i])\n else:\n t = a[i]\n while t>k*2:\n if t%2==1:\n t= int(t/2)+1\n else:\n t = int(t/2)\n ans+=1\n k = a[i]\n\n print(ans)\n\nmain()", "n,k = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\ncurrMax = k\ncount = 0\ni = 0\nwhile (i<n):\n temp = (a[i]+1)//2\n if (currMax>=temp):\n currMax = max(currMax,a[i])\n i += 1\n else:\n currMax = 2*currMax\n count += 1\nprint(count)\n", "R=lambda:list(map(int,input().split()))\r\nn,k=R()\r\na=sorted(R())\r\nb=0\r\nfor i in a:\r\n while i>k+k:\r\n k+=k\r\n b+=1\r\n k=max(k,i)\r\nprint(b)\r\n", "R=lambda:list(map(int,input().split()))\nn,k=R()\na=sorted(R())\nb=0\nfor i in a:\n while i>k+k:\n k+=k\n b+=1\n k=max(k,i)\nprint(b)\n", "n, k = map(int, input().split())\r\ndif = list(map(int, input().split()))\r\ndif.sort()\r\ni = 0\r\nans = 0\r\nwhile i < n:\r\n while i < n and dif[i] <= 2 * k:\r\n k = max(k, dif[i])\r\n i += 1\r\n if i < n:\r\n while 2 * k < dif[i]:\r\n k *= 2\r\n ans += 1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nk *= 2\r\nans = 0\r\n\r\nfor x in a:\r\n while k < x:\r\n k *= 2\r\n ans += 1\r\n k = max(k, x*2)\r\n\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\naa = sorted(map(int, input().split()))\r\n\r\nansw = 0\r\n\r\nfor a in aa:\r\n while 2 * k < a:\r\n k *= 2\r\n answ += 1\r\n k = max(k, a)\r\n\r\nprint(answ)\r\n", "n, k = map(int, input().split())\r\ntasks = sorted(filter(lambda x: x > k, set(map(int, input().split()))))\r\nres = 0\r\n\r\nfor task in tasks:\r\n while (k << 1) < task:\r\n k <<= 1\r\n res += 1\r\n k = task\r\n\r\nprint(res)\r\n", "n, k=map(int, input().split())\r\np=list(map(int,input().split()))\r\np.sort()\r\na=0\r\nfor i in p:\r\n while(k*2<i):\r\n a+=1\r\n k*=2\r\n k=max(k,i)\r\nprint(a)\r\n", "n, k = map(int, input().split())\r\na = sorted([int(x) for x in input().split()])\r\nans = 0\r\n\r\nfor i in range(0, n):\r\n while k * 2 < a[i]:\r\n ans += 1\r\n k *= 2\r\n k = max(k, a[i])\r\n \r\nprint(ans)", "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, k = mints()\r\na = list(mints())\r\na.sort()\r\nr = 0\r\nfor i in range(n):\r\n\tif a[i] > k:\r\n\t\twhile k*2 < a[i]:\r\n\t\t\tr += 1\r\n\t\t\tk *= 2\r\n\t\tk = a[i]\r\nprint(r)\r\n", "n, k = map(int, input().split())\r\ns = sorted(tuple(map(int, input().split())))\r\nmax = k\r\nans = 0\r\nfor a in s:\r\n if a > max:\r\n while max < a / 2:\r\n max = max * 2\r\n ans = ans + 1\r\n max = a\r\nprint(ans)\r\n", "n, k = map(int, input().split())\ndifficulties = map(int, input().split())\n\nmaxDif = k\n\ndifficulties = sorted(difficulties)\n\nother = 0\n\nfor index, item in enumerate(difficulties):\n while maxDif * 2 < item:\n maxDif *= 2\n other += 1\n\n if maxDif < item:\n maxDif = item\n\nprint(other)\n", "import collections\r\nd=collections.deque()\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=0\r\nfor i in a:\r\n d.append(i)\r\nwhile len(d)>0:\r\n while len(d)>0 and d[0]<=2*k:\r\n k=max(k,d.popleft())\r\n k=2*k\r\n x+=1\r\nprint(x-1)", "get = lambda : list(map(int , input().split()))\r\nn, k = get()\r\nlist = get()\r\nlist = sorted(list)\r\ncount = 0\r\nfor i in list :\r\n while k < i/2:\r\n k = k * 2\r\n count+=1\r\n k = max(k , i)\r\nprint(count)", "import math \r\ndef main():\r\n n, k = map(int, input().split())\r\n P = list(map(int, input().split()))\r\n P.sort()\r\n\r\n M = k\r\n count = 0\r\n for num in P:\r\n f = math.ceil(math.log2(num/M)) - 1\r\n # print(num/M, f)\r\n if f < 1:\r\n pass\r\n else:\r\n count += f\r\n M = max(M, num)\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n # global stime\r\n # stime = time.clock()\r\n main()\r\n", "s = input().split(' ')\r\nn = int(s[0])\r\nk = int(s[1])\r\ns = input().split(' ')\r\narr = []\r\nfor a in s:\r\n arr.append(int(a))\r\n\r\narr.sort()\r\ntot = 0\r\nfor i in range(0, n):\r\n while 2 * k < arr[i]:\r\n k *= 2\r\n tot+=1\r\n k = max(k, arr[i])\r\nprint(tot)\r\n", "n,k=map(int,input().split())\r\nans=0\r\nfor i in sorted(map(int,input().split())):\r\n while i>2*k:\r\n ans+=1\r\n k*=2\r\n k=max(k,i)\r\nprint(ans)", "import math\r\ndef calc(a,b):\r\n x=0\r\n while(a<b):\r\n a=a*2\r\n x+=1\r\n return x\r\nn,k=input().split()\r\nn,k=int(n),int(k)\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nfor i in range(0,n):\r\n if(a[i]<=2*k):\r\n k=max(k,a[i])\r\n elif(a[i]>2*k):\r\n ans+=calc(k,math.ceil(a[i]/2))\r\n k=a[i]\r\nprint(ans)\r\n \r\n\r\n", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in a:\r\n while k*2 < i:\r\n ans += 1\r\n k *= 2\r\n k = max(k, i)\r\n \r\nprint(ans)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\na.sort()\r\n\r\ncnt = 0; i = 0\r\nwhile i < n:\r\n if k*2 < a[i]:\r\n cnt += 1\r\n k <<= 1\r\n i -= 1\r\n else:\r\n k = max(k, a[i])\r\n i += 1\r\n \r\nprint(cnt)", "n,k=map(int,input().split())\r\nls=list(map(int,input().split()))\r\nls.sort()\r\ncnt=0\r\nfor i in ls:\r\n if i<=k*2:\r\n k=max(k,i)\r\n else:\r\n while i>k*2:\r\n k*=2\r\n cnt+=1\r\n k=max(i,k)\r\nprint(cnt)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nka=0\r\nfor i in range(n):\r\n while(l[i]>(2*k)):\r\n k=k*2\r\n ka=ka+1\r\n k=max(k,l[i])\r\nprint(ka)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nn,k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort(reverse=True)\r\nans = 0\r\nwhile A:\r\n a = A.pop()\r\n while a>k*2:\r\n k*=2\r\n ans+=1\r\n k = max(a,k)\r\nprint(ans)", "n, k = map(int, input().split())\r\nline = [int(x) for x in input().split()]\r\nline.sort()\r\nans = 0\r\nfor i in line:\r\n if i > k:\r\n while k < i / 2:\r\n k = k * 2\r\n ans = ans + 1\r\n k = i\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nM = k\r\nans = 0\r\n\r\nfor ai in a:\r\n while (ai+1)//2>M:\r\n M *= 2\r\n ans += 1\r\n \r\n M = max(M, ai)\r\n\r\nprint(ans)", "n, k = map(int, input().split())\na = sorted(map(int, input().split()))\n\nans = 0\nfrom math import log\n\nfor i in a:\n\tif k * 2 >= i:\n\t\tk = max(k, i)\n\telse:\n\t\twhile k * 2 < i:\n\t\t\tk *= 2\n\t\t\tans += 1\n\t\tk = max(k, i)\n\nprint(ans)", "#Jasnah\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\ntemp=0\r\nfor i in range(len(a)):\r\n if 2*k>=a[i]:\r\n if k<a[i]:\r\n k=a[i]\r\n else:\r\n while 2*k<a[i]:\r\n temp+=1\r\n k=2*k\r\n if k<a[i]:\r\n k=a[i]\r\nprint(temp)", "n,k = [int(i) for i in input().split()]\r\na = sorted(int(i) for i in input().split())\r\nans=0\r\nfor i in range(n):\r\n\twhile a[i]/2 > k:\r\n\t\tk*=2\r\n\t\tans+=1\r\n\tk=max(k,a[i])\r\nprint(ans)", "n, k = map(int, input().split(\" \"))\r\n\r\narr = sorted([int(i) for i in input().split(\" \")])\r\n\r\nanswer = 0\r\nfor i in range(n):\r\n while 2 * k < arr[i]:\r\n answer += 1\r\n k *= 2\r\n k = max(k, arr[i])\r\n\r\nprint(answer)", "n, k = map(int, input().split())\nnum = list(map(int, input().split()))\nnum.sort()\ncount = 0\nfor level in num:\n if level<=k*2:\n k = max(level,k)\n else:\n while level>k*2:\n k*=2\n count+=1\n k=max(level,k)\nprint(count)\n\t\t \t \t \t \t \t\t \t\t \t\t\t\t", "def solve(v, skills):\r\n skills.sort()\r\n ans=0\r\n tmp = 2*v\r\n for i in skills:\r\n while i > tmp:\r\n ans+=1\r\n tmp*=2\r\n tmp = max(tmp, i*2)\r\n return ans\r\n\r\nn,v=map(int,input().split())\r\nskills=list(map(int,input().split()))\r\nprint(solve(v,skills))\r\n", "n,k=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n\twhile a[i]/2>k:\r\n\t\tk*=2\r\n\t\tans+=1\r\n\tk=max(k,a[i])\r\nprint(ans)", "n,k=map(int, input().split())\r\na=sorted([int(x) for x in input().split()])\r\nans=0\r\n \r\nfor i in range(0, n):\r\n while k*2<a[i]:\r\n ans+=1\r\n k*=2\r\n k=max(k,a[i])\r\n \r\nprint(ans)\r\n", "import math\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nnum = a[-1]; ans = 0\r\nwhile math.ceil(num/2) > k:\r\n i = 0\r\n while a[i] < num:\r\n if a[i] >= math.ceil(num/2):\r\n num = a[i]\r\n break\r\n i += 1\r\n else:\r\n num = math.ceil(num/2)\r\n ans += 1\r\nprint(ans)", "\n\n\n\nn, k = map(int, input().split())\n\nA = sorted([int(x) for x in input().split()])\n\nresult = 0\n\nfor x in A:\n while x > 2 * k:\n k *= 2\n result += 1\n k = max([k, x])\n\nprint(result)\n", "ans = 0\nn, k = map(int, input().split())\nd = 2 * k\narr = input()\nl = list(map(int, arr.split(' ')))\nl = sorted(l)\nfor i in l:\n if d >= i:\n d = 2 * max(k, i)\n else:\n while d < i:\n d *= 2\n ans += 1\n d = max(d, 2 * i)\nprint(ans)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(n):\r\n if k*2>=a[i]:\r\n k=max(k,a[i])\r\n else:\r\n while k*2<a[i]:\r\n k=k*2\r\n c+=1\r\n k=max(k,a[i])\r\nprint(c)", "_, k = [int(in_part) for in_part in input().strip(' ').split(' ')]\r\n\r\narr = [int(in_part) for in_part in input().strip(' ').split(' ')]\r\narr.sort()\r\n\r\ncount = 0\r\nfor x in arr:\r\n while x > 2 * k:\r\n k *= 2\r\n count += 1\r\n\r\n if x > k:\r\n k = x\r\n\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nresult = 0\r\n\r\nfor d in a:\r\n\twhile d > 2*k:\r\n\t\tk *= 2\r\n\t\tresult += 1\r\n\tk = max(d, k)\r\n\r\nprint(result)", "n, cur = map(int, input().split())\r\nl = sorted(map(int, input().split()))\r\nres = 0\r\nfor e in l:\r\n while 2 * cur < e:\r\n cur *= 2\r\n res += 1\r\n cur = max(cur, e)\r\nprint(res)", "n,k=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nans=int(0)\r\nfor i in l:\r\n while k*2<i:\r\n k*=2\r\n ans+=1\r\n k=max(k,i)\r\nprint(ans)\r\n", "n, mx = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\na.sort()\r\ncntr = i = 0\r\nwhile i < n:\r\n if mx >= a[i] / 2:\r\n mx = max(mx, a[i])\r\n i += 1\r\n else:\r\n mx *= 2\r\n cntr += 1\r\nprint(cntr)\r\n", "n,k = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\ncurr = k \r\nans = 0 \r\nfor i in range(n):\r\n if (2*curr>A[i]):\r\n curr = max(A[i],curr)\r\n else:\r\n while (2*curr < A[i]):\r\n curr = 2*curr \r\n ans +=1 \r\n curr = max(curr,A[i])\r\nprint(ans)\r\n ", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n\r\nints = lambda: list(map(int, input().split()))\r\n\r\nn, k = ints()\r\na = ints()\r\n\r\nans = 0\r\na.sort()\r\ni = 0\r\nwhile i < n:\r\n if k < a[i]/2:\r\n ans += 1\r\n k = 2 * k\r\n else:\r\n i += 1\r\n k = max(k, a[i-1])\r\nprint(ans)", "#!/usr/local/bin/python3\n\nn, k = map(int, input().split())\n\nmax_difficulty = k\n\nproblems = map(int, input().split())\nproblems = sorted(problems)\n\nhelp_requested = 0\n\nfor problem in problems:\n if problem <= 2 * max_difficulty:\n max_difficulty = max(problem, max_difficulty)\n continue\n\n while problem > 2 * max_difficulty:\n help_requested += 1\n max_difficulty *= 2\n max_difficulty = max(problem, max_difficulty)\n\nprint(help_requested)\n", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nanswer = 0\r\nfor elem in a:\r\n while 2 * k < elem:\r\n k *= 2\r\n answer += 1\r\n k = max(k, elem)\r\nprint(answer)", "n,k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\ncur = k\r\nans = 0\r\nfor i, a in enumerate(A):\r\n if 2*cur >= a:\r\n cur = max(a, cur)\r\n else:\r\n while 2*cur < a:\r\n cur *= 2\r\n ans += 1\r\n cur = max(a, cur)\r\nprint(ans)\r\n", "n, k = list(map(int,input().split(' ')))\r\nq = sorted(list(map(int, input().split(' '))))\r\nresult = 0\r\nif k >= q[-1]/2:\r\n print(result)\r\nelse:\r\n for i in q:\r\n while k*2 < i:\r\n result += 1\r\n k *= 2\r\n k = max(k, i)\r\n print(result)\r\n", "n, k = map(int, input().split(' '))\nproblems = list(map(int, input().split(' ')))\n\nproblems.sort()\n# easy = []\n\n# for i in range(len(problems)):\n# \tif problems[i] > k:\n# \t\tproblems = problems[i:]\n# \t\tbreak\n\nmax_solved = k\nproblem_index = 0\nn_has_to_solve = 0\n\nwhile problem_index < n:\n\tif problems[problem_index] <= max_solved * 2:\n\t\tmax_solved = max(max_solved, problems[problem_index])\n\t\tproblem_index += 1\n\telse:\n\t\tmax_solved *= 2\n\t\tn_has_to_solve += 1\n\nprint(n_has_to_solve)", "n,m = map(int,input().split())\r\nseq = list(map(int,input().split()))\r\ncnt = 0\r\nseq.sort()\r\nfor x in seq:\r\n\twhile(m * 2 < x):\r\n\t\tcnt = cnt + 1\r\n\t\tm = m * 2\r\n\tm = max(m,x)\r\nprint(cnt)\r\n", "n, k = map(int, input().split())\ns = [int(i) for i in input().split()]\ns.sort()\nans = 0\nfor i in s:\n while k<i/2:\n ans+=1\n k=2*k\n k = max(k, i)\nprint(ans)\n\n", "import math\r\nn, k = [int(x) for x in input().split()]\r\npr = [int(x) for x in input().split()]\r\npr.sort()\r\ncount = 0\r\nfor i in pr:\r\n if i > k:\r\n if math.ceil(i / 2) <= k:\r\n k = i\r\n else:\r\n ct = i\r\n while True:\r\n ct = math.ceil(ct / 2)\r\n count += 1\r\n if math.ceil(ct / 2) <= k:\r\n break\r\n k = i\r\nprint(count)", "import sys\r\n\r\nn, max_solvable = [int(i) for i in sys.stdin.readline().split()]\r\ndif = [int(i) for i in sys.stdin.readline().split()]\r\ndif.sort()\r\n\r\nmax_solvable = max_solvable * 2\r\n\r\ni = 0\r\nans = 0\r\n\r\nwhile(True):\r\n\twhile i < len(dif) and max_solvable >= dif[i]:\r\n\t\tmax_solvable = max(max_solvable, dif[i] * 2)\r\n\t\ti += 1\r\n\tif i == len(dif):\r\n\t\tbreak\r\n\tans += 1\r\n\tmax_solvable *= 2\r\n\r\nprint(ans)", "import math\n\nI = lambda: map(int, input().split())\nn, k = I()\na = list(I())\n# print(a)\nans = 0\nfor task in sorted(a):\n if math.ceil(task/2) <= k:\n k = max(task, k)\n continue\n else:\n while not math.ceil(task/2) <= k:\n ans += 1\n k *= 2\n k = task\n\nprint(ans)\n\n", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn,k=map(int,input().split())\r\n\r\nans=0\r\nfor i in sorted(map(int,input().split())):\r\n while i>2*k:\r\n ans+=1\r\n k*=2\r\n k=max(k,i)\r\n\r\nprint(ans)\r\n", "from sys import stdin, stdout\r\nEPS = 10 ** (-20)\r\nINF = float('inf')\r\nsize = 10 ** 6\r\n\r\nn, k = map(int, stdin.readline().split())\r\nvalues = sorted(list(map(int, stdin.readline().split())))\r\ni = 0\r\nans = 0\r\n\r\nwhile i < n:\r\n if 2 * k >= values[i]:\r\n k = max(k, values[i])\r\n i += 1\r\n else:\r\n k *= 2\r\n ans += 1\r\n\r\nstdout.write(str(ans))" ]

[ "def inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef fill_arr(n):\r\n return [0 for x in range(n)]\r\n\r\n\r\nx, y = inp()\r\na, b = fill_arr(5), fill_arr(5)\r\nfor i in range(1, x + 1):\r\n a[i % 5] += 1\r\nfor i in range(1, y + 1):\r\n b[i % 5] += 1\r\nsum = a[0] * b[0]\r\nfor i in range(1,5):\r\n sum += a[i] * b[5 - i]\r\n\r\nprint(sum)\r\n", "n,m=map(int,input().split())\nans=0\nfor i in range(1,n+1):\n ans+=(i%5+m)//5\nprint(ans)", "import math\r\n\r\n\r\nnum = sorted([int(x) for x in input().split()])\r\nc = 0\r\nif num[0] > 5:\r\n for i in range(1, 6):\r\n c += len(range(5 if 5-i == 0 else 5-i, num[1]+1, 5))\r\n c *= (math.floor(num[0]/5))\r\n for x in range(1, num[0] % 5 + 1):\r\n c += len(range(5 if 5-x == 0 else 5-x, num[1]+1, 5))\r\nelse:\r\n for x in range(1, num[0] + 1):\r\n c += len(range(5 if 5-x == 0 else 5-x, num[1]+1, 5))\r\nprint(c)\r\n", "def fun(x,y):\r\n final=0\r\n for i in range(1,x+1):\r\n if i%5==y:\r\n final+=1\r\n return final\r\n\r\nn,m=map(int,input().split())\r\nans=0\r\nans+=fun(n,0)*fun(m,0)\r\nans+=fun(n,1)*fun(m,4)\r\nans+=fun(n,2)*fun(m,3)\r\nans+=fun(n,3)*fun(m,2)\r\nans+=fun(n,4)*fun(m,1)\r\nprint(ans)", "import math\r\n\r\nnumbers = list(map(int , input().split()))\r\nbigest_reach_number = math.floor( (numbers[0] + numbers[1]) /5 )\r\ncounter = 0\r\nfor i in range (1 , bigest_reach_number+1):\r\n main_number = i * 5\r\n if main_number <= numbers[0] and main_number <= numbers[1] :\r\n counter += main_number - 1\r\n elif main_number > numbers[0] and main_number <= numbers[1] :\r\n count = (main_number - 1) - (main_number - numbers[0]) + 1\r\n counter += count\r\n elif main_number <= numbers[0] and main_number > numbers[1] :\r\n count = (main_number - 1) - (main_number - numbers[1]) + 1\r\n counter += count\r\n else :\r\n count = numbers[1] - (main_number - numbers[0]) + 1;\r\n counter += count\r\nprint(counter)", "#in the name of god\r\n#Mr_Rubik\r\n#''.join(sorted(a)) sort string\r\na,b=map(int,input().split())\r\nsum=0\r\nsum+=a*int(b/5)\r\nsum+=int(a/5)* (b % 5)\r\nif a%5+b%5>=5:\r\n sum+=(a%5+b%5)%5+1\r\nprint(sum)", "n, m = map(int, input().split())\n\nans = 0\nfor i in range(5):\n ni = len(list(range(i+1, n+1, 5)))\n if (5-i-1) != 0:\n mi = len(list(range(5-i-1, m+1, 5)))\n else:\n mi = len(list(range(5, m+1, 5)))\n ans += (ni * mi)\nprint(ans)\n", "n, m = map(int, input().split())\nres = 0\nfor k in range(1, 400001):\n\ty = k * 5\n\tMax = y - 1\n\ta = min(Max, n)\n\tb = min(Max, m)\n\tpoint = y - a\n\tres+= max(0, b - point + 1)\nprint(res)", "n,m=map(int,input().split())\r\nans=5*(n//5)*(m//5)\r\np=n%5\r\nq=m%5\r\ntmp=0\r\nfor i in range(1,p+1):\r\n for j in range(1,q+1):\r\n if (i+j)%5==0:\r\n tmp+=1\r\nres1,res2=0,0\r\nfor i in range(1,p+1):\r\n for j in range(1,6):\r\n if (i+j)%5==0:\r\n res1+=1\r\nfor i in range(1,q+1):\r\n for j in range(1,6):\r\n if(i+j)%5==0:\r\n res2+=1\r\nans=ans+res1*(m//5)+res2*(n//5)+tmp\r\nprint(ans) ", "a,b=input().split( )\r\na,b=int(a)%5*[int(a)//5+1]+-int(a)%5*[int(a)//5]+5*[int(a)//5],int(b)%5*[int(b)//5+1]+-int(b)%5*[int(b)//5]+5*[int(b)//5]\r\nprint(a[0]*b[3]+a[1]*b[2]+a[2]*b[1]+a[3]*b[0]+a[4]*b[4])\r\n", "a,b=list(map(int,input().split()))\r\n#a_dict={\"0\":0,\"1\":0,\"2\":0,\"3\":0,\"4\":0}\r\n#b_dict={\"0\":0,\"1\":0,\"2\":0,\"3\":0,\"4\":0}\r\n\r\ntemp=a\r\n#print(temp//5)\r\na_dict={\"0\":temp//5,\"1\":temp//5,\"2\":temp//5,\"3\":temp//5,\"4\":temp//5}\r\n\r\ntemp=temp%5\r\nwhile temp:\r\n a_dict[str(temp)]=a_dict[str(temp)]+1\r\n temp-=1\r\n \r\n\r\n\r\n\r\ntemp=b\r\nb_dict={\"0\":temp//5,\"1\":temp//5,\"2\":temp//5,\"3\":temp//5,\"4\":temp//5}\r\n\r\n\r\n\r\ntemp=temp%5\r\nwhile temp:\r\n b_dict[str(temp)]=b_dict[str(temp)]+1\r\n temp-=1\r\n\r\n#print(a_dict,b_dict)\r\n\r\n\r\n\r\n\r\ncount=a_dict[\"0\"]*b_dict[\"0\"]\r\nfor i in range(1,5):\r\n count+=a_dict[str(i)]*b_dict[str(5-i)]\r\nprint(count)", "def solve():\r\n n, m = map(int, input().split())\r\n nn, mm = [0] * 5, [0] * 5\r\n for i in range(1, n+1):\r\n nn[i % 5] += 1\r\n for i in range(1, m+1):\r\n mm[i % 5] += 1\r\n print(nn[0]*mm[0] + nn[1]*mm[4] + nn[2]*mm[3] + nn[3]*mm[2] + nn[4]*mm[1])\r\nsolve()\r\n\r\n", "n, m = map(int, input().split())\r\nlst = [0] * 5\r\nans = 0\r\nfor i in range(1,m+1):\r\n lst[i%5] += 1\r\nfor i in range(1,n+1):\r\n ans = ans + lst[(5-(i%5))%5]\r\nprint(ans)", "n , m = list(map(int,input().split()))\r\ncnt = 0\r\nfor x in range(1,n+1):\r\n\tcnt += (x%5 + m)//5\r\nprint(cnt)", "n,m = list(map(int,input().split()))\r\na = [n//5]*5\r\nb = [m//5]*5\r\n\r\nfor i in range(n%5):\r\n a[i] += 1\r\nfor i in range(m%5):\r\n b[i] += 1\r\n#print(a,b)\r\n\r\nans = a[4]*b[4]\r\nfor i in range(4):\r\n ans += a[i]*b[3-i]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\npairs = 0\r\n\r\nfor i in range(1, n % 5 + 1):\r\n pairs += (m + i % 5 - (m + i) % 5) // 5\r\n\r\nprint(pairs + n // 5 * m)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗ \r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝ \r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗ \r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\n\"\"\"\r\nn, m = map(int, input().split())\r\na = [0, 0, 0, 0, 0]\r\nb = [0, 0, 0, 0, 0]\r\nfor i in range(1, n + 1):\r\n\tif i % 5 == 0:\r\n\t\ta[0] += 1\r\n\telif i % 5 == 1:\r\n\t\ta[1] += 1\r\n\telif i % 5 == 2:\r\n\t\ta[2] += 1\r\n\telif i % 5 == 3:\r\n\t\ta[3] += 1\r\n\telse:\r\n\t\ta[4] += 1\r\nfor i in range(1, m + 1):\r\n\tif i % 5 == 0:\r\n\t\tb[0] += 1\r\n\telif i % 5 == 1:\r\n\t\tb[1] += 1\r\n\telif i % 5 == 2:\r\n\t\tb[2] += 1\r\n\telif i % 5 == 3:\r\n\t\tb[3] += 1\r\n\telse:\r\n\t\tb[4] += 1\r\nprint(a[0] * b[0] + a[1] * b[4] + a[2] * b[3] + a[3] * b[2] + a[4] * b[1])\r\n\r\n\r\n\r\n\t\r\n\t\n", "n, m = map(int, input().split())\r\nresult = 0\r\nfor i in range(1,n+1):\r\n result += (m+i%5)//5\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 26 13:57:33 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 72 - CF682-DIV2A\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\nfullN = n//5\r\nfullM = m//5\r\nhaveN = [fullN+1]*(n%5) + [fullN]*(5-n%5)\r\nhaveM = [fullM+1]*(m%5) + [fullM]*(5-m%5)\r\n\r\nans = haveN[4]*haveM[4] + haveN[0]*haveM[3] + haveN[1]*haveM[2] + haveN[2]*haveM[1]+haveN[3]*haveM[0]\r\nprint(ans)", "n,m = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\nfor i in range(1,6):\r\n\tcount += ((n+(5-i)%5)//5)*((m+i%5)//5)\r\nprint(count)", "n,m = map(int,input().split())\r\none,two,three,four,five, = 0,0,0,0,0\r\nfor i in range(4,max(n,m)+1,5):\r\n\tone+=1\r\nfor i in range(3,max(n,m)+1,5):\r\n\ttwo+=1\r\nfor i in range(2,max(n,m)+1,5):\r\n\tthree+=1\r\nfor i in range(1,max(n,m)+1,5):\r\n\tfour+=1\r\nfor i in range(5,max(n,m)+1,5):\r\n\tfive+=1\r\ncount=0\r\nfor i in range(1,min(n,m)+1):\r\n\tif i%5==1: count+=one\r\n\telif i%5==2: count+=two\r\n\telif i%5==3: count+=three\r\n\telif i%5==4: count+=four\r\n\telse: count+=five\r\nprint(count)", "n,m=map(int,input().split())\r\nprint((n//5)*(m//5)+(n//5+(n%5>0))*(m//5+(m%5>3))+(n//5+(n%5>1))*(m//5+(m%5>2))+(n//5+(n%5>2))*(m//5+(m%5>1))+(n//5+(n%5>3))*(m//5+(m%5>0)))", "m, n = [int(x) for x in input().split(' ')]\r\ndm = {}\r\ndn = {}\r\nfor i in range(5):\r\n dm[i] = m//5 + ((m%5) >= i)\r\n dn[i] = n//5 + ((n%5) >= i)\r\nans = (dm[0]-1)*(dn[0]-1)\r\nfor i in range(1, 5):\r\n ans += dm[i]*dn[5-i]\r\nprint(ans)\r\n", "number_x, number_y = tuple(map(int, input().split()))\r\nx_list = [0 for i in range(5)]\r\ny_list = [0 for i in range(5)]\r\nfor i in range(1, number_x + 1):\r\n x_list[i%5] += 1\r\nfor i in range(1, number_y + 1):\r\n y_list[i%5] += 1\r\nsum = x_list[0] * y_list[0]\r\nfor i in range(1, 5):\r\n sum += x_list[i] * y_list[5 - i]\r\nprint(sum, end = '')", "n,m = map(int, input().split())\r\nsum = 0\r\nfor i in range(1, n + 1):\r\n sum = sum + (m+i%5)//5\r\nprint(sum)", "x,y = map(int,input().split())\r\nx,y = (y,x) if x>y else (x,y)\r\nsol = 0\r\n#l = [4,3,2,1,0]\r\nj = [((y-4)//5)+1,((y-3)//5)+1,((y-2)//5)+1,((y-1)//5)+1,y//5]\r\nsu = sum(j)\r\nfor i in range(x//5):\r\n #t = 5-(i%5)\r\n #sol += ((y-t)//5)\r\n sol += su\r\n #while t<=y:\r\n # #print(i,t)\r\n # sol += 1\r\n # t += 5\r\n#for i in range(x//5):\r\n# sol += l[i]*j[i]\r\n#for i in range(x%5):\r\n# sol += l[i]*j[i]\r\n#sol = sum(j)\r\nfor i in range(x%5):\r\n \r\n sol += j[i]\r\nprint(sol)", "first,second=list(map(int,input().split()))\r\n\r\nfor_first={1:0,2:0,3:0,4:0,0:0}\r\nfor_second={1:0,2:0,3:0,4:0,0:0}\r\nfor i in range(1,first+1):\r\n remain=i%5\r\n for_first[remain]=for_first[remain]+1\r\nfor i in range(1,second+1):\r\n remain=i%5\r\n for_second[remain]=for_second[remain]+1\r\n# print(for_first)\r\n# print(for_second)\r\nans=0\r\n# for i in first:\r\n# ans=ans+for_first[i]*for_second[i]\r\n\r\nans=ans+for_first[1]*for_second[4]\r\nans=ans+for_first[2]*for_second[3]\r\nans=ans+for_first[3]*for_second[2]\r\nans=ans+for_first[4]*for_second[1]\r\nans=ans+for_first[0]*for_second[0]\r\nprint(ans)", "import math\r\nfrom collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\na,b=M()\r\nc={};d={}\r\nfor i in range(1,6):c[i]=a//5\r\nfor i in range(0,a%5):c[i+1]+=1\r\nfor j in range(1,6):d[j]=b//5\r\nfor j in range(0,b%5):d[j+1]+=1\r\nans=d[5]*c[5]\r\nfor i in range(1,5):\r\n ans+=c[i]*d[5-i]\r\nprint(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", "n, m = map(int, input().split())\r\nn1 = [n//5, n//5, n//5, n//5, n//5]\r\nm1 = [m//5, m//5, m//5, m//5, m//5]\r\nfor x in range(n%5):\r\n n1[x] += 1\r\nfor h in range(m%5):\r\n m1[h ] += 1\r\nprint(n1[0]*m1[3] + n1[1]*m1[2] + n1[2]*m1[1] + n1[3]*m1[0] + n1[4]*m1[4])\r\n\r\n", "n, m = list(map(int, input().split()))\r\nre = 0\r\nnum = [m // 5] * 5\r\nm %= 5\r\nfor i in range(m):\r\n num[i] += 1\r\nfor i in range(1, 6):\r\n x = n // 5\r\n if n % 5 >= i:\r\n x += 1\r\n re += x * num[5 - i - 1]\r\nprint(re)", "n,m=map(int,input().split())\r\nprint(sum((m+((i+1)%5))//5 for i in range(n)))", "n, m = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(1, n+1):\n l = i + 1\n r = i + m\n ans += (r//5) - (l-1)//5\n\nprint(ans)\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,m=map(int,input().split())\r\nd=[el%5 for el in range(1,n+1)]\r\ne=[el%5 for el in range(1,m+1)]\r\nd=Counter(d)\r\ne=Counter(e)\r\nans=0\r\nfor i in range(5):\r\n ans+=d[i]*e[(5-i)%5]\r\nprint(ans)\r\n ", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nn,m=map(int,input().split())\r\nd=[];p=[];E=0\r\nfor i in range(1,5):\r\n d.append(n//5+int(n%5>=i))\r\n p.append(m//5+int(m%5>=i))\r\nfor i in range(4):\r\n E+=d[i]*p[-i-1]\r\nE+=n//5*(m//5)\r\nprint(E)\r\n\r\n", "n, m = map(int, input().split())\r\nt = [0] * 5\r\nt1 = [0] * 5\r\nfor i in range(1, n+1):\r\n t[i % 5] += 1\r\nfor i in range(1, m+1):\r\n t1[i % 5] += 1\r\n\r\nprint(t[0]*t1[0] + t[1]*t1[4] + t[2]*t1[3]+ t1[1]*t[4] + t1[2]*t[3])\r\n", "n,m=list(map(int,input().split()))\r\narr1=[0,0,0,0,0]\r\narr2=[0,0,0,0,0]\r\nfor i in range(1,n+1):\r\n z=i%5\r\n arr1[z]+=1\r\nfor i in range(1,m+1):\r\n z=i%5\r\n arr2[z]+=1\r\n \r\nprint(arr1[0]*arr2[0]+arr1[1]*arr2[4]+arr1[2]*arr2[3]+arr1[3]*arr2[2]+arr1[4]*arr2[1])\r\n \r\n ", "from collections import defaultdict\r\ndef solve():\r\n counter = 0\r\n n, m = list(map(int, input().split()))\r\n needs = defaultdict(int)\r\n for i in range(1, m+1):\r\n ans = 0\r\n for j in range(5):\r\n if (i + j) % 5 == 0:\r\n ans = j\r\n break\r\n needs[ans] += 1\r\n for i in range(1, n+1):\r\n counter += needs[i%5]\r\n return counter\r\n\r\nprint(solve())", "import sys\n\nn, m = map(int, sys.stdin.readline().split())\nres = (n // 5) * (m // 5) * 5\nres += (n // 5) * (m % 5)\nres += (m // 5) * (n % 5)\nfor i in range(1, (n % 5) + 1):\n for j in range(1, (m % 5) + 1):\n if (i + j) % 5 == 0:\n res += 1\nprint(res)", "a,b = map(int, input().split())\r\nx = min(a,b)\r\ny = max(a,b)\r\nans = 0\r\nfor i in range(1,x+1):\r\n k=i+1\r\n while (k%5!=0):\r\n k+=1 \r\n temp = (y-(k-i))//5\r\n if temp>=0:\r\n ans+=temp+1\r\nprint(ans) ", "import sys\nn, m = map(int, sys.stdin.readline().split())\nans = (n//5) * (m//5)\nans += ((n+4)//5) * ((m+1)//5)\nans += ((n+3)//5) * ((m+2)//5)\nans += ((n+2)//5) * ((m+3)//5)\nans += ((n+1)//5) * ((m+4)//5)\nprint(ans)\n", "a=[int(x) for x in input().split()]\nx=a[0]\ny=a[1]\np=x*(y//5)\nfor i in range(1,x+1):\n if y%5+i%5>=5:\n p+=1\nprint(p)\n \t \t\t\t\t\t\t\t\t\t \t \t\t\t \t \t", "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\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\n\r\nn, m = map(int, input().split())\r\ncnt = 0\r\nx = [0 for i in range(6)]\r\nfor i in range(1, n+1):\r\n x[i%5] += 1\r\nfor i in range(1, m+1):\r\n cnt += x[-i%5]\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def fun(d,ubound):\r\n c = int(.1*ubound)\r\n if(d!=0 and ubound%10>=d):\r\n c+=1\r\n return c\r\nn,m = map(int,input().split(' '))\r\ncount = 0\r\nfor a in range(0,10):\r\n b = 10-a\r\n if(b==10):b=0\r\n c1= fun(a,n)\r\n c2= fun(b,m)\r\n count += c1*c2\r\n if(a<=5):\r\n b2=5-a\r\n else:\r\n b2=15-a\r\n c3=fun(b2,m)\r\n count+= c1*c3\r\nprint(count)", "t,y=input().split()\r\nm=int(t)\r\nn=int(y)\r\nc=0\r\nfor i in range(1,n+1):\r\n #for j in range(1,n+1):\r\n #print(i+j)\r\n c+=(i+m)//5-(i)//5\r\nprint(c) \r\n", "n,m = map(int,input().split())\na = [n//5 for i in range(5)]\nfor i in range(1,n%5+1):\n a[i]+=1\n# print(a)\nb = [m//5 for i in range(5)]\nfor i in range(1,m%5+1):\n b[i]+=1\nr = 0\n# for i in range(6):\n# r+= a[i]*b[5-1-i]\nr+=a[0]*b[0]\nr+=a[1]*b[4]\nr+=a[2]*b[3]\nr+=a[3]*b[2]\nr+=a[4]*b[1]\nprint(r)\n# print(a,b)\n", "import math\r\n\r\n\r\na,b=map(int,input().split())\r\ns=0\r\nfor i in range(1,a+1):\r\n s+=(b+i%5)//5\r\nprint(s)", "from collections import Counter\n\nn, m = (int(i) for i in input().split())\nx_cnt = Counter(i % 5 for i in range(1, n + 1))\ny_cnt = Counter(i % 5 for i in range(1, m + 1))\nres = sum(x_cnt[i] * y_cnt[(5 - i) % 5] for i in range(5))\nprint(res)\n", "n,m=map(int,input().split())\nmx=max(n,m)\nl=[]\nfor i in range(1,6):\n if i==5:\n l.append(int((mx+i)/5)-1)\n l.append(int((mx+i)/5))\n\ncmpt=0\nfor i in range(1,min(n,m)+1):\n if i % 5==1:\n cmpt+=l[0]\n\n elif i%5==2:\n cmpt+=l[1]\n\n elif i%5==3:\n cmpt+=l[2]\n\n elif i%5==4:\n cmpt+=l[3]\n\n elif i%5==0:\n cmpt+=l[4]\nprint(cmpt)", "def alyona(n,m):\r\n if n<=m:\r\n ans=0\r\n for i in range(1,n+1):\r\n a=i//5\r\n ans+=(m+i)//5-a\r\n else:\r\n ans=0\r\n for i in range(1,m+1):\r\n a=i//5\r\n ans+=(n+i)//5-a\r\n return ans\r\n\r\nn,m=list(map(int,input().split(\" \")))\r\n\r\nprint(alyona(n,m))\r\n\r\n", "n,m=map(int, input().split())\r\nprint(sum((m+(i+1)%5)//5 for i in range(n)))", "def MakeArray(X):\r\n Temp = [X // 5] * 5\r\n for i in range(1, X % 5 + 1):\r\n Temp[i] += 1\r\n return Temp\r\n \r\n \r\nNum = list(map(int, input().split()))\r\nFirst, Second = MakeArray(Num[0]), MakeArray(Num[1])\r\nprint(First[0] * Second[0] + sum(i * j for i, j in zip(First[1::], Second[1::][::-1])))\r\n \r\n# New start", "a,b=map(int,input().split())\r\ntot=0\r\nfor i in range(1,a+1):\r\n tot+=(b+(i%5))//5\r\nprint(tot)", "n,m = map(int,input().split())\r\nd1 = {\"1\":n//5,\"2\":n//5,\"3\":n//5,\"4\":n//5,\"0\":n//5}\r\nd2 = {\"1\":m//5,\"2\":m//5,\"3\":m//5,\"4\":m//5,\"0\":m//5}\r\nfor i in range(1,n%5+1):\r\n\td1[str(i)] = d1[str(i)] + 1\r\nfor i in range(1,m%5+1):\r\n\td2[str(i)] = d2[str(i)] + 1\r\nprint(d1[\"1\"]*d2[\"4\"]+d1[\"2\"]*d2[\"3\"]+\\\r\n\td1[\"3\"]*d2[\"2\"]+d1[\"4\"]*d2[\"1\"]+d1[\"0\"]*d2[\"0\"])", "n,m=map(int,input().split())\r\nans =0\r\nfor i in range(1,n+1):\r\n ans += (m+i)//5 - i//5\r\nprint(ans)", "n,m=map(int,input().split())\r\nprint((n//5)*(m//5)+((n-1)//5+1)*((m-4)//5+1)+((n-2)//5+1)*((m-3)//5+1)+((n-3)//5+1)*((m-2)//5+1)+((n-4)//5+1)*((m-1)//5+1));\r\n", "#Coder: Parth Dubal\n#College: GLSICA\na=input().split(\" \")\ntemp,ans,count,i,n,m=1,0,0,5,int(a[0]),int(a[1])\nif n>m: n,m=m,n\nwhile temp>0:\n\tif n>=i: temp=i-1\n\telif m>=i: temp=n\n\telif i>m: temp=n-(i-m)+1\n\tif temp>0: ans+=temp\n\ti+=5\nprint(ans)\n", "'''input\n21 21\n'''\nn, m = map(int, input().split())\nt = 0\nfor x in range(1,n+1):\n\tx = x % 5\n\tt += (m + x) // 5\nprint(t)", "def main():\r\n n, m = map(int, input().split())\r\n y = {}\r\n for i in range(1, 6):\r\n y[i] = max((m - i) // 5 + 1, 0)\r\n\r\n count = sum(y.values()) * (n // 5)\r\n rem = n % 5\r\n for i in range(1, rem + 1):\r\n count += y[5 - i]\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m = map(int,input().split())\r\nQ = []\r\nQQ = []\r\nfor i in range(n):\r\n Q.append((i+1)%5)\r\nfor i in range(m):\r\n QQ.append((i+1)%5)\r\ncnt = 0\r\ncnt+= Q.count(0)*QQ.count(0)\r\ncnt+=Q.count(1)*QQ.count(4)\r\ncnt+=Q.count(2)*QQ.count(3)\r\ncnt+=Q.count(3)*QQ.count(2)\r\ncnt+=Q.count(4)*QQ.count(1)\r\nprint(cnt)", "a,b=[int(i) for i in input().split()]\r\na0=0\r\na1=0\r\na2=0\r\na3=0\r\na4=0\r\nb0=0\r\nb1=0\r\nb2=0\r\nb3=0\r\nb4=0\r\nfor i in range(1,a+1):\r\n if i%5==0:\r\n a0=a0+1\r\n elif i%5==1:\r\n a1+=1\r\n elif i%5==2:\r\n a2+=1\r\n elif i%5==3:\r\n a3+=1\r\n else:\r\n a4+=1\r\nfor i in range(1,b+1):\r\n if i%5==0:\r\n b0=b0+1\r\n elif i%5==1:\r\n b1+=1\r\n elif i%5==2:\r\n b2+=1\r\n elif i%5==3:\r\n b3+=1\r\n else:\r\n b4+=1\r\nprint(a0*b0+a1*b4+a2*b3+a3*b2+a4*b1)\r\n", "n, m = map(int, input().split())\r\nprint(sum((m + x) // 5 - x // 5 for x in range(1, n + 1)))\r\n", "n,m =[int(x) for x in input().split()]\r\na = n//5\r\nb =m//5\r\nans = 5*a*b\r\nans += (n%5)*b\r\nans += (m%5)*a\r\nlis = [i+1 for i in range(n%5)]\r\narr = [i+1 for i in range(m%5)]\r\nfor item in lis:\r\n for sub in arr:\r\n if item + sub == 5:\r\n ans += 1 \r\nprint(ans)", "a=input()\r\nb=a.split()\r\na=int(b[0])\r\nb=int(b[1])\r\ns=(a//5)*(b//5)\r\ns=s+((a/5+0.8)//1)*((b/5+0.2)//1)\r\ns+=((a/5+0.6)//1)*((b/5+0.4)//1)\r\ns+=((a/5+0.4)//1)*((b/5+0.6)//1)\r\ns+=((a/5+0.2)//1)*((b/5+0.8)//1)\r\nprint(int(s))\r\n", "n,m = map(int,input().split())\r\nl1 = [0]*5\r\nl2 = [0]*5\r\nfor i in range(1,n+1):\r\n l1[i%5]+=1\r\nfor j in range(1,m+1):\r\n l2[j%5]+=1\r\n# print(l1,l2)\r\nans = l1[0]*l2[0]\r\nfor i in range(1,5):\r\n ans+=l1[i]*l2[5-i]\r\nprint(ans)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/682/A\r\n\r\ndef g_m(v):\r\n l_r = [0] * 5\r\n l_r[0] = v // 5\r\n for i in range(1, 5):\r\n l_r[i] = l_r[0] + (1 if v % 5 >= i else 0)\r\n \r\n return l_r\r\n\r\nx, y = map(int, input().split())\r\n\r\nl_mx = g_m(x)\r\nl_my = g_m(y)\r\n\r\nt = 0\r\nfor i in range(5):\r\n t += l_mx[i] * l_my[(5 - i) % 5]\r\n \r\nprint(t)", "from math import ceil\r\n\r\ndef main():\r\n n, m = map(int, fin().split())\r\n res = 0\r\n for i in range(1, 1+n):\r\n if i%5 == 0: res += (m - (5-i)%5)//5 \r\n else: res += (m - (5-i)%5)//5 + 1\r\n fout(res)\r\n\r\n# FastIO\r\nfrom sys import stdin, stdout\r\ntry: input, output = open(\"task.in\", \"r\"), open(\"task.out\", \"w\")\r\nexcept: input, output = stdin, stdout\r\ndef fin(): return input.readline().strip(\"\\r\\n\")\r\ndef fout(s): return output.write(str(s)+\"\\n\")\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()", "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, m=MI()\nnn={i:0 for i in range(5)}\nmm={i:0 for i in range(5)}\nfor i in range(1, n+1):\n nn[i%5]+=1\nfor i in range(1, m+1):\n mm[i%5]+=1\nans=nn[0]*mm[0]+nn[1]*mm[4]+nn[2]*mm[3]+nn[3]*mm[2]+nn[4]*mm[1]\nprint(ans)\n", "m,n=map(int,input().split())\r\na=[0]*5\r\nb=[0]*5\r\np=m%5\r\nq=n%5\r\nfor i in range (1,5):\r\n if i<=p:\r\n a[i]=int(m/5)+1\r\n else:\r\n a[i]=int(m/5)\r\na[0]=int(m/5)\r\nfor i in range (1,5):\r\n if i<=q:\r\n b[i]=int(n/5)+1\r\n else:\r\n b[i]=int(n/5)\r\nb[0]=int(n/5)\r\nprint(a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[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\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\n\r\nif m>n:\r\n n5 = n//5\r\n m5 = m//5\r\n te = 5-(m5+1)*5+m\r\n if (n5+1)*5-n <= te:\r\n tt = n5*te + te-((n5+1)*5-n)+1\r\n else:\r\n tt = n5*te\r\n ans = tt*(m5+1) + (n-tt)*m5\r\n\r\nelse:\r\n n5 = n//5\r\n m5 = m//5\r\n te = 5-(n5+1)*5+n\r\n if (m5+1)*5-m <= te:\r\n tt = m5*te + te-((m5+1)*5-m)+1\r\n else:\r\n tt = m5*te\r\n ans = tt*(n5+1) + (m-tt)*n5\r\n\r\nprint(ans)", "n, m = list(map(int, input().split()))\r\ncount = 0\r\nfirst_five = [-1] * 5\r\nfor i in range(1,5):\r\n first_five[i-1] = ((m-(5-i))//5)+1\r\nfirst_five[4] = m//5\r\ntotal_five = sum(first_five)\r\nprint(total_five*(n//5) + sum(first_five[:n%5]))", "m, n = map(int, input().split())\r\nA = [0 for x in range(5)]\r\nB = [0 for p in range(5)]\r\nfor i in range(1, m+1):\r\n A[i % 5] += 1\r\nfor i in range(1, n+1):\r\n B[i % 5] += 1\r\nprint(f'{A[0]*B[0]+A[1]*B[4]+A[2]*B[3]+A[3]*B[2]+A[4]*B[1]}')", "n,m= [int(i) for i in input().split()]\na =[]\nb =[]\npair =0\nfor i in range(4):\n a.append(n//5)\n b.append(m//5)\nfor i in range((n%5)):\n a[i] += 1\nfor i in range((m%5)):\n b[i] += 1\nfor i in range(4):\n pair += a[i]*b[3-i]\npair += (n//5)*(m//5)\nprint(pair)", "N,M = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(1, N + 1):\r\n ans += (M + (i % 5)) // 5\r\nprint(ans)", "n,m=map(int,input().split())\r\nx=n//5\r\ny=m//5\r\na=[x for i in range(5)]\r\nb=[y for i in range(5)]\r\nx=n%5\r\ny=m%5\r\nfor i in range(x):\r\n\ta[i]+=1\r\nfor i in range(y):\r\n\tb[i]+=1\r\ns=0\r\nfor i in range(5):\r\n\tif i==4:\r\n\t\ts+=a[i]*b[i]\r\n\telse:\r\n\t\ts+=a[i]*b[3-i]\r\nprint(s)\r\n", "n, m = map(int, input().split())\r\n\r\nc1 = [0] * 5\r\nc2 = [0] * 5\r\n\r\nfor x in range(1, n + 1):\r\n c1[x % 5] += 1\r\n\r\nfor y in range(1, m + 1):\r\n c2[y % 5] += 1\r\n\r\ncount = c1[0] * c2[0] + c1[1] * c2[4] + c1[2] * c2[3] + c1[3] * c2[2] + c1[4] * c2[1]\r\n\r\nprint(count)", "import sys,math\nsys.setrecursionlimit(10**8)\n'''\ndef fun():\n for i in range(16):\n for j in range(4):\n if i&(1<<j):\n print(j,end='')\n print()\nimport binarytree\nfrom collections import deque\nbst = binarytree.tree(height=4,is_perfect=True)\nprint(bst)\ndef s(bst):\n if bst:\n bst.left,bst.right = bst.right,bst.left\n s(bst.right)\n s(bst.left)\ns(bst)\nprint(bst)\n'''\nn, m = map(int,input().split())\nnarr = []\nfor i in range(1,n+1):\n narr.append(i%5)\nif m>=5:\n dig = m//5\n marr = {0:dig,1:dig,2:dig,3:dig,4:dig}\n if m%5 !=0:\n nx = m%5\n m = m-m%5\n for i in range(m+1,m+nx+1):\n marr[i%5] += 1\n ans = 0\n for i in narr:\n if abs(i-5) !=5:\n ans+= marr[abs(i-5)]\n else:\n ans+=marr[0]\n print(ans)\nelse:\n ans = 0\n marr = {0:0,1:0,2:0,3:0,4:0}\n for i in range(1,m+1):\n marr[i%5]+=1\n for i in narr:\n if abs(i-5) !=5:\n ans+= marr[abs(i-5)]\n else:\n ans+=marr[0]\n print(ans)\n\n", "a,b=map(int,input().split())\r\ne=1\r\nsum1=0\r\nsum2=0\r\nsum3=0\r\nsum4=0\r\nsum5=0\r\nkeber=0\r\nwhile(e<=b):\r\n if(e%5==4):\r\n sum1+=1\r\n elif(e%5==3):\r\n sum2+=1 \r\n elif(e%5==2):\r\n sum3+=1\r\n elif(e%5==1):\r\n sum4+=1\r\n elif(e%5==0):\r\n sum5+=1\r\n e+=1\r\nkeber+=int(a/5)*(sum1+sum2+sum3+sum4+sum5)\r\nif(a%5==0):\r\n print(keber)\r\nelif(a%5==1):\r\n print(keber+sum1)\r\nelif(a%5==2):\r\n print(keber+sum1+sum2)\r\nelif(a%5==3):\r\n print(keber+sum1+sum2+sum3)\r\nelif(a%5==4):\r\n print(keber+sum1+sum2+sum3+sum4)\r\n \r\n \r\n\r\n\r\n\r\n", "from sys import stdin\r\n#n=int(stdin.readline().strip())\r\nn,m=map(int,stdin.readline().strip().split())\r\n#s=list(map(int,stdin.readline().strip().split()))\r\ncnt=[0 for i in range(5)]\r\nans=0\r\nfor i in range(1,n+1):\r\n cnt[i%5]+=1\r\nfor i in range(1,m+1):\r\n ans+=cnt[(-i)%5]\r\nprint(ans)\r\n", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nans = 0\r\nif (m < n) :\r\n t = m\r\n m = n\r\n n = t\r\nfor i in range(1, n + 1) :\r\n x = 5 - i % 5\r\n if (m >= x) :\r\n ans += ((m - x) // 5) + 1\r\nprint(ans)", "n, m = map(int, input().strip().split())\r\ngn, gm = n // 5, m // 5\r\nxn, xm = n % 5, m % 5\r\ncount = 0\r\nfor i in range(1, xn + 1):\r\n if 5 - i in [*range(1, xm + 1)]: count += 1\r\nprint(gn * gm * 5 + gn * xm + gm * xn + count)", "import sys\n\ndef div(n, k):\n '''\n Returns the # numbers in range 1..n\n inclusive which end with k.\n\n k must be in range 0, 9.\n '''\n if k == 0:\n return n // 10\n return n // 10 + (1 if n % 10 >= k else 0)\n\ndef main(n, m):\n s = 0\n for i in range(10):\n nums = div(n, i)\n l1 = (10 - i) % 10\n l2 = (5 - i) % 10\n\n if l1 == l2:\n s += nums * div(m, l1)\n else:\n s += nums * div(m, l1)\n s += nums * div(m, l2)\n print(s)\n \n\nif __name__ == \"__main__\":\n arr = []\n for e, line in enumerate(sys.stdin.readlines()):\n arr = list(map(int, line.strip().split()))\n main(*arr)\n", "n,m=list(map(int,input().split()))\r\ncount1,count2,count3,count4,count12,count32,count42,count22=0,0,0,0,0,0,0,0\r\ncount0=0\r\ncount02=0\r\nfor i in range(1,n%10+1):\r\n if i%5==1:\r\n count1+=1\r\n if i%5==2:\r\n count2+=1\r\n if i%5==3:\r\n count3+=1\r\n if i%5==4:\r\n count4+=1\r\n if i%5==0:\r\n count0+=1\r\n \r\nfor i in range(1,m%10+1):\r\n if i%5==1:\r\n count12+=1\r\n if i%5==2:\r\n count22+=1\r\n if i%5==3:\r\n count32+=1\r\n if i%5==4:\r\n count42+=1\r\n if i%5==0:\r\n count02+=1\r\nto1inn=2*(n//10)+count1\r\n\r\nto2inn=2*(n//10)+ count2\r\nto3inn=2*(n//10)+ count3\r\nto4inn=2*(n//10)+count4\r\nto1inm=2*(m//10) + count12\r\nto2inm=2*(m//10)+ count22\r\nto3inm=2*(m//10)+ count32\r\nto4inm=2*(m//10)+ count42\r\nto0inn=2*(n//10)+count0\r\nto0inm=2*(m//10)+count02\r\nprint(to1inn*to4inm + to2inn*to3inm + to3inn*to2inm + to4inn*to1inm+to0inm*to0inn)#11 14\r\n\r\n", "n,m=input().split() \r\nn,m=int(n), int (m)\r\ncount=0 \r\nfor i in range(1,n+1): \r\n count=count+ (int((m+ ((i%5)))/5)) \r\n \r\nprint(count) ", "n,m=map(int,input().split())\r\na=max(n,m)\r\nb=min(n,m)\r\nc=b//5*a\r\nd=b%5\r\ne=a//5\r\nfor i in range(d):\r\n\tc+=e\r\n\tif 5-i-1<=a%5:\r\n\t\tc+=1\r\nprint(c)", "#\t✪ H4WK3yE乡\r\n#\tMayank Chaudhary\r\n#\tABES EC , Ghaziabad\r\n# ///==========Libraries, Constants and Functions=============///\r\nimport sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import deque,Counter\r\nfrom math import gcd,sqrt,factorial,ceil\r\nfrom itertools import permutations\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\nmini=1000000007\r\n\r\ndef fact(n): # <------ To calculate factorial of n under modulo m\r\n if n==0:\r\n return 1\r\n p=1;d=(10**9)+7\r\n for i in range(1,n+1):\r\n p=p*i\r\n p=p%d\r\n return p\r\ndef ncr(n,r): # < ------ To calculate nCr mod p value using Fermat Little under modulo m\r\n d=10**9+7\r\n num=fact(n)\r\n den=(fact(r)*fact(n-r))%d\r\n den=pow(den,d-2,d)\r\n return (num*den)%d\r\ndef sieve(n): # <----- sieve of eratosthenes for prime no.\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=p+1\r\n return prime\r\n \r\ndef binary(number): # <----- calculate the no. of 1's in binary representation of number\r\n result=0\r\n while number:\r\n result=result+1\r\n number=number&(number-1)\r\n return result\r\n\r\ndef calculate_factors(n): #<---- most efficient method to calculate no. of factors of number \r\n hh = [1] * (n + 1); \r\n p = 2; \r\n while((p * p) < n): \r\n if (hh[p] == 1): \r\n for i in range((p * 2), n, p): \r\n hh[i] = 0; \r\n p += 1; \r\n total = 1; \r\n for p in range(2, n + 1): \r\n if (hh[p] == 1): \r\n count = 0; \r\n if (n % p == 0): \r\n while (n % p == 0): \r\n n = int(n / p); \r\n count += 1; \r\n total *= (count + 1); \r\n return total; \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# ///==========MAIN=============///\r\nn,m=get_ints()\r\nrem_n=[0]*5\r\nrem_m=[0]*5\r\nif n<5:\r\n for i in range(1,n+1):\r\n rem_n[i]=1\r\nelse:\r\n store=n//5\r\n for i in range(5):\r\n rem_n[i]=store\r\n store=(n-(n//5)*5)\r\n for i in range(1,store+1):\r\n rem_n[i]=rem_n[i]+1\r\nif m<5:\r\n for i in range(1,m+1):\r\n rem_m[i]=1\r\nelse:\r\n store=m//5\r\n for i in range(5):\r\n rem_m[i]=store\r\n store=(m-(m//5)*5)\r\n for i in range(1,store+1):\r\n rem_m[i]=rem_m[i]+1\r\ni=1;j=4\r\ntotal=rem_n[0]*rem_m[0]\r\nwhile i<=4 and j>-1:\r\n total=total+rem_n[i]*rem_m[j]\r\n i=i+1\r\n j=j-1\r\nprint(total)\r\n", "n,m = map(int, input().split())\r\na = [0] * 5\r\nb = [0] * 5\r\npairs = 0\r\nfor i in range(1, n+1):\r\n\ta[i%5] += 1\r\nfor i in range(1, m+1):\r\n\tb[i%5] += 1\r\nfor i in range(5):\r\n\tif i == 0:\r\n\t\tpairs += a[0] * b[0]\r\n\telse:\r\n\t\tpairs += a[i]*b[5-i]\r\nprint(pairs)", "import math\nprecalc=[0,0,0,0,0]\nn,m=map(int,input().split())\nfor i in range(1,m+1):\n precalc[(i%5)]+=1\ncnt=0\nfor i in range(1,n+1):\n cnt+=precalc[(5-i%5)%5]\nprint(cnt)\n", "n, m=[int(y) for y in input().split()]\r\nif n>m:n, m = m, n\r\nres=0\r\nfor i in range(1, n+1):\r\n res+= ((m+i)//5)-(i//5)\r\nprint(res)", "f, s = [int(x) for x in input().split()]\na = [0] * 5\nb = [0] * 5\n\nfor i in range(f):\n index = (i+1) % 5\n a[index] += 1\n\n\nfor j in range(s):\n index = (j+1) % 5\n b[index] += 1\n\ntotal = a[0]*b[0] + a[1]*b[4] + a[2]*b[3] + a[3]*b[2] + a[4]*b[1]\nprint(total)", "n , m= map(int,input().split())\r\ns = 0\r\nfor i in range(1,m+1):\r\n s += ((n+(i%5 )))//5\r\nprint(s)\r\n''' ________\r\n|\\ /| /\\ | | | /\r\n| \\ / | / \\ | | | /\r\n| \\ / | / \\ | |_____ | /\r\n| \\/ | /------\\ | | |/\\\r\n| | / \\ | | | \\\r\n| | / \\ |______ |________ | \\\r\n \r\n \r\n ´´´´´´´´´´´´´´´´´´´´´´´´¶´´´´´´´´´¶´´´´´´´´´´´´´´´´´´´´´´´´´´\r\n ´´´´´´´´´´´´´´´´´´´´´´´´´¶´´´´´´´´´¶´´´´´´´´´´´´´´´´´´´´´´´´´\r\n ´´´´´´´´´´´´´´´´´´´´´¶´´´¶´´´´´´´´´¶´´´¶´´´´´´´´´´´´´´´´´´´´´\r\n ´´´´´´´´´´´´´´´´´´´´´¶´´¶¶´´´´´´´´´¶¶´´¶´´´´´´´´´´´´´´´´´´´´´\r\n ´´´´´´´´´´´´´´´´´´´´´¶¶´¶¶¶´´´´´´´¶¶¶´¶¶´´´´´´´´´´´´´´´´´´´´´\r\n ´´´´´´´´´´´´´¶´´´´´´¶¶´´´¶¶¶´´´´´¶¶¶´´´¶¶´´´´´´¶´´´´´´´´´´´´´\r\n ´´´´´´´´´´´´¶¶´´´´´´¶¶´´´¶¶¶´´´´´¶¶¶´´´¶¶´´´´´´¶¶´´´´´´´´´´´´\r\n ´´´´´´´´´´´¶¶´´´´´´¶¶´´´´¶¶¶¶´´´¶¶¶¶´´´´¶¶´´´´´´¶¶´´´´´´´´´´´\r\n ´´´´´´´´´´´¶¶´´´´´¶¶¶´´´´¶¶¶¶´´¶¶¶¶¶´´´´¶¶¶´´´´´¶¶¶´´´´´´´´´´\r\n ´´´´´´´¶´´¶¶¶´´´´¶¶¶¶´´´´¶¶¶¶´´´¶¶¶¶´´´´¶¶¶¶´´´¶¶¶¶´´¶´´´´´´´\r\n ´´´´´´´¶¶´¶¶¶¶¶´´¶¶¶¶´´´¶¶¶¶¶´´´¶¶¶¶¶´´´¶¶¶¶´´¶¶¶¶¶´¶¶´´´´´´´\r\n ´´´´´´´¶¶´¶¶¶¶¶´´¶¶¶¶¶¶¶¶¶¶¶´´´´´¶¶¶¶¶¶¶¶¶¶¶´´¶¶¶¶¶´¶¶´´´´´´´\r\n ´´´´´´´¶¶´¶¶¶¶¶´´¶¶¶¶¶¶¶¶¶¶¶´´´´´¶¶¶¶¶¶¶¶¶¶¶´´¶¶¶¶¶´¶¶´´´´´´´\r\n ´´´´´´¶¶¶´´¶¶¶¶´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´¶¶¶¶´´¶¶¶´´´´´´\r\n ´´´´´¶¶¶¶´´¶¶¶¶´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´¶¶¶¶´´¶¶¶¶´´´´´\r\n ´´´´¶¶¶¶´´´¶¶¶¶¶´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´¶¶¶¶¶´´´¶¶¶¶´´´´\r\n ´´´¶¶¶¶´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´¶¶¶¶´´´´\r\n ´´´¶¶¶¶¶´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´¶¶¶¶´´´´\r\n ´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´\r\n ´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´\r\n ´´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´´\r\n ´´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´´\r\n ´´´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´´´\r\n ´´´´´¶¶¶¶¶´´´´´´´´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´´´´´´´´¶¶¶¶¶´´´´´\r\n ´´´´´¶¶¶¶¶¶´´´´´´´´´´´´´¶¶¶¶¶¶¶¶¶¶¶¶¶´´´´´´´´´´´´´¶¶¶¶¶¶´´´´´\r\n ´´´´´´¶¶¶¶¶¶¶´´´´´´´´´´´´´¶¶¶¶¶¶¶¶¶´´´´´..´´´´´´´´¶¶¶¶¶¶´´´´´\r\n ´´´´´´´¶¶¶¶¶¶¶¶´´´´´´´´´´´´´¶¶¶¶¶´´´´´´´´´´´´´¶¶¶¶¶¶¶¶´´´´´´´\r\n ´´´´´´´´¶¶¶¶¶¶¶¶¶¶´´´´´´´´´´´¶¶¶´´´´´´´´´´´¶¶¶¶¶¶¶¶¶¶´´´´´´´´\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());rem_n=[0]*5;rem_m=[0]*5\r\nans=0\r\nfor i in range(1,n+1):rem_n[i%5]+=1\r\nfor j in range(1,m+1):rem_m[j%5]+=1\r\nans+=(rem_n[0]*rem_m[0])\r\nans+=(rem_n[2]*rem_m[3])\r\nans+=(rem_n[3]*rem_m[2])\r\nans+=(rem_n[1]*rem_m[4])\r\nans+=(rem_n[4]*rem_m[1])\r\nprint(ans)\r\n", "def solve(n,m):\n count = 0\n for i in range(1,n+1):\n val = 5-(i%5)\n rem = m%5\n ans = m//5\n if(val <= (rem)):\n count += ans\n count += 1\n else:\n count += ans\n \n return count\n\n\n# MAIN\nn,m = [int(ele) for ele in input().split()]\nprint(solve(n,m))", "n, m = map(int, input().split())\n \ntot = 0\nfor i in range(1, m+1):\n tot += (n + (i%5)) // 5\n\nprint(tot)", "n,m = map(int,input().split());c = 0\r\nfor i in range(1,n+1):\r\n y = 5 - (i % 5)\r\n if y<=m :q = int((m-y)/5);c += q + 1\r\nprint(c)", "def main():\n n, m = map(int, input().split())\n\n a, b = [n // 5] * 4, [m // 5] * 4,\n\n for i in range(n % 5):\n a[i] += 1\n for i in range(m % 5):\n b[i] += 1\n res = 0\n\n for i in range(4):\n res += a[i] * b[3-i]\n extra = (n // 5) * (m // 5)\n print(res + extra)\n\n\nif __name__ == '__main__':\n main()\n", "\r\n\r\nif __name__ == '__main__':\r\n n,m = map(int,input().split())\r\n a = [0]*5\r\n b = [0]*5\r\n for i in range(1,n+1):\r\n a[i%5] += 1\r\n for i in range(1,m+1):\r\n b[i%5] += 1\r\n print(a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[4]*b[1]+a[3]*b[2])", "n,m=map(int,input().split())\r\n\r\ncountn={}\r\n\r\nfor x in range(1,n+1):\r\n countn[x%5]=countn.get(x%5,0)+1\r\n\r\nres=0\r\nfor x in range(1,m+1):\r\n n=x%5\r\n if n==0:\r\n n=5\r\n res+=countn.get(5-n,0)\r\n\r\nprint(res)", "n,m=map(int,input().split())\n\ncount=0\nfor i in range(1,n+1):\n temp=i%5\n req=5-temp\n res=(m-req)//5\n count+=(res+1)\n\nprint(count)\n \n \n", "n,m = list(map(int, input().split()))\nk = 5\n\nif n < m:\n n,m = m,n\n\nmodk = [0]*k\nfor i in range(1,m+1):\n modk[i%k] += 1 \n\nans = 0\nfor i in range(1,n+1):\n ans += modk[(k - (i % k)) % k]\n\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\nfreq_n = {i: 0 for i in range(5)}\r\nfreq_m = {i: 0 for i in range(5)}\r\n\r\nfor i in range(5):\r\n freq_n[i] = n // 5\r\n freq_m[i] = m // 5\r\n\r\nfor i in range(1, (n % 5) + 1):\r\n freq_n[i] += 1\r\n \r\nfor i in range(1, (m % 5) + 1):\r\n freq_m[i] += 1\r\n\r\nres = 0\r\n\r\nres += freq_n[0] * freq_m[0]\r\nres += freq_n[1] * freq_m[4]\r\nres += freq_n[2] * freq_m[3]\r\nres += freq_n[3] * freq_m[2]\r\nres += freq_n[4] * freq_m[1]\r\n\r\nprint(res)", "from sys import stdin, stdout\r\nimport sys\r\nINF=1e11\r\nimport math\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\nfrom collections import defaultdict \r\n#for _ in range(int(stdin.readline())):\r\nd=defaultdict(int)\r\nn,m=get_ints()\r\nfor i in range(1,m+1):\r\n d[i%5]+=1\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=d[(5-i%5)%5]\r\nprint(ans) ", "n,m = map(int,input().split())\nn1 = []\nn2 = []\nn3 = []\nn4 = []\nn0 = []\nm1 = []\nm2 = []\nm3 = []\nm4 = []\nm0 = []\nfor i in range(1,n+1):\n if i % 5 == 0:\n n0.append(i)\n elif i % 5 == 1:\n n1.append(i)\n elif i%5 == 2:\n n2.append(i)\n elif i % 5 == 3:\n n3.append(i)\n else:\n n4.append(i)\nfor i in range(1,m+1):\n if i % 5 == 0:\n m0.append(i)\n elif i % 5 == 1:\n m1.append(i)\n elif i%5 == 2:\n m2.append(i)\n elif i % 5 == 3:\n m3.append(i)\n else:\n m4.append(i)\nprint((len(n1)*len(m4))+(len(n2)*len(m3))+(len(n0)*len(m0))+(len(m1)*len(n4))+(len(m2)*len(n3)))", "n, m = list(map(int, input().split()))\r\nnd = n // 5\r\nmd = m // 5\r\nnm = n % 5\r\nmm = m % 5\r\nans = 5 *(nd*md) + (nm * md) + (mm * nd ) \r\nfor i in range(1, nm + 1):\r\n for j in range (1, mm + 1):\r\n if ((i + j ) % 5 == 0): ans += 1\r\nprint(ans)", "m , n = list(map(int , input().split()))\r\n\r\n\r\nc = 0 \r\n\r\nfor i in range(1 , n +1 ):\r\n c += (i + m ) // 5 - (i//5)\r\nprint(c)", "def number_of_pairs(n, m):\r\n pairs_count = 0 \r\n\r\n for i in range(1, n + 1):\r\n start = (5 - i % 5) % 5\r\n if start == 0:\r\n start += 5\r\n \r\n count = (m - start + 1) // 5\r\n if (m - start + 1) % 5 != 0:\r\n count += 1\r\n pairs_count += count\r\n \r\n \r\n return pairs_count\r\n \r\n \r\n \r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n a = list(map(int,input().split()))\r\n n, m = a[0], a[1]\r\n print(number_of_pairs(n, m))\r\n \r\n", "n,m = map(int, input().split())\r\npair=0\r\nfor i in range(1,5):\r\n a = n//5 + (n%5 >= i)\r\n b = m//5 + (m%5 >= (5-i))\r\n pair += a*b\r\n # print(i, a,5-i, b, pair)\r\npair += (n//5) * (m//5)\r\n# print(n,m)\r\nprint(pair)", "x,y=map(int, input().split());\r\nans = 0;\r\nfor i in range(1,x+1):\r\n ans += ((i%5)+y)//5;\r\nprint(ans);", "n,m = map(int,input().split())\r\nres = 0\r\nfor i in range(1,m+1):\r\n res+=(n+(i%5))//5\r\nprint(res)", "from sys import stdin\r\n\r\ndef get_input():\r\n input_str = stdin.read().strip().split(' ')\r\n\r\n n, k = input_str\r\n\r\n return int(n), int(k)\r\n\r\ndef get_count(m, n):\r\n count, mn, mx = 0, min(m, n), max(m, n)\r\n\r\n for i in range(1, mn + 1):\r\n rem = i % 5\r\n a = 5 - rem if rem > 0 else 0\r\n count += (mx - a) // 5 + 1\r\n if rem == 0:\r\n count -= 1\r\n\r\n return count\r\n\r\n\r\nprint(get_count(*get_input()))\r\n", "n, m = map(int, input().split())\r\nres = 0\r\n\r\nfor i in range(1, n + 1):\r\n res += (m + (i % 5)) // 5\r\n\r\nprint(res)\r\n", "n,m = map(int, input().split())\r\n\r\nfirst = [0 for i in range(5)]\r\nsec = [0 for i in range(5)]\r\n\r\nfor i in range(1, m+1):\r\n first[i%5] += 1\r\nfor i in range(1, n+1):\r\n sec[i%5] += 1\r\n \r\nanswer = first[0]*sec[0] + first[1]*sec[4] + first[2]*sec[3] + first[3]*sec[2] + first[4]*sec[1]\r\nprint(answer)\r\n ", "from sys import stdin,stdout,exit\r\nimport math\r\nfrom fractions import gcd\r\ndef sin(): \r\n\treturn stdin.readline().rstrip()\r\ndef listInput():\r\n\treturn list(map(int,sin().split()))\r\ndef printBS(li):\r\n\tif not li: return\r\n\tfor i in range(len(li)-1):\r\n\t\tstdout.write(\"%d \"%(li[i]))\r\n\tstdout.write(\"%d\\n\"%(li[-1]))\r\nn,m=listInput()\r\nans=0\r\nfor i in range(1,n+1):\r\n\ta=(-i)%5\r\n\tif a==0 : a=5\r\n\tif a>m: continue\r\n\tans+=(m-a+5)//5\r\nprint(ans)", "n,m=map(int,input().split())\r\na=[int(n/5) for i in range(5)]\r\nif n%5==4:\r\n a[0]+=1\r\n a[1]+=1\r\n a[2]+=1\r\n a[3]+=1\r\nelif n%5==3:\r\n a[1]+=1\r\n a[2]+=1\r\n a[3]+=1\r\nelif n%5==2:\r\n a[2]+=1\r\n a[3]+=1\r\nelif n%5==1:\r\n a[3]+=1\r\nfinal=sum(a)*int(m/5)\r\ntemp=m%5\r\nfor i in range(temp):\r\n final+=a[i]\r\nprint(final)", "n,m = map(int,input().split())\nmin_nm = min(n,m)\nmax_nm = max(n,m)\ncount = 0\nfor i in range(1,min_nm + 1):\n count += ((i+max_nm)//5 - (i + 1)//5)\n if ((i + 1) % 5) == 0:\n count += 1; \n\nprint(count)\n", "n, m = map(int, input().split())\r\nprint(2*n*(m//10) + 2*(m%10)*(n//10) + sum([sum([1 if (i + j)%5 == 0 else 0 for i in range(1,1+n%10)]) for j in range(1,1+m%10)]))", "n , m = list(map(int,input().split()))\r\nif m > n : n , m = m , n\r\nans = 0\r\nfor i in range(1,m + 1):\r\n a = (i // 5 + 1) * 5 - i\r\n ans += ((n - a) // 5) + 1\r\nprint(ans)", "n,m=map(int,input().split())\r\nif n>m:\r\n n,m=m,n\r\nc=0\r\nfor i in range(1,n+1):\r\n if i%5==1:\r\n c+=(m+1)//5\r\n elif i%5==2:\r\n c+=(m+2)//5\r\n elif i%5==3:\r\n c+=(m+3)//5\r\n elif i%5==4:\r\n c+=(m+4)//5\r\n elif i%5==0:\r\n c+=(m//5)\r\nprint(c) \r\n ", "n, m = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1,n+1):\r\n count += ((m-(5-(i%5)))//5)+1 if i%5 != 0 else (m//5)\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n res=0\r\n res+=i//5\r\n ans+=(i+m)//5\r\n ans-=res\r\nprint(ans) \r\n", "n , m = map(int,input().split())\ntotal = 0\nd = {}\nfor i in range(1,n+1):\n val = i%5\n if val in d:\n d[val]+=1\n else:\n d[val] = 1\nfor i in range(1,m+1):\n val =i%5\n if(val==0 and val in d):\n total+=d[val]\n else:\n val = 5-val\n if(val in d):\n total+=d[val]\nprint(total)\n", "a , b = map(int,input().split())\nres = a * (b //5) \nfor i in range(1,a+1):\n for j in range(1,b%5+1):\n if (i + j) %5 ==0 :\n res +=1\n\n# res += b * (a//5) \nprint(res)", "n , m = [int(x) for x in input().split()]\r\n\r\nnp = n * (m//5 )\r\nfor i in range(4 , 4 - m % 5 , -1):\r\n np += (5 - i + n)//5\r\nprint(np)", "t = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\nc = 0\r\nfor i in range(1,n+1):\r\n c+=(m+i)//5-i//5\r\nprint(c)", "n,m = map(int,input().split());acc = 0\r\nfor i in range(1,min(n,m)+1):acc+=((i+max(n,m))//5)-(i//5)\r\nprint(acc)", "n, m = tuple(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(0, 5):\r\n\ta = n // 5\r\n\tb = m // 5 \r\n\t\r\n\tif i == 0:\r\n\t\ta -= 1\r\n\tif n % 5 >= i:\r\n\t\ta += 1\r\n\tif m % 5 >= (5 - i):\r\n\t\tb += 1\r\n\t\t\r\n\tans += a * b\r\n\t\r\nprint(ans)", "n,m=map(int, input().split())\r\nprint(sum((m+(i)%5)//5 for i in range(1 ,n+1)))", "def f(l):\r\n n,m = l\r\n c1 = [(n+5-i)//5 for i in range(5)]\r\n c2 = [(m+5-i)//5 for i in range(5)]\r\n return (c1[0]-1)*(c2[0]-1)+sum([c1[i]*c2[5-i] for i in range(1,5)])\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "a, b = map(int, input().split())\r\nx, y = a//5, b//5\r\ncnt = 0\r\nfor i in range(1,a%5 + 1):\r\n for j in range(1, b%5 + 1):\r\n if (i + j) % 5 == 0: cnt += 1\r\nprint(cnt + x*y*5 + (a%5) * y + (b%5) * x)", "def compute():\n n, m = map(int,input().split())\n ans = 0\n for it in range(1,n+1):\n ans += (m+it%5)//5\n return ans\n\nif __name__==\"__main__\":\n print(compute())\n", "a,b=map(int,input().split())\r\nf=0\r\nj=0\r\nfor i in range(1,1+5):\r\n f=(b+(i%5))//5\r\n h=(a+(5-i))//5\r\n j+=f*h\r\nprint(j)\r\n", "n,m=[int(x) for x in input().split()]\r\nk=0\r\nfor i in range(1,(n+m)//5+1):\r\n\tk+=min(m,n,5*i-1)\r\n\tif 5*i>max(m,n):\r\n\t\tk-=(5*i-max(m,n)-1)\r\nprint(k)", "from math import ceil,floor\r\nn,m = map(int, input().split())\r\nres = 0\r\nfor i in range(1,n+1):\r\n req = 5 - i%5\r\n res += ((m-req) // 5) +1 \r\nprint(res)\r\n", "a,b = map(int,input().split());cnt = 0\r\nfor i in range(1,a+1):\r\n cnt+=(b+(i%5))//5\r\nprint(cnt)", "n,m=map(int,input().split())\r\nprint(sum((m+((i)%5))//5 for i in range(1, n+1)))", "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\nans = 0\r\nfor i in range(1, n + 1):\r\n ans += (i + m) // 5 - i // 5\r\nprint(ans)", "n, m = map(int, input().split())\r\n\r\nres = 0\r\na = [None] * 5\r\nfor i in range(5):\r\n\ta[i] = 0\r\n\r\nfor i in range(1, m+1):\r\n\ta[i % 5] += 1\r\n\r\nfor i in range(1, n+1):\r\n\tres += a[(5 - (i%5))%5]\r\n\r\nprint(res)", "n,m=map(int, input().split())\nans=0\nfor i in range(1,n+1):\n ans+=(m+i)//5 - i//5\nprint(ans)\n", "n, m = map(int, input().split(\" \"))\n\ncounter = 0\n\nfor i in range(1, m+1):\n no = i % 5\n counter += (n+(i % 5))//5\n\nprint(counter)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \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############ ---- Solution ---- ############ \r\nn,m = invr()\r\nm_rests = [0]*5\r\nn_rests = [0]*5\r\n\r\nfor i in range(1,n+1):\r\n n_rests[i%5]+=1\r\nfor j in range(1,m+1):\r\n m_rests[j%5]+=1\r\nresult = n_rests[0]*m_rests[0]\r\nfor i in range (1,5):\r\n result+=n_rests[i]*m_rests[5-i]\r\nprint(result)", "#Upto n and m divided by 5\r\ntemp=input()\r\ntemp=temp.split(\" \")\r\nn=int(temp[0])\r\nm=int(temp[1])\r\nsum=(n//5)*(5*(m//5))\r\n#Only n more than range\r\ntemp=(n%5)*(m//5)\r\n#only m more than range\r\nsum=sum+temp\r\ntemp=(m%5)*(n//5)\r\nsum=sum+temp\r\n\r\n#both n and m out of range\r\nn=n%5\r\nm=m%5\r\nfor x in range(1,n+1):\r\n for y in range(1,m+1):\r\n if x+y==5:\r\n sum+=1\r\nprint(sum)", "def calculate_possibilities(start, end):\r\n possibility1 = (start-1)//5\r\n possibility2 = end//5\r\n return possibility2-possibility1\r\n\r\n\r\nn, m = [int(x) for x in input().split()]\r\npossibilities = [0, 0, 0, 0, 0]\r\ntotal = 0\r\nfor i in range(1, min(n, 5)+1):\r\n possibilities[i-1] = calculate_possibilities(1+i, m+i)\r\n total += possibilities[i-1]\r\n\r\nif n <= 5:\r\n print(total)\r\nelse:\r\n print(total*(n//5)+sum(possibilities[:(n%5)]))\r\n", "import math\nn,m = map(int,input().split())\nn_= [0]*5\nm_ = [0]*5\nfor i in range(1,n+1):\n\tn_[i%5] += 1\nfor i in range(1,m+1):\n\tm_[i%5] += 1\n#print(n_)\n#print(m_)\n\nprint(n_[1]*m_[4] + n_[2]*m_[3] + n_[3]*m_[2] + n_[4]*m_[1] + n_[0]*m_[0])\t", "n,m=map(int,input().split())\r\nma=max(n,m)\r\nmi=min(n,m)\r\nc=0\r\nif n>=5 and m>=5:\r\n \r\n x=ma%5\r\n if(x==0):\r\n x5=((ma-5)//5)+1\r\n else:\r\n x5=((ma-x)-5)//5 + 1\r\n if(x==1):\r\n x4=(((ma)-1)//5)+1\r\n else:\r\n x4=(((ma-x)-5)//5)+1\r\n if(x==2):\r\n x3=(((ma)-2)//5)+1\r\n else:\r\n x3=(((ma-x)-5)//5)+1\r\n if(x==3):\r\n x2=(((ma)-3)//5)+1\r\n else:\r\n x2=(((ma-x)-5)//5)+1\r\n if(x==4):\r\n x1=(((ma)-4)//5)+1\r\n else:\r\n x1=(((ma-x)-5)//5)+1\r\n if ma%5==1:\r\n x4=x4\r\n elif ma%5==2:\r\n x4=x4+1\r\n \r\n elif ma%5==3:\r\n x4=x4+1\r\n x3=x3+1\r\n \r\n elif ma%5==4:\r\n x4=x4+1\r\n x3=x3+1\r\n x2=x2+1\r\n \r\n for i in range (1,mi+1):\r\n l=i%5\r\n if l==1:\r\n c+=x1\r\n if l==2:\r\n c+=x2\r\n if l==3:\r\n c+=x3\r\n if l==4:\r\n c+=x4\r\n if l==0:\r\n c+=x5\r\n print (c)\r\n #print (x1,x2,x3,x4,x5)\r\nelse:\r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if (i+j)%5==0:\r\n c+=1\r\n print(c)\r\n \r\n", "n,m = map(int,input().split())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n\r\n count += (i+m)//5-i//5\r\n\r\nprint(count)", "n, m = map(int, input().split(\" \"))\nres = 0\nprint(sum((((i+1)%5+m)//5)*(n//5+1) for i in range(5) if n%5>=(i+1))+\n sum((((i+1)%5+m)//5)*(n//5) for i in range(5) if n%5<(i+1)))\n", "m,n=input().split()\r\nm = int(m)\r\nn = int(n)\r\nM=m//10\r\nMM=m%10\r\na=[M]*10\r\nfor i in range(MM):\r\n a[i+1]+=1;\r\n\r\nN=n//10\r\nNN=n%10\r\nb=[N]*10\r\nfor i in range(NN):\r\n b[i+1]+=1;\r\n\r\nans = (a[0]+a[5])*(b[5]+b[0]) + (a[1]+a[6])*(b[4]+b[9]) + (a[2]+a[7])*(b[3]+b[8]) + (a[3]+a[8])*(b[2]+b[7]) + (a[4]+a[9])*(b[1]+b[6])\r\nprint(ans)", "#682A\r\n[b,k] = list(map(int,input().split()))\r\nbq = b//5\r\nkq = k//5\r\nbr = b%5\r\nkr = k%5\r\ns = bq*kq\r\nfor i in range(1,5):\r\n if br >= i:\r\n bm = bq+1\r\n else:\r\n bm =bq\r\n if kr >= 5-i:\r\n km = kq+1\r\n else:\r\n km =kq\r\n s += bm*km\r\nprint(s)", "n, m = [int(x) for x in input().split()]\na = [0,0,0,0,0]\nb = [0,0,0,0,0]\nfor i in range(1,n+1):\n a[i%5] += 1\nfor i in range(1,m+1):\n b[i%5] += 1 \nprint(a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[1]) ", "arr = input().split()\r\n\r\nm = int(arr[0])\r\nn = int(arr[1])\r\n\r\nmodm = [m // 5, m // 5, m // 5, m // 5, m // 5]\r\nmodm[:m % 5] = [m // 5 + 1 for i in range(m % 5)]\r\n\r\nmodn = [n // 5, n // 5, n // 5, n // 5, n // 5]\r\nmodn[:n % 5] = [n // 5 + 1 for i in range(n % 5)]\r\n\r\nprint(modm[0] * modn[3] + modm[1] * modn[2] + modm[2] * modn[1] + modm[3] * modn[0] + modm[4] * modn[4])", "n,m=map(int,input().split())\r\nm1=min(n,m)\r\nm2=max(n,m)\r\nc=0\r\nr=m2%5\r\nfor i in range(1,m1+1):\r\n if i%5>=5-r:\r\n c=c+m2//5+1\r\n else:\r\n c=c+m2//5\r\nprint(c)", "n,m = [int(x) for x in input().split()]\r\nfreq1 = [0 for x in range(5)]\r\nfreq2 = [0 for x in range(5)]\r\nfor i in range(1,n+1):\r\n freq1[i%5]+=1\r\nfor i in range(1,m+1):\r\n freq2[i%5]+=1\r\nc=0\r\nfor i in range(5):\r\n c+= freq1[i%5]*freq2[abs(5-i)%5]\r\nprint(c)\r\n", "import sys\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef f(x, k):\r\n\tif k == 0:\r\n\t\treturn x//5\r\n\treturn (x+5-k)//5\r\n\t\r\n\r\nn,m = map(int,minp().split())\r\nr = 0\r\nfor i in range(5):\r\n\t#print(f(n,i),f(m,5-i))\r\n\tr += f(n,i)*f(m,5-i)\r\nprint(r)", "n,k=map(int,input().split())\r\nr0=r1=r2=r3=r4=0\r\nk0=k1=k2=k3=k4=0\r\nfor x in range(1,n+1):\r\n if x%5==0:\r\n r0+=1\r\n if x%5==1:\r\n r1+=1\r\n if x%5==2:\r\n r2+=1\r\n if x%5==3:\r\n r3+=1\r\n if x%5==4:\r\n r4+=1\r\nfor x in range(1,k+1):\r\n if x%5==0:\r\n k0+=1\r\n if x%5==1:\r\n k1+=1\r\n if x%5==2:\r\n k2+=1\r\n if x%5==3:\r\n k3+=1\r\n if x%5==4:\r\n k4+=1\r\nprint(r0*k0+r1*k4+r2*k3+r3*k2+r4*k1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n,m = [int(inp) for inp in input().split()]\r\n ans = 0\r\n for i in range(5):\r\n k = (m+(5-i)%5)//5\r\n l = (n+i)//5\r\n ans += k*l\r\n print(ans)\r\n\r\n \r\nif __name__ == '__main__':\r\n main()", "a,b = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(1,min(6,a+1)):\r\n x = 5 - i\r\n m_val = ((b-x)//5) + 1\r\n n_val = ((a-i)//5) + 1\r\n # print(\"for i \",i,m_val,n_val)\r\n if m_val>0 and n_val>0:\r\n ans += m_val * n_val\r\n if i==5:\r\n ans -=n_val\r\nprint(ans)", "n, m = map(int, input().split())\r\nkq = 0\r\nfor i in range(1, n+1):\r\n u = i%5\r\n v = 5-u if u>0 else 0\r\n d = ((1-v)+4)//5\r\n c = (m -v)//5\r\n kq += c -d+1\r\nprint(kq)", "a,b=map(int,input().split())\r\nc=max(a,b)\r\nd,r,s=c//5,c%5,0\r\nfor x in range(1,min(a,b)+1):\r\n\tif (r+x%5)//5==1:s+=(d+1)\r\n\telse:s+=d\r\nprint(s)\r\n", "n, m = map(int, input().split())\r\nnn = n + (5-n%5)%5\r\nmm = m + (5-m%5) % 5\r\nans = (nn * mm) // 5 - (mm - m) * nn//5 - (nn-n) * mm//5\r\nfor i in range(n+1, nn + 1):\r\n for j in range(m + 1, mm + 1):\r\n if (i + j) % 5 == 0:\r\n ans += 1\r\nprint(ans)", "def generateSums(num1,num2):\r\n a = []\r\n b = []\r\n for i in range(5):\r\n a.append(0)\r\n b.append(0)\r\n for i in range(num1+1):\r\n a.append(0)\r\n for i in range(num2+1):\r\n b.append(0)\r\n for i in range(1,num1+1):\r\n a[i%5] +=1\r\n for i in range(1,num2+1):\r\n b[i%5] +=1\r\n return (a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[1])\r\n\r\n\r\n\r\nnums = input().split()\r\nprint(generateSums(int(nums[0]),int(nums[1])))\r\n#items = input().split()\r\n", "def count_pairs_multiples_5(m, n):\r\n answer = (n//5)*(m//5)\r\n \r\n for i in range(1,5):\r\n current_x = n//5\r\n current_y = m//5\r\n if(n%5 >= i):\r\n current_x = current_x + 1\r\n if(m%5 >= 5 - i):\r\n current_y = current_y + 1\r\n answer = answer + (current_x*current_y)\r\n return answer\r\n\r\nx, y = map(int, input().split())\r\nans = count_pairs_multiples_5(x,y)\r\nprint(ans)", "import math\r\nn, m =map(int, input().split())\r\nif (n>m):\r\n temp = n\r\n n = m\r\n m = temp\r\nresult = 0\r\nfor i in range(1, n+1):\r\n result += int((m+i%5)/5)\r\nprint(result)\r\n", "n, m = map(int, input().split())\n\nresidues = [0] * 5\n\nfor i in range(1, n + 1):\n residues[i%5] += 1\n\npairs = 0\nfor i in range(1, m+1):\n pairs += residues[(5 - i)%5]\n\nprint(pairs)\n\n", "a,b = map(int, input().split())\r\nsum = 0\r\nfor i in range(1, a + 1):\r\n sum = sum + (b+i%5)//5\r\nprint(sum)", "n, m = map(int, input().split())\r\nval = [0] * 5\r\nfor i in range(5):\r\n val[i] = (m // 5) + (1 if m % 5 >= 4 - i and i != 4 else 0)\r\n\r\nprint((sum(val) * (n // 5)) + sum(val[:n % 5]))\r\n", "n,m = map(int,input().split())\r\nsum=0\r\nfor i in range(1,n+1):\r\n for j in range(1,(m-((5*(m//5))))+1):\r\n if (i+j) % 5==0:\r\n sum+=1\r\nprint(n*(m//5)+sum)", "n,m = list(map(int,input().split()))\r\nS=0\r\nfor i in range(1,n+1):\r\n\t\tS+=((m-(5*(i//5)+5)+i)//5)+1\r\nprint(S)\t\t\r\n", "import math\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans*= i\r\n return ans\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)*c)\r\n\r\nn,m =map(int, input().split())\r\nn,m = min(n,m), max(n,m)\r\nd = {i:0 for i in range(5)}\r\nfor i in range(1, n+1):\r\n d[i%5]+=1\r\nans = 0\r\nfor i in range(1, m+1):\r\n ans+=d[(5-(i%5))%5]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\nif n > m: \n\tn, m = m, n\n\ntotal = 0\nfor i in range(1, n+1):\n\n\ttotal += (m - 5 + i % 5) // 5 + 1\n\nprint(total)", "n, m = [int(i) for i in input().split()]\n\nc = 0\n\nfor i in range(1, min([n, m]) + 1):\n\tc += (max([n, m]) - (5 - (i%5)))//5 + 1\n\nprint(c)\n", "from collections import Counter\n\nn,m = list(map(int, input().split()))\nk = 5\n\nn, m = max(n,m), min(n,m)\n\nam = [i%k for i in range(1,m+1)]\n\nmodk = Counter(am)\n\nans = 0\nfor i in range(1,n+1):\n ans += modk[(k - (i % k)) % k]\n\nprint(ans)\n", "n, m = list(map(int, input().split(\" \")))\r\ncount = 0\r\n\r\na = [0, 0, 0, 0, 0]\r\nb = [0, 0, 0, 0, 0]\r\n\r\nfor i in range(1, n + 1):\r\n a[i % 5] += 1\r\n\r\n\r\nfor i in range(1, m + 1):\r\n b[i % 5] += 1\r\n\r\ncount = a[0] * b[0] + a[1] * b[4] + a[2] * b[3] + a[3] * b[2]+ a[4] * b[1]\r\nprint(count)", "x,y = map(int,input().split())\r\nc = []\r\nfor i in range(x):\r\n c.append((y+((i+1)%5)) //5)\r\nprint(sum(c))\r\n", "k = list(map(int,input().split()))\r\nn = k[0]\r\nm = k[1]\r\nListN = [n//5,n//5,n//5,n//5,n//5]\r\nListM = [m//5,m//5,m//5,m//5,m//5]\r\n\r\nRn = n%5\r\nRm = m%5\r\nfor i in range (0,Rn):\r\n ListN[i] +=1\r\nfor i in range (0,Rm):\r\n ListM[i] +=1\r\n# print(ListN)\r\n# print(ListM)\r\nans = ListN[0]*ListM[3] + ListN[1]*ListM[2] + ListN[2]*ListM[1] + ListN[3]*ListM[0] + ListN[4]*ListM[4]\r\nprint(ans)", "n,m= map(int, input().split())\r\nf = 0\r\nfor i in range(1,n+1):\r\n f+=(m+(i%5))//5\r\nprint(f)", "#class bebo : \r\n # def __init__(self) :\r\n # print(\"baraa1\")\r\n\r\n#class bebo2 : \r\n # def __init__(self):\r\n # print(\"baraa2\")\r\n\r\n#class bebo3(bebo2,bebo) : \r\n # def __init__(self):\r\n # super().__init__()\r\n\r\n#div = bebo3()\r\nn,m=input().split()\r\nn,m=int(n),int(m)\r\ncount=0\r\nfor i in range(1,n+1):\r\n count=count+(int((m+((i%5)))/5))\r\nprint(count)", "from sys import stdin\r\nfrom math import floor\r\n\r\ndef main():\r\n n, m = list(map(int, stdin.readline().strip().split()))\r\n t = 0\r\n for i in range(1, n+1):\r\n t += floor((m+i)/5) - floor(i/5)\r\n print(t)\r\n\r\nmain()", "\nl = list(map(int, input().split()))\nk = min(l)\nj = max(l)\n\ncount = 0\n\n\nfor i in range(1, k+1):\n a = (i//5) * 5\n count += ((j+i)-a)//5\n\nprint(count)\n", "n, m = map(int, input().split())\r\nsum_ = 0\r\nfor i in range(1, n + 1):\r\n sum_ += (m + i % 5) // 5\r\nprint(sum_)\r\n", "n,m=[int(x) for x in input().split()]\r\nc=0\r\nfor i in range(1,n+1):\r\n c=c+((i+m)//5)-i//5\r\nprint(c) \r\n", "\r\nns = [0] * 5\r\nms = [0] * 5\r\nn,m = map(int, input().split())\r\nfor i in range(1,n+1):\r\n ns[i%5] += 1\r\n\r\nfor i in range(1,m+1):\r\n ms[i%5] += 1\r\n\r\nprint(ns[0]*ms[0]+ns[1]*ms[4]+ns[2]*ms[3]+ns[3]*ms[2]+ns[4]*ms[1])\r\n\r\n", "x,y = map(int, input().split())\r\ndef createmods(n):\r\n # a list s.t. [i] = number of integers <=n that is i(mod 5)\r\n list = [n//5]*5\r\n for i in range (0,n%5):\r\n list[i+1]+=1\r\n return list\r\n\r\nxmod = createmods(x)\r\nymod = createmods(y)\r\n#print(xmod, ymod)\r\n#0+0, 1+4, 2+3, 3+2, 4+1\r\nans = xmod[0]*ymod[0]+xmod[1]*ymod[4]+xmod[2]*ymod[3]+xmod[3]*ymod[2]+xmod[4]*ymod[1]\r\nprint(ans)", "n,m=map(int,input().split())\r\nprint(sum((m+(i%5))//5 for i in range(1,n+1)))", "n, m = map(int, input().split())\r\n\r\nans = 0\r\n\r\nfor i in range (5):\r\n if (i == 0):\r\n ans += (n//5)*(m//5)\r\n \r\n else:\r\n ans += (((n - i)//5) + 1) * (((m - (5 - i))//5) + 1)\r\n \r\n \r\n\r\nprint (ans)\r\n\n# Sat Oct 29 2022 19:05:37 GMT+0300 (Moscow Standard Time)\n", "n,m=map(int,input().split())\r\n\r\nmap1={0:0,1:0,2:0,3:0,4:0}\r\nmap2={0:0,1:0,2:0,3:0,4:0}\r\n\r\nfor i in range(1,n+1):\r\n val = i%5\r\n map1[val]+=1\r\n \r\nfor i in range(1,m+1):\r\n val=i%5\r\n map2[val]+=1\r\n \r\nans=0\r\nfor i in range(5):\r\n if(i!=0):\r\n ans+=map1[i]*map2[abs(5-i)]\r\n \r\nif(map1[0]!=0 and map2[0]!=0):\r\n ans+=map1[0]*map2[0]\r\n \r\nprint(ans)", "n,m = map(int, input().split( ))\r\ncount = 0\r\nif(n >= m):\r\n for i in range(1,m+1):\r\n count += (n+i)//5 - i//5\r\nelse:\r\n for i in range(1,n+1):\r\n count += (m+i)//5 - i//5\r\n \r\nprint(count)", "#Coder: Parth Dubal\n#College: GLSICA\nimport itertools \na=input().split(\" \")\ncount=0\ntemp,ans=1,0\nn,m=int(a[0]),int(a[1])\nif n>m:\n\tn,m=m,n\ni=5\nwhile temp>0:\n\tif n>=i:\n\t\ttemp=i-1\n\telif m>=i:\n\t\ttemp=n\n\telif i>m:\n\t\ttemp=n-(i-m)+1\n\tif temp>0:\n\t\tans+=temp\n\ti+=5\nprint(ans)\n", "t = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\nc = 0\r\nfor i in range(1,n+1):\r\n c+= ((i+m)//5)-(i//5)\r\nprint(c)", "inp=input().split()\r\nn=int(inp[0])\r\nm=int(inp[1])\r\n\r\nd={}\r\n\r\nA=min(n,m)\r\nB=max(n,m)\r\n\r\nfor i in range(1, A+1):\r\n \r\n num=i%5\r\n if(num==0):\r\n num=5\r\n \r\n \r\n if(num not in d):\r\n d[num]=1\r\n else:\r\n d[num]=d.get(num)+1\r\n\r\ncount=0\r\nfor i in range(1,B+1):\r\n \r\n num2=i%5\r\n sol=5-num2\r\n \r\n if(sol in d):\r\n count+=d.get(sol)\r\n \r\nprint(count)\r\n \r\n \r\n ", "n,m=sorted(map(int,input().split()))\nres=[0]*5\nres[0]=m//5\nfor i in range(1,5):\n start=5-i\n if(5*res[0])+start<=m:\n res[i]= res[0]+1\n else:\n res[i]=res[0]\nsu=0\nfor i in range(1,n+1):\n su+=res[i%5]\nprint(su)", "a,b = map(int,input().split())\r\nd,p ={},{}\r\nfor i in range(1,6):\r\n\tif i<=a%5:d[i]=a//5 +1\r\n\telse:d[i]=a//5\r\n\tif i<=b%5:p[i]=b//5 +1\r\n\telse:p[i]=b//5\r\nz =d[5]*p[5]\r\nfor i in range(1,5):\r\n\tz+=d[i]*p[5-i]\r\nprint(z)", "import math\r\nn,m=map(int,input().split(\" \"))\r\ncount=0\r\nans=set()\r\nfor x in range(1,min(n,m)+1):\r\n if x%5==0:\r\n count=count+((max(n,m))+x%5)//5\r\n #print(x,(max(n,m)+x%5)//5)\r\n else:\r\n count=count+((max(n,m)+x%5))//5\r\n #print(x,(max(n,m)+x%5)//5)\r\nprint(count)\r\n ", "\r\nn,m=map(int, input().split())\r\nf1=[n//5 for i in range(5)]\r\nf2=[m//5 for i in range(5)]\r\nfor i in range(n%5):\r\n f1[i]+=1\r\nfor i in range(m%5):\r\n f2[i]+=1\r\nprint(f1[0]*f2[3] + f1[1]*f2[2] + f1[2]*f2[1] + f1[3]*f2[0] + f1[4]*f2[4])\r\n\r\n\r\n\r\n", "m, n = map(int, input().split())\r\nm, n = max(m,n), min(m,n)\r\nfirstTerm = lambda x: 5-(x%5)\r\ncount = 0\r\nfor val in range(1, n+1):\r\n a = firstTerm(val)\r\n count += (m-a)//5 + 1\r\nprint(count)\r\n", "from math import floor\r\n\r\nn, m = map(int, input().split())\r\ncounter = 0\r\n\r\nfor number in range(1, n + 1):\r\n counter += floor((m - (5 - (number % 5))) / 5) + 1\r\n\r\nprint(counter)\r\n", "n,m = map(int,input().split())\r\n\r\nnum1 = [0]*5\r\nnum2 =[0]*5\r\nfor i in range(5):\r\n num1[i] = n//5\r\n if n%5>=i: num1[i]+=1\r\n num2[i] = m//5\r\n if m%5 >= i: num2[i]+=1\r\n \r\nnum1[0]-=1\r\nnum2[0]-=1\r\n\r\nans = num1[0]*num2[0]+num1[1]*num2[4]+num1[2]*num2[3]+num1[3]*num2[2]+num1[4]*num2[1]\r\nprint(ans)", "from sys import stdin\r\n\r\nn,m = map(int,stdin.readline().split())\r\n\r\nd1 = {}\r\nd2 = {}\r\nfor i in range(1,6):\r\n\td1[i]=0\r\n\td2[i]=0\r\nfor i in range(1,n+1):\r\n\tif i%5==0:\r\n\t\tif 5 in d1:\r\n\t\t\td1[5]+=1\r\n\t\telse:\r\n\t\t\td1[5]=1\r\n\telse:\r\n\t\tif i%5 in d1:\r\n\t\t\td1[i%5]+=1\r\n\t\telse:\r\n\t\t\td1[i%5]=1\r\n\r\nfor i in range(1,m+1):\r\n\tif i%5==0:\r\n\t\tif 5 in d2:\r\n\t\t\td2[5]+=1\r\n\t\telse:\r\n\t\t\td2[5]=1\r\n\telse:\r\n\t\tif i%5 in d2:\r\n\t\t\td2[i%5]+=1\r\n\t\telse:\r\n\t\t\td2[i%5]=1\r\nans = 0\r\nfor i in range(1,6):\r\n\tif i==5:\r\n\t\tans+=(d1[i]*d2[i])\r\n\telse:\r\n\t\tans+=(d1[i]*d2[5-i])\r\n\r\nprint(ans)", "def solve():\r\n (a, b) = map(int, input().split())\r\n\r\n x, y = [a//5]*5, [b//5]*5\r\n for i in range(1, a%5+1):\r\n x[i] += 1\r\n \r\n for j in range(1, b%5+1):\r\n y[j] += 1\r\n\r\n return x[0]*y[0] + x[1]*y[4] + x[2]*y[3] + x[3]*y[2] + x[4]*y[1]\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "n,m = map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=((m+(i%5)))//5\r\nprint(ans)\r\n ", "n,m = list(map(int, input().split(\" \")))\r\ncount = 0\r\na = [0]*5\r\nb = [0]*5\r\nfor i in range(1,n+1):\r\n a[i%5] += 1\r\nfor i in range(1,m+1):\r\n b[i%5] += 1\r\n\r\nprint(a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[1]) ", "from sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\ndef f(a, b):\r\n\treturn a // 5 + (b <= a % 5) - (b == 0)\r\n\r\nn, m = map(int, input().split())\r\nans = 0\r\nfor i in range(5):\r\n\tans += f(n, i) * f(m, (5 - i) % 5)\r\nprint(ans)", "import math\r\nm,n=map(int,input().split())\r\nrem1m=math.floor((m-4)/5)+1\r\nrem2m=math.floor((m-3)/5)+1\r\nrem3m=math.floor((m-2)/5)+1\r\nrem4m=math.floor((m-1)/5)+1\r\nrem1n=math.floor((n-4)/5)+1\r\nrem2n=math.floor((n-3)/5)+1\r\nrem3n=math.floor((n-2)/5)+1\r\nrem4n=math.floor((n-1)/5)+1\r\nc1=rem1m*rem4n\r\nc2=rem2m*rem3n\r\nc3=rem3m*rem2n\r\nc4=rem4m*rem1n\r\nc5=int(m/5)*int(n/5)\r\nprint(c1+c2+c3+c4+c5)\r\n\r\n", "# You lost the game.\n\nn,m = map(int, input().split())\nr = 0\ne = n % 5\nN = [n//5 for _ in range(5)]\nfor i in range(1,e+1):\n N[i] += 1\ne = m % 5\nM = [m//5 for _ in range(5)]\nfor i in range(1,e+1):\n M[i] += 1\nfor i in range(1,5):\n r += N[i]*M[5-i]\nprint(r+N[0]*M[0])\n", "# import math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom math import *\r\n# from bisect import bisect_right\r\nmod = 1000000007\r\n# from functools import reduce\r\n# from itertools import permutations\r\n# import queue\r\n\r\n\r\ndef solve():\r\n n,m=map(int,input().split())\r\n d={i:0 for i in range(5)}\r\n for i in range(1,m+1):\r\n d[i%5]+=1\r\n\r\n count=0\r\n for i in range(1,n+1):\r\n x=5-i%5\r\n if x==5:\r\n x=0\r\n count+=d[x]\r\n print(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n# t=int(input())\r\nt = 1\r\nfor _ in range(t):\r\n # print(\"Case #{}: \".format(_ + 1), end=\"\")\r\n solve()", "import sys\nfrom itertools import product\nfrom random import randint\n\n\ndef readlines(type=int):\n return list(map(type, sys.stdin.readline().split()))\n\n\ndef read(type=int):\n return type(sys.stdin.readline().strip())\n\n\njoint = lambda it, sep=\" \": sep.join(\n [str(i) if type(i) != list else sep.join(map(str, i)) for i in it])\n\n\ndef solve_naive(n, m):\n total = 0\n for x, y in product(range(1, n + 1), range(1, m + 1)):\n if (x + y) % 5 == 0:\n total += 1\n return total\n\n\ndef solve(n, m):\n total = 0\n l, u = sorted([n, m])\n sum = n + m\n max_multiple = sum // 5\n multiples = [i * 5 for i in range(1, max_multiple + 1)]\n for multiple in multiples:\n can = min(l, multiple - 1) - (multiple - min(u, multiple - 1)) + 1\n # print(f'{can=}')\n total += can\n return total\n\n\ndef main():\n n, m = readlines()\n print(solve(n, m))\n\n\ndef test():\n count = 0\n while True:\n count += 1\n n = randint(1, 1000000)\n m = randint(1, 1000000)\n assert solve(n, m) == solve_naive(n, m)\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, m = map(int, input().split())\n\ns = 0\nfor i in range(1, n+1):\n s += (m+i)//5\n if (i >= 5): s -= i//5\n\n\nprint(s)\n \n", "n, m = map(int, input().split())\r\n\r\nres = 0\r\nx = m % 5\r\ny = int(m / 5)\r\nfor i in range(1, n+1):\r\n\tr = 5 - (i % 5)\r\n\tif (x >= r): res += y + 1\r\n\telse: res += y\r\n\r\nprint(res)", "from collections import Counter\nn, m = map(int, input().strip().split())\na = [i%5 for i in range(1, n+1)]\nb = [i%5 for i in range(1, m+1)]\ncountsA = Counter(a)\ncountsB = Counter(b)\nans = 0\nfor i in countsA:\n\tif i == 0:\n\t\tans += countsA[i]*countsB[i]\n\telse:\n\t\tans += countsA[i]*countsB[5-i]\nprint(ans)", "n,m=map(int,input().split())\r\na=[0 for i in range(5)]\r\nb=[0 for i in range(5)]\r\nfor i in range(1,n+1):\r\n a[i%5]+=1\r\nfor i in range(1,m+1):\r\n b[i%5]+=1\r\ntotal=0\r\nfor i in range(1,5):\r\n total+=a[i]*b[5-i]\r\ntotal+=(a[0]*b[0])\r\nprint(total)", "n, m = list(map(int, input().split()))\r\n\r\nsol = 0\r\n\r\nfor i in range(5):\r\n sol += ( (n + (5 - i)%5) // 5 ) * ( (m + i) // 5 )\r\n\r\nprint(sol)", "num=[int(x) for x in input().split()]\n\n\na={}\nb={}\nfor i in range(5):\n a[i]=0\n b[i]=0\n\nfor i in range(1,num[0]+1):\n if i%5 in a: \n a[i%5]+=1\n else:\n a[i%5]=1\n \nfor i in range(1,num[1]+1):\n if i%5 in b: \n b[i%5]+=1\n else:\n b[i%5]=1\n\n\nsum=a[0]*b[0]\n \nfor i in range(1,5):\n sum+=a[i]*b[5-i]\n\nprint(sum)", "n,m=(int(i) for i in input().split())\r\nl1=[0]*5\r\nl2=[0]*5\r\nfor i in range(1,n+1):\r\n l1[i%5]+=1\r\nfor i in range(1,m+1):\r\n l2[i%5]+=1\r\ns=(l1[0]*l2[0])+(l1[1]*l2[4])+(l1[2]*l2[3])+(l1[3]*l2[2])+(l1[4]*l2[1])\r\nprint(s)", "n, m = map(int, input().split())\r\ncnt = [0 for _ in range(0, 5)]\r\nfor i in range(1, m + 1):\r\n cnt[i % 5] += 1\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if i % 5 == 0:\r\n ans += cnt[0]\r\n else:\r\n ans += cnt[5 - (i % 5)]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\nt1 = [n//5]*5\r\nfor x in range(1, n%5 + 1): t1[x] += 1\r\n\r\nt2 = [m//5]*5\r\nfor x in range(1, m%5 + 1): t2[x] += 1\r\n\r\ns = 0\r\ns += t1[0]*t2[0]\r\n\r\nfor x in range(1, 5): s += t1[x]*t2[5-x]\r\n\r\nprint(s)", "n = list(input().split(\" \"))\r\nm = int(n[1])\r\nn = int(n[0])\r\n#int a0, a1, a2, a3, a4, b0, b1, b2, b3, b4\r\na0 = n//5\r\na1 = n//5 + (n%5 > 0)\r\na2 = n//5 + (n%5 > 1)\r\na3 = n//5 + (n%5 > 2)\r\na4 = n//5 + (n%5 > 3)\r\nb0 = m//5;\r\nb1 = m//5 + (m%5 > 0)\r\nb2 = m//5 + (m%5 > 1)\r\nb3 = m//5 + (m%5 > 2)\r\nb4 = m//5 + (m%5 > 3)\r\nprint(a0*b0+a1*b4+a2*b3+a3*b2+a4*b1)\r\n", "\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\nfre1=[0]*7\r\nfre2=[0]*7\r\n\r\nl=1\r\nfor i in range(min(n,m)):\r\n\tfre1[(l%5)]+=1\r\n\tfre2[(l%5)]+=1\r\n\tl+=1\r\n\r\n\r\n\r\nwhile(l<=n):\r\n\tfre1[(l%5)]+=1\r\n\tl+=1\r\n\r\nwhile(l<=m):\r\n\tfre2[(l%5)]+=1\r\n\tl+=1\r\n\r\n\r\nres=fre1[0]*fre2[0]\r\n\r\nfor i in range(4):\r\n\r\n\tres+=fre1[i+1]*fre2[5-i-1]\r\n\r\n\r\nprint(res)\r\n\r\n", "import sys\r\ndef check(k, n_n, l):\r\n if k > l or k == 0:\r\n return n_n\r\n else:\r\n return n_n + 1\r\n \r\ninput = sys.stdin.readline\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n n_n = n // 5; mm = m // 5\r\n ln = n % 5; lm = m % 5\r\n sum_ = 0\r\n if ln == 0 and lm == 0:\r\n print(5 * n_n * mm)\r\n exit()\r\n for i in range(0, 5):\r\n pair = (5 - i) % 5\r\n sum_ += check(i, n_n, ln) * check(pair, mm, lm)\r\n print(sum_)", "def create_div(q,r):\r\n div = [q] * 5\r\n for i in range(r):\r\n div[i] += 1\r\n return div\r\n\r\ns1,s2 = map(int,input().split())\r\n\r\nq1 = s1 // 5\r\nr1 = s1 % 5\r\n\r\nq2 = s2 // 5\r\nr2 = s2 % 5\r\n\r\n\r\ndiv1 = create_div(q1,r1)\r\ndiv2 = create_div(q2,r2)\r\n\r\n#print('div1',div1)\r\n#print('div2',div2)\r\n\r\nc = div1[-1] * div2[-1]\r\n\r\nfor i in range(4):\r\n c += div1[i] * div2[3 - i]\r\n\r\nprint(c)\r\n\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n\r\nlst = [int(x) for x in input().split()]\r\nn = lst[0]\r\nm = lst[1]\r\ncounter=0\r\nfor i in range(1,n+1):\r\n counter += int((m+i%5)/5)\r\nprint(counter)\r\n", "x,y=map(int,input().split())\r\na=[0]*5\r\nb=[0]*5\r\nfor i in range(1,x+1):\r\n a[i%5]+=1\r\nfor j in range(1,y+1):\r\n b[j%5]+=1\r\nprint((a[0]*b[0]) +(a[1]*b[4]) + (a[2]*b[3]) + (b[2]*a[3]) + (a[4]*b[1]))\r\n ", "t = [int(x) for x in input().split()]\r\nmay = t[0]\r\nmen = t[1]\r\nif (may < t[1]):\r\n may = t[1]\r\n men = t[0]\r\nn = men\r\nm = may\r\nres = (m // 5) * n\r\n\r\nresiduo = m % 5\r\nfor k in range(1, residuo+1):\r\n res += (n+k)//5\r\nprint(res)", "n, m = [int(x) for x in input().split()]\r\na = [n // 5 for i in range(5)]\r\nb = [m // 5 for i in range(5)]\r\nfor i in range(n%5):\r\n a[i] += 1\r\nfor i in range(m%5):\r\n b[i] += 1\r\nprint(a[0]*b[3] + a[1]*b[2] + a[2]*b[1] + a[3]*b[0] + a[4]*b[4])\r\n", "#BISMILLAH\n#REMEMBER WHY YOU STARTED\n\nl = list(map(int, input().strip().split()))\nn, m = l[0], l[1]\nres = 0\nfor i in range(1, n+1):\n\tres += int((m + int(i % 5)) / 5)\nprint(res)\n\n", "n, m = map(int, input().split())\r\n\r\nif n < m:\r\n n, m = m, n\r\n\r\nns = [0]*10\r\nms = [0]*10\r\n\r\ntmp = n//10\r\nfor i in range(10):\r\n ns[i] = tmp \r\n\r\nif n%10 != 0:\r\n for i in range(1, 1+n%10):\r\n ns[i] += 1\r\n\r\ntmp = m//10\r\nfor i in range(10):\r\n ms[i] = tmp \r\n\r\nif m%10 != 0:\r\n for i in range(1, 1+m%10):\r\n ms[i] += 1\r\n\r\n\r\nans = 0\r\nk = 0\r\nfor i in range(10):\r\n for j in range(10):\r\n if (i+j)%5 == 0:\r\n ans += ns[i]*ms[j]\r\n\r\nprint(ans)", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tn,m = map(int,input().split())\r\n\td = {0:0,1:0,2:0,3:0,4:0,5:0}\r\n\tfor i in range(1,m+1):\r\n\t\td[i%5]+=1\r\n\tans =0\r\n\t# print(d)\r\n\tfor i in range(1,n+1):\r\n\t\tans += d[(5-(i%5))%5]\r\n\tprint(ans)\r\n\r\n\r\nmain()\r\n\r\n\r\n\r\n# t= int(input())\r\n# while t:\r\n# \tmain()\r\n# \tt-=1", "x,y=map(int,input().split())\r\n\"\"\"m=y\r\ny=max(x,y)\r\nx=min(m,x)\r\nmikx=x//5\r\nmakxy=(x+y)//5\r\nif x+y<20:\r\n ll = list()\r\n for i in range(1, x+1):\r\n for t in range(1, y+1):\r\n if (i + t) % 5 == 0:\r\n ll.append([i, t])\r\n print(len(ll))\r\n exit()\r\na=(x+y+1)-makxy*5\r\nb=(mikx*5)-1\r\naa=a+(mikx-1)*5\r\nt=makxy-2*mikx\r\ncount=t*x\r\ncount+=int((4+b)/2*mikx)\r\ncount+=int((a+aa)/2*mikx)\r\nprint(count)\"\"\"\r\nprint(sum((y+(i+1)%5)//5 for i in range(x)))", "nn=input()\r\nns=nn.split()\r\na=[]\r\nb=[]\r\nfor i in range(5):\r\n a.append(0)\r\n b.append(0)\r\n\r\n \r\nfor i in range(1,int(ns[0])+1):\r\n a[i%5]=a[i%5]+1\r\nfor i in range(1,int(ns[1])+1):\r\n b[i%5]=b[i%5]+1\r\n\r\nprint(a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[1]) ", "if __name__ == '__main__':\r\n A = list(map(int, input().split()))\r\n n = A[0]\r\n m = A[1]\r\n\r\n first = max(n, m)\r\n second = min(n, m)\r\n\r\n totaldevisors = 0\r\n for i in range(5):\r\n if i != 0:\r\n totaldevisors += ((second + 5 - i) // 5) * ((first + i) // 5)\r\n else:\r\n totaldevisors += (((second + 5 - i) // 5) - 1) * ((first + i) // 5)\r\n print(totaldevisors)", "n,m = map(int, input().split())\nkq = 0\nfor i in range(1,n+1):\n u = i%5\n v = 5-u if u>0 else 0\n d = ((1-v)+4)//5\n c = (m-v)//5\n kq += c-d+1\nprint(kq)\n\t \t\t \t \t \t\t\t\t \t \t \t \t\t\t\t", "n, m = map(int, input().split())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n ans += (m + i % 5) // 5\r\nprint(ans)", "n, m = map(int, input().split())\nnmod = n % 5\nndiv = {k: n // 5 for k in range(5)}\nfor i in range(nmod):\n ndiv[(i + 1) % 5] += 1\n# print(ndiv)\nmmod = m % 5\nmdiv = {k: m // 5 for k in range(5)}\nfor i in range(mmod):\n mdiv[(i + 1) % 5] += 1\n# print(mdiv)\nans = 0\nfor i in range(5):\n if i == 0:\n ans += ndiv[i] * mdiv[i]\n else:\n ans += ndiv[i] * mdiv[5 - i]\nprint(ans)\n", "a, b = map(int,input().split())\n\na1 = [0,0,0,0,0]\nb1 = [0,0,0,0,0]\nif a >= 5:\n\ta1 = [a//5,a//5,a//5,a//5,a//5]\n\ta %= 5\nif b >= 5:\n\tb1 = [b//5,b//5,b//5,b//5,b//5]\n\tb %= 5\nfor i in range(1, a + 1):\n\tif i % 5 == 0:\n\t\ta1[0] += 1\n\telif i % 5 == 1:\n\t\ta1[1] += 1\n\telif i % 5 == 2:\n\t\ta1[2] += 1\n\telif i % 5 == 3:\n\t\ta1[3] += 1\n\telif i % 5 == 4:\n\t\ta1[4] += 1\nfor i in range(1, b + 1):\n\tif i % 5 == 0:\n\t\tb1[0] += 1\n\telif i % 5 == 1:\n\t\tb1[1] += 1\n\telif i % 5 == 2:\n\t\tb1[2] += 1\n\telif i % 5 == 3:\n\t\tb1[3] += 1\n\telif i % 5 == 4:\n\t\tb1[4] += 1\nprint(a1[0] *b1[0] + a1[1] * b1[4] + a1[2] *b1[3] +a1[3] * b1[2] +a1[4] *b1[1])\n", "n,m=[int(x) for x in input().split()];i=5;c=0\r\nif n>m:a=m;m=n;n=a\r\nwhile True:\r\n if n>=i:c+=i-1\r\n elif m>=i:c+=n\r\n else:\r\n if n-(i-m)+1<0:break\r\n else:c+=n-(i-m)+1\r\n i+=5\r\nprint(c)", "inp = lambda: map(int, input().split())\r\nal, bl = inp()\r\na = [0]*5; b = [0]*5\r\nfor i in range(1, al+1): a[i%5]+=1\r\nfor i in range(1, bl+1): b[i%5]+=1\r\nans = a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[1]\r\nprint(ans)", "n, m = map(int, input().split())\r\ndem = 0\r\nfor x in range(1, n+1):\r\n if x % 5 == 0:\r\n dem += m//5\r\n else:\r\n u = 5 - (x % 5)\r\n dem += (m - u) // 5 + 1\r\nprint(dem)\r\n", "import sys\r\n\r\n\r\na, b = map(int, sys.stdin.readline().split())\r\ns = 0\r\n\r\n# a = 0 mod 5\r\n# b = 0 mod 5\r\ns += (a//5)*(b//5)\r\n\r\n# a = 1 mod 5\r\n# b = 4 mod 5\r\n# s += ((a-1)//5 + 1)*((b+1)//5)\r\n\r\nfor i in range(1, 5):\r\n s += ((a-i)//5 + 1)*((b+i)//5)\r\n \r\nprint(s)", "import math\n\ncol, fil = input().split()\ncol = int(col)\nfil = int(fil)\narr1 = [0, 0, 0, 0, 0]\narr2 = [0, 0, 0, 0, 0]\n\ndefinido1 = int((col - col%5)/5)\ndefinido2 = int((fil - fil%5)/5)\nmodu1 = col%5\nmodu2 = fil%5\n\nfor x in range(5):\n arr1[x] = definido1\n arr2[x] = definido2\n \nfor x in range(1, 5):\n if modu1 > 0:\n arr1[x] = arr1[x] + 1\n modu1 = modu1 - 1\n if modu2 > 0:\n arr2[x] = arr2[x] + 1\n modu2 = modu2 - 1\n \nres = arr1[0] * arr2[0]\n\nfor x in range(1, 5):\n res = res + arr1[x]*arr2[5-x]\n \nprint(res)", "n, m = map(int, input().split())\r\na, b = n // 5, m // 5\r\nx1, x2 = [a, a + int(n % 5 >= 1), a + int(n % 5 >= 2), a + int(n % 5 >= 3), a + int(n % 5 >= 4)], [b, b + int(m % 5 >= 1), b + int(m % 5 >= 2), b + int(m % 5 >= 3), b + int(m % 5 >= 4)]\r\nprint(x1[0] * x2[0] + x1[1] * x2[4] + x1[2] * x2[3] + x1[3] * x2[2] + x1[4] * x2[1])\r\n", "n,m=list(map(int,input().split(\" \")))\r\nmodN,modM=[0]*5,[0]*5\r\nfor i in range(1,n+1):\r\n modN[i%5]+=1\r\nfor i in range(1,m+1):\r\n modM[i%5]+=1\r\nprint(modN[0]*modM[0]+modN[1]*modM[4]+modN[2]*modM[3]+modN[3]*modM[2]+modN[4]*modM[1])", "x,y=map(int,input().split())\r\nz=x//5\r\na=[z]*5\r\nz=y//5\r\nb=[z]*5\r\nz=x%5\r\nfor i in range(1,z+1):\r\n a[i]+=1\r\nz=y%5\r\nfor j in range(1,z+1):\r\n b[j]+=1\r\nprint((a[0]*b[0]) +(a[1]*b[4]) + (a[2]*b[3]) + (b[2]*a[3]) + (a[4]*b[1]))\r\n ", "n,m=map(int,input().split())\r\nl=[0]*5\r\nl2=[0]*5\r\nfor i in range(1,n+1):\r\n t=i%5\r\n l[t]+=1\r\n \r\nfor i in range(1,m+1):\r\n t=i%5\r\n l2[t]+=1\r\n \r\nprint(l[0]*l2[0]+l[1]*l2[4]+l[2]*l2[3]+l[3]*l2[2]+l[4]*l2[1])\r\n", "def main(): \r\n n,m = map(int,input().split())\r\n ans = 0\r\n for i in range(1,m+1):\r\n b = i%5\r\n ans += (n+b)//5\r\n print(ans) \r\nmain()", "import math\n\n\ndef remainder_error(start, iterations):\n term = int((start + 0.2) / 0.2)\n error = 0\n for i in range(0, iterations):\n if term == 6:\n term = 1\n else:\n error += 0.2*(term-1)\n term += 1\n return error\n\n\nstring_input = input().split(\" \")\nn, m = int(string_input[0]), int(string_input[1])\nright_start = (1 + m) / 5\nright_end = (m + n) / 5\nright_sum_with_error = round(n * (right_start + right_end) / 2, 1)\nleft_end = (1+n)/5\nleft_sum_with_error = round(n * (0.4 + left_end) / 2, 1)\nright_start_decimal = int((round(right_start, 1)*10) % 10)/10\noffset = n//5\noffset_error = 2*offset\nmod = n % 5\nif mod == 4:\n offset += 1\nmod_error_left = round(remainder_error(0.4, mod), 1)\nmod_error_right = round(remainder_error(right_start_decimal, mod), 1)\nleft_sum = round(left_sum_with_error - mod_error_left - offset_error, 1)\nright_sum = round(right_sum_with_error - mod_error_right - offset_error, 1)\npairs = int(right_sum - left_sum + offset)\nprint(pairs)\n \t\t\t\t \t\t\t\t\t \t\t\t\t\t\t\t \t\t \t\t", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"\"\r\n# Class: A\r\n\r\ndef Solve():\r\n n,m=map(int, input().split())\r\n ans=0\r\n for i in range(1, n+1):\r\n ans+=(m+(i)%5)//5\r\n print(ans)\r\n \r\nif __name__ == \"__main__\":\r\n Solve()", "n,m=map(int,input().split())\r\nR=list(range(10))\r\na=[n//10for i in R]\r\nb=[m//10for i in R]\r\nfor i in R[1:]:a[i]+=i<=n%10;b[i]+=i<=m%10\r\nprint(sum(a[i]*b[j]for i in R for j in R if(i+j)%5==0))", "n,m = map(int, input().split())\r\n\r\n\r\ntotal = 0\r\n\r\nfor i in range(1, n+1):\r\n total += (m+ (i%5)) // 5\r\n \r\nprint(total)", "x,y = map(int,input().split())\r\nans = 0\r\nfor i in range(5):\r\n\tj = (5-i)%5\r\n\tcti = x//5\r\n\tif(i and x%5 >= i): cti += 1\r\n\tctj = y//5\r\n\tif(j and y%5 >= j): ctj += 1\r\n\tans += cti*ctj\r\nprint(ans)", "s = input()\r\nl = s.split()\r\nn = int(l[0])\r\nm = int(l[1])\r\nrep = (n+m)//5\r\nmini = min(n,m)\r\n \r\nsum=0\r\n \r\nfor i in range(1,rep+1):\r\n \r\n multiple = i*5\r\n if multiple-1<=n and multiple-1 <=m:\r\n sum+=(multiple-1)\r\n else:\r\n if n==m or multiple>n and multiple>m:\r\n sum+=n-(multiple-m)+1\r\n else:\r\n sum+=mini\r\n \r\n \r\n \r\n \r\nprint(sum)", "q = sorted([int(x) for x in input().split()])\r\nc = 0\r\nfor i in range(1, q[0]+1):\r\n t = 5 - (i-5*(i//5))\r\n c += len(range(t, q[1]+1, 5))\r\nprint(c)\r\n", "n,m=list(map(int,input().split()))\nf1=[0]*5\nf2=[0]*5\nfor i in range(1,n+1):\n f1[i%5]+=1\nfor i in range(1,m+1):\n f2[i%5]+=1\nprint(f1[0]*f2[0]+f1[1]*f2[4]+f2[1]*f1[4]+f1[2]*f2[3]+f2[2]*f1[3]) \n\n\t \t\t\t \t\t\t \t\t \t\t \t \t \t\t", "n,m = map(int,input().split())\r\nz=0\r\nfor x in range(n):\r\n z+=(m+((x+1)%5))//5\r\nprint(z)\r\n", "n,m=sorted(list(map(int,input().split())))\r\na=n//5\r\nx={1:a , 2:a , 3:a ,4:a ,0:a }\r\nfor i in range(1,n%5 +1):\r\n\tx[i]=a+1\r\n\r\nb=m//5\r\ny={4:b, 3:b , 2:b , 1:b , 0:b}\r\nfor j in range(m%5):\r\n\ty[4-j]= b+1\r\n\r\nans=0\r\n\r\nfor i in range(5):\r\n\tans+=(x[i]*y[i])\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = [0] * 5\r\nb = [0] * 5\r\nfor i in range(1,n+1):\r\n a[i%5]+=1\r\nfor j in range(1,m+1):\r\n b[j%5]+=1\r\nres=0\r\n\r\nres+=a[0]*b[0]\r\nfor j in range(1,5):\r\n res+=a[j]*b[5-j]\r\nprint(res)\r\n", "n,m = map(int,input().split())\r\nans = 0\r\nfor i in range(1,n+1):\r\n l1 = i%5\r\n tp1 = m+l1\r\n ans+=(tp1//5)\r\nprint(ans)", "n, m = map(int,input().split())\r\nno=[n//5]*5\r\nmo=[m//5]*5\r\nfor i in range(1,5):\r\n if i<=n%5: no[i]+=1\r\n if i<=m%5: mo[i]+=1\r\n \r\nprint(no[0]*mo[0]+no[1]*mo[4]+no[2]*mo[3]+no[3]*mo[2]+no[4]*mo[1])\r\n#print(no[0]*mo[0])\r\n\n# Wed Jan 05 2022 09:38:59 GMT+0000 (Coordinated Universal Time)\n", "n,m = [int(x) for x in input(\"\").split()]\r\na = [0] * 5\r\nb = [0] * 5\r\nfor i in range(1, n+1):\r\n a[i%5] += 1\r\n\r\nfor i in range(1, m+1):\r\n b[i%5] += 1\r\n\r\nprint(a[0] * b[0] + a[1] * b[4] + a[2] * b[3] + a[3] * b[2] + a[4] * b[1])\r\n", "import math\r\n\r\nn, m = sorted( list(map(int, input().split())) )\r\npairs = 0\r\n\r\nfor i in range(1, n+1):\r\n if i%5 == 0:\r\n pairs += int(m/5)\r\n #print(i, int(m/5))\r\n continue\r\n\r\n x = i % 5\r\n x = 5 - x\r\n pairs += math.floor((m-x)/5.0)+1\r\n\r\n #print(i, math.floor((m-x)/5.0)+1)\r\n\r\nprint(pairs)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nfor i in range(1, n + 1):\r\n\tc += (m + (i % 5)) // 5\r\nprint(c)\r\n", "n, m = [int(s) for s in input().split()]\r\n\r\nremainder_freq = [0] * 5\r\nfor k in range(1, m + 1):\r\n remainder_freq[k % 5] += 1\r\n\r\nans = 0\r\nfor x in range(1, n + 1):\r\n ans += remainder_freq[(5 - (x % 5)) % 5]\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nqn=n//5\r\nqm=m//5\r\nif(n%5==0):\r\n an=[qn]*5\r\nelif(n%5==1):\r\n an=[qn+1]+[qn]*4\r\nelif(n%5==2):\r\n an=[qn+1]*2+[qn]*3\r\nelif(n%5==3):\r\n an=[qn+1]*3+[qn]*2\r\nelif(n%5==4):\r\n an=[qn+1]*4+[qn]*1\r\nif(m%5==0):\r\n am=[qm]*5\r\nelif(m%5==1):\r\n am=[qm+1]+[qm]*4\r\nelif(m%5==2):\r\n am=[qm+1]*2+[qm]*3\r\nelif(m%5==3):\r\n am=[qm+1]*3+[qm]*2\r\nelif(m%5==4):\r\n am=[qm+1]*4+[qm]*1\r\nprint(am[0]*an[3]+am[1]*an[2]+am[2]*an[1]+am[3]*an[0]+am[4]*an[4])\r\n", "# cook your dish here\r\nn,m=map(int,input().split())\r\nc=0\r\ntot=n+m \r\nfor i in range(1,n+1):\r\n c+=((i+m)//5)-(i//5)\r\nprint(c)", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\na=min(x,y)\r\ny=max(x,y)\r\nx=a\r\nans=0\r\nfor i in range(1,x+1):\r\n f=i//5\r\n s=(i+y)//5\r\n ans+=(s-f)\r\nprint(ans)\r\n\r\n", "n, m = map(int, input().split(\" \"))\nresult = 0\nfor i in range(5):\n a = n//5 + (1 if i != 0 and i <= n%5 else 0)\n b = m//5 + (1 if (5-i) <= m%5 else 0)\n result += a*b\nprint(result)\n", "a, b = map(int, input().split())\r\ns = 0\r\nfor i in range(1, a + 1):\r\n\tt = 5 - (i % 5)\r\n\ts += (b - t) // 5 + 1\r\nprint (s)", "buff = input().split(\" \")\r\nn = int(buff[0])\r\nm = int(buff[1])\r\n\r\nns = [n//5, n//5, n//5, n//5, n//5]\r\nfor i in range(1, n%5 + 1):\r\n ns[i]+=1\r\n\r\nms = [m//5, m//5, m//5, m//5, m//5]\r\nfor i in range(1, m%5 + 1):\r\n ms[i]+=1\r\n\r\nres = ns[0] * ms[0]\r\n\r\nfor i in range(1, 5):\r\n res+=ns[i] * ms[5 - i]\r\n\r\nprint(res)", "x, y = map(int, input().split())\ncount_x = [0] * 5\ncount_x[0] = x // 5\nfor i in range(1, 5):\n if x >= i:\n count_x[i] = (x - i) // 5 + 1\ncount_y = [0] * 5\ncount_y[0] = y // 5\nfor i in range(1, 5):\n if y >= i:\n count_y[i] = (y - i) // 5 + 1\nans = 0\nfor i in range(5):\n ans += count_x[i] * count_y[(5 - i) % 5]\nprint(ans)\n", "n, m = map(int, input().split())\r\n\r\nn1 = n // 5 + (n % 5 >= 1)\r\nn2 = n // 5 + (n % 5 >= 2)\r\nn3 = n // 5 + (n % 5 >= 3)\r\nn4 = n // 5 + (n % 5 >= 4)\r\nn0 = n // 5\r\n\r\nm1 = m // 5 + (m % 5 >= 1)\r\nm2 = m // 5 + (m % 5 >= 2)\r\nm3 = m // 5 + (m % 5 >= 3)\r\nm4 = m // 5 + (m % 5 >= 4)\r\nm0 = m // 5\r\n\r\nprint((n0 * m0) + (n1 * m4) + (n2 * m3) + (n3 * m2) + (n4 * m1))\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\na,b=inp()\r\narr =[0,0,0,0,0]\r\narr1 =[0,0,0,0,0]\r\nfor i in range(1,a+1):\r\n arr[i%5]+=1\r\nfor i in range(1,b+1):\r\n \r\n arr1[i%5]+=1\r\n\r\n \r\nprint(arr[1]*arr1[4]+arr[4]*arr1[1]+arr[3]*arr1[2]+arr[2]*arr1[3]+arr[0]*arr1[0])", "a ,b = map(int,input().split());cnt=0\r\nfor i in range(1,a+1):\r\n cnt =cnt+ (((i%5)+b)//5)\r\nprint(cnt)", "def main(n):\n r = n % 5\n a = b = c = d = e = n//5\n if r > 0:\n b+=1\n if r > 1:\n c+=1\n if r > 2:\n d+=1\n if r > 3:\n e+=1\n\n return a, b, c, d, e\n \n\nn, m = map(int, input().split())\na = main(n)\nb = main(m)\n\nprint(a[0]*b[0] + a[1]*b[4] + a[2]*b[3] + a[3]*b[2] + a[4]*b[1])\n# print(main(n))\n", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(5):\r\n c+=((a+i)//5) * ((b+(5-i)%5)//5)\r\nprint(c) ", "i = input()\ni = i.split()\nn = int(i[0])\nm = int(i[1])\n\na = min(n,m)\nb = max(n,m)\n\ni = 5\nans = 0\nwhile i < n + m + 1:\n if i <= a:\n ans += i - 1\n elif i > a and i <= b:\n ans += a\n else:\n ans += (a - i + b + 1)\n i += 5\nprint(ans)\n\t\t\t \t \t\t \t \t \t \t", "class CodeforcesTask682ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_m = []\r\n\r\n def read_input(self):\r\n self.n_m = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n pairs = 0\r\n sm = min(*self.n_m)\r\n bg = max(*self.n_m)\r\n for x in range((bg // 5) * 2 + 1):\r\n x += 1\r\n a = x * 5 - 1\r\n if a < 0:\r\n a = 0\r\n if a > bg:\r\n a = bg + sm - a\r\n if a < 0:\r\n a = 0\r\n # print(x, a, sm)\r\n pairs += min(a, sm)\r\n\r\n self.result = str(pairs)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask682ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "x, y = map(int, input().split())\r\n\r\n\r\ndef createmods(n):\r\n # a list s.t. [i] = number of integers <=n that is i(mod 5)\r\n list = [n // 5] * 5\r\n for i in range(0, n % 5):\r\n list[i + 1] += 1\r\n return list\r\n\r\n\r\nxmod = createmods(x)\r\nymod = createmods(y)\r\n#print(xmod, ymod)\r\n#0+0, 1+4, 2+3, 3+2, 4+1\r\nans = xmod[0] * ymod[0] + xmod[1] * ymod[4] + xmod[2] * ymod[3] + xmod[\r\n 3] * ymod[2] + xmod[4] * ymod[1]\r\nprint(ans)", "n, m = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n d = 5-(i+1)%5\r\n ans += int(m/5)\r\n if ((m%5) >= d):\r\n ans += 1\r\nprint(ans)\r\n", "n,m=map(int , input().split())\r\ns=0\r\nfor i in range(1,n+1):\r\n\ts+=(m+(i%5))//5\r\nprint(s)", "n, k = map(int, input().rstrip().split(\" \"))\r\nm = max(n,k)\r\nn = min(n,k)\r\ntotal = m*(n//5)\r\nz = (n%5+m%5)\r\nf = 0\r\nif z > 5:\r\n f = z%5\r\nelse:\r\n f = 0\r\ntotal = total + (n%5)*(m//5) +z//5 + f\r\nprint(total)", "n, m = map(int, input().split())\r\n\r\nanswer = (n // 5)*(m // 5)\r\n\r\nfor i in range(1, 5):\r\n x = n // 5\r\n y = m // 5\r\n\r\n if n % 5 >= i:\r\n x += 1\r\n if m % 5 >= 5 - i:\r\n y += 1\r\n\r\n answer = answer + (x * y)\r\n\r\nprint(answer)", "n, m = map(int, input().split())\r\n\r\nif n >= m:\r\n\tx = n\r\n\ty = m\r\nelse:\r\n\tx = m\r\n\ty = n\r\n\r\npairs = list()\r\nnum_pairs = 0\r\nfor i in range(1,x + 1):\r\n\thighest_div = (i + y) // 5\r\n\tlowest_div = i // 5\r\n\tnum_pairs += (highest_div - lowest_div)\r\n\t\r\nprint(num_pairs)", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\na1, a2 = a//5, a % 5\r\nb1, b2 = b//5, b % 5\r\nprint(a1*b1*5 + a2*b1 + a1*b2 + max(a2+b2-4, 0))\r\n", "n, m = list(map(int, input().split()))\r\nl1 = [0, 0, 0, 0, 0]\r\nl2 = [0, 0, 0, 0, 0]\r\nfor i in range(1, n+1):\r\n l1[i % 5] += 1\r\n\r\nfor i in range(1, m+1):\r\n l2[i % 5] += 1\r\nans = l1[0]*l2[0]\r\nans += l1[1]*l2[4]\r\nans += l1[2]*l2[3]\r\nans += l2[2]*l1[3]\r\nans += l2[1]*l1[4]\r\nprint(ans)\r\n", "n,m=[int(i) for i in input().split()]\r\np=min(n,m)\r\nq=max(n,m)\r\nx=q//5\r\ny=p//5\r\nz=p-(p//5)*5\r\nc=0\r\nif q%5!=0:\r\n for i in range(x*5+1,q+1):\r\n if p>=5-(i%5):\r\n c+=1\r\n if c!=0 :\r\n if y==0:\r\n print(x*p + y*c + c)\r\n else:\r\n print(x*p + y*c + max(0,z-4+c))\r\n else:\r\n print(x*p + y*c)\r\nelse:\r\n print(x*p)\r\n\r\n", "n,m=list(map(int ,input().split()))\r\nx=0\r\nfor i in range(1,n+1):\r\n x=x+(m+i)//5-i//5\r\nprint(x)", "a,b = map(int, input().split())\r\npairs = 0\r\nfor x in range(1,a+1):\r\n c = 5-(x%5)\r\n\r\n if b>=c:\r\n pairs += 1 + (b-c)//5 \r\nprint (pairs)", "n,m = map(int, input().split())\r\ns=0\r\nfor i in range(1, n + 1):\r\n s += (i + m) // 5 - i//5\r\nprint(s)", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nr1 = [a // 5 for x in range(5)]\r\nfor x in range(1, a % 5 + 1):\r\n r1[x] += 1\r\nr2 = [b // 5 for x in range(5)]\r\nfor x in range(1, b % 5 + 1):\r\n r2[x] += 1\r\nn = 0\r\nfor x in range(5):\r\n n += r1[x] * r2[(5 - x) % 5]\r\nprint(n)", "import sys\r\ninput = sys.stdin.readline\r\nx, y = map(int, input().split())\r\na = max(x,y)\r\nans = 0\r\nfor i in range(1, min(x,y)+1):\r\n\tans += (a+i)//5\r\n\tans -= i//5\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "x,x1=map(int,input().split())\r\nj=0\r\na=x-(x%5)\r\na1=(x%5)\r\nb=x1//5\r\nx11=range(1,(x1%5)+1)\r\nj+=a*b+a1*b\r\nj+=((x//5)*(x1%5))\r\nfor i in range(1,a1+1):\r\n i=5-i\r\n j+=x11.count(i)\r\nprint(j)", "[n, m] = list(map(int, input().split(\" \")))\nr = (n//5)*(m//5)\nfor i in range(1, 5):\n r += (n//5 + (n%5 >=i))*(m//5 + (m%5 >=(5-i)))\nprint(r)\n", "n, m = list(map(int, input().split()))\r\nc = (n // 5) * (m // 5)\r\nif n > m:\r\n n, m = m, n\r\nfor i in range(1, m+1):\r\n if i % 5 == 0: continue\r\n x = 5 - i % 5\r\n c += ((n - x) // 5) + 1\r\nprint(str(c))", "d={0:0,1:0,3:0,4:0,2:0};n,m=map(int,input().split());s=0\r\nfor i in range(1,n+1):d[i%5]+=1;\r\nfor i in range(1,m+1):\r\n\tif i%5==0:s+=d[0]\r\n\telse:s+=d[5-i%5]\r\nprint(s)", "from math import ceil\r\nn, m = map(int, input().split())\r\n\r\nif n > m:\r\n\tn, m = m, n\r\n\r\ntotal = 0\r\nmaior = m\r\nfor i in range(1, n+1):\r\n\ttotal += ((i+maior)//5)- ceil((i+1)/5) + 1\r\nprint(total)\r\n", "n, m=map(int, input().split())\r\nh=n//5\r\nk=m//5\r\nh1=n%5\r\nk1=m%5\r\nostn_1=h+bool(h1>=1)\r\nostm_4=k+bool(k1>=4)\r\nostn_2=h+bool(h1>=2)\r\nostm_3=k+bool(k1>=3)\r\nostn_3=h+bool(h1>=3)\r\nostm_2=k+bool(k1>=2)\r\nostn_4=h+bool(h1>=4)\r\nostm_1=k+bool(k1>=1)\r\n#print(ostn_1, ostm_4, ostn_2, ostm_3, ostn_3, ostm_2, ostn_4, ostm_1)\r\nprint(ostn_1*ostm_4+ostn_2*ostm_3+ostn_3*ostm_2+ostn_4*ostm_1+h*k)\n# Sun Oct 30 2022 21:11:48 GMT+0300 (Moscow Standard Time)\n", "# Author: Maharshi Gor\r\n\r\n\r\ndef read(type=int):\r\n return type(input())\r\n\r\n\r\ndef read_arr(type=int):\r\n return [type(token) for token in input().split()]\r\n\r\n\r\ndef solution(a, b, c, A, B):\r\n A.sort()\r\n B.sort()\r\n aa = min(a, len(A))\r\n bb = min(b, len(B))\r\n\r\n s = 0\r\n for i in range(aa):\r\n s += A[i]\r\n for i in range(bb):\r\n s += B[i]\r\n\r\n\r\ndef run():\r\n n, m = read_arr()\r\n A = [0] * 5\r\n B = [0] * 5\r\n for i in range(1, n + 1):\r\n A[i % 5] += 1\r\n for i in range(1, m + 1):\r\n B[i % 5] += 1\r\n s = 0\r\n s += A[0] * B[0]\r\n s += A[1] * B[4]\r\n s += A[2] * B[3]\r\n s += A[3] * B[2]\r\n s += A[4] * B[1]\r\n print(s)\r\n\r\nrun()\r\n", "a,b = map(int,input().split())\r\nif a % 5 > 0:\r\n l1 = a//5 + 1\r\nelse:\r\n l1 = a//5\r\nif a % 5 > 1:\r\n l2 = a//5 + 1\r\nelse:\r\n l2 = a//5\r\nif a % 5 > 2:\r\n l3 = a//5 + 1\r\nelse:\r\n l3 = a//5\r\nif a % 5 > 3:\r\n l4 = a//5 + 1\r\nelse:\r\n l4 = a//5\r\nl5 = a//5\r\nif b % 5 > 0:\r\n m1 = b//5 + 1\r\nelse:\r\n m1 = b//5\r\nif b % 5 > 1:\r\n m2 = b//5 + 1\r\nelse:\r\n m2 = b//5\r\nif b % 5 > 2:\r\n m3 = b//5 + 1\r\nelse:\r\n m3 = b//5\r\nif b % 5 > 3:\r\n m4 = b//5 + 1\r\nelse:\r\n m4 = b//5\r\nm5 = b//5\r\nprint(m1*l4 + m2*l3 + m3 * l2 + m4 * l1 + m5 * l5)\n# Tue Jan 03 2023 12:18:35 GMT+0300 (Moscow Standard Time)\n", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, m = (int(i) for i in read().split())\r\n count = 0\r\n for i in range(1, n + 1):\r\n # Find the range of numbers that are reachable from the current number\r\n left_range =i+ 1 # Smallest sum possible\r\n right_range = i + m # Highest range\r\n # Number of multiples of 5 within the range\r\n multiples_of_5 = right_range // 5 - (left_range - 1)// 5\r\n count += multiples_of_5\r\n print(count)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nfor i in range(1, n+1):\r\n c += (m+i % 5)//5\r\n\r\nprint(c)\r\n", "n, m = map(int, input().split())\r\nif m < n:\r\n n, m = m, n\r\n\r\nnko = [n//5 for i in range(5)]\r\nmko = [m//5 for i in range(5)]\r\n\r\nx = n % 5\r\ny = m % 5\r\n\r\nfor i in range(1, x+1):\r\n nko[i] += 1\r\nfor i in range(1, y+1):\r\n mko[i] += 1\r\n\r\ns = nko[0] * mko[0] + nko[1] * mko[4] + nko[2] * mko[3] + nko[3] * mko[2] + nko[4] * mko[1]\r\nprint(s)", "n, m = map(int, input().split(\" \"))\nres = 0\n\nfor i in range(1, 6):\n if n%5 >= i:\n res += ((i%5+m)//5)*(n//5+1)\n else:\n res += ((i%5+m)//5)*(n//5)\nprint(res)\n", "n,m=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n+1):\r\n c+=(m+i%5)//5\r\n\r\nprint(c)", "n, m = map(int, input().split())\na = [0] * 4\nb = [0] * 4\nfor i in range(4):\n a[i] = n // 5\n b[i] = m // 5\nfor i in range(0, n % 5):\n a[i] += 1\nfor i in range(0, m % 5):\n b[i] += 1\nans = 0\nfor i in range(4):\n ans += a[i] * b[3 - i]\n\nans += (n // 5) * (m // 5)\nprint(ans)\n", "n, m = map(int, input().split())\r\na = [0] * 6\r\nfor i in range(1, n + 1):\r\n a[i % 5]+=1\r\na[5] = a[0]\r\nans = 0\r\nfor i in range(1,m+1):\r\n ans += a[5 - i % 5]\r\nprint(ans)", "a,b= map(int,input().split())\r\ncount = 0\r\n\r\nfor i in range(1,a+1):\r\n count+= (int(i%5) + b)//5\r\n \r\nprint(count)\r\n\r\n\r\n\r\n ", "n, m = map(int, input().split())\nans = [0] * 5\nfor i in range(1, m + 1):\n ans[i % 5] += 1\nprint(sum(ans[(5 - j % 5) % 5] for j in range(1, n + 1)))\n\n", "I = lambda :map(int, input().split())\r\nn,m=I()\r\nn,m=min(n,m), max(m,n)\r\n# x=1 ??\r\nans=0\r\nfor i in range(5):\r\n ans+=m//5+(m%5>=5-i)\r\nans*=n//5\r\nfor i in range(1,n%5+1):\r\n ans+=m//5+(m%5>=5-i)\r\nprint(ans)", "n,m=[int(i) for i in input().split()]\r\nl1=[0,0,0,0,0]\r\nl2=[0,0,0,0,0]\r\nl1[0]=int(n//5)\r\nl2[0]=int(m//5)\r\nfor i in range(1,5):\r\n l1[i]=int((n-i)//5)+1\r\n l2[i]=int((m-i)//5)+1\r\nans=l1[0]*l2[0]\r\nfor i in range(1,5):\r\n ans+=(l1[i]*l2[5-i])\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(1,n+1):\r\n c=c+(m+(i%5))//5\r\nprint(c)", "n, m = map(int, input().split())\r\n\r\nndiv, nmod = divmod(n, 5)\r\nmdiv, mmod = divmod(m, 5)\r\n\r\nncnt = [ndiv] * 5\r\nfor i in range(nmod + 1):\r\n ncnt[i] += 1\r\n\r\nmcnt = [mdiv] * 5\r\nfor i in range(mmod + 1):\r\n mcnt[i] += 1\r\n\r\nncnt[0] -= 1\r\nmcnt[0] -= 1\r\n\r\nres = ncnt[0] * mcnt[0] + ncnt[1] * mcnt[4] + ncnt[2] * mcnt[3] \\\r\n + ncnt[3] * mcnt[2] + ncnt[4] * mcnt[1]\r\n\r\nprint(res)", "n, m = map(int, input().split())\r\na = max(n, m)\r\nb = min(n, m)\r\nnum = int(int(a - int(a / 5)) / 4) * (b - int(b / 5))\r\nnum += int(a / 5) * int(b / 5)\r\nif a % 5 < 4:\r\n for i in range(a + 1 - a % 5, a + 1):\r\n for j in range(1, b + 1):\r\n if (i + j) % 5 == 0:\r\n num += 1\r\nprint(num)", "# Wadea #\r\n\r\nn,m = map(int,input().split())\r\nnn = [0,0,0,0,0]\r\nmm = [0,0,0,0,0]\r\nans = 0\r\nfor i in range(1,n+1):\r\n nn[i%5] += 1\r\nfor j in range(1,m+1):\r\n mm[j%5] += 1\r\nans = (nn[0]*mm[0])+(nn[1]*mm[4])+(nn[2]*mm[3])+(nn[3]*mm[2])+(nn[4]*mm[1])\r\nprint(ans)", "n,m=map(int,input().split())\r\nif n<m:\r\n m,n=n,m\r\nmm=m//5\r\nmodn=n%5\r\nans=n*mm\r\nmodm=m%5\r\nans+=modm*(n//5)\r\nif modn+modm>=5:\r\n ans+=((modn+modm)%5)+1\r\nprint(ans)\r\n", "# Wadea #\r\n\r\nn,m = map(int,input().split())\r\nans = 0\r\nfor i in range(1,n+1):\r\n ans += ((m+i%5))//5\r\nprint(ans)", "\r\nn,k=list(map(int, input().split(' ')))\r\nlst = [0,0,0,0,0]\r\nfor j in range(1,k+1):\r\n lst[j%5]+=1\r\ncount = 0\r\nfor i in range(1,n+1):\r\n count+= (lst[5 - i%5] if (i % 5) != 0 else lst[0])\r\nprint(int(count))\r\n \r\n\r\n", "m1,n1 = input().split()\r\nm = eval(m1)\r\nn = eval(n1)\r\ntotal = 0\r\nif n >= 5 or m >= 5:\r\n total += (m // 5) * (n // 5) * 5\r\nx = m % 5\r\ny = n % 5\r\ntotal += (x * (n // 5)) + (y * (m // 5))\r\nmn = min(x,y)\r\nmx = max(x,y)\r\nif mn == 1:\r\n if mx == 4:\r\n total += 1\r\nelif mn == 2:\r\n total += (mx - 2)\r\nelif mn == 3:\r\n total += (mx - 1)\r\nelif mn == 4:\r\n total += mx\r\nprint(total)", "n,m=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=(m+i%5)//5\r\nprint(ans)", "a,b=input().strip().split(\" \")\r\na,b=[int(a),int(b)]\r\nans=0\r\nfor i in range(1,a+1):\r\n ans+=(i%5+b)//5\r\nprint(ans)\r\n", "n = list(map(int,input().split()))\r\nx = n[0]\r\ny = n[1]\r\na = [0,0,0,0,0]\r\nb = [0,0,0,0,0]\r\nfor i in range(1,x+1):\r\n a[i%5]+= 1\r\nfor i in range(1,y+1): \r\n b[i%5]+= 1 \r\nprint(a[0]*b[0]+a[1]*b[4]+a[2]*b[3]+a[3]*b[2]+a[4]*b[1] )\r\n", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nres=list(input().split())\r\n\r\nb=int((int(res[0])+int(res[1]))/5)*5\r\n\r\nc=0\r\nmin1=min(int(res[0]),int(res[1]) )\r\nmax1=max(int(res[0]),int(res[1]) )\r\n\r\n# print(p,p1,p2)\r\n#print(math.ceil(int(res[0])/int(res[2]))*math.ceil(int(res[1])/int(res[2])))\r\n#print ((8**res)-int((8**res)/10)*10)\r\nfor i in range(1,int((int(res[0])+int(res[1]))/5)+1):\r\n v=5*i\r\n if(v-min1<=1):\r\n c=c+(v-1)\r\n elif(v-max1<=1):\r\n c=c+min1\r\n else:\r\n c=c+(min1-((v-1)-max1))\r\nprint(c)", "n , m = map(int , input().split())\r\ncount = 0\r\n\r\nfor i in range(1 , n+1):\r\n count += (m + (i % 5)) // 5\r\nprint(count)", "n, m = map(int, input().split())\r\nans = 0\r\ncnt_n = [0] * 5\r\ncnt_m = [0] * 5\r\nfor i in range(1, n + 1):\r\n cnt_n[i % 5] += 1\r\nfor i in range(1, m + 1):\r\n cnt_m[i % 5] += 1\r\nans += cnt_n[0] * cnt_m[0]\r\nfor i in range(1, 5):\r\n ans += cnt_n[i] * cnt_m[4 - i + 1]\r\nprint(ans)\r\n", "a,b = map(int,input().split())\nval = a//5\nan = a%5\naa = []\nfor i in range(5):\n\taa.append(val+ (1 if an>=i+1 else 0))\nval = b//5\nan = b%5\nbb = []\nfor i in range(5):\n\tbb.append(val+(1 if an>=i+1 else 0))\nans = 0\nfor i in range(4):\n\tans += aa[i]*bb[3-i]\nans += aa[4]*bb[4]\nprint(ans)\n", "def ceil(a, b):\r\n return -(-a // b)\r\n \r\ndef answer(n, m):\r\n #for n == 1 only:\r\n #ans = (m+1) // 5\r\n #for n == 2 only:\r\n #ans = (m+2) // 5\r\n num_of_ns_like_1 = max(((n-1) // 5) + 1, 0)\r\n num_of_ns_like_2 = max(((n-2) // 5) + 1, 0)\r\n num_of_ns_like_3 = max(((n-3) // 5) + 1, 0)\r\n num_of_ns_like_4 = max(((n-4) // 5) + 1, 0)\r\n num_of_ns_like_5 = max(((n-5) // 5) + 1, 0)\r\n ans = ((m + 1) // 5) * num_of_ns_like_1\r\n ans += ((m + 2) // 5) * num_of_ns_like_2\r\n ans += ((m + 3) // 5) * num_of_ns_like_3\r\n ans += ((m + 4) // 5) * num_of_ns_like_4\r\n ans += ((m) // 5) * num_of_ns_like_5\r\n \r\n \r\n return ans\r\n\r\ndef main():\r\n n, m = [int(i) for i in input().split()]\r\n print(answer(n, m))\r\n\r\n\r\n return\r\nmain()", "import sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n d1, d2 = {0: 0, 1: 0, 2: 0, 3: 0, 4: 0}, {0: 0, 1: 0, 2: 0, 3: 0, 4: 0}\r\n\r\n for i in range(1, n+1):\r\n d1[i % 5] += 1\r\n\r\n for i in range(1, m+1):\r\n d2[i % 5] += 1\r\n\r\n ans = 0\r\n for key in d1:\r\n if key == 0:\r\n ans += d1[0] * d2.get(0, 0)\r\n continue\r\n if 5 - key in d2:\r\n ans += d2[5 - key] * d1[key]\r\n print(ans)\r\n", "n,k=map(int,input().split())\r\n\r\ncounter=0\r\nif n>k:\r\n h1=k\r\n h2=n\r\nelse:\r\n h1=n\r\n h2=k\r\n\r\nd=h2//5\r\nmod=h2%5\r\nr=h1//5\r\nmod2=h1%5\r\ncounter=d*r*5+mod*r+mod2*d\r\nfor i in range(mod):\r\n for j in range (mod2):\r\n if ((i+1)+(j+1))%5==0:\r\n counter+=1\r\n\r\n\r\nprint(int(counter))", "import math\r\n\r\ny = [int(i) for i in input().split()]\r\nn = y[0]\r\nm = y[1]\r\n\r\na=[0,0,0,0,0]\r\nb=[0,0,0,0,0]\r\n\r\nfor i in range(1,n+1):\r\n a[i%5]=a[i%5]+1\r\nfor j in range(1,m+1):\r\n b[j%5]=b[j%5]+1\r\n\r\nprint(a[0]*b[0] + a[1]*b[4] + a[2]*b[3] + b[2]*a[3] + a[4]*b[1])\r\n\r\n", "n, m = map(int, input().split())\r\nmini = min(n, m)\r\nmaxi = max(n,m)\r\npairs = 0\r\nfor i in range(1, mini+1):\r\n sum = i + maxi\r\n pairs += sum // 5 - (i // 5)\r\nprint(pairs) ", "n,m=map(int,input().split())\r\na1=n//5;a2=m//5\r\nb1=n%5;b2=m%5\r\ns=0\r\nif b1==1 and b2==4:\r\n s=1\r\nelif b1==2:\r\n s=max(0,b2-2)\r\nelif b1==3:\r\n s=max(0,b2-1)\r\nelif b1==4:\r\n s=max(0,b2) \r\nprint(a1*a2*5+b1*a2+b2*a1+s)", "n,m=map(int,input().split())\r\nans=0\r\nrems=[0]*m\r\n\r\nfor i in range(1,n+1):\r\n yep=i%5\r\n ans+=(yep+m)//5\r\nprint(ans)", "n,m=map(int,input().split())\r\nk=max(n,m)\r\ns=0\r\nz=1+k\r\nfor x in range(1,min(n,m)+1):\r\n s+=z//5-(x//5)\r\n z+=1\r\nprint(s)", "n, m = map(int, input().split())\r\na, b = [0] * 5, [0] * 5\r\n\r\nfor i in range(1, n+1):\r\n a[i % 5] += 1\r\n\r\nfor j in range(1, m+1):\r\n b[j % 5] += 1\r\n\r\nprint(a[0]*b[0] + a[4]*b[1] + a[3]*b[2] + a[2]*b[3] + a[1]*b[4])", "n,m = map(int,input().split())\r\ngr = n if n>m else m \r\nsm = n+m-gr\r\nsave=0\r\nst=0\r\nfor i in range(1,sm+1):\r\n\tgr+=1\r\n\ttemp=gr//5\r\n\tif i%5==0:\t\t\r\n\t\tst+=1\r\n\ttemp-=1*st\t\t\r\n\tsave+=temp\r\nprint(save)", "import math\r\ndef yzd_solution(n, m):\r\n answer = 0\r\n for i in range(1,m+1):\r\n answer += (n + (i%5))//5\r\n print(answer)\r\n\r\nn, m = map(int, input().split())\r\nyzd_solution(n, m)", "from sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\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, m = iia()\r\nd = {}\r\nfor i in range(1,n+1):\r\n d.setdefault(i % 5, [0])[0] += 1 \r\nres = 0\r\nfor i in range(1, m + 1):\r\n cur = 5 - (i % 5) if i % 5 != 0 else 0\r\n res += d.get(cur, [0])[0]\r\nprint(res)\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nli = [0] * 5\r\nfor i in range(1, m + 1):\r\n if i % 5 == 0:\r\n li[0] += 1\r\n elif i % 5 == 1:\r\n li[1] += 1\r\n elif i % 5 == 2:\r\n li[2] += 1\r\n elif i % 5 == 3:\r\n li[3] += 1\r\n elif i % 5 == 4:\r\n li[4] += 1\r\nans = n // 5 * sum(li)\r\nif n % 5 == 0:\r\n pass\r\nelif n % 5 == 1:\r\n ans += li[4]\r\nelif n % 5 == 2:\r\n ans += li[3] + li[4]\r\nelif n % 5 == 3:\r\n ans += li[3] + li[4] + li[2]\r\nelif n % 5 == 4:\r\n ans += li[3] + li[4] + li[2] + li[1]\r\nprint(ans)", "def take_down(number):\r\n number = int(number)\r\n return int(number-number%5)\r\n\r\n\r\nc1, c2 = map(int, input().split())\r\nres = 0\r\n\r\nfor i in range(1, c1+1):\r\n max = i + c2 \r\n res += (take_down(max)/5 - take_down(i)/5)\r\n \r\nprint(int(res))", "n, m = map(int, input().split())\r\n\r\nx = [0, 0, 0, 0, 0]\r\ny = [0, 0, 0, 0, 0]\r\n\r\nfor i in range(1, n+1):\r\n x[i%5] += 1\r\n\r\nfor i in range(1, m+1):\r\n y[i%5] += 1\r\n \r\nprint(x[1]*y[4] + x[2]*y[3] + x[3]*y[2] + x[4]*y[1] + x[0]*y[0])", "n,m = list(map(int,input().split()))\r\ncm = {}\r\ncn = {}\r\nx = n//5\r\ny = m//5\r\nfor i in range(5):\r\n cm[i]=y\r\n cn[i]=x\r\nx = n%5\r\ny = m%5\r\nfor i in range(1,x+1):\r\n cn[i]+=1\r\nfor i in range(1,y+1):\r\n cm[i]+=1\r\nres = cm[0]*cn[0]\r\nfor i in range(1,5):\r\n res+=cm[i]*cn[5-i]\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def count_pairs_divisible_by_5(n, m):\r\n count = 0\r\n count_mod = [0] * 5\r\n\r\n for i in range(1, n+1):\r\n count_mod[i % 5] += 1\r\n\r\n for i in range(1, m+1):\r\n count += count_mod[(5 - (i % 5)) % 5]\r\n\r\n return count\r\nn, m = map(int, input().split())\r\n\r\nresult = count_pairs_divisible_by_5(n, m)\r\nprint(result)\r\n", "import math\r\nn,m=map(int,input().split())\r\nc=[0 for i in range(5)]\r\nfor i in range(5):\r\n a=math.ceil((m-i)/5)\r\n b=5-((m-i)%5)\r\n c[b-1]=a\r\nd=sum(c)*(n//5)\r\ne=n%5\r\nd+=sum(c[:e])\r\nprint(d)\r\n", "def main():\r\n n, m = map(int, input().split())\r\n print(solve(n, m))\r\n\r\ndef solve(n, m):\r\n return sum(compute_mod_five_num(i, n) * compute_mod_five_num((5 - i) % 5, m) for i in range(5))\r\n\r\ndef compute_mod_five_num(modulus, limit):\r\n return limit // 5 + (1 if modulus != 0 and modulus <= limit % 5 else 0)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\n\r\ns1 = [0, 0, 0, 0, 0]\r\ns2 = [0, 0, 0, 0, 0]\r\nfor i in range(1, n + 1):\r\n\ts1[i % 5] += 1\r\n\r\nfor i in range(1, m + 1):\r\n\ts2[i % 5] += 1\r\n\r\n\r\nprint(s1[0] * s2[0] + s1[1] * s2[4] + s1[2] * s2[3] + s1[3] * s2[2] + s1[4] * s2[1])\r\n\r\n\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())\nI=lambda :int(input())\na,b=M()\nl=[a//5]*5\nm=[b//5]*5\nif(a%5):\n for i in range(1,a%5+1):\n l[i]+=1\nif(b%5):\n for i in range(1,b%5+1):\n m[i]+=1\nc=0\nfor i in range(1,5):\n c+=l[i]*m[5-i]\nc+=l[0]*m[0]\nprint(c)\n \n", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nm = inputs[1]\r\nc=0\r\nlist1=[0 for i in range(0,5)]\r\nfor i in range(1,m+1):\r\n rem = i%5\r\n list1[rem]+=1\r\nfor i in range(1,n+1):\r\n x=i\r\n y = 5 - (i%5)\r\n if(y==5):\r\n y=0\r\n c+=list1[y]\r\nprint(c)", "n,m = input().split()\r\nn,m = int(n), int(m)\r\nstart = 0\r\ncount = 0\r\nadd = [m//5,m//5,m//5,m//5,m//5]\r\nif m%5 == 1:\r\n add[0] += 1\r\nelif m%5 == 2:\r\n add[0] += 1\r\n add[1] += 1\r\nelif m%5 == 3:\r\n add[0] += 1\r\n add[1] += 1\r\n add[2] += 1\r\nelif m%5 == 4:\r\n add[0] += 1\r\n add[1] += 1\r\n add[2] += 1\r\n add[3] += 1\r\n#print(add)\r\nfor i in range(1,n+1):\r\n if i%5 == 1:\r\n count += add[3]\r\n elif i%5 == 2:\r\n count += add[2]\r\n elif i%5 == 3:\r\n count += add[1]\r\n elif i%5 == 4:\r\n count += add[0]\r\n else:\r\n count += add[4]\r\n\r\nprint(int(count))", "n,m=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=(m+i%5)//5\r\nprint(ans)\r\n\r\n\r\n# n,m=map(int,input().split())\r\n# print(sum((m+((i+1)%5))//5 for i in range(n)))", "\r\n\r\n\r\nx,y=map(int,input().split())\r\nd={}\r\nans=0\r\nfor i in range(0,5):\r\n d[i]=0\r\n#print(d)\r\nfor i in range(1,x+1):\r\n d[i%5]=d[i%5]+1\r\n#print(d)\r\nfor j in range(1,y+1):\r\n ans=ans+d[(5-j%5)%5]\r\nprint(ans)\r\n", "r=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,r[0]+1):\r\n sum=(r[1]+(i%5))/5\r\n sum=int(sum)\r\n count+=sum\r\nprint(count)", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(1,n+1):\r\n count += (m+i)//5-i//5\r\nprint(count)", "n, m = map(int, input().split())\nnr = [0] * 5\nmr = [0] * 5\n\nfor i in range(1, n + 1):\n nr[i % 5] += 1\n\nfor i in range(1, m + 1):\n mr[i % 5] += 1\n\nans = 0\nfor i in range(5):\n ans += nr[i] * mr[(5 - i) % 5]\n\nprint(ans)", "m,n=map(int,input().split())\r\nprint(((m+4)//5)*((n+1)//5)+((m+1)//5)*((n+4)//5)+((m+3)//5)*((n+2)//5)+((m+2)//5)*((n+3)//5)+(n//5)*(m//5))\r\n", "n,m=list(map(int,input().split()))\r\nnn=[n//5]*5\r\nmm=[m//5]*5\r\nbache1=((n//5)*5)\r\nbache2=(m//5)*5\r\nfor i in range(bache1+1,n+1):\r\n nn[i%5]+=1\r\nfor i in range(bache2+1,m+1):\r\n mm[i%5]+=1\r\nprint((nn[0]*mm[0])+(nn[1]*mm[4])+(nn[2]*mm[3])+(nn[4]*mm[1])+(nn[3]*mm[2]))\r\n", "'''\n ▄████████ ▄███████▄ ▄█ ▄███████▄ ███ █▄ ▄█ ▄█ ▄██████▄ \n ███ ███ ██▀ ▄██ ███ ██▀ ▄██ ███ ███ ███ ███ ███ ███ \n ███ ███ ▄███▀ ███▌ ▄███▀ ███ ███ ███ ███ ███ ███ \n ███ ███ ▀█▀▄███▀▄▄ ███▌ ▀█▀▄███▀▄▄ ███ ███ ███ ███ ███ ███ \n▀███████████ ▄███▀ ▀ ███▌ ▄███▀ ▀ ███ ███ ███ ███ ███ ███ \n ███ ███ ▄███▀ ███ ▄███▀ ███ ███ ███ ███ ███ ███ \n ███ ███ ███▄ ▄█ ███ ███▄ ▄█ ███ ███ ███▌ ▄ ███▌ ▄ ███ ███ \n ███ █▀ ▀████████▀ █▀ ▀████████▀ ████████▀ █████▄▄██ █████▄▄██ ▀██████▀ \n'''\nn,m=map(int,input().split())\nm1=0\nm2=0\nm3=0\nm4=0\nn1=0\nn2=0\nn3=0\nn4=0\nm0=0\nn0=0\nfor i in range(1,n+1):\n\tif i%5==1:\n\t\tn1+=1\n\telif i%5==2:\n\t\tn2+=1\n\telif i%5==3:\n\t\tn3+=1\n\telif i%5==4:\n\t\tn4+=1\n\telse:\n\t\tn0+=1\nfor i in range(1,m+1):\n\tif i%5==1:\n\t\tm1+=1\n\telif i%5==2:\n\t\tm2+=1\n\telif i%5==3:\n\t\tm3+=1\n\telif i%5==4:\n\t\tm4+=1\n\telse:\n\t\tm0+=1\nprint((n4*m1)+(n3*m2)+(n2*m3)+(n1*m4)+(n0*m0))\n", "x, y = map(int, input().split())\r\nA = [x // 5 for i in range(5)]\r\nB = [y // 5 for i in range(5)]\r\n\r\namariA = x % 5\r\namariB = y % 5\r\n\r\nfor i in range(1, amariA + 1):\r\n A[i] += 1\r\nfor i in range(1, amariB + 1):\r\n B[i] += 1\r\nttl = A[0] * B[0]\r\nfor i in range(1, 5):\r\n ttl += A[i] * B[5 - i]\r\nprint(ttl)", "n , m = [int(i) for i in input().split()]\r\nres = 0\r\n\r\nremsM = [0] * 5\r\nremsN = [0] * 5\r\nfor i in range(1,m+1):\r\n remsM[i % 5] += 1\r\n\r\nfor i in range(1,n+1):\r\n remsN[i % 5] += 1\r\n\r\nres = (remsM[0] * remsN[0]) + (remsM[1] * remsN[4]) + (remsM[2] * remsN[3]) + (remsM[3] * remsN[2]) + (remsM[4] * remsN[1])\r\nprint(res)", "l=list(map(int,input().split(\" \")))\nn=l[0]\nm=l[1]\na=list()\nb=list()\ntotal=0\nif m>=n:\n\tfor i in range(1,n+1):\n\t\ta.append(i%5)\n\t\tb.append(i%5)\n\tfor i in range(n+1,m+1):\n\t\tb.append(i%5)\nelse:\n\tfor i in range(1,m+1):\n\t\ta.append(i%5)\n\t\tb.append(i%5)\n\tfor i in range(m+1,n+1):\n\t\ta.append(i%5)\nif a.count(0)>0 and b.count(0)>0:\n\ttotal=total+a.count(0)*b.count(0)\nif a.count(1)>0 and b.count(4)>0:\n\ttotal=total+a.count(1)*b.count(4)\nif a.count(2)>0 and b.count(3)>0:\n\ttotal=total+a.count(2)*b.count(3)\nif a.count(3)>0 and b.count(2)>0:\n\ttotal=total+a.count(3)*b.count(2)\nif a.count(4)>0 and b.count(1)>0:\n\ttotal=total+a.count(4)*b.count(1)\nprint(total)\n\n\n", "# n,m=map(int,input().split())\r\n# cnt=[0]*5\r\n# s=0\r\n# for i in range(1,m+1):\r\n# cnt[i%5]+=1\r\n# for i in range(1,n+1):\r\n# if i%5==0:\r\n# s+=cnt[0]\r\n# else:\r\n# s+=cnt[5-i%5]\r\n# print(s)\r\n\r\nn,m=list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if (m+(i)%5)//5:\r\n count+=(m+(i)%5)//5\r\n\r\nprint(count)\r\n\r\n# print((15%5)//5)\r\n# print((2%5)//5)", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\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\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 cn = defaultdict(int)\r\n cm = defaultdict(int)\r\n\r\n for d in range(1,11):\r\n cn[d%10] = n//10\r\n cm[d%10] = m//10\r\n for i in range(1, n%10+1):\r\n cn[i] += 1\r\n for i in range(1, m%10+1):\r\n cm[i] += 1\r\n\r\n ans = 0\r\n for i in range(0, 10):\r\n pre = ans\r\n ans += cn[i] * cm[0-i]\r\n ans += cn[i] * cm[5-i]\r\n ans += cn[i] * cm[10-i]\r\n ans += cn[i] * cm[15-i]\r\n print(ans)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()\r\n", "def main():\r\n l = input().split()\r\n n = int(min(int(l[0]), int(l[1])))\r\n m = int(max(int(l[0]), int(l[1])))\r\n nbr = 0\r\n for i in range(1,n+1) :\r\n nbr += (i%5+m)//5\r\n print(nbr)\r\nif __name__ == '__main__': main()", "first_column_max, second_column_max = map(int, input().split())\n\nbigger_column_max, smaller_column_max = ((first_column_max, second_column_max)\n if first_column_max > second_column_max\n else (second_column_max, first_column_max))\n\nnumber_of_pairs = 0\n\nfor number in range(1, smaller_column_max + 1):\n number_of_pairs += (number + bigger_column_max) // 5 - number // 5\n\nprint(number_of_pairs)\n", "n , m = map(int,input().split())\r\n\r\nans = 0\r\n\r\nfor i in range(1 , n+1):\r\n ans += (i%5 + m ) // 5\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "from math import floor\r\nn, m = map(int, input().split())\r\ntotal = 0\r\nfor x in range(1, n + 1):\r\n total += floor((m + x % 5) / 5)\r\nprint(total)", "def fact(n):\r\n x = n//5\r\n if(n%5==4):\r\n l = [x,x+1,x+1,x+1,x+1]\r\n elif(n%5==3):\r\n l = [x,x+1,x+1,x+1,x]\r\n elif(n%5==2):\r\n l = [x,x+1,x+1,x,x]\r\n elif(n%5==1):\r\n l = [x,x+1,x,x,x]\r\n else:\r\n l = [x,x,x,x,x] \r\n \r\n return l \r\n \r\nn,m = map(int,input().split())\r\nr = fact(n)\r\ns = fact(m)\r\nd = s[1:]\r\nd =d[::-1] \r\ns =[s[0]] + d\r\n\r\n\r\n\r\nt = 0 \r\nfor i in range(5):\r\n t = t + s[i]*r[i] \r\n\r\nprint(t) \r\n", "n, m = map(int, input().split())\r\na = [0]*5\r\nb = [0]*5\r\nfor i in range(1, n+1):\r\n a[i%5] += 1\r\nfor i in range(1, m+1):\r\n b[i%5] += 1\r\nprint(a[0]*b[0] + a[1]*b[4] + a[4]*b[1] + a[2]*b[3] + a[3]*b[2])", "n, m = map(int, input().split())\r\nprint(sum((m + ((i + 1) % 5)) // 5 for i in range(n)))", "n, m = [int(x) for x in input().split()]\r\nres = 0\r\ntmp1 = []\r\ntmp2 = []\r\nfor i in range (1, 6):\r\n if n >= i:\r\n tmp1.append(int((n - i) / 5) + 1)\r\n else:\r\n tmp1.append(0)\r\n if m >= i:\r\n tmp2.append(int((m - i) / 5) + 1)\r\n else:\r\n tmp2.append(0)\r\nfor i in range (4):\r\n res += tmp1[i] * tmp2[3 - i]\r\nres += tmp1[4] * tmp2[4]\r\nprint(res)", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(1,n+1):\r\n count+=(m+i%5)//5\r\nprint(count)\r\n ", "a,b=map(int,input().split())\r\nd={}\r\nd[0]=0\r\nd[1]=0\r\nd[2]=0\r\nd[3]=0\r\nd[4]=0\r\nfor i in range(1,a+1):\r\n d[i%5]+=1\r\nt={}\r\nt[0]=0\r\nt[1]=0\r\nt[2]=0\r\nt[3]=0\r\nt[4]=0\r\nfor i in range(1,b+1):\r\n t[i%5]+=1\r\nprint(d[0]*t[0]+d[1]*t[4]+d[2]*t[3]+d[3]*t[2]+d[4]*t[1])", "# https://codeforces.com/contest/682/problem/A\r\n\r\nn, m = map(int, input().split())\r\n\r\nans = 0\r\ni = 1\r\n\r\nwhile i <= n:\r\n ans += (m + (i % 5)) // 5\r\n i += 1\r\n\r\nprint(ans)\r\n", "x,y=input().split()\r\n\r\nx=int(x)\r\ny=int(y)\r\nfax = [0]*5\r\nfay = [0]*5\r\nfor i in range(1,x+1):\r\n fax[i%5]+=1\r\n\r\nfor i in range(1,y+1):\r\n fay[i%5]+=1\r\n\r\nprint(fax[0]*fay[0]+fax[1]*fay[4]+fax[4]*fay[1]+fax[2]*fay[3]+fax[3]*fay[2])", "def mod5 (a,b) :\r\n pairs = 0\r\n for x in range(1,a+1):\r\n limit = b + x\r\n #limit = limit - limit%5\r\n pairs += limit//5\r\n pairs -= x//5\r\n return pairs\r\n\r\n\r\n\r\na,b = list(map(int,input().split()))\r\nprint (mod5(a,b))\r\n \r\n \r\n \r\n", "n,m=map(int,input().split())\r\nans = 0\r\nfor i in range(1,1+n):\r\n ans+=(i+m)//5-i//5\r\nprint(ans)", "def main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n count_fives_in_n = n // 5\r\n count_fives_in_m = m // 5\r\n remainder_of_n = n % 5\r\n remainder_of_m = m % 5\r\n total_counter = count_fives_in_m * count_fives_in_n + count_fives_in_m * count_fives_in_n * 4 + remainder_of_n * count_fives_in_m + remainder_of_m * count_fives_in_n\r\n if max(remainder_of_m, remainder_of_n) == 4:\r\n total_counter += min(remainder_of_m, remainder_of_n)\r\n elif max(remainder_of_m, remainder_of_n) == 3:\r\n if min(remainder_of_m, remainder_of_n) == 2:\r\n total_counter += 1\r\n elif min(remainder_of_m, remainder_of_n) == 3:\r\n total_counter += 2\r\n print(total_counter)\r\n\r\n\r\n\r\nmain_function()\r\n\r\n" ]

[ "from bisect import bisect_left, bisect_right, insort\nfrom itertools import chain, repeat, starmap\nfrom functools import reduce\nfrom math import log\nfrom operator import add, eq, ne, gt, ge, lt, le, iadd\nfrom collections.abc import Sequence\n\n\nclass SortedList:\n DEFAULT_LOAD_FACTOR = 1000\n\n def __init__(self, iterable=None, key=None):\n assert key is None, 'Please use SortedKeyList'\n self._len = 0\n self._load = self.DEFAULT_LOAD_FACTOR\n self._lists = []\n self._maxes = []\n self._index = []\n self._offset = 0\n if iterable is not None:\n self._update(iterable)\n\n def _reset(self, load):\n values = reduce(iadd, self._lists, [])\n self._clear()\n self._load = load\n self._update(values)\n\n def clear(self):\n self._len = 0\n del self._lists[:]\n del self._maxes[:]\n del self._index[:]\n self._offset = 0\n\n _clear = clear\n\n def add(self, value):\n _lists = self._lists\n _maxes = self._maxes\n if _maxes:\n pos = bisect_right(_maxes, value)\n if pos == len(_maxes):\n pos -= 1\n _lists[pos].append(value)\n _maxes[pos] = value\n else:\n insort(_lists[pos], value)\n self._expand(pos)\n else:\n _lists.append([value])\n _maxes.append(value)\n self._len += 1\n\n def _expand(self, pos):\n _load = self._load\n _lists = self._lists\n _index = self._index\n if len(_lists[pos]) > (_load << 1):\n _maxes = self._maxes\n _lists_pos = _lists[pos]\n half = _lists_pos[_load:]\n del _lists_pos[_load:]\n _maxes[pos] = _lists_pos[-1]\n _lists.insert(pos + 1, half)\n _maxes.insert(pos + 1, half[-1])\n del _index[:]\n else:\n if _index:\n child = self._offset + pos\n while child:\n _index[child] += 1\n child = (child - 1) >> 1\n _index[0] += 1\n\n def update(self, iterable):\n _lists = self._lists\n _maxes = self._maxes\n values = sorted(iterable)\n if _maxes:\n if len(values) * 4 >= self._len:\n _lists.append(values)\n values = reduce(iadd, _lists, [])\n values.sort()\n self._clear()\n else:\n _add = self.add\n for val in values:\n _add(val)\n return\n _load = self._load\n _lists.extend(values[pos:(pos + _load)]\n for pos in range(0, len(values), _load))\n _maxes.extend(sublist[-1] for sublist in _lists)\n self._len = len(values)\n del self._index[:]\n\n _update = update\n\n def __contains__(self, value):\n _maxes = self._maxes\n if not _maxes:\n return False\n pos = bisect_left(_maxes, value)\n if pos == len(_maxes):\n return False\n _lists = self._lists\n idx = bisect_left(_lists[pos], value)\n return _lists[pos][idx] == value\n\n def discard(self, value):\n _maxes = self._maxes\n if not _maxes:\n return\n pos = bisect_left(_maxes, value)\n if pos == len(_maxes):\n return\n _lists = self._lists\n idx = bisect_left(_lists[pos], value)\n if _lists[pos][idx] == value:\n self._delete(pos, idx)\n\n def remove(self, value):\n _maxes = self._maxes\n if not _maxes:\n raise ValueError('{0!r} not in list'.format(value))\n pos = bisect_left(_maxes, value)\n if pos == len(_maxes):\n raise ValueError('{0!r} not in list'.format(value))\n _lists = self._lists\n idx = bisect_left(_lists[pos], value)\n if _lists[pos][idx] == value:\n self._delete(pos, idx)\n else:\n raise ValueError('{0!r} not in list'.format(value))\n\n def _delete(self, pos, idx):\n _lists = self._lists\n _maxes = self._maxes\n _index = self._index\n _lists_pos = _lists[pos]\n del _lists_pos[idx]\n self._len -= 1\n len_lists_pos = len(_lists_pos)\n if len_lists_pos > (self._load >> 1):\n _maxes[pos] = _lists_pos[-1]\n if _index:\n child = self._offset + pos\n while child > 0:\n _index[child] -= 1\n child = (child - 1) >> 1\n _index[0] -= 1\n elif len(_lists) > 1:\n if not pos:\n pos += 1\n prev = pos - 1\n _lists[prev].extend(_lists[pos])\n _maxes[prev] = _lists[prev][-1]\n del _lists[pos]\n del _maxes[pos]\n del _index[:]\n self._expand(prev)\n elif len_lists_pos:\n _maxes[pos] = _lists_pos[-1]\n else:\n del _lists[pos]\n del _maxes[pos]\n del _index[:]\n\n def _loc(self, pos, idx):\n if not pos:\n return idx\n _index = self._index\n if not _index:\n self._build_index()\n total = 0\n pos += self._offset\n while pos:\n if not pos & 1:\n total += _index[pos - 1]\n pos = (pos - 1) >> 1\n return total + idx\n\n def _pos(self, idx):\n if idx < 0:\n last_len = len(self._lists[-1])\n if (-idx) <= last_len:\n return len(self._lists) - 1, last_len + idx\n idx += self._len\n if idx < 0:\n raise IndexError('list index out of range')\n elif idx >= self._len:\n raise IndexError('list index out of range')\n if idx < len(self._lists[0]):\n return 0, idx\n _index = self._index\n if not _index:\n self._build_index()\n pos = 0\n child = 1\n len_index = len(_index)\n while child < len_index:\n index_child = _index[child]\n if idx < index_child:\n pos = child\n else:\n idx -= index_child\n pos = child + 1\n child = (pos << 1) + 1\n return (pos - self._offset, idx)\n\n def _build_index(self):\n row0 = list(map(len, self._lists))\n if len(row0) == 1:\n self._index[:] = row0\n self._offset = 0\n return\n head = iter(row0)\n tail = iter(head)\n row1 = list(starmap(add, zip(head, tail)))\n if len(row0) & 1:\n row1.append(row0[-1])\n if len(row1) == 1:\n self._index[:] = row1 + row0\n self._offset = 1\n return\n size = 2 ** (int(log(len(row1) - 1, 2)) + 1)\n row1.extend(repeat(0, size - len(row1)))\n tree = [row0, row1]\n while len(tree[-1]) > 1:\n head = iter(tree[-1])\n tail = iter(head)\n row = list(starmap(add, zip(head, tail)))\n tree.append(row)\n reduce(iadd, reversed(tree), self._index)\n self._offset = size * 2 - 1\n\n def __delitem__(self, index):\n if isinstance(index, slice):\n start, stop, step = index.indices(self._len)\n if step == 1 and start < stop:\n if start == 0 and stop == self._len:\n return self._clear()\n elif self._len <= 8 * (stop - start):\n values = self._getitem(slice(None, start))\n if stop < self._len:\n values += self._getitem(slice(stop, None))\n self._clear()\n return self._update(values)\n indices = range(start, stop, step)\n if step > 0:\n indices = reversed(indices)\n _pos, _delete = self._pos, self._delete\n for index in indices:\n pos, idx = _pos(index)\n _delete(pos, idx)\n else:\n pos, idx = self._pos(index)\n self._delete(pos, idx)\n\n def __getitem__(self, index):\n _lists = self._lists\n if isinstance(index, slice):\n start, stop, step = index.indices(self._len)\n if step == 1 and start < stop:\n if start == 0 and stop == self._len:\n return reduce(iadd, self._lists, [])\n start_pos, start_idx = self._pos(start)\n start_list = _lists[start_pos]\n stop_idx = start_idx + stop - start\n if len(start_list) >= stop_idx:\n return start_list[start_idx:stop_idx]\n if stop == self._len:\n stop_pos = len(_lists) - 1\n stop_idx = len(_lists[stop_pos])\n else:\n stop_pos, stop_idx = self._pos(stop)\n prefix = _lists[start_pos][start_idx:]\n middle = _lists[(start_pos + 1):stop_pos]\n result = reduce(iadd, middle, prefix)\n result += _lists[stop_pos][:stop_idx]\n return result\n if step == -1 and start > stop:\n result = self._getitem(slice(stop + 1, start + 1))\n result.reverse()\n return result\n indices = range(start, stop, step)\n return list(self._getitem(index) for index in indices)\n else:\n if self._len:\n if index == 0:\n return _lists[0][0]\n elif index == -1:\n return _lists[-1][-1]\n else:\n raise IndexError('list index out of range')\n if 0 <= index < len(_lists[0]):\n return _lists[0][index]\n len_last = len(_lists[-1])\n if -len_last < index < 0:\n return _lists[-1][len_last + index]\n pos, idx = self._pos(index)\n return _lists[pos][idx]\n\n _getitem = __getitem__\n\n def __iter__(self):\n return chain.from_iterable(self._lists)\n\n def __reversed__(self):\n return chain.from_iterable(map(reversed, reversed(self._lists)))\n\n def islice(self, start=None, stop=None, reverse=False):\n _len = self._len\n if not _len:\n return iter(())\n start, stop, _ = slice(start, stop).indices(self._len)\n if start >= stop:\n return iter(())\n _pos = self._pos\n min_pos, min_idx = _pos(start)\n if stop == _len:\n max_pos = len(self._lists) - 1\n max_idx = len(self._lists[-1])\n else:\n max_pos, max_idx = _pos(stop)\n return self._islice(min_pos, min_idx, max_pos, max_idx, reverse)\n\n def _islice(self, min_pos, min_idx, max_pos, max_idx, reverse):\n _lists = self._lists\n if min_pos > max_pos:\n return iter(())\n if min_pos == max_pos:\n if reverse:\n indices = reversed(range(min_idx, max_idx))\n return map(_lists[min_pos].__getitem__, indices)\n indices = range(min_idx, max_idx)\n return map(_lists[min_pos].__getitem__, indices)\n next_pos = min_pos + 1\n if next_pos == max_pos:\n if reverse:\n min_indices = range(min_idx, len(_lists[min_pos]))\n max_indices = range(max_idx)\n return chain(\n map(_lists[max_pos].__getitem__, reversed(max_indices)),\n map(_lists[min_pos].__getitem__, reversed(min_indices)),\n )\n min_indices = range(min_idx, len(_lists[min_pos]))\n max_indices = range(max_idx)\n return chain(\n map(_lists[min_pos].__getitem__, min_indices),\n map(_lists[max_pos].__getitem__, max_indices),\n )\n if reverse:\n min_indices = range(min_idx, len(_lists[min_pos]))\n sublist_indices = range(next_pos, max_pos)\n sublists = map(_lists.__getitem__, reversed(sublist_indices))\n max_indices = range(max_idx)\n return chain(\n map(_lists[max_pos].__getitem__, reversed(max_indices)),\n chain.from_iterable(map(reversed, sublists)),\n map(_lists[min_pos].__getitem__, reversed(min_indices)),\n )\n min_indices = range(min_idx, len(_lists[min_pos]))\n sublist_indices = range(next_pos, max_pos)\n sublists = map(_lists.__getitem__, sublist_indices)\n max_indices = range(max_idx)\n return chain(\n map(_lists[min_pos].__getitem__, min_indices),\n chain.from_iterable(sublists),\n map(_lists[max_pos].__getitem__, max_indices),\n )\n\n def irange(self, minimum=None, maximum=None, inclusive=(True, True),\n reverse=False):\n _maxes = self._maxes\n if not _maxes:\n return iter(())\n _lists = self._lists\n if minimum is None:\n min_pos = 0\n min_idx = 0\n else:\n if inclusive[0]:\n min_pos = bisect_left(_maxes, minimum)\n if min_pos == len(_maxes):\n return iter(())\n min_idx = bisect_left(_lists[min_pos], minimum)\n else:\n min_pos = bisect_right(_maxes, minimum)\n if min_pos == len(_maxes):\n return iter(())\n min_idx = bisect_right(_lists[min_pos], minimum)\n if maximum is None:\n max_pos = len(_maxes) - 1\n max_idx = len(_lists[max_pos])\n else:\n if inclusive[1]:\n max_pos = bisect_right(_maxes, maximum)\n if max_pos == len(_maxes):\n max_pos -= 1\n max_idx = len(_lists[max_pos])\n else:\n max_idx = bisect_right(_lists[max_pos], maximum)\n else:\n max_pos = bisect_left(_maxes, maximum)\n if max_pos == len(_maxes):\n max_pos -= 1\n max_idx = len(_lists[max_pos])\n else:\n max_idx = bisect_left(_lists[max_pos], maximum)\n return self._islice(min_pos, min_idx, max_pos, max_idx, reverse)\n\n def __len__(self):\n return self._len\n\n def bisect_left(self, value):\n _maxes = self._maxes\n if not _maxes:\n return 0\n pos = bisect_left(_maxes, value)\n if pos == len(_maxes):\n return self._len\n idx = bisect_left(self._lists[pos], value)\n return self._loc(pos, idx)\n\n def bisect_right(self, value):\n _maxes = self._maxes\n if not _maxes:\n return 0\n pos = bisect_right(_maxes, value)\n if pos == len(_maxes):\n return self._len\n idx = bisect_right(self._lists[pos], value)\n return self._loc(pos, idx)\n\n bisect = bisect_right\n _bisect_right = bisect_right\n\n def count(self, value):\n _maxes = self._maxes\n if not _maxes:\n return 0\n pos_left = bisect_left(_maxes, value)\n if pos_left == len(_maxes):\n return 0\n _lists = self._lists\n idx_left = bisect_left(_lists[pos_left], value)\n pos_right = bisect_right(_maxes, value)\n if pos_right == len(_maxes):\n return self._len - self._loc(pos_left, idx_left)\n idx_right = bisect_right(_lists[pos_right], value)\n if pos_left == pos_right:\n return idx_right - idx_left\n right = self._loc(pos_right, idx_right)\n left = self._loc(pos_left, idx_left)\n return right - left\n\n def copy(self):\n return self.__class__(self)\n\n __copy__ = copy\n\n def pop(self, index=-1):\n if not self._len:\n raise IndexError('pop index out of range')\n _lists = self._lists\n if index == 0:\n val = _lists[0][0]\n self._delete(0, 0)\n return val\n if index == -1:\n pos = len(_lists) - 1\n loc = len(_lists[pos]) - 1\n val = _lists[pos][loc]\n self._delete(pos, loc)\n return val\n if 0 <= index < len(_lists[0]):\n val = _lists[0][index]\n self._delete(0, index)\n return val\n len_last = len(_lists[-1])\n if -len_last < index < 0:\n pos = len(_lists) - 1\n loc = len_last + index\n val = _lists[pos][loc]\n self._delete(pos, loc)\n return val\n pos, idx = self._pos(index)\n val = _lists[pos][idx]\n self._delete(pos, idx)\n return val\n\n def index(self, value, start=None, stop=None):\n _len = self._len\n if not _len:\n raise ValueError('{0!r} is not in list'.format(value))\n if start is None:\n start = 0\n if start < 0:\n start += _len\n if start < 0:\n start = 0\n if stop is None:\n stop = _len\n if stop < 0:\n stop += _len\n if stop > _len:\n stop = _len\n if stop <= start:\n raise ValueError('{0!r} is not in list'.format(value))\n _maxes = self._maxes\n pos_left = bisect_left(_maxes, value)\n if pos_left == len(_maxes):\n raise ValueError('{0!r} is not in list'.format(value))\n _lists = self._lists\n idx_left = bisect_left(_lists[pos_left], value)\n if _lists[pos_left][idx_left] != value:\n raise ValueError('{0!r} is not in list'.format(value))\n stop -= 1\n left = self._loc(pos_left, idx_left)\n if start <= left:\n if left <= stop:\n return left\n else:\n right = self._bisect_right(value) - 1\n if start <= right:\n return start\n raise ValueError('{0!r} is not in list'.format(value))\n\n def __add__(self, other):\n values = reduce(iadd, self._lists, [])\n values.extend(other)\n return self.__class__(values)\n\n __radd__ = __add__\n\n def __iadd__(self, other):\n self._update(other)\n return self\n\n def __mul__(self, num):\n values = reduce(iadd, self._lists, []) * num\n return self.__class__(values)\n\n __rmul__ = __mul__\n\n def __imul__(self, num):\n values = reduce(iadd, self._lists, []) * num\n self._clear()\n self._update(values)\n return self\n\n def __make_cmp(seq_op, symbol, doc):\n def comparer(self, other):\n if not isinstance(other, Sequence):\n return NotImplemented\n self_len = self._len\n len_other = len(other)\n if self_len != len_other:\n if seq_op is eq:\n return False\n if seq_op is ne:\n return True\n for alpha, beta in zip(self, other):\n if alpha != beta:\n return seq_op(alpha, beta)\n return seq_op(self_len, len_other)\n\n seq_op_name = seq_op.__name__\n comparer.__name__ = '__{0}__'.format(seq_op_name)\n return comparer\n\n __eq__ = __make_cmp(eq, '==', 'equal to')\n __ne__ = __make_cmp(ne, '!=', 'not equal to')\n __lt__ = __make_cmp(lt, '<', 'less than')\n __gt__ = __make_cmp(gt, '>', 'greater than')\n __le__ = __make_cmp(le, '<=', 'less than or equal to')\n __ge__ = __make_cmp(ge, '>=', 'greater than or equal to')\n __make_cmp = staticmethod(__make_cmp)\n\n def __reduce__(self):\n values = reduce(iadd, self._lists, [])\n return (type(self), (values,))\n\nimport sys\n\nenemy_cards_cnt, self_cards_cnt = map(int, sys.stdin.readline().strip().split())\nenemy_attacks, enemy_defenses = [], []\n\nfor _ in range(enemy_cards_cnt):\n card_type, strength = sys.stdin.readline().strip().split()\n if card_type == 'ATK':\n enemy_attacks.append(int(strength))\n else:\n enemy_defenses.append(int(strength))\n\nself_attacks = [int(sys.stdin.readline().strip()) for _ in range(self_cards_cnt)]\n\nenemy_attacks.sort()\nenemy_defenses.sort()\nself_attacks.sort()\n\ndef try_attack(prefix_len: int) -> int or AssertionError:\n assert all(self >= enemy for self, enemy in zip(self_attacks[-prefix_len:], enemy_attacks[:prefix_len]))\n return sum(self_attacks[-prefix_len:]) - sum(enemy_attacks[:prefix_len])\n\ndef try_attack_all() -> int or AssertionError:\n _self_attacks = SortedList(self_attacks)\n for d in enemy_defenses:\n i = _self_attacks.bisect_right(d)\n assert i < len(_self_attacks)\n _self_attacks.pop(i)\n assert len(_self_attacks) >= len(enemy_attacks)\n assert all(self >= enemy for self, enemy in zip(_self_attacks[-len(enemy_attacks):], enemy_attacks))\n return sum(_self_attacks) - sum(enemy_attacks)\n\n\nmax_inflictable_damage = 0\n\nfor p_len in range(1, len(enemy_attacks) + 1):\n try:\n max_inflictable_damage = max(max_inflictable_damage, try_attack(p_len))\n except AssertionError:\n break\n\nelse:\n try:\n max_inflictable_damage = max(max_inflictable_damage, try_attack_all())\n except AssertionError:\n ...\n\nprint(max_inflictable_damage)\n", "n , m = map(int , input().split())\r\na , d = [1e9] , [1e9]\r\nfor x in range(n) :\r\n p , s = input().split()\r\n [d , a][p < 'B'].append(int(s))\r\nv = [int(input()) for y in range(m) ]\r\nfor q in [a , d , v] : q.sort()\r\ns = sum(v)\r\ni = j = 0\r\nfor t in v : \r\n if t > d[i] : s , i = s - t , i + 1\r\n elif t >= a[j] : s , j = s - a[j] , j + 1\r\nif i + j - n : s = 0\r\nprint(max(s , sum(max(0 , y - x) for x , y in zip(a, v[::-1]))))", "import sys\r\nn, m = map(int, input().split())\r\natk = []\r\ndfs = []\r\n\r\nfor _ in range(n):\r\n t, s = input().split()\r\n (atk if t == \"ATK\" else dfs).append(int(s))\r\natk = sorted(atk)\r\ndfs = sorted(dfs)\r\nmine = sorted([int(input()) for _ in range(m)])\r\n\r\n\r\ndef s1():\r\n ret = 0\r\n done = [False] * m\r\n for s in dfs:\r\n check = False\r\n for i in range(m):\r\n if not done[i] and mine[i] > s:\r\n check = True\r\n done[i] = True\r\n break\r\n if not check:\r\n return 0\r\n for s in atk:\r\n check = False\r\n for i in range(m):\r\n if not done[i] and mine[i] >= s:\r\n check = True\r\n done[i] = True\r\n ret += mine[i] - s\r\n break\r\n if not check:\r\n return 0\r\n for i in range(m):\r\n if not done[i]:\r\n ret += mine[i]\r\n return ret\r\n\r\ndef s2():\r\n ret = 0\r\n for i in range(m):\r\n alc = 0\r\n for j in range(min(m - i, len(atk))):\r\n if mine[i + j] < atk[j]:\r\n break\r\n else:\r\n alc += mine[i + j] - atk[j]\r\n ret = max(ret, alc)\r\n return ret\r\n\r\nprint(max(s1(), s2()))\r\n", "n, m = map(int, input().split())\n\n(a, d) = ([], [])\n\nfor i in range(n):\n\n t, val = input().split()\n\n (a if t == 'ATK' else d).append(int(val))\n\nmy = sorted([int(input()) for i in range(m)])\n\na.sort()\n\nd.sort()\n\n\n\ndef solve1():\n\n ret = 0\n\n used = [False] * m\n\n for val in d:\n\n for i in range(m):\n\n if not used[i] and my[i] > val: \n\n used[i] = True\n\n break\n\n else:\n\n return 0\n\n for val in a:\n\n for i in range(m):\n\n if not used[i] and my[i] >= val:\n\n used[i] = True\n\n ret += my[i] - val\n\n break\n\n else:\n\n return 0\n\n return ret + sum([my[i] for i in range(m) if not used[i]])\n\n\n\ndef solve2():\n\n ret = 0\n\n for k in range(min(len(a), m)):\n\n if my[-k-1] >= a[k]: ret += my[-k-1] - a[k]\n\n else: break\n\n return ret\n\n\n\nprint(max(solve1(), solve2()))\n\n\n\n# Made By Mostafa_Khaled", "def function1(mas, mas2):\r\n mas.sort()\r\n mas2.sort()\r\n mas.reverse()\r\n ans = 0\r\n for i in range(min(len(mas), len(mas2))):\r\n if mas[i] > mas2[i]:\r\n ans += mas[i] - mas2[i]\r\n else:\r\n break\r\n return ans\r\ndef function2(mas, mas1, mas2):\r\n mas.sort()\r\n mas1.sort()\r\n mas2.sort()\r\n if len(mas1) + len(mas2) > len(mas):\r\n return 0\r\n f = True\r\n while f and len(mas2) > 0:\r\n f = False\r\n for i in range(len(mas)):\r\n if mas[i] > mas2[0]:\r\n mas2.pop(0)\r\n mas.pop(i)\r\n f = True\r\n break\r\n if len(mas2) != 0:\r\n return 0\r\n ans = 0\r\n f = True\r\n while f and len(mas1) > 0:\r\n f = False\r\n for i in range(len(mas)):\r\n if mas[i] >= mas1[0]:\r\n ans += mas[i] - mas1[0]\r\n mas1.pop(0)\r\n mas.pop(i)\r\n f = True\r\n break\r\n if len(mas1) != 0:\r\n return 0\r\n ans += sum(mas)\r\n return ans\r\ndef main():\r\n n, m = map(int, input().split())\r\n mas1 = []\r\n mas2 = []\r\n mas3 = []\r\n for _ in range(n):\r\n s, d = input().split()\r\n d = int(d)\r\n if s == \"ATK\":\r\n mas1.append(d)\r\n else:\r\n mas2.append(d)\r\n for _ in range(m):\r\n d = int(input())\r\n mas3.append(d)\r\n ans1 = function1(mas3, mas1)\r\n ans2 = function2(mas3, mas1, mas2)\r\n print(max(ans1, ans2))\r\nif __name__ == \"__main__\":\r\n main()# 1691702660.3649907" ]

[ "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\n#a.sort()\r\nl=[]\r\nfor i in range(n):\r\n l.append((a[i],i+1))\r\nl.sort()\r\ncnt=0\r\np=[]\r\ns=0\r\nk=0\r\n#print(l)\r\nfor i in range(n):\r\n s=s+l[i][0]\r\n if s<=m:\r\n cnt+=1\r\n p.append(l[i][1])\r\n else:\r\n print(cnt)\r\n print(*p)\r\n k=1\r\n break\r\nif k==0:\r\n print(cnt)\r\n print(*p) ", "n, k = map(int, input().split())\r\nreq_days = [int(c) for c in input().split()]\r\n\r\nreq_days_sorted = sorted((e, i) for i, e in enumerate(req_days, 1))\r\nacc = 0\r\n#print(req_days_sorted)\r\nans = []\r\nfor e, i in req_days_sorted:\r\n #print(acc, i, e, k)\r\n if acc + e <= k:\r\n acc += e\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\nif len(ans) > 0:\r\n print(*ans)\r\n", "def main():\r\n n, k = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n for index, value in enumerate(arr):\r\n arr[index] = (index, value)\r\n arr.sort(key=lambda x: x[1])\r\n\r\n learn_arr = []\r\n s = 0\r\n for element in arr:\r\n s += element[1]\r\n if s > k:\r\n break\r\n else:\r\n learn_arr.append(element[0] + 1)\r\n\r\n print(len(learn_arr))\r\n print(*learn_arr)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]=[a[i],i]\r\n\r\na.sort()\r\nfor i in range(n):\r\n if a[i][0]>k:\r\n print(i)\r\n for j in range(i):\r\n print(a[j][1]+1,end=\" \")\r\n break\r\n else:\r\n k-=a[i][0]\r\nelse:\r\n print(n)\r\n for i in range(1,n+1):\r\n print(i,end=\" \")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nb, a = map(list, (zip(*sorted(zip(map(int, input().split()), range(1,n+1))))))\r\n\r\nc = 0\r\nfor i in b:\r\n k -= i\r\n if k < 0:\r\n break\r\n c += 1\r\nprint(c)\r\nprint(' '.join(map(str, a[:c])))", "n, k = list(map(int, input().split()))\nvalues = [(value, pos) for pos, value in enumerate(map(int, input().split()), start=1)]\nvalues.sort()\n\nx,ans = 0, []\nwhile (x < n) and (values[x][0]) <= k:\n ans.append(values[x][1])\n k -= values[x][0]\n x += 1\n\nprint(len(ans))\nprint(*ans)\n", "\n\nn, k = map(int, input().split())\narr = list(enumerate(list(map(int, input().split()))))\n\narr.sort(key=lambda x: x[1])\n\nins = 0 \nsum_ = 0\nres = []\nfor i in arr:\n if sum_+i[1] <= k:\n sum_ += i[1]\n ins += 1\n res.append(i[0]+1)\n else:\n break\nprint(ins)\nprint(\" \".join([str(i) for i in res]))\n\n\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, k = [int(x) for x in input().split()]\r\nq = [int(x) for x in input().split()]\r\nq = sorted(enumerate(q), key = lambda x : x[1])\r\nans = []\r\ntot = 0\r\nfor idx, item in q:\r\n\tif tot + item <= k:\r\n\t\ttot += item\r\n\t\tans.append(idx+1)\r\n\telse:\r\n\t\tbreak\r\nprint(len(ans))\r\nif len(ans):\r\n\tprint(\" \".join(map(str, ans)))\t\t\r\n", "str=input().split(\" \")\r\nn=int(str[0])\r\nm=int(str[1])\r\nstr=input().split(\" \")\r\nfor i in range(0,n):\r\n str[i]=[int(str[i]),i]\r\n# debug\r\n# print(type(str),str)\r\n# print(type(str[0]))\r\ndef cmp(x,y):\r\n if x[0]<y[0]:\r\n return -1\r\n elif x[0]>y[0]:\r\n return 1\r\n else:\r\n return 0\r\n#str.sort(cmp)\r\nstr=sorted(str)\r\na=0\r\ncnt=0\r\n#debug\r\n#print(type(str),str)\r\nans=[]\r\n#print(type(ans))\r\nfor i in str:\r\n #print(i)\r\n a+=i[0]\r\n if a>m:\r\n break\r\n else:\r\n ans.append(i[1]+1)\r\n cnt += 1\r\nprint(cnt)\r\nfor i in ans:\r\n print(i,end=' ')\r\n ", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\na=list(map(int,input().split()))\r\na1=sorted(a)\r\ni=0\r\nl=[]\r\nwhile k>0:\r\n if a1[i]<=k:\r\n l.append(a1[i])\r\n k-=a1[i]\r\n i+=1\r\n if i>=len(a1):\r\n break\r\n else:\r\n break\r\nif len(l)==0:\r\n print(0)\r\nelse:\r\n print(len(l))\r\n for i in range(0,len(a)):\r\n if a[i] in l:\r\n print(i+1,end=' ')\r\n l.remove(a[i])", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\nc=0\np=max(l)\na=[]\nwhile k>=0:\n\tm=min(l)\n\tif m==p+1:\n\t\tbreak\n\tk-=m\n\tc+=1\n\tif k<0:\n\t\tc-=1\n\t\tbreak\n\telse:\n\t\ti=l.index(m)\n\t\ta.append(i+1)\n\t\tl[i]=p+1\nprint(c)\nprint(*a)\n\t\t\t \t \t \t\t \t \t\t \t \t \t", "n=[int(q)for q in input().split()]\r\ni=[int(q)for q in input().split()]\r\nc=0\r\na=[]\r\nwhile c<n[0]and n[1]>=min(i):\r\n n[1]-=min(i)\r\n c+=1\r\n a.append(i.index(min(i))+1)\r\n i[i.index(min(i))]=101\r\nprint(c)\r\nif c>0:\r\n a.sort()\r\n print(str(a)[1:-1].replace(',',''))\r\n \r\n \r\n", "n,a=input().split()\nn=int(n)\na=int(a)\nd=list(map(int,input().strip().split()))[:n]\naa=sorted(d)\nx=0\ny=0\nc=0\nb=[]\nqq=0\nwhile x+aa[0]<=a:\n y=aa[0]\n b.append(d.index(y))\n qq=d.index(y)\n d[qq]=-1\n x=x+y\n aa.remove(y)\n c=c+1\n if len(aa)==0:\n break\nprint(c)\nfor i in range(len(b)):\n print(b[i]+1,end=\" \")\n \t\t \t \t \t \t\t \t\t\t \t \t\t \t \t", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\ns = '\\n'\r\nfor j, i in sorted(zip(R(), range(n))):\r\n if j <= k:\r\n k -= j\r\n s += str(i + 1) + ' '\r\nprint(str(s.count(' ')) + s)", "n,k=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\na=[[a[i],i+1] for i in range(len(a))]\r\na.sort(key=lambda x:x[0])\r\nres=[]\r\nfor i in range(len(a)):\r\n if k<a[i][0]:\r\n break\r\n res.append(a[i][1])\r\n k-=a[i][0]\r\nprint(len(res))\r\nif len(res)>0:\r\n res=[str(i) for i in res]\r\n print(\" \".join(res))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n b.append([a[i], i + 1])\r\nb.sort()\r\nans = []\r\nfor i in range(n):\r\n if k >= b[i][0]:\r\n k -= b[i][0]\r\n ans.append(b[i][1])\r\n else:\r\n break\r\nprint(len(ans))\r\nif len(ans) > 0:\r\n print(*ans)\r\n", "a=0\r\nlst=[]\r\nz=list(map(int,input().split())) \r\nf=list(map(int,input().split())) \r\nx=sorted(f.copy())\r\nfor i in range(z[0]): \r\n a+=x[i] \r\n if a<=z[1]: \r\n lst.append(x[i])\r\n else:\r\n break\r\nprint(len(lst))\r\nfor i in lst : \r\n if f.count(i)==1:\r\n print(f.index(i)+1,end=' ')\r\n else:\r\n print(f.index(i)+1,end=' ')\r\n f[f.index(i)]=-1", "n,x=map(int,input().split())\nlst=[int(i) for i in input().split()]\nans=[]\nl=sorted(lst)\nk=0\nfor i in l:\n if k+i<=x:\n k=k+i\n p=lst.index(i)\n lst[p]=-1\n ans.append(p+1)\n else:\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", "n,k=map(int,input().split())\nl=[int(x) for x in input().split()]\nl1=l.copy()\nl.sort()\ns=0 \ni=0\nans=[]\n#print(l)\n#print(l1)\nwhile(i<n):\n if((s+l[i])<=k):\n #print(l[i])\n s=s+l[i]\n k1=l1.index(l[i])\n ans.append(k1+1)\n l1[k1]=-10\n else:\n #print(s,l[i],k)\n break \n i=i+1 \nprint(len(ans))\nprint(*ans,sep=\" \")\n \t \t \t \t \t \t \t\t \t \t\t \t", "n, k = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\narr = list(enumerate(arr))\r\narr.sort(key=lambda x:x[1])\r\nd = 0\r\nans = []\r\nfor i in range(len(arr)):\r\n\td += arr[i][1]\r\n\tif d > k:\r\n\t\tbreak\r\n\tans.append(arr[i][0]+1)\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "n, k = list(map(int, input().rstrip().split()))\na = list(map(int, input().rstrip().split()))\nb = a.copy()\na.sort()\nt = 0\nind = []\ncount = 0\nfor x in a:\n if t + x <= k:\n t += x\n count += 1\n for i in range(n):\n if b[i] == x:\n ind += [i + 1]\n b[i] = -1\n break\n else:\n break\nprint(count)\nif count > 0:\n print(*ind)\n", "n,k = map(int,input().split())\r\narr = list()\r\nc = dict()\r\nj = 1\r\nfor i in input().split():\r\n d = int(i)\r\n arr.append(d)\r\n c[d] = c.get(d,list())\r\n c[d].append(j)\r\n j+=1\r\n\r\narr.sort()\r\nans = list()\r\nfor i in arr:\r\n if i>k:\r\n break\r\n else:\r\n k-=i\r\n ans.append(c[i].pop())\r\nprint(len(ans))\r\nprint(*ans)", "n, k = map(int, input().split())\nx = list(map(int, input().split()))\ny = x.copy()\ncnt, i = 0, 0\na = []\ny.sort()\nwhile i < n and k >= y[i]:\n cnt += 1\n a.append(x.index(y[i]) + 1)\n x[x.index(y[i])] = 0\n k -= y[i]\n i += 1\nprint(cnt)\nprint(*a)\n", "n,k = map(int, input().split())\r\narr = sorted(list(zip(range(n), (map(int, input().split())))), key = lambda x: x[1])\r\nans = []\r\ni = 0\r\nwhile k-arr[i][1] >=0:\r\n\tk-=arr[i][1]\r\n\tans.append(arr[i][0]+1)\r\n\ti+=1\r\n\tif i == n:\r\n\t\tbreak\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split())) \r\nind = {}\r\nfor i in range(n):\r\n if a[i] in ind:\r\n ind[a[i]].append(i)\r\n else:\r\n ind[a[i]] = [i]\r\na.sort()\r\nans = []\r\nfor i in a:\r\n if m-i >= 0:\r\n ans.append(ind[i].pop()+1)\r\n else:\r\n break\r\n m -= i\r\nprint(len(ans))\r\nprint(*ans)\r\n", "def sum1(a):\r\n s=0\r\n for i in range(len(a)):\r\n s+=a[i][0]\r\n return s\r\nn,k=map(int,input().split())\r\nd1=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n):\r\n d.append([d1[i],i+1])\r\nd.sort()\r\ns=sum1(d)\r\nj=n\r\nwhile(s>k):\r\n j-=1\r\n s=sum1(d[0:j])\r\nprint(j)\r\nfor i in range(j):\r\n print(d[i][1],end=\" \")", "n,k = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nx=[]\r\nans=[]\r\nsum=0\r\n\r\nfor i in range(n):\r\n x.append([lst[i],i])\r\n\r\nx.sort()\r\n \r\nfor i in range(n):\r\n sum+=x[i][0]\r\n \r\n if sum<=k:\r\n ans.append(x[i][1]+1)\r\n else:\r\n break\r\n\r\nans.sort()\r\n\r\nif len(ans)>0:\r\n print(len(ans))\r\n for i in ans:\r\n print(i, end=' ')\r\nelse:\r\n print(0)", "# your code goes here\nn,k = map(int,input().split())\nl = list(map(int,input().split()))\nr = []\nres =sorted(l)\nc = 0\nfor i in range(n):\n if (res[i]+c)>k:\n break\n else:\n ind = l.index(res[i])\n c = c + res[i]\n l[ind] = -1\n r.append(ind+1)\nprint(len(r))\nprint(*r)\n \t\t\t \t \t \t\t\t\t\t \t \t \t\t\t", "from collections import Counter\r\n\r\ndef solve(n,k,arr):\r\n d = [0]*n\r\n for i,v in enumerate(arr):\r\n d[i] = (v,i+1)\r\n d.sort()\r\n ansarr = []\r\n for v,i in d:\r\n if k-v >= 0:\r\n ansarr.append(i)\r\n k -= v\r\n else:\r\n break\r\n ansarr.sort()\r\n print(len(ansarr))\r\n print(*ansarr)\r\n \r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nsolve(n,k,arr)\r\n\r\n", "n,k = map(int,input().split())\na = list(map(int,input().split()))\ndist = [0]*n\nl = []\npos = 0\naux = 0\nfor i in range(n):\n\tdist[i] = a[i],i+1\ndist = sorted(dist)\n\nsoma = dist[0][0]\n\nwhile(soma <= k):\n\tpos+=1\n\taux+=1\n\tif(pos >= n):\n\t\tbreak\n\tsoma += dist[pos][0]\nfor i in range(aux):\n\tl.append(str(dist[i][1]))\nl = sorted(l)\nprint(aux)\nif aux!=0:\n\tprint(\" \".join(l))\n", "n,d=input().split()\nn=int(n)\nd=int(d)\na=list(map(int,input().strip().split()))[:n]\ndd=sorted(a)\nx=0\ny=0\nc=0\nb=[]\npp=0\nwhile x+dd[0]<=d:\n y=dd[0]\n b.append(a.index(y))\n pp=a.index(y)\n a[pp]=-1\n x=x+y\n dd.remove(y)\n c=c+1\n if len(dd)==0:\n break\nprint(c)\nfor i in range(len(b)):\n print(b[i]+1,end=\" \")\n \t \t \t \t \t \t \t\t \t\t \t\t\t\t", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in a]\r\nb.sort()\r\np,c,d=0,[],[]\r\nfor i in b:\r\n p+=i \r\n if(p<=k):\r\n c.append(i)\r\n else:\r\n break\r\n#print(c)\r\nans=len(c)\r\nprint(ans)\r\nfor i in range(len(a)):\r\n if(a[i] in c):\r\n d.append(i+1)\r\n c.remove(a[i])\r\n#print(d) \r\nfor i in d:\r\n print(i,end=' ')\r\n ", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nd = []\r\nfor i in range(n):\r\n x = []\r\n x.append(l[i])\r\n x.append(i+1)\r\n d.append(x)\r\nd.sort()\r\nc = 0\r\ns = []\r\nf = 0\r\nfor i in range(n):\r\n if c+d[i][0]>k:\r\n break\r\n else:\r\n f+=1\r\n c+=d[i][0]\r\n s.append(d[i][1])\r\n\r\nprint(f)\r\nfor i in range(f):\r\n print(s[i],end=' ')", "s = input()\ns = s.split(\" \")\nn = int(s[0]) # instruments\nk = int(s[1]) # hours\n\na = input()\na = a.split(\" \")\nls = sorted([(int(a[i]),i+1) for i in range(len(a))]) \n# (instrument hours,index) from smallest to greatest\n\n#print(ls)\n\nans = []\nfor x in ls:\n if (k-x[0])<0:\n break\n else:\n k = k-x[0]\n ans.append(x[1])\n\nif len(ans)==0:\n print(0)\nelse:\n print(len(ans))\n for x in ans:\n print(x,end=\" \")\n\n \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\n\r\nd = list(map(int, input().split()))\r\n\r\na = [(d[i], i + 1) for i in range(len(d))]\r\ns_a = sorted(a)\r\n\r\ni = 0\r\nsum1 = 0\r\nwhile (sum1 <= k) and (i < len(a)):\r\n sum1 += s_a[i][0]\r\n i+=1\r\n\r\nif(sum1 > k):\r\n i-=1\r\n\r\nprint(i)\r\nfor iter1 in range(i):\r\n print(s_a[iter1][1], end = \" \")\r\n", "import sys\r\nfrom itertools import groupby\r\nsys.setrecursionlimit(1000000000)\r\nlines = []\r\nfor Line in sys.stdin:\r\n lines.append(Line.rstrip('\\n'))\r\n\r\n\r\n# lines=[\"1 3\",\r\n# \"4\"]\r\nn,k=list(map(int,lines[0].split()))\r\ndel(lines[0])\r\nA=list(map(int,lines[0].split()))\r\ndel(lines[0])\r\n\r\n\r\nB=[]\r\nfor i in range(len(A)):\r\n\tB+=[(A[i],i)]\r\nA=sorted(B)\r\n\r\nT=0\r\ns=0\r\nI=[]\r\nwhile (T<=k)and(s<n):\r\n\tT+=A[s][0]\r\n\tif (T<=k):\r\n\t I+=[A[s][1]+1]\r\n\t s+=1\r\nprint(len(I))\r\nif len(I)>0:\r\n I=sorted(I)\r\n print(*I)\r\n", "R=lambda:map(int,input().split())\r\nn,k=R()\r\nt=[]\r\nfor a,b in sorted(zip(R(),range(n))):\r\n if k>=a:\r\n t+=[b+1]\r\n k-=a\r\nprint(len(t))\r\nprint(' '.join(map(str,t)))\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n a_i = list(map(int, input().split()))\r\n\r\n tuple_list = [(a_i[i], i+1) for i in range(n)]\r\n sorted_tuple = sorted(tuple_list, key= lambda x: x[0])\r\n # Step 4: Run loop\r\n result = []\r\n for a, b in sorted_tuple:\r\n if a <= k:\r\n result.append(b) # append index to result\r\n k = k-a\r\n else:\r\n break\r\n print(len(result))\r\n for k in result:\r\n print(k, end = ' ')\r\n\r\nsolve()\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# create a list of tuples (days, index) to store the number of days required\r\n# to learn an instrument and its index\r\ndays_index = [(a[i], i + 1) for i in range(n)]\r\n# sort the list of tuples by the number of days required to learn an instrument\r\ndays_index.sort()\r\n\r\n# iterate over the sorted list of tuples, subtract the number of days required\r\n# to learn an instrument from k and add the instrument index to a list of\r\n# instruments learned if k is non-negative\r\ninstruments_learned = []\r\nfor i in range(n):\r\n if k >= days_index[i][0]:\r\n k -= days_index[i][0]\r\n instruments_learned.append(days_index[i][1])\r\n else:\r\n break\r\n\r\nprint(len(instruments_learned))\r\nprint(*instruments_learned)\r\n", "n, days = map(int, input().split())\r\noriginal = list(map(int, input().split()))\r\norder = sorted(original)\r\ni = 0\r\nans = []\r\n\r\nwhile len(order) > 0 and order[0] <= days:\r\n days -= order[0]\r\n ind = original.index(order[i])\r\n ans.append(ind + 1)\r\n\r\n original[ind] = 0\r\n order.pop(0)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n_instruments, days = map(int, input().split())\r\ninstruments = list(map(int, input().split()))\r\n\r\ninstruments = [[_ + 1, instruments[_]] for _ in range(n_instruments)]\r\ninstruments.sort(key=lambda x: x[1])\r\n\r\nlearned_instruments = []\r\n\r\nfor i in range(n_instruments):\r\n if sum([instruments[_][1] for _ in range(i + 1)]) <= days:\r\n learned_instruments.append(instruments[i][0])\r\n else:\r\n break\r\n\r\nprint(len(learned_instruments))\r\n\r\nif len(learned_instruments) > 0:\r\n print(*learned_instruments)", "\r\nn, k = map(int, input().split())\r\n\r\nar = [int(x) for x in input().split()]\r\na = []\r\nfor x in range(n):\r\n i = ar[x]\r\n a.append((i, x+1))\r\na.sort()\r\nsumo = 0\r\nans = []\r\nfor i in range(n):\r\n if a[i][0] + sumo > k:\r\n break\r\n else:\r\n ans.append(a[i])\r\n sumo += a[i][0]\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i][1], end=\" \")", "numbers = list(map(int,input().split()))\r\ninstruments = 0\r\ndays = list(map(int, input().split()))\r\nindices = []\r\nwhile numbers[1] > 0:\r\n if min(days) <= numbers[1]:\r\n instruments += 1\r\n numbers[1] -= min(days)\r\n indices.append(str(days.index(min(days))+1))\r\n days[days.index(min(days))] += numbers[1]+1\r\n else:\r\n break\r\nprint(instruments)\r\nprint(\" \".join(indices))\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nbb=k\r\nrip=0\r\ncou=0\r\nz=[]\r\nwhile k>=0 and cou<len(a):\r\n b=min(a)\r\n ind=a.index(b)\r\n k-=b\r\n rip+=b\r\n cou+=1\r\n z.append(ind+1)\r\n a[ind]=100001\r\nif rip>bb:\r\n z.pop()\r\nif len(z)==0:\r\n print(0)\r\nelse:\r\n print(len(z))\r\n print(*z)\r\n ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=sorted(l)\r\n\r\n\r\ns=0\r\na=0\r\np=[]\r\nfor i in range(n):\r\n s+=t[i]\r\n if(s<=k):\r\n a+=1\r\n else:\r\n break\r\n\r\nprint(a)\r\nfor j in range(a):\r\n r=l.index(t[j])\r\n print(r+1,end=\" \")\r\n l[r]=-1\r\n", "l1 = [int(x) for x in input().split()]\r\nn,k = l1[0],l1[1]\r\nl2 = [[int(x)] for x in input().split()]\r\nfor x in range(len(l2)):\r\n l2[x].append(x+1)\r\nl2.sort(reverse=True)\r\nc=[]\r\ndef catorse(listo):\r\n temp=0\r\n for x in listo:\r\n temp+=x[0]\r\n return temp\r\nwhile l2 and catorse(c)<k:\r\n c.append(l2.pop())\r\n #print(c)\r\nif catorse(c)>k:\r\n c.pop()\r\nc = [x[1] for x in c]\r\nprint(len(c))\r\nprint(*c)", "n, m = map(int, input().split()); n = 0\r\nl = list(map(int, input().split()))\r\nll = sorted(l)\r\nidx = []\r\nfor i in range(len(ll)):\r\n if m >= ll[i]:\r\n m -= ll[i]\r\n idx.append(l.index(ll[i]) + 1)\r\n l[l.index(ll[i])] = -1\r\n else:\r\n break\r\nprint(len(idx))\r\nprint(*idx)", "n, k = map(int, input().split())\r\na = [int(item) for item in input().split()]\r\nl = k\r\nmy_list = []\r\nfor element in a:\r\n if min(a) > l:\r\n break\r\n else:\r\n my_list.append(a.index(min(a)) + 1)\r\n l -= min(a)\r\n a[a.index(min(a))] = k\r\nprint(len(my_list))\r\nprint(*my_list)", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn, k = map(lambda v: int(v), input().split())\r\norig = list(map(lambda v: int(v), input().split()))\r\na = sorted(orig)\r\n\r\nc, s = 0, 0\r\nfor i in a:\r\n if s+i<=k:\r\n c+=1\r\n s+=i\r\n else: break\r\n\r\n\r\ndef rep(x):\r\n ind = orig.index(x)\r\n orig[ind] = -1\r\n return ind+1\r\n\r\nprint(c)\r\nprint(*map(lambda x: rep(x), a[0:c]))\r\n\r\n", "n, k = map(int, input().split())\r\na = tuple(map(int, input().split()))\r\na = sorted(zip(a, range(1, len(a) + 1)))\r\nres = []\r\nfor x, i in a:\r\n if x > k:\r\n break\r\n k -= x\r\n res.append(i)\r\nprint(len(res))\r\nprint(*res)", "n, k = map(int, input().split())\r\n\r\ntoLearn = []\r\nsum = 0\r\ndays = list(map(int, input().split()))\r\n\r\nidxs = sorted(range(1, len(days)+1), key=lambda x: days[x-1])\r\ndays.sort()\r\n\r\nfor i in range(n):\r\n sum += days[i]\r\n toLearn.append(idxs[i])\r\n if sum >= k:\r\n break\r\n\r\nif sum > k:\r\n toLearn.pop(-1)\r\n\r\nprint(len(toLearn))\r\nif (len(toLearn)):\r\n print(*toLearn)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted([ele, i+1] for i, ele in enumerate(a))\r\n\r\nres = 0\r\nli = []\r\nfor i, j in b:\r\n k -= i\r\n if k < 0:\r\n break\r\n elif k == 0:\r\n res += 1\r\n li.append(j)\r\n break\r\n res += 1\r\n li.append(j)\r\n\r\nprint(res)\r\nprint(*li)", "R=lambda:map(int,input().split())\nn,k=R(); l=sorted(zip(R(),range(1,n+1))); h = []\nfor _,i in l:\n\tk-=_\n\tif k>=0: h.append(i)\nprint(len(h));print(*h)\n\t\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\nfor i in range(n):\r\n a[i]=(a[i],i+1)\r\na.sort()\r\nm=0\r\nans=[]\r\nwhile m<n and k>=a[m][0]:\r\n k-=a[m][0]\r\n ans.append(a[m][1])\r\n m+=1\r\nif len(ans)>0:\r\n print(m)\r\n print(*ans)\r\nelse:print(0)", "n,d=input().split()\r\nn=int(n)\r\nd=int(d)\r\na=list(map(int,input().strip().split()))[:n]\r\ndd=sorted(a)\r\nx=0\r\ny=0\r\nc=0\r\nb=[]\r\nqq=0\r\nwhile x+dd[0]<=d:\r\n y=dd[0]\r\n b.append(a.index(y))\r\n qq=a.index(y)\r\n a[qq]=-1\r\n x=x+y\r\n dd.remove(y)\r\n c=c+1\r\n if len(dd)==0:\r\n break\r\nprint(c)\r\nfor i in range(len(b)):\r\n print(b[i]+1,end=\" \")", "n,k = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nnw = [(l[i], i+1) for i in range(n)]\r\n\r\nnw.sort()\r\n\r\ncurr = 0\r\ni = 0\r\nans = []\r\nwhile i < n and curr + nw[i][0] <= k:\r\n \r\n curr+=nw[i][0]\r\n ans.append(nw[i][1])\r\n i+=1\r\n \r\nprint(i)\r\nprint(*ans)", "n,tot = map(int,input().split())\r\narr = []\r\nfor i,x in enumerate(input().split()):\r\n\tarr.append([i+1,int(x)])\r\narr.sort(key = lambda x:x[1])\r\nj = 0\r\nsum = 0\r\nans = [] \r\nwhile j < n and tot >= sum+arr[j][1]:\r\n\tsum+=arr[j][1]\r\n\tans.append(arr[j][0])\r\n\tj+=1\r\nprint(j)\r\nif j != 0: \r\n\tprint(*ans)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nnew=[]\r\nans=[]\r\ns=0\r\nfor i in range(n):\r\n new.append([l[i],i+1])\r\nnew.sort()\r\nfor i in range(n):\r\n s+=new[i][0]\r\n if(s<=k):\r\n ans.append(new[i][1])\r\n else:\r\n break\r\nif(len(ans)==0):\r\n print(0)\r\nelse:\r\n print(len(ans))\r\n print(*ans)", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=l.copy()\r\nk.sort()\r\na,flag=0,0\r\nfor i in range(m):\r\n\ta+=k[i]\r\n\tif a==n:\r\n\t\ti=i+1\r\n\t\tflag=1\r\n\t\tbreak\r\n\telif a>n:\r\n\t\tflag=1\r\n\t\tbreak\t\t\r\nif flag==1:\r\n\tprint(i)\r\nelse:\r\n\tprint(m)\r\n\ti=m\t\t\t\r\nfor j in range(i):\r\n\tprint(l.index(k[j])+1,end=' ')\r\n\tl[l.index(k[j])]=-1", "n, k = map(int, input().split())\r\n\r\na = [0]*n\r\nd = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n a[i] = i + 1\r\n\r\ns = sorted(zip(d, a))\r\n\r\n\r\nl_o = list()\r\ni = 0\r\nwhile i < len(s) and k - s[i][0] >= 0:\r\n k -= s[i][0]\r\n l_o.append(s[i][1])\r\n i += 1 \r\n\r\nprint(i)\r\nfor o in l_o:\r\n print(o, end = \" \")", "n,k=input().split()\r\na=[int(i) for i in input().split()]\r\nn=int(n)\r\nk=int(k)\r\n\r\nfor i in range(len(a)):\r\n a[i]=(a[i],i+1)\r\na=sorted(a)\r\nans=[]\r\ntotal=0\r\nfor i in range(len(a)):\r\n if(total+a[i][0]>k):\r\n break\r\n total=total+a[i][0]\r\n ans.append(a[i][1])\r\nans=sorted(ans)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")", "import sys, math, cmath, time, collections\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\r\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n# SOME GENERAL HELPER\r\ndef input_as_array():\r\n return list(map(int, input().split()))\r\n\r\nstart_time = time.time()\r\n\r\n\r\ndef solve(arr, n, k):\r\n \"\"\"\r\n The actual solution begins here\r\n c = a + b\r\n print(c)\r\n \"\"\"\r\n # print(f\"The initial array is: {arr}\")\r\n # Now to print the indices of the instruments to be learnt\r\n g = defaultdict(list)\r\n for i, c in enumerate(arr, 1):\r\n g[c].append(i)\r\n # print(g)\r\n\r\n\r\n arr.sort()\r\n # print(f\"The sorted arr is:\", arr)\r\n s = 0\r\n i = 0\r\n while i < n:\r\n if s + arr[i] <= k:\r\n s += arr[i]\r\n else:\r\n break\r\n i += 1\r\n\r\n print(i)\r\n required = arr[:i]\r\n # print(f\"The required is:\", required)\r\n\r\n op = []\r\n ctr = Counter(required)\r\n for k, v in ctr.items():\r\n op.append(g[k][:v])\r\n # print(op)\r\n\r\n flatten = [k for c in op for k in c]\r\n print(*flatten)\r\n\r\ndef main():\r\n \"\"\"\r\n Main function dedicated to get the I/P\r\n a, b = map(int, input().split())\r\n solve(a, b)\r\n \"\"\"\r\n n, k = map(int, input().split())\r\n arr = input_as_array()\r\n solve(arr, n, k)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n LOCAL = False\r\n\r\n # If it's Local - Get I/P from file\r\n if LOCAL:\r\n sys.stdin = open(\"../io/data.in\", \"r\")\r\n sys.stdout = open(\"../io/data.out\", \"w\")\r\n\r\n testcases = 1\r\n for i in range(testcases):\r\n main()\r\n\r\n # If it's local - Print this O/P\r\n if LOCAL:\r\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\r\n sys.stdout.close()\r\n", "def musical_instrument(n,k,a):\r\n if sum(a) <= k :\r\n print (n)\r\n print (\" \".join(list(map(str,list(range(1,n+1))))))\r\n else:\r\n total = sum(a) \r\n dup = sorted(a.copy())\r\n while total > k and len(dup) > 0 :\r\n total -= dup[-1]\r\n dup.pop(-1)\r\n\r\n if len(dup) == 0:\r\n print (0)\r\n else:\r\n print (len(dup))\r\n ans = []\r\n j = 0\r\n while j < n:\r\n if a[j] in dup:\r\n ans.append(str(j+1))\r\n dup.remove(a[j])\r\n j += 1\r\n\r\n print (\" \".join(ans))\r\n\r\n\r\nn,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nmusical_instrument(n,k,a)\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nindex = {}\r\nfor i in range(n):\r\n if a[i] not in index:\r\n index[a[i]] = [i+1]\r\n else:\r\n index[a[i]].append(i+1)\r\na.sort()\r\nc = 0\r\nres = []\r\nfor i in range(n):\r\n if k-a[i]>=0:\r\n c+=1\r\n res.append(index[a[i]].pop())\r\n k-=a[i]\r\n else:\r\n break\r\n\r\nprint (c)\r\nif len(res)>0:\r\n print(*res)\r\n\r\n", "n,d=[int(x) for x in input().split()]\na=list(map(int,input().split()))\nb=[]\nfor i in range(n):\n b.append((a[i],i))\nb.sort(key=lambda x:x[0])\na=[]\ns=0\nc=0\nfor i in b:\n s+=i[0]\n if s<=d:\n a.append(i[1]+1)\n c+=1\n else:\n break\nif c!=0:\n print(c)\n print(*a)\nelse:\n print(c)\n\n \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\nparsa=list(map(int,input().split()))\r\namin=[0]*n\r\nfor i in range(0,n,1):\r\n amin[i]=parsa[i]\r\nparsa.sort()\r\ncounter=0\r\ns=m\r\nfor i in range(0,n,1):\r\n if m==0:\r\n break\r\n else:\r\n if m>=parsa[i]:\r\n m-=parsa[i]\r\n counter+=1\r\n else:\r\n break\r\nprint(counter)\r\nfor i in range(0,n,1):\r\n if s==0:\r\n break\r\n else:\r\n if s>=parsa[i]:\r\n s-=parsa[i]\r\n for j in range(0,n,1):\r\n if amin[j]==parsa[i]:\r\n print(j+1,end=\" \")\r\n amin[j]=-1\r\n break\r\n else:\r\n break", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = sorted(a)\r\nc = 0\r\nd = []\r\nfor i in range(n):\r\n if c+b[i] > m:\r\n break\r\n else:\r\n c += b[i]\r\n d.append(a.index(b[i])+1)\r\n a[a.index(b[i])] = 0\r\n\r\nprint(len(d))\r\nif len(d) > 0:\r\n print(*d)\r\n\r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\na = s[:]\r\ns.sort()\r\nmax_col_ans = 0\r\nans = []\r\nfor x in s:\r\n if k >= x:\r\n k -= x\r\n max_col_ans += 1\r\n ans.append(str(a.index(x)+1))\r\n a[a.index(x)] = max(a)+1\r\nprint(max_col_ans)\r\nprint(' '.join(ans))\r\n", "from collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn,k=M()\r\na=LI()\r\nb=sorted(a)\r\nc=[]\r\nfor i in range(n):\r\n if b[i]<=k:\r\n d=a.index(b[i])\r\n a[d]=-1\r\n c.append(d+1);k-=b[i]\r\nprint(len(c))\r\nprint(*c)", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\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 char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, k = multi_input()\r\n a = list_input(int)\r\n b = [[a[i], i] for i in range(n)]\r\n b.sort()\r\n ans = []\r\n sum = 0\r\n for i in range(n):\r\n if sum + b[i][0] > k:\r\n break\r\n sum += b[i][0]\r\n ans.append(b[i][1])\r\n print(f\"{len(ans)}\\n\")\r\n for i in ans:\r\n print(f\"{i+1} \")\r\n print(\"\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\nnumber_of_instruments, days = tuple(map(int, input().strip().split()))\n\ninstruments = []\nfor i, v in enumerate(input().strip().split()):\n instruments.append((int(i) + 1, int(v)))\n\ninstruments = sorted(instruments, key=lambda x: x[1])\n\nresult = \"\"\ncount = 0\n\nfor i, instr in instruments:\n if instr <= days:\n result += f\" {i}\"\n days -= instr\n count += 1\n\nprint(count)\nif result:\n print(result.strip())\n\n\n", "from collections import deque,defaultdict,Counter\r\nimport math\r\nfrom sys import stdin,stdout\r\n\r\n\r\ndef inp():\r\n\treturn int(stdin.readline())\r\n\r\n\r\ndef inlt():\r\n\treturn list(map(int,stdin.readline().split()))\r\n\r\n\r\ndef insr():\r\n\treturn list(stdin.readline().strip())\r\n\r\n\r\ndef invr():\r\n\treturn map(int,stdin.readline().split())\r\n\r\n\r\ndef main():\r\n\tn , k = invr()\r\n\ta = inlt()\r\n\td = {}\r\n\tfor i in range(1,n+1):\r\n\t\td[i] = a[i-1]\r\n\td = {k:v for k,v in sorted(d.items(),key=lambda item:item[1])}\r\n\ts = 0 ; c = 0 ; l =[]\r\n\tfor i,j in d.items():\r\n\t\ts += j\r\n\t\tif s <= k :\r\n\t\t\tl.append(i)\r\n\t\t\tc += 1\r\n\tprint(c)\r\n\tprint(*l)\r\n\t\r\n\t\r\nif __name__==\"__main__\":\r\n\tmain()\r\n\r\n", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\narray_1 = sorted([[num, pos] for pos, num in enumerate(array)])\r\narray_2 = []\r\n\r\nfor i in array_1:\r\n if k - i[0] >= 0:\r\n array_2.append(i[1] + 1)\r\n k -= i[0]\r\n else:\r\n break\r\n\r\nprint(len(array_2))\r\nprint(*array_2)\r\n\r\n", "R=lambda:map(int,input().split())\r\nn,k=R(); l=sorted(zip(R(),range(1,n+1))); h = []\r\nfor _,i in l:\r\n\tk-=_\r\n\tif k>=0: h.append(i)\r\nprint(len(h));print(*h)", "a,b=map(int,input().split())\r\nx=[int(x) for x in input().split()]\r\ny=x[:]\r\ny=sorted(y)\r\ns=0\r\nt=[0]*a\r\nfor i in range(len(y)):\r\n if s+y[i]<=b:\r\n s+=y[i]\r\n t[i]=((x.index(y[i]))+1)\r\n x[t[i]-1]=0\r\nz=[]\r\nfor i in range(len(x)):\r\n if x[i]==0:\r\n z.append(i+1)\r\nprint(x.count(0))\r\nprint(*z)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=l.copy()\r\nl2.sort()\r\nl1=[]\r\nwhile len(l2)>0:\r\n if l2[0]>k:\r\n break\r\n else:\r\n k-=l2[0]\r\n l1.append(l.index(l2[0])+1)\r\n l[l.index(l2[0])]=0\r\n l2.remove(l2[0])\r\n if k<0:\r\n l1.remove(l1[-1])\r\n break\r\nprint(len(l1))\r\nprint(\" \".join(map(str,l1)))", "\r\n\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted((a[i],i+1) for i in range(n))\r\nres=[]\r\nfor x,ind in b:\r\n if k>=x:\r\n k-=x\r\n res.append(ind)\r\nprint(len(res))\r\nprint(*res)\r\n\r\n ", "\r\nn , k = map(int,input().split())\r\nsol = []\r\n\r\nfor a , b in sorted(zip(map(int,input().split()), range(1 , n+1))):\r\n if k >= a :\r\n k -= a\r\n sol.append(b)\r\n\r\nprint(len(sol))\r\nprint(*sol)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in range (n):\r\n l1.append(tuple((l[i],i+1)))\r\nl1.sort()\r\nans=[]\r\nfor i in range (n):\r\n if l1[i][0]<=k:\r\n ans.append(l1[i][1])\r\n k-=l1[i][0]\r\nans.sort()\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i],end=\" \")\r\n", "nk=list(map(int,input().split()))\r\ndays=list(map(int,input().split()))\r\nind=[]\r\nfor i in range(len(days)):\r\n ind.append(days[i])\r\n \r\ns=0\r\n\r\nif (sum(days))<=(nk[1]):\r\n print(nk[0])\r\n for i in range(1,nk[0]+1):\r\n print(i, end=\" \")\r\n \r\nelif sum(days)>nk[1]:\r\n while(sum(days)>nk[1]):\r\n days.remove(int(max(days)))\r\n print(len(days))\r\n for i in range(len(days)):\r\n if days[i] in ind:\r\n print(ind.index(days[i])+1, end=\" \")\r\n ind[ind.index(days[i])] = -1\r\n#print(ind, end =\"\\n\")\r\n#print(days)\r\n", "n, k = map(int, input().split())\n\ninstruments = []\nfor i, ins in enumerate(input().split()):\n instruments.append({\"ai\": int(ins), \"i\": str(i + 1)})\ninstruments = sorted(instruments, key=lambda k: k[\"ai\"])\n\nres = []\nfor i, ins in enumerate(instruments):\n k -= ins[\"ai\"]\n if k >= 0:\n res.append(ins[\"i\"])\n\nprint(len(res))\nif len(res) > 0:\n print(\" \".join(res))", "n,k = map(int,input().split())\na = list(map(int,input().split()))\nkp=sorted(a)\nind=[]\ni=0\ns=0\nwhile i<=n-1 and s+kp[i]<=k:\n s+=kp[i]\n ele = a.index(kp[i])\n a[ele] = None\n ind.append(ele+1)\n i+=1\nprint(len(ind))\nprint(' '.join(map(str,ind)))\n", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [i for i in range(1,n+1)]\r\nz = zip(a, b)\r\nb = [x for _, x in sorted(z)]\r\na.sort()\r\ntotal = 0\r\ncount = 0\r\ntemp = []\r\nfor i in range(n):\r\n total += a[i]\r\n if(total<=k):\r\n count+=1\r\n temp.append(b[i])\r\n else:\r\n break\r\nprint(count)\r\nfor x in temp:\r\n print(x, end = \" \")\r\n \r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=sorted(l)\r\ns=0\r\na=[]\r\nc=0\r\nfor i in range(n):\r\n if(p[i]+s)<=k:\r\n s=s+p[i]\r\n c=c+1\r\n z=l.index(p[i])\r\n a.append(z+1)\r\n l[z]=0\r\n \r\nprint(c)\r\nprint(*a)\r\n\r\n ", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk,s=[],0\r\nfor i in range(len(l)):\r\n k.append([l[i],i+1])\r\ng=sorted(k,key=lambda i:i[0])\r\nans=[]\r\nc=0\r\nfor i in g:\r\n s+=i[0] \r\n if s>b:\r\n break\r\n ans.append(i[1])\r\n c+=1\r\nprint(c)\r\nif len(ans)>0:\r\n ans=sorted(ans)\r\n print(*ans)", "from bisect import bisect_left as bl\nfrom bisect import bisect_right as br\nimport heapq\nimport math\nfrom collections import *\nfrom functools import reduce,cmp_to_key\nimport sys\ninput = sys.stdin.readline\n \n# M = mod = 998244353\ndef factors(n):return sorted(list(set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))))\n# def inv_mod(n):return pow(n, mod - 2, mod)\n \ndef li():return [int(i) for i in input().rstrip('\\n').split(' ')]\ndef st():return input().rstrip('\\n')\ndef val():return int(input().rstrip('\\n'))\ndef li2():return [i for i in input().rstrip('\\n').split(' ')]\ndef li3():return [int(i) for i in input().rstrip('\\n')]\n\n\n\nn, k = li()\na = li()\nfor i in range(n):\n a[i] = [i,a[i]]\na.sort(key = lambda x:x[1])\ntot = k\nans = []\nfor i in range(n):\n if tot >= a[i][1]:\n tot -= a[i][1]\n ans.append(a[i][0] + 1)\n else:break\nprint(len(ans))\nprint(*ans)", "n,k=map(int,input().split())\r\ninp=input().split()\r\narr=[(int(inp[i]),i+1) for i in range(len(inp))]\r\narr.sort()\r\nsum=0\r\n#print(arr)\r\nans=[]\r\ni=0\r\nwhile sum+arr[i][0]<=k:\r\n sum+=arr[i][0]\r\n ans.append(arr[i][1])\r\n i+=1\r\n if i==n:\r\n break\r\nprint(len(ans))\r\nprint(*ans)", "# 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, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\noriginal = arr.copy()\r\narr.sort()\r\ntemp = []\r\nfor i in range(n):\r\n if arr[i] <= k:\r\n temp.append(original.index(arr[i]) + 1)\r\n ans = original.index(arr[i])\r\n original[ans] = \"X\"\r\n k -= arr[i]\r\n else:\r\n break\r\nprint(len(temp))\r\nprint(*temp)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n l[i]=[l[i],i]\r\nl.sort()\r\ns=0\r\nc=0\r\nans=[]\r\nfor i in range(n):\r\n s+=l[i][0]\r\n if(s>k):\r\n break\r\n ans.append(l[i][1]+1)\r\n c+=1\r\nprint(c)\r\nprint(*ans)", "n, k = map(int, input().split())\na = sorted((x, j) for j, x in enumerate(map(int, input().split())))\nans = 0\nindices = []\nfor x, y in a:\n if k >= x:\n k -= x\n ans += 1\n indices.append(y + 1)\nprint(ans)\nprint(' '.join(map(str, sorted(indices))))", "instrument_number , days = map(int , input().split()) \r\nl = list(map(int , input().split())) \r\nres =[]\r\ncounter = 0 \r\nfor i in l : \r\n mn = min(l)\r\n if days < mn : \r\n break\r\n days -= mn\r\n counter +=1\r\n res.append(l.index(mn) + 1)\r\n l[l.index(mn)] = days + 1 \r\nprint(counter)\r\nprint(*res)\r\n", "n,k = map(int,input().split())\na = []\nfor i,j in enumerate(map(int,input().split())):\n\ta.append((j,i+1))\na.sort()\nans = []\nc = 0\nfor i,j in a:\n\tif c+i <= k:\n\t\tans.append(j)\n\t\tc += i\n\telse:\n\t\tbreak\nif len(ans) == 0:\n\tans = []\nprint(len(ans))\nprint(*ans)\n\t \t \t \t\t\t\t\t\t \t\t\t\t\t \t\t\t \t", "'''\nFuad Ashraful Mehmet\nUAP-CSE-42\n'''\nfrom gettext import find\nfrom glob import glob\nimport sys\ninput = sys.stdin.readline\ndef R(): return map(int, input().split())\ndef I(): return int(input())\ndef S(): return input().rstrip('\\n')\ndef L(): return list(R())\n\n\nDEBUG = False\n\ndp, a, path = None, None, None\n\n\ndef go(idx, rem):\n if idx < 0:\n return 0\n\n if dp[idx][rem] != -1:\n return dp[idx][rem]\n\n res = go(idx-1, rem)\n\n if rem-a[idx] >= 0:\n res = max(res, 1+go(idx-1, rem-a[idx]))\n\n dp[idx][rem] = res\n return res\n\n\ndef find_path(idx, rem):\n if idx < 0:\n return\n\n choice1 = go(idx-1, rem)\n choice2 = 1+go(idx-1, rem-a[idx]) if rem >= a[idx] else 0\n\n if choice1 >= choice2:\n find_path(idx-1, rem)\n else:\n path.append(idx+1)\n find_path(idx-1, rem-a[idx])\n\n return\n\n\ndef solve():\n n, k = R()\n global dp\n global a\n global path\n\n a, dp, path = L(), [\n [-1] * (k+1) for _ in range(n+1)\n ], []\n\n ans = go(n-1, k)\n if DEBUG:\n print(f'Ans {ans}')\n\n find_path(n-1, k)\n\n print(ans)\n print(*path)\n\n\nif __name__ == '__main__':\n solve()\n\n \t\t \t \t \t\t \t \t \t\t \t\t\t \t \t", "n, t = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(zip(a,list(range(1,n+1))))\r\nb.sort()\r\nl =[]\r\ng = 0\r\nwhile t >= 0 and g != n:\r\n t -= b[g][0]\r\n l.append(b[g][1])\r\n g += 1\r\nif t < 0:\r\n l.pop(-1)\r\nprint(len(l))\r\nprint(' '.join([str(elem) for elem in l]))", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nq = [0]*n\r\nfor i in range(n):\r\n q[i] = [l[i],i+1]\r\nq.sort(key = lambda x:x[0])\r\nz = []\r\nx = 0\r\nfor i in range(n):\r\n m -= q[i][0]\r\n if m<0:\r\n break\r\n else:\r\n z.append(q[i][1])\r\n x += 1\r\nprint(x)\r\nprint(*z,sep=\" \")", "def fking(li):\r\n return li[0]\r\n\r\nn,k= input().split(); n,k= int(n), int(k); li1= list(map(int, input().split())); li2=[]\r\nfor i in range(n):\r\n tl= (li1[i], i)\r\n li2.append(tl)\r\n\r\nli2.sort(key=fking)\r\n\r\ncn1=0; cn2=0; li3=[]\r\n\r\nfor i in range(n):\r\n if cn2+ li2[i][0] <=k:\r\n cn1+=1\r\n li3.append(li2[i][1]+1)\r\n cn2+= li2[i][0]\r\n else: break\r\n \r\nif cn1==0:\r\n print(0)\r\nelse:\r\n print(cn1)\r\n otpt= ' '.join(str(i) for i in li3)\r\n print(otpt)", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef arr_inp():\r\n return [[i, int(x)] for i, x in enumerate(input().split())]\r\n\r\ndef print_arr(arr):\r\n print(*arr, sep=' ')\r\n\r\nn, k = inp()\r\na = arr_inp()\r\na.sort(key=lambda x: x[1])\r\nnew_arr = []\r\n\r\nfor i in range(n):\r\n if (a[i][1] <= k):\r\n k -= a[i][1]\r\n new_arr.append(a[i][0]+1)\r\n else:\r\n break\r\n\r\nprint(len(new_arr))\r\nprint_arr(new_arr)\r\n\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc=s=0\r\nL = []\r\nfor i in sorted(a):\r\n if s + i <= k:\r\n L.append(a.index(i)+1)\r\n a[a.index(i)] = -1\r\n s += i\r\n c+= 1\r\n else:\r\n break\r\nprint(c)\r\nif L != []:\r\n print(*L)\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = []\r\nsum1 = 0\r\nfor i in range(len(l)):\r\n\tans.append((i,l[i]))\r\nans.sort(key = lambda x:x[1])\r\n# print(*ans)\r\nt = []\r\nfor i in range(len(l)):\r\n\tsum1 = sum1 + ans[i][1]\r\n\tif sum1 > k:\r\n\t\tbreak\r\n\tt.append(ans[i][0]+1)\r\nprint(len(t))\r\nprint(*t)", "def solve(n,k,arr):\r\n temp = [[j,i+1] for i,j in enumerate(arr)]\r\n temp.sort()\r\n ans = []\r\n i=0\r\n while i<n and k>0:\r\n if temp[i][0]>k: break\r\n k -= temp[i][0]\r\n ans.append(temp[i][1])\r\n i += 1\r\n \r\n return ans\r\n \r\nif __name__==\"__main__\":\r\n n,k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n \r\n ans = solve(n,k,arr)\r\n print(len(ans))\r\n print(*ans)", "n,k=map(int,input().split())\r\na=[int(x)for x in input().split()]\r\nt=a[:]\r\na.sort()\r\nans=0\r\nli=[]\r\nfor i in range(n):\r\n k-=a[i]\r\n if k>=0:\r\n ans+=1\r\n x=t.index(a[i])\r\n li.append(x+1)\r\n t[x]='0'\r\n else:break\r\n \r\nprint(ans)\r\nprint(*li)", "[n,k]=list(map(int,input().split(\" \")))\r\nl=sorted(zip(list(map(int,input().split(\" \"))),range(1,n+1)))\r\nres=[]\r\nfor a,b in l:\r\n k-=a\r\n if k>=0:res.append(b)\r\nprint(len(res))\r\nprint(*res)", "a,b=map(int,input().split())\nl=list(map(int,input().split()))\n\nk=[]\ns=0\nfor i in range(len(l)):\n k.append([l[i],i+1])\n\ng=sorted(k,key=lambda x:x[0])\n#print(g)\no=[]\nc=0\n\nfor i in g:\n s+=i[0] \n if(s>b):\n break\n o.append(i[1])\n c+=1\nprint(c)\nif(len(o)>0):\n o=sorted(o)\n print(*o)\n \n \n\n\n \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()) \r\nsum=0 \r\nl2=[]\r\nl=sorted([(x,i) for i,x in enumerate(map(int,input().split()),1)])\r\n \r\nfor i,j in l:\r\n sum=sum+i \r\n if(sum<=k): \r\n l2.append(j) \r\nprint(len(l2)) \r\nfor h in l2:\r\n print(h, end=' ') ", "n, k = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny=[]\r\nfor i in x:\r\n y.append(i)\r\ncount, i = 0, 0\r\na = []\r\ny.sort()\r\nwhile (i < n and k >= y[i]):\r\n count += 1\r\n a.append(x.index(y[i]) + 1)\r\n x[x.index(y[i])] = 0\r\n k -= y[i]\r\n i += 1\r\nprint(count)\r\nfor i in a:\r\n print(i,end=\" \")", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nres = []\r\nans = []\r\n\r\nfor i in range(len(lst)):\r\n if lst[i] <= k:\r\n res.append((lst[i], i+1))\r\n\r\nres.sort()\r\nfor r in range(len(res)):\r\n if res[r][0] <= k:\r\n ans.append(res[r][1])\r\n k -= res[r][0]\r\n else:\r\n break\r\n \r\nif len(ans) > 0:\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print(len(ans))", "import os,sys,io,math\r\nfrom tokenize import Triple\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\n\r\nn,k=map(int,input().split())\r\nl=I()\r\nl=list(enumerate(l))\r\n# print(l)\r\nl.sort(key=lambda x:x[1])\r\ns=0\r\nres=[]\r\nfor i,j in l:\r\n if s+j<=k:\r\n res.append(i+1)\r\n s+=j\r\n else:break\r\nprint(len(res))\r\nprint(*res)", "MyDict, Answer, i, Sum, X, Days = {}, [], 0, 0, list(map(int, input().split())), list(map(int, input().split()))\r\nfor i in range(X[0]):\r\n MyDict[i + 1] = Days[i]\r\nMyDict = dict(sorted(MyDict.items(), key=lambda key: key[1]))\r\nfor i in range(len(MyDict.values())):\r\n if Sum+list(MyDict.values())[i]<=X[1]:\r\n Sum += list(MyDict.values())[i]\r\n Answer.append(list(MyDict.keys())[i])\r\n else:\r\n break\r\nprint(len(Answer))\r\nprint(*Answer)\r\n\r\n# UB_CodeForces\r\n# Advice: Even in impossible, there is a possible\r\n# Location: At home behind my desk\r\n# Caption: The tags 1100 are challenging me\r\n# CodeNumber: 480\r\n", "def codeForces_507A():\n x = list(map(int, input().split()))\n n , k = x[0],x[1]\n learnTime = list(map(int, input().split()))\n l = []\n for i in range(0,len(learnTime)):\n l.append((learnTime[i],i))\n l.sort()\n e = []\n for i in l:\n res = k- i[0]\n if res>=0:\n k -= i[0]\n e.append(i[1])\n print(len(e))\n for i in e:\n print(i+1,end=\" \")\n\n\nif __name__ == '__main__':\n codeForces_507A()\n\t \t \t\t \t \t \t \t \t\t\t \t\t \t\t", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = [[a[i], i] for i in range(n)]\r\n b.sort(key=lambda x: x[0])\r\n s = 0\r\n ans = 0\r\n for i in range(n):\r\n if (s + b[i][0] <= k):\r\n ans += 1\r\n s += b[i][0]\r\n else:\r\n break\r\n print(ans)\r\n for i in range(ans):\r\n print(b[i][1] + 1, end=' ')\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=[[l[i],i+1]for i in range(n)]\r\nc=0\r\nx=sorted(x,key=lambda x:x[0])\r\n#print(x)\r\ni=0\r\nwhile i<n and c<k:\r\n c=c+x[i][0]\r\n if c>k:\r\n break\r\n i+=1\r\nprint(i)\r\nif i !=0:\r\n for i in range(i):\r\n print(x[i][1],end=' ')", "''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''\r\n#codeforces507A\r\nfrom collections import Counter\r\ngi = lambda : list(map(int,input().strip().split()))\r\nn, m = gi()\r\nl = gi()\r\nl = [(l[k], k + 1) for k in range(n)]\r\nl.sort()\r\nans = []\r\nfor e in l:\r\n\tm -= e[0]\r\n\tif m >= 0:\r\n\t\tans.append(e[1])\r\n\tif m <= 0:\r\n\t\tbreak;\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans)))", "l1 = input()\nnk = [int(i) for i in l1.split()]\nl = input()\nline = [int(i) for i in l.split()]\ntotal = 0\nnum = 0\nfinal=[]\nfor i in range(nk[0]):\n low = min(line)\n low_index = line.index(low)\n if total + low <= nk[1]:\n total += low\n final.append(low_index)\n line[low_index] = 101\n num += 1\n else:\n break\nprint(num)\nfor i in range(len(final)):\n print(final[i]+1, end=\" \")\n \t \t \t\t \t\t\t \t \t \t \t\t\t\t\t\t", "n, days = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nif min(a) > days:\r\n print(0)\r\n exit()\r\na_index = [i for i in range(1,n+1)]\r\nzipped = sorted(zip(a, a_index))\r\nans = []\r\nsorted_a = [i for i,_ in zipped]\r\nsorted_index = [i for _,i in zipped]\r\nfor i in range(n):\r\n if days >= sorted_a[i]:\r\n ans.append(sorted_index[i])\r\n days -= sorted_a[i]\r\nprint(len(ans))\r\nprint(*ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd={(a[i],i) for i in range(n)}\r\nb=sorted(d)\r\ns=sum(a)\r\nwhile s>k and b:\r\n\tx=b.pop()\r\n\ts-=x[0]\r\nx=len(b)\r\nprint(x)\r\nfor i in range(x):\r\n\tprint(b[i][1]+1,end=\" \")", "n,k=map(int,input().split());l=list(map(int,input().split()));t=[]\r\nfor i in range(n):t.append((l[i],i+1))\r\nt.sort();l=[]\r\nfor i in range(n):\r\n\tif k-t[i][0]>=0:k-=t[i][0];l.append(t[i][1])\r\n\telse:break\r\nprint(len(l));print(*l)", "n, k = map(int, input().split())\r\nsum = 0\r\nlstrs = []\r\nfor a, b in sorted(zip(map(int, input().split()), range(1, n+1))):\r\n sum += a\r\n if sum > k:\r\n break\r\n lstrs.append(str(b))\r\nprint(len(lstrs))\r\nprint(\" \".join(lstrs))\r\n \r\n", "R=lambda:map(int, input().split())\r\nn, k=R(); l=sorted(zip(R(), range(1, n+1))); h = []\r\nfor _, i in l:\r\n k-=_\r\n if k>=0: h.append(i)\r\nprint(len(h));print(*h)", "s=[int(i) for i in input().split(\" \")]\r\nn=s[0]\r\nk=s[1]\r\na=[int(i) for i in input().split(\" \")]\r\na_1=sorted(a)\r\nm=0\r\ninstr=[]\r\nwhile k>=0 and m<n:\r\n k-=a_1[m]\r\n if k<0:\r\n break\r\n instr.append(str(a.index(a_1[m])+1))\r\n a[a.index(a_1[m])]=101\r\n m+=1\r\nprint(m)\r\nif m!=0:\r\n print(\" \".join(instr))", "import heapq\n\nnInstruments, nDays = [int(x) for x in input().split()]\n\ninstr = [int(x) for x in input().split()]\n\nindInst = [[instr[i], i + 1] for i in range(nInstruments)]\n\nheapq.heapify(indInst)\n\ndays = 0\nlearned = []\nwhile len(indInst) > 0:\n nextInst = heapq.heappop(indInst)\n days += nextInst[0]\n if days > nDays:\n break\n learned.append(nextInst[1])\n\nprint(len(learned))\nfor ind in learned:\n print(ind, end=' ')\nprint()\n \t\t \t \t \t \t\t\t \t \t \t\t \t\t \t\t", "[n, k] = list(map(int, input().split(\" \")))\na = list(map(int, input().split(\" \")))\nb = [0]*n\nfor i in range(n):\n b[i] = {\"index\": i+1, \"value\": a[i]}\na = sorted(b, key=lambda item: item[\"value\"])\nr = []\nwhile len(a) > 0 and k >= a[0][\"value\"]:\n t = a.pop(0)\n k = k - t[\"value\"]\n r.append(t[\"index\"])\nprint(n-len(a))\nprint(*r)\n", "n,k = [int(i) for i in input().strip().split()]\r\na = [(int(i),en+1) for en,i in enumerate(input().strip().split())]\r\na.sort()\r\ni = 0\r\ncount = 0\r\nans = []\r\nwhile i<n and k>=a[i][0]:\r\n k-=a[i][0]\r\n count+=1\r\n ans.append(a[i][1])\r\n i+=1\r\nprint(count)\r\nif count!=0:\r\n print(*ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [[a[i], i + 1] for i in range(n)]\r\nb.sort()\r\nsm = 0\r\nans = 0\r\nansl = []\r\nfor i in range(n):\r\n sm += b[i][0]\r\n if sm <= k:\r\n ans += 1\r\n ansl += [b[i][1]]\r\n else:\r\n break\r\nprint(ans)\r\nprint(*ansl)\r\n", "n,k=map(int,input().split())\r\nli=[int(x) for x in input().split()] \r\n\r\nz=sorted(li)\r\ns=i=0\r\nout=[]\r\nwhile s<k and i<n:\r\n\tif s+z[i]>k:\r\n\t\tbreak\r\n\ts+=z[i]\r\n\tfor x in range(n):\r\n\t\tif li[x]==z[i]:\r\n\t\t\tli[x]=-1\r\n\t\t\tout.append(x+1)\r\n\t\t\tbreak\r\n\ti+=1\r\nprint(len(out))\r\nprint(*out)\r\n", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nans = []\r\nfor i in range(n):\r\n ans += [(a[i],i+1)]\r\nans.sort(key=lambda x: x[0])\r\nif (ans[0][0] > k):\r\n print(0)\r\nelse:\r\n sm = 0\r\n res = []\r\n for i in range(n):\r\n sm += ans[i][0]\r\n if (sm <= k):\r\n res += [ans[i][1]]\r\n else:\r\n break\r\n print(len(res))\r\n print(*res)\r\n", "def main():\r\n [n, k] = list(map(int, input().split()))\r\n ns = list(map(int, input().split()))\r\n for i in range(n):\r\n ns[i] = [ns[i], i + 1]\r\n\r\n ns = sorted(ns, key = lambda p: p[0])\r\n\r\n s = 0\r\n sol = []\r\n for e in ns:\r\n if s+ e[0] <= k:\r\n s += e[0]\r\n sol.append(e[1])\r\n\r\n if len(sol) > 0:\r\n print(len(sol))\r\n for s in sol:\r\n print(s, end= ' ')\r\n print()\r\n else:\r\n print(0)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=sorted(zip(map(int,input().split()),range(1,1+n)))\r\nr,s=[],0\r\nfor i in a:\r\n s+=i[0]\r\n if s<=k: r.append(i[1])\r\nprint(len(r))\r\nprint(*r)", "n,k=map(int,input().split())\r\nl=sorted([(x,i+1) for i,x in enumerate(map(int,input().split()))])\r\ns=[]\r\nfor i in range(n):\r\n if l[i][0]>k: break\r\n s+=[l[i][1]]\r\n k-=l[i][0]\r\nprint(len(s))\r\nprint(*s)", "nk=list(map(int,input().strip().split()))\r\nn=nk[0]\r\nk=nk[1]\r\narr=list(map(int,input().strip().split()))\r\narr2=sorted(arr)\r\nflag=True\r\ni=s=0\r\nl=[]\r\nwhile i<n and arr2[i]+s<=k:\r\n l.append(arr2[i])\r\n s+=arr2[i]\r\n i+=1\r\nif s==0:\r\n print(0)\r\nelse:\r\n l2=[]\r\n for j in range(len(arr)):\r\n if arr[j] in l:\r\n l2.append(j+1)\r\n l.remove(arr[j])\r\n print(i)\r\n print(*l2)", "n , k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(a)\r\nsum = 0\r\ni=0\r\nfor i in range(len(a)):\r\n sum = sum + b[i]\r\n if sum > k:\r\n i=i-1\r\n break\r\nprint(i+1)\r\nfor i in b[0:i+1]:\r\n print(a.index(i)+1,end=\" \")\r\n a[a.index(i)] = -1\r\n\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nb=[]\nfor i in range(n):\n b.append((a[i],i+1))\nb.sort()\ni=0\ns=[]\nt=0\nwhile i<n:\n t+=b[i][0]\n if t<=k:\n s.append(b[i][1])\n i+=1\n else:\n break\nprint(i)\nprint(*s)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=a[:]\r\na.sort()\r\nx,c=0,0\r\nfor i in range(n):\r\n x+=a[i]\r\n if x<k:\r\n c+=1\r\n else:\r\n if k-x>=0:\r\n c=c+1\r\n break\r\nprint(c)\r\nfor i in range(c):\r\n x=l.index(a[i])\r\n print(x+1,end=\" \")\r\n l[x]=-1\r\n ", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b.append((a[i],i+1))\r\n\r\nb.sort()\r\ncountd = 0\r\nc=[]\r\nfor i in b:\r\n countd+=i[0]\r\n if(countd>k):\r\n break\r\n c.append(i[1])\r\nprint(len(c))\r\nprint(*c)", "n, k = [int(i) for i in input().split()]\r\na = input().split()\r\n\r\nfor i in range(n):\r\n a[i] = [int(a[i]), i]\r\n\r\na.sort()\r\n\r\ndays = 0\r\n\r\nres = []\r\n\r\nfor d in range(len(a)):\r\n if days + a[d][0] <= k:\r\n days += a[d][0]\r\n res.append(a[d][1] + 1)\r\n else:\r\n break\r\nprint(len(res))\r\nprint(*res)\r\n", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = a.copy()\r\na.sort()\r\n\r\ni = 0\r\nc = 0\r\nl = []\r\nwhile k > 0 and i < n:\r\n if a[i] <= k:\r\n k -= a[i]\r\n ind = s.index(a[i])\r\n l.append(ind+1)\r\n s[ind] = -1\r\n c += 1\r\n i += 1\r\n else:\r\n break\r\nprint(c)\r\nprint(*l)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na1=[]\r\nfor i in range(n):\r\n a1.append((a[i],i+1))\r\na1.sort()\r\na=[]\r\nfor i in range(n):\r\n\tif (k-a1[i][0]>=0):\r\n\t k-=a1[i][0];\r\n\t a.append(a1[i][1])\r\n\telse:\r\n\t break\r\nprint(len(a))\r\nprint(*a) ", "n, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\npairs = []\r\nfor i in range(n):\r\n pairs.append([nums[i], i])\r\n\r\npairs.sort()\r\nindices = []\r\nsm = 0\r\ncount = 0\r\nfor pair in pairs:\r\n if sm + pair[0] > k:\r\n break\r\n else:\r\n sm += pair[0]\r\n count += 1\r\n indices.append(pair[1])\r\n\r\nprint(count)\r\nif count != 0:\r\n [print(x+1, end=\" \") for x in indices]\r\n print()\r\n \r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nvisited = [False for i in range(n)]\r\narray = []\r\n\r\nfor i in range(n):\r\n array.append([arr[i],i+1])\r\n\r\narr = sorted(array)\r\nans = []\r\n\r\ni = 0\r\nwhile i < n and k > 0:\r\n if arr[i][0] <= k:\r\n k -= arr[i][0]\r\n ans.append(arr[i][1])\r\n else:\r\n break\r\n i += 1\r\n\r\nif len(ans) > 0:\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print(0)\r\n", "from sys import stdin, stdout\r\nimport math\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncount=0\r\nu=k\r\nans=[]\r\nfor i in range(len(arr)):\r\n d=arr.index(min(arr))\r\n if(k<arr[d]):\r\n break\r\n else:\r\n k-=arr[d]\r\n ans.append(d+1)\r\n arr[d]=u\r\n\r\nprint(len(ans))\r\nif(len(ans)>0):\r\n for i in range(len(ans)):\r\n stdout.write(str(ans[i])+\" \")", "n,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nb=sorted(a)\r\nans=[]\r\nfor i in range(n):\r\n k-=b[i]\r\n if(k<0):\r\n break\r\n ans+=[str(a.index(b[i])+1)]\r\n a[a.index(b[i])]=0\r\nprint(len(ans))\r\nprint(\" \".join(ans))", "n,k=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=l1.copy()\r\nl2.sort()\r\nl3=[]\r\nwhile(len(l2)>0):\r\n if(k<l2[0]):\r\n break\r\n elif(k>=l2[0]):\r\n k-=l2[0]\r\n l3.append(l1.index(l2[0])+1)\r\n l1[l1.index(l2[0])]=0\r\n l2.pop(0)\r\n\r\nif(len(l3)>0):\r\n print(len(l3))\r\n for i in range (len(l3)):\r\n print(l3[i],end=\" \")\r\nelse:\r\n print(0)", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\na=sorted(x)\r\ns=[]\r\nss=[]\r\nc=0\r\nfor i in range(len(a)):\r\n if sum(ss)+a[i]<=k:\r\n s.append(x.index(a[i])+1)\r\n ss.append(a[i])\r\n x.insert(x.index(a[i]),-1)\r\n x.remove(a[i])\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\nx=[str(i) for i in s]\r\nif len(x)>0:print(' '.join(x))\r\n", "n, k = map(int, input().split())\r\ndata = sorted(enumerate(map(int, input().split())), key=lambda x:x[1])\r\ns = 0\r\nidx = -1\r\nfor i in range(n):\r\n if s + data[i][1] > k:\r\n break\r\n s += data[i][1]\r\n idx = i\r\n\r\nprint(idx + 1)\r\nfor i in range(idx + 1):\r\n print(data[i][0] + 1, end=' ')", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n l.append((a[i],i+1))\r\nl,a=sorted(l),[]\r\nfor i in range(n):\r\n\tif (k-l[i][0]>=0):\r\n\t k-=l[i][0];\r\n\t a.append(l[i][1])\r\n\telse:\r\n\t break\r\nprint(len(a))\r\nprint(*a) ", "num, k = map(int, input().split())\nl = list(map(int, input().split()))\nx = []\ny =sorted(l)\nsums = 0\nfor i in range(num):\n\tif y[i]+sums>k:\n\t\tbreak\n\telse:\n\t\tindex = l.index(y[i])\n\t\tsums += y[i]\n\t\tl[index] = -1\n\t\tx.append(index+1)\nprint(len(x))\nprint(*x)\n\t\t\n\t\n \t\t\t\t \t\t \t\t\t \t\t \t\t \t", "N, D = map(int, input().split())\r\n\r\ndays = list(map(int, input().split()))\r\n\r\nfor i, d in enumerate(days):\r\n days[i] = [d, i]\r\n\r\ndays.sort(key=lambda x:x[0])\r\nans = 0\r\nre = []\r\nind = 0\r\nwhile ind < len(days) and D >= days[ind][0]:\r\n D -= days[ind][0]\r\n re += [days[ind][1] + 1]\r\n ans += 1\r\n ind += 1\r\nprint(ans)\r\nfor r in re:\r\n print(r, end=' ')\r\n ", "n, k = map(int, input().split())\r\ninstruments = list(map(int, input().split()))\r\ninstrument_tuples = [(days, index) for index, days in enumerate(instruments)]\r\ninstrument_tuples.sort()\r\ndays_allocated = 0\r\ninstruments_to_learn = []\r\nfor days, index in instrument_tuples:\r\n if days_allocated + days <= k:\r\n days_allocated += days\r\n instruments_to_learn.append(index)\r\n else:\r\n break\r\n\r\nprint(len(instruments_to_learn))\r\nprint(\" \".join(str(i+1) for i in instruments_to_learn))", "I = lambda: map(int, input().split())\r\nn, k = I()\r\nl = sorted(zip(I(), range(1, n+1)))\r\nh = []\r\nfor i, j in l:\r\n k -= i\r\n if k>=0:\r\n h.append(j)\r\nprint(len(h))\r\nprint(*h)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# Создаем список кортежей (индекс инструмента, количество дней для обучения)\r\ntools = [(i + 1, a[i]) for i in range(n)]\r\n\r\n# Сортируем инструменты по количеству дней для обучения\r\ntools.sort(key=lambda x: x[1])\r\n\r\nindices = []\r\ndays_left = k\r\n\r\nfor tool in tools:\r\n index, days = tool\r\n if days <= days_left:\r\n indices.append(index)\r\n days_left -= days\r\n\r\nprint(len(indices))\r\nif indices:\r\n print(*indices)", "n,x=map(int,input().split())\nlt=[int(i) for i in input().split()]\nans=[]\nl=sorted(lt)\nk=0\nfor i in l:\n if k+i<=x:\n k=k+i\n p=lt.index(i)\n lt[p]=-1\n ans.append(p+1)\n else:\n break\n \nprint(len(ans))\nprint(*ans)\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())\r\nA = [(i+1, int(x)) for i, x in enumerate(input().split())]\r\n\r\nA.sort(key = lambda t: t[1])\r\n\r\nanswer = []\r\nfor t in A:\r\n if t[1] > K:\r\n break\r\n answer.append(t[0])\r\n K -= t[1]\r\n\r\nprint(len(answer))\r\nprint(*answer)", "n, v=[int(k) for k in input().split()]\r\nw=[int(k) for k in input().split()]\r\nw=[[w[k], k+1] for k in range(len(w))]\r\nw.sort(key=lambda x: x[0])\r\nres=0\r\nq=[]\r\nfor j in w:\r\n if j[0]>v:\r\n break\r\n else:\r\n v-=j[0]\r\n q.append(j[1])\r\n res+=1\r\nprint(res)\r\nif res:\r\n print(\" \".join([str(k) for k in q]))", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\na = list(map(int,input().split()))\r\n\r\nnew_arr = [(a[x],x+1) for x in range(n)]\r\nnew_arr = sorted(new_arr,key=lambda x:x[0])\r\n\r\nindex = 0\r\ncount = 0\r\nwhile index<n:\r\n if new_arr[index][0] > k:\r\n break\r\n\r\n k -= new_arr[index][0]\r\n count += 1\r\n index += 1\r\n\r\nprint(count)\r\nfor i in range(count):\r\n print(new_arr[i][1],end=\" \")", "lee = input().split(\" \")\nn = int(lee[0])\nk = int(lee[1])\nlee = input().split(\" \")\nc = []\nd= []\nsum=0\nfor i in range(n):\n c.append(int(lee[i]))\n d.append(i+1)\nt= sorted(zip(c, d))\nj = 0\nwhile sum+t[j][0] <= k:\n sum = sum+t[j][0]\n j = j+1\n if j==len(t):\n break\nprint(j)\ncad = \"\"\nfor i in range (j):\n cad = cad+str(t[i][1])+\" \"\nprint(cad[:len(cad)-1])\n \t\t \t\t \t \t\t \t\t \t\t\t\t \t \t\t", "#Written by Shagoto\n\nn, k = map(int, input().split(\" \"))\narr = list(map(int, input().split(\" \")))\ntemp = arr.copy()\ntemp.sort()\n\nans = []\ntotal = 0\nfor x in range(n):\n total += temp[x]\n if(total <= k):\n ans.append(arr.index(temp[x]))\n arr[arr.index(temp[x])] = 10000\n\nprint(len(ans))\nfor x in ans:\n print(x+1, end = \" \")\n \t\t\t \t\t\t\t\t \t \t\t \t\t\t\t \t", "n,a=input().split()\nn=int(n)\na=int(a)\ng=list(map(int,input().strip().split()))[:n]\naaa=sorted(g)\nx=0\ny=0\nc=0\nb=[]\nqq=0\nwhile x+aaa[0]<=a:\n y=aaa[0]\n b.append(g.index(y))\n qq=g.index(y)\n g[qq]=-1\n x=x+y\n aaa.remove(y)\n c=c+1\n if len(aaa)==0:\n break\nprint(c)\nfor i in range(len(b)):\n print(b[i]+1,end=\" \")\n\t\t \t\t\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\nfor i in range(n):\r\n a[i]=a[i],i+1\r\na.sort()\r\ni=0\r\ns=0\r\nb=[]\r\nwhile i<n and s<k:\r\n if s+a[i][0]<=k:\r\n s+=a[i][0]\r\n i+=1\r\n else:\r\n break\r\nprint(i)\r\nfor i in range(i):\r\n b.append(a[i][1])\r\nprint(*b)\r\n\r\n", "x=list(map(int, input().split()))\r\ny=list(map(int, input().split()))\r\nk=x[1]\r\np=[]\r\nif min(y)>k:\r\n print(0)\r\nelif min(y)==k:\r\n print(1)\r\n print(y.index(min(y))+1)\r\nelse:\r\n s=0\r\n for i in range(len(y)):\r\n s=s+min(y)\r\n if s>k:\r\n break\r\n else:\r\n q=y.index(min(y))\r\n p.append(q+1)\r\n y[q]=max(y)+1\r\n print(len(p))\r\n print(' '.join(map(str, p)))", "def main():\r\n # input\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n # soln\r\n m = []\r\n for i, c in enumerate(a):\r\n m.append([c, i])\r\n m.sort()\r\n ans = []\r\n cnt = 0\r\n for c, i in m:\r\n if k >= c:\r\n ans.append(i+1)\r\n cnt += 1\r\n k = k - c\r\n else:\r\n break\r\n print(cnt)\r\n for i in ans:\r\n print(i, end = \" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# cook your dish here\r\na,b=input().split(\" \")\r\nn=int(a)\r\nk=int(b)\r\nl=[int(i) for i in input().split(\" \")]\r\nif(n==1 and k<max(l)):\r\n print('0')\r\nelse:\r\n l1=[]\r\n count=0\r\n for i in range(len(l)):\r\n l1.append(l[i])\r\n l1.sort()\r\n l2=[]\r\n learn=0\r\n \r\n for i in range(n):\r\n learn+=l1[i]\r\n if(k>=learn):\r\n l2.append(l1[i])\r\n \r\n else:\r\n continue\r\n \r\n \r\n print(len(l2))\r\n str1=\"\"\r\n for i in range(len(l2)):\r\n a=(l.index(l2[i]))\r\n l[a]=0\r\n str1+=str(a+1)\r\n str1+=\" \"\r\n print(str1) \r\n \r\n ", "n,k=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl1=l.copy()\r\nl.sort()\r\ns=0 \r\ni=0\r\nans=[]\r\n#print(l)\r\n#print(l1)\r\nwhile(i<n):\r\n if((s+l[i])<=k):\r\n #print(l[i])\r\n s=s+l[i]\r\n k1=l1.index(l[i])\r\n ans.append(k1+1)\r\n l1[k1]=-10\r\n else:\r\n #print(s,l[i],k)\r\n break \r\n i=i+1 \r\nprint(len(ans))\r\nprint(*ans,sep=\" \")", "n, k = map(int, input().split())\r\nara = list(map(int, input().strip().split()))\r\n\r\nfor i in range(n):\r\n ara[i] = (ara[i], i + 1)\r\nara = sorted(ara)\r\n# print(ara)\r\nans = []\r\nj = 0\r\ntotal = 0\r\nfor i in range(n):\r\n if total + ara[i][0] > k:\r\n break\r\n total += ara[i][0]\r\n ans.append(ara[i][1])\r\nans = sorted(ans)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i, end=\" \")\r\n", "n,k = map(int,input().split())\r\nar = list(map(int,input().split()))\r\ns = sorted(ar)\r\nx = [] \r\ni = 0\r\nwhile k > 0 and i <n:\r\n\tidx = ar.index(s[i])\r\n\tx.append(idx+1)\r\n\tk-=ar[idx]\r\n\tar[idx] = 0\r\n\ti+=1\r\nif k <0:x.pop()\r\nprint(len(x))\r\nif x:print(*x)", "n,k=map(int,input().split());a=sorted(zip(list(map(int,input().split())),range(1,n+1)));d=0;l=[]\r\nfor i in a:\r\n d+=i[0]\r\n if d<=k:l.append(i[1])\r\nprint(len(l));print(*l)", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\nl1 = []\nl2 =sorted(l)\n\nsums = 0\nfor i in range(n):\n\tif l2[i]+sums>k:\n\t\tbreak\n\telse:\n\t\tindex = l.index(l2[i])\n\t\tsums += l2[i]\n\t\tl[index] = -1\n\t\tl1.append(index+1)\nprint(len(l1))\nprint(*l1)\n\t\t\n\t\n\t\t \t\t\t \t \t \t\t\t \t\t\t \t\t \t \t\t", "n , k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr = [[i,j] for i,j in enumerate(arr)]\r\n#print(arr)\r\narr = sorted(arr,key = lambda x:x[1])\r\n#print(arr)\r\nout = []\r\nfor i in range(n):\r\n if arr[i][1]<=k:\r\n k -= arr[i][1]\r\n out.append(arr[i][0]+1)\r\n else:\r\n break\r\nprint(len(out))\r\nprint(*out)", "[n, k] = list(map(int, input().split(\" \")))\ndays = list(map(int, input().split(\" \")))\norder = []\n\ni = 0\nwhile (k > 0):\n if (k - min(days) < 0):\n break\n minimum = min(days)\n k -= minimum\n i += 1\n order.append(days.index(minimum) + 1)\n days[days.index(minimum)] = 10001\n\n\nprint(i)\nif(i > 0):\n print(' '.join(list(map(str, order))).strip())\n \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()))\nfor i in range(n):\n A[i] = [A[i], i]\nA.sort()\nans = []\nfor j in range(n):\n if k >= A[j][0]:\n k -= A[j][0]\n ans.append(A[j][1] + 1)\nprint(len(ans))\nprint(*ans)", "n,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nfor i in range(n):\r\n L[i]=(L[i],i)\r\nL.sort()\r\nans=0\r\nA=[]\r\nind=0\r\nwhile(ind<len(L) and k>=L[ind][0]):\r\n ans+=1\r\n A.append(L[ind][1]+1)\r\n k-=L[ind][0]\r\n ind+=1\r\nprint(ans)\r\nfor item in A:\r\n print(item,end=\" \")\r\n", "n, k = [int(i) for i in input().split(\" \")]\r\ns = input().split(\" \")\r\ninstruments = [[int(s[i]), i] for i in range(n)]\r\n\r\ninstruments = sorted(instruments, key=lambda x:x[0])\r\nmaxi = 0;\r\ncounter = 0;\r\nfor i in range(len(instruments)):\r\n if k < maxi + instruments[i][0]:\r\n break\r\n maxi += instruments[i][0]\r\n counter += 1\r\nprint(counter)\r\nprint(\" \".join([str(i[1] + 1) for i in instruments][:counter]))", "n,d=input().split()\nn=int(n)\nd=int(d)\na=list(map(int,input().strip().split()))[:n]\ndd=sorted(a)\nx=0\ny=0\nc=0\nb=[]\nqq=0\nwhile x+dd[0]<=d:\n y=dd[0]\n b.append(a.index(y))\n qq=a.index(y)\n a[qq]=-1\n x=x+y\n dd.remove(y)\n c=c+1\n if len(dd)==0:\n break\nprint(c)\nfor i in range(len(b)):\n print(b[i]+1,end=\" \")\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\nr = lambda : list(map(int, input().split()))\r\narr = list(enumerate(r(),1))\r\narr.sort(key = lambda x: x[1])\r\n\r\n# print(arr)\r\n\r\nans = []\r\nfor pos , val in arr:\r\n if k - val < 0: break\r\n k -= val\r\n\r\n ans.append(pos)\r\n\r\nprint(len(ans))\r\nprint(*ans) \r\n", "import math\r\nclass gh:\r\n def __init__(self,val,index):\r\n self.val=val\r\n self.index=index\r\nn,k=map(int,input().split(\" \"))\r\nar=list(map(int,input().split(\" \")))\r\narr=[]\r\nfor i in range(0,n):\r\n arr.append(gh(ar[i],i))\r\narr.sort(key=lambda x:x.val)\r\nres=[]\r\nfor i in range(0,n):\r\n if k-arr[i].val>=0:\r\n k=k-arr[i].val\r\n res.append(arr[i].index)\r\n else:\r\n break;\r\nprint(len(res))\r\nfor i in range(0,len(res)):\r\n print(res[i]+1,\"\",end=\"\")\r\n\r\n ", "n,k = input().split()\nn = int(n)\nk = int(k)\na = []\nl = [int(x) for x in input().split()]\nfor i in range(n):\n\ta.append((i+1,l[i]))\na.sort(key = lambda x:x[1])\ns = 0\ni=0\nans = []\ncount = 0\nwhile(s<=k and i<n):\n\ts+=a[i][1]\n\tif(s<=k):\n\t\tans.append(a[i][0])\n\t\ti+=1\n\t\tcount+=1\nprint(count)\nfor i in range(len(ans)):\n\tprint(ans[i],end = \" \")\n\n", "numbers_length, size = input().split(' ')\r\nnumbers_length = int(numbers_length)\r\nsize = int(size)\r\n\r\nnumbers = input().split(' ')\r\nnumbers = list(map(int, numbers))\r\n\r\ntotal = 0\r\nlast_index =0\r\nresult = []\r\nfor a, b in sorted(zip((numbers), range(1, size+1))):\r\n if total + a > size:\r\n break\r\n total+=a\r\n last_index+=1\r\n result.append(b)\r\nprint(len(result))\r\nprint(\" \".join(map(str,result)))\r\n", "# https://codeforces.com/problemset/problem/507/A\nn,k=map(int,input().split())\nl=[(int(i),j) for j,i in enumerate(input().split())]\nans=[]\nl.sort()\nfor val,ind in l:\n if(k-val>=0):\n k-=val\n ans.append(ind+1)\n else:\n break\nprint(len(ans))\nfor i in ans:\n print(i,end=' ')\n", "'''Amr is a young coder who likes music a lot. He always wanted to learn how to play music but he was busy coding so he got an idea.\r\n\r\nAmr has n instruments, it takes ai days to learn i-th instrument. Being busy, Amr dedicated k days to learn how to play the maximum possible number of instruments.\r\n\r\nAmr asked for your help to distribute his free days between instruments so that he can achieve his goal.\r\n\r\nInput\r\nThe first line contains two numbers n, k (1 ≤ n ≤ 100, 0 ≤ k ≤ 10 000), the number of instruments and number of days respectively.\r\n\r\nThe second line contains n integers ai (1 ≤ ai ≤ 100), representing number of days required to learn the i-th instrument.\r\n\r\nOutput\r\nIn the first line output one integer m representing the maximum number of instruments Amr can learn.\r\n\r\nIn the second line output m space-separated integers: the indices of instruments to be learnt. You may output indices in any order.\r\n\r\nif there are multiple optimal solutions output any. It is not necessary to use all days for studying.'''\r\n\r\nn, k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nd = []\r\nfor i in range(n):\r\n d.append([arr[i],i+1])\r\nd.sort(key=lambda x:x[0])\r\nres = []\r\nc = 0\r\ni = 0\r\na = 0\r\nwhile a<=k and i<n:\r\n a = a+d[i][0]\r\n if a<=k:\r\n res.append(d[i][1])\r\n c = c+1\r\n i = i+1\r\nprint(c)\r\nif c>0:\r\n print(*res)", "from operator import itemgetter\r\nfrom collections import OrderedDict\r\n\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\na = list(map(int, input().split()))\r\nins = {}\r\nsum = 0\r\ncnt = 0\r\noutput = ''\r\n\r\nfor i in range(1, n+1):\r\n ins[i] = a[i-1]\r\n\r\nins = OrderedDict(sorted(ins.items(), key=itemgetter(1)))\r\n\r\nfor i in ins:\r\n if sum + ins[i] <= k:\r\n sum += ins[i]\r\n cnt += 1\r\n else:\r\n break\r\nprint(cnt)\r\nfor i in ins:\r\n if cnt > 0:\r\n output += str(i) + ' '\r\n cnt -= 1\r\n else:\r\n break\r\nprint(output)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[[a[i],i+1] for i in range(n)]\r\nb.sort()\r\nc=0\r\nr=[]\r\nfor j in range(n):\r\n\tif((k-b[j][0])>=0):\r\n\t\tc=c+1\r\n\t\tk=k-b[j][0]\r\n\t\tr.append(b[j][1])\r\nprint(c)\r\nprint(*r)", "def checkk(x,i,s,k):\r\n global j\r\n for j in range(len(x),0,-1):\r\n if i*j+s<=k:\r\n return True\r\n return False\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ndic = {}\r\nj=0\r\nfor i in range(n):\r\n if arr[i] not in dic:\r\n dic[arr[i]]=[i+1]\r\n else:\r\n dic[arr[i]]+=[i+1]\r\nsumm = 0\r\nlstn = []\r\nfor i in range(1,101):\r\n if i in dic:\r\n if checkk(dic[i],i,summ,k):\r\n summ += i*j\r\n lstn.extend(dic[i][:j])\r\nprint(len(lstn))\r\nprint(*lstn)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = []\r\nfor i in range(1, n + 1):\r\n l.append((i, a[i - 1]))\r\n\r\nl.sort(key=lambda p : p[1])\r\nq = 0\r\nc = 0\r\nwhile c < n and q <= k:\r\n q += l[c][1]\r\n c += 1\r\n if q > k:\r\n c -= 1\r\n\r\nprint(c)\r\nprint(\" \".join(map(str, [i[0] for i in l[:c]])))", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl2 = list(l)\r\nl2.sort()\r\ns =0\r\nr =[]\r\nfor i in l2:\r\n if s+i <= b:\r\n s+= i\r\n r.append(l.index(i)+1)\r\n l[l.index(i)] = 90000\r\n \r\n \r\nprint(len(r))\r\nif (len(r)>0):\r\n for i in r:\r\n print(str(i) + \" \", end=\"\")", "n, d = map(int, input().split())\na = list(map(int, input().split()))\nb = sorted(a)\ns = 0\nind = []\nfor i in b:\n if s+i <= d:\n s += i\n inc = a.index(i)\n a[inc] = -1\n ind.append(inc+1)\n\nprint(len(ind))\nprint(*sorted(ind))\n\n \t \t \t \t \t \t\t\t\t\t\t\t \t\t\t \t\t", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nk=[]\r\ns=0\r\nfor i in range(len(l)):\r\n k.append([l[i],i+1])\r\n\r\ng=sorted(k,key=lambda x:x[0])\r\n#print(g)\r\no=[]\r\nc=0\r\n\r\nfor i in g:\r\n s+=i[0] \r\n if(s>b):\r\n break\r\n o.append(i[1])\r\n c+=1\r\nprint(c)\r\nif(len(o)>0):\r\n o=sorted(o)\r\n print(*o)\r\n \r\n \r\n\r\n", "import random\r\nn,m=map(int,input().split())\r\nk=list(map(int,input().split()))\r\no=sorted(k)\r\nl=0\r\np=[]\r\nfor i in range(n):\r\n if m>=o[i]:m-=o[i];l+=1\r\nfor j in range(l):\r\n p.append(k.index(min(k))+1)\r\n k[k.index(min(k))]=random.randint(max(k)+1,max(k)+2)\r\nprint(l);print(*p)", "n,m=map(int,input().split())\r\ny=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(n):\r\n x.append([y[i],i+1])\r\nx.sort(key=lambda i:i[0])\r\nc=0\r\ni=0\r\nwhile i<n:\r\n c+=x[i][0]\r\n if c>m:\r\n break\r\n i+=1\r\n\r\nprint(i)\r\nfor j in range(i):\r\n print(x[j][1],end=\" \")", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\na=sorted(l)\nind=0\nwhile k>0 and ind<n:\n if k-a[ind]<0:\n break\n k-=a[ind]\n ind+=1\n \nprint(ind)\nfor i in range(ind):\n i1=l.index(a[i])\n print(i1+1,end=\" \")\n l[i1]=-1\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())\r\nk_1 = list(map(int, input().split()))\r\nm, h = [], []\r\nj, summ = 0, 0\r\nfor i in k_1:\r\n j += 1\r\n m.append([i, j])\r\nm.sort()\r\nfor i in m:\r\n if (summ + i[0]) <= k:\r\n summ += i[0]\r\n h.append(i[1])\r\nif len(h) == 0:\r\n print(0)\r\nelse:\r\n print(len(h))\r\n for i in h:\r\n print(i, end = \" \")", "n, k = map(int, input().split())\r\nb = list(map(int, input().split()))\r\na = [(b[i], i) for i in range(n)]\r\na = sorted(a)\r\nins = 0\r\nind = 0\r\nwhile ind < n:\r\n if ins + a[ind][0] <= k:\r\n ins += a[ind][0]\r\n else:\r\n break\r\n ind += 1\r\nprint(ind)\r\nans = []\r\nfor i in range(ind):\r\n ans.append(a[i][1] + 1)\r\nprint(*ans)", "import sys\r\n\r\nn_k = input().split()\r\nai = input().split()\r\n\r\nmy_dict = {}\r\nfor i in range (0, int(n_k[0])):\r\n my_dict[i]= int(ai[i])\r\n\r\ndict = sorted(my_dict.items(), key=lambda x: x[1])\r\n\r\nsum = 0\r\ni = 0\r\nfor key in dict:\r\n sum += key[1]\r\n if (sum == int(n_k[1])):\r\n i += 1\r\n break\r\n elif(sum < int(n_k[1])):\r\n i += 1\r\n else:\r\n break\r\n\r\nprint(i)\r\nfor j in range(0, i):\r\n sys.stdout.write(str(dict[j][0] + 1) +' ')", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\nn,k = map(int, input().split())\r\nls = list(map(int,input().split()))\r\n\r\nlsind=[]\r\n\r\nfor i in range(n):\r\n\tlsind.append((ls[i],i+1))\r\n\r\nans = []\r\ns = 0\r\n\r\nfor x in sorted(lsind):\r\n\ts+=x[0]\r\n\tif s <= k: ans.append(x[1])\r\n\telse: break\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nresList = list()\r\nfor a, b in sorted(zip(l, range(n))):\r\n if a <= k:\r\n resList.append(b+1)\r\n k -= a\r\nprint(len(resList))\r\nprint(' '.join(map(str, resList)))" ]

[ "n, m = [int(x) for x in input().split(' ')]\nc = [int(x) for x in input().split(' ')]\na = [int(x) for x in input().split(' ')]\ncnt = 0\nfor i in range(n):\n if c[i] <= a[0]:\n a.pop(0)\n cnt += 1\n if len(a) <= 0: break \nprint(cnt)\n", "def main():\n [n_games, n_bills] = [int(_) for _ in input().split()]\n game_prices = [0] + [int(_) for _ in input().split()]\n bills = [0] + [int(_) for _ in input().split()]\n\n last_game = 0\n last_bill = 0\n count_games_bought = 0\n\n while last_game < n_games and last_bill < n_bills:\n last_bill += 1\n bill = bills[last_bill]\n try:\n last_game = next(g for g in range(last_game + 1, n_games + 1) if game_prices[g] <= bill)\n count_games_bought += 1\n except StopIteration:\n last_game = n_games\n\n print(count_games_bought)\n\n\nif __name__ == '__main__':\n main()\n", "n,m=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\n\r\ni,j = 0,0\r\ncount=0\r\nwhile i<len(l) and j<len(k):\r\n if l[i]<=k[j]:\r\n count+=1\r\n j+=1\r\n i+=1\r\n else:\r\n i+=1\r\nprint(count)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nzero1 = 0 ; zero2 = 0\nfor i in a:\n\tif zero2 < m and i <= b[zero2]:\n\t\tzero1 += 1 ; zero2 += 1\nprint(zero1)\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nPc, Pa, ans = 0, 0, 0\r\nwhile Pc < n and Pa < m :\r\n if a[Pa] >= c[Pc] :\r\n ans += 1\r\n Pa += 1\r\n Pc += 1\r\n else:\r\n Pc += 1\r\nprint(ans)\r\n", "n,m = input().split()\r\ncost_Array = list(map(int, input().split()))\r\nbill_Array = list(map(int, input().split()))\r\ni = 0\r\nj = 0\r\ncount = 0\r\nwhile (i<int(n) and j<int(m) ):\r\n if cost_Array[i] <= bill_Array[j]:\r\n count += 1\r\n i += 1\r\n j += 1\r\n\r\n else:\r\n i += 1\r\nprint(count)\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()]\ni = 0\nj = 0\nans = 0\nwhile i < n and j < m:\n if a[i] <= b[j]:\n i += 1\n j += 1\n ans += 1\n else:\n i += 1\nprint(j)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx,y,=0,0\r\nwhile(x!=n)and(y!=k):\r\n if(a[x]<=b[y]):\r\n y=y+1\r\n x=x+1\r\nprint(y)\r\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ngame = bill = 0\r\nwhile game < n and bill < m:\r\n if a[bill] >= c[game]:\r\n bill += 1\r\n game += 1\r\nprint(bill)", "n,m = map(int,input().split())\r\nshu1 = input()\r\nshu2 = input()\r\na = [int(i) for i in shu1.split(' ')]\r\nb = [int(i) for i in shu2.split(' ')]\r\nans = 0\r\nfor i in a:\r\n if b[ans]>=i:\r\n ans+=1\r\n if ans==m:\r\n break\r\nprint(ans)", "n, m = map(int, input().split())\nc = map(int, input().split())\na = map(int, input().split())\n\nt = 0\nfor j in a:\n for i in c:\n if j >= i:\n t += 1\n break\nprint(t)\n", "n, q = map(int, input().split())\r\ncosts = [int(c) for c in input().split()]\r\nbills = [int(b) for b in input().split()]\r\n\r\ni = 0\r\nj = 0\r\ncount = 0\r\nwhile i < len(costs) and j < len(bills):\r\n if bills[j] >= costs[i]:\r\n j += 1\r\n i += 1\r\n count += 1\r\n else:\r\n i += 1\r\n\r\nprint(count)\r\n\r\n\r\n", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n, m = map(int, input().split())\n c = list(map(int, input().split()))\n a = list(map(int, input().split()))\n p = 0\n cnt = 0\n for i in range(n):\n if p >= m:\n break\n if a[p] >= c[i]:\n cnt += 1\n p += 1\n print(cnt)\n \n \nif __name__ == '__main__':\n main()\n\n\t \t\t\t\t \t \t\t\t\t \t \t \t", "def go():\n n, m = [int(i) for i in input().split(' ')]\n a = [int(i) for i in input().split(' ')]\n b = [int(i) for i in input().split(' ')]\n i = j = 0\n while i < n and j < m:\n if a[i] <= b[j]:\n j += 1\n i += 1\n return j\n\nprint(go())\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\n\r\ncount=0\r\nj=0\r\n\r\nfor i in range(n):\r\n if c[j]>=a[i]:\r\n j+=1\r\n count+=1\r\n\r\n if count==m:\r\n break\r\nprint(count)", "while True:\r\n\ttry:\r\n\t\tdef soln(n, m):\r\n\t\t\tgif = list(map(int, input().split()))\r\n\t\t\twalt = list(map(int, input().split()))\r\n\t\t\ti = 0;j= 0;\r\n\t\t\tbuy = 0\r\n\t\t\twhile i < n:\r\n\t\t\t\tif j == m:\r\n\t\t\t\t\tbreak\r\n\t\t\t\tif gif[i] <= walt[j]:\r\n\t\t\t\t\tbuy += 1\r\n\t\t\t\t\tj += 1\r\n\t\t\t\ti += 1\r\n\t\t\tprint(buy)\r\n\t\tdef read():\r\n\t\t\tn, m = map(int, input().split())\r\n\t\t\tsoln(n, m)\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "import math\r\nn,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = 0\r\n\r\na.reverse()\r\nfor i in c:\r\n #print(i)\r\n if i <= a[-1]:\r\n a.pop()\r\n ans += 1\r\n if ans == m:\r\n break\r\nprint(ans)\r\n\r\n", "n,m=input().split()\r\nc=map(int,input().split())\r\na=map(int,input().split())\r\ncount=0\r\nfor i in a:\r\n\tfor j in c:\r\n\t\tif(j<=i):\r\n\t\t\tcount+=1\r\n\t\t\tbreak\r\nprint(count)", "n,m = map(int, input().split())\nmat = list(map(int, input().split()))\nsat = list(map(int, input().split()))\n\nj = 0\ni = 0\nres = 0\n\nwhile i<n:\n if mat[i]<=sat[j]:\n res+=1\n j+=1\n if j>=m:\n break\n i+=1\nprint(res)\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(m):\r\n test = True\r\n for j in range(n):\r\n if a[i] >= c[j] and c[j] != -1 and test:\r\n k += 1\r\n c[j] = -1\r\n test = False\r\n elif test:\r\n c[j] = -1\r\nprint(k)\r\n", "a,b=list(map(int,input().split()))\r\naa=list(map(int,input().split()))\r\nbb=list(map(int,input().split()))\r\npos=0\r\nfor i in aa:\r\n\tif pos>=b:\r\n\t\tbreak\r\n\tif bb[pos]>=i:\r\n\t\tpos+=1\r\nprint(pos)\r\n", "games, bills = map(int, input().split())\r\ncosts = list(map(int, input().split()))\r\nmoneys = list(map(int, input().split()))\r\ntempMon = 0\r\ngoNext = True\r\nanswer = 0\r\ntempMoney = moneys.pop(0)\r\nfor cost in costs:\r\n #goNext = False\r\n if(tempMoney >= cost):\r\n answer += 1\r\n if moneys:\r\n tempMoney = moneys.pop(0)\r\n #goNext = True\r\n else:\r\n break \r\n \r\n\r\nprint(answer) \r\n\r\n \r\n", "from sys import exit\r\n\r\nn, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni1, i2 = 0, 0\r\nq = 0\r\nwhile(i1 < n and i2 < m):\r\n if(b[i2] >= s[i1]):\r\n i2 += 1\r\n q += 1\r\n i1 += 1\r\nprint(q)", "n , m = map(int , input().split())\r\n\r\nc = list(map(int, input().split()))\r\n\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in c:\r\n res += (res < len(a) and a[res] >= i)\r\nprint(res) ", "n, m = map(int, input().split())\r\na = list( map(int, input().split()) )\r\nb = list( map(int, input().split()) )\r\ni, j, counter = 0, 0, 0\r\nwhile( i < int(n) and j < int(m) ):\r\n if( a[i] <= b[j] ):\r\n i += 1\r\n j += 1\r\n counter += 1\r\n else:\r\n i += 1\r\nprint(counter) ", "a,b=map(int,input().split(\" \"))\nc=input().split(\" \")\nd=input().split(\" \")\nn=0\nc=[int(i) for i in c]\nd=[int(j) for j in d]\nfor i in range(a):\n if n!=b:\n if d[n]>=c[i]:\n n=n+1\nprint(n)\n\n\n\n \t\t \t\t \t\t \t\t \t \t \t\t\t\t\t\t\t", "i= input().split()\r\n\r\na=int(i[0])\r\nb=int(i[1])\r\n\r\ncost= list(map(int, input().split()))\r\ngame= list(map(int, input().split()))\r\n\r\nk=0\r\ncount=0\r\nj=0\r\nwhile k<a and j<b:\r\n if cost[k]<=game[j]:\r\n count=count+1\r\n j=j+1\r\n k=k+1\r\n\r\n\r\nprint(count)", "n,m = map(int,input().split())\r\nnl = list(map(int,input().split()))\r\nml = list(map(int,input().split()))\r\ni,count=0,0\r\nfor j in range(n):\r\n\tif nl[j]<=ml[i]:\r\n\t\tcount+=1\r\n\t\ti+=1\r\n\tif i==m:\r\n\t\tbreak\r\nprint(count)", "##########################################################################\r\n# Author : nesco \r\n# Created: Tue Dec 28 2021 21:32:01\r\n# File : A. Game Shopping\r\n##########################################################################\r\nimport sys,math,cmath,time,collections\r\n##########################################################################\r\n################# ---- THE ACTUAL CODE STARTS BELOW ---- #################\r\ndef solve():\r\n n, m = invr()\r\n c = inlt()\r\n a = inlt()\r\n\r\n cnt = 0\r\n\r\n for i in range(m):\r\n bill = a[i]\r\n\r\n if len(c) > 0:\r\n while(bill < c[0]):\r\n del c[0]\r\n if len(c) == 0:\r\n break\r\n\r\n if len(c) > 0:\r\n if bill >= c[0]:\r\n cnt = cnt + 1\r\n del c[0]\r\n else:\r\n break\r\n\r\n print(cnt)\r\n\r\n################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################\r\n##########################################################################\r\n \r\ndef main():\r\n global tt\r\n t = 1\r\n for tt in range(1,t + 1):\r\n solve()\r\n \r\n#---------------------- USER DEFINED INPUT FUNCTIONS --------------------#\r\ndef inp(): # input integer\r\n return(int(input()))\r\ndef inlt(): # input list of integers\r\n return(list(map(int,input().split())))\r\ndef inls(): # input list of strings\r\n return(list(map(str,input().split())))\r\ndef insr(): # input string\r\n return(input().strip())\r\ndef invr(): # input array\r\n return(map(int,input().split()))\r\n \r\n#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#\r\n# are a and b coprime?\r\ndef is_coprime(x, y):\r\n return gcd(x, y) == 1\r\n\r\n# gcd of two positive integers\r\ndef gcd(p,q):\r\n while q != 0:\r\n p, q = q, p%q\r\n return p\r\n\r\n# set to list converter\r\ndef convert(set):\r\n return list(set)\r\n\r\n# outputs unique values from list\r\ndef unique(list):\r\n list_set = set(list)\r\n unique_list = convert(list_set)\r\n return unique_list\r\n\r\n# sorting string\r\ndef sort_string(string):\r\n r = sorted(string)\r\n return \"\".join(r)\r\n\r\n# reverse string\r\ndef reverse_string(string):\r\n return string[::-1]\r\n\r\n# Convert string to list character-wise\r\ndef convert_to_list(string):\r\n lis=[]\r\n lis[:0]=string\r\n return lis\r\n\r\n# list of all prime numbers up to n\r\ndef seive(n):\r\n a = []\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): \r\n prime[i] = False\r\n p = p + 1\r\n for p in range(2,n + 1): \r\n if prime[p]: \r\n a.append(p)\r\n return(a)\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# counts number of elements \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\n# counts number of letters in string\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\n# returns factorial of 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\n# returns all (possible) factors of 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\n# returns prime factors of 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\n# transpose matrix or vector (list)\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\n# returns boolean if x is power of two\r\ndef power_two(x):\r\n return (x and (not(x & (x - 1))))\r\n\r\n# returns ceil of division\r\ndef ceil(a, b):\r\n return -(-a // b)\r\n#-----------------------------------------------------------------------#\r\n \r\nmain()", "l1=[int(i) for i in input().split()]\r\nc1=[int(j) for j in input().split()]\r\na1=[int(k) for k in input().split()]\r\ncount=0\r\nfor l in c1:\r\n if len(a1)!=0:\r\n v=a1[0]\r\n if l<=v:\r\n count+=1\r\n a1.remove(v)\r\nprint(count)", "def main():\r\n n, m = [int(v) for v in input().split()]\r\n vals1 = [int(v) for v in input().split()]\r\n vals2 = [int(v) for v in input().split()]\r\n cur = 0\r\n c = 0\r\n for i in range(n):\r\n if cur<m:\r\n if vals2[cur]>=vals1[i]:\r\n c+=1\r\n cur+=1\r\n print(c)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "totalGames, totalBills = list(map(int, input().split(\" \")))\r\ngames = list(map(int, input().split(\" \")))\r\nbills = list(map(int, input().split(\" \")))\r\nbought, game, bill = 0, 0, 0\r\nwhile bill < totalBills and game < totalGames:\r\n if games[game] <= bills[bill]:\r\n bought += 1\r\n bill += 1\r\n game += 1\r\nprint(bought)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\ny,z=0,0\r\nwhile(z!=n)and(y!=m):\r\n if(a[z]<=b[y]):\r\n y=y+1\r\n c=c+1\r\n z=z+1\r\n else:\r\n z=z+1\r\nprint(c)\r\n \r\n", "n,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\ni=int(0)\ncnt=(0)\nj=int(0)\nwhile i<n and j<m:\n if a[i]<=b[j]:\n cnt+=1;\n i+=1\n j+=1\n else:\n i+=1\nprint(cnt)\n\n\t \t\t \t \t\t \t\t\t \t \t \t \t \t", "s = input()\r\nn = int(s.split(' ')[0])\r\nm = int(s.split(' ')[1])\r\ns1 = input()\r\ns2 = input()\r\nc = s1.split(' ')\r\na = s2.split(' ')\r\n\r\namount = 0\r\nfor el in c:\r\n if len(a) > 0:\r\n if int(el) <= int(a[0]):\r\n a.remove(a[0])\r\n amount += 1\r\n else:\r\n break\r\n\r\nprint(amount)\r\n", "r=lambda:map(int,input().split())\r\nr()\r\nc,a=r(),[*r()]+[0]\r\ni=0\r\nfor x in c:i+=x<=a[i]\r\nprint(i)", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nc = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb_idx = c_idx = 0\r\ncnt = 0\r\nwhile c_idx < len(c) and b_idx < len(b):\r\n if b[b_idx] >= c[c_idx]:\r\n cnt += 1\r\n b_idx += 1\r\n c_idx += 1\r\n \r\nprint(cnt)\r\n", "pocHier, pocPen = list(map(int, input().split()))\r\nhry = list(map(int, input().split()))\r\npen = list(map(int, input().split()))\r\nsucasCisPen, vys = 0, 0\r\n\r\nfor i in range(pocHier):\r\n\tif pen[sucasCisPen] >= hry[i]:\r\n\t\tvys += 1\r\n\t\tsucasCisPen += 1\r\n\t\r\n\tif sucasCisPen >= pocPen:\r\n\t\tbreak\r\n\t\r\nprint(vys)", "n, m = map(int, input().split())\n*games, = map(int, input().split())\n*bills, = map(int, input().split())\ni, j, counter= 0, 0, 0\nwhile True:\n if games[i] <= bills[j]:\n counter += 1\n j +=1\n i += 1\n if i == n or j == m:\n break\nprint(counter)", "n, m = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\ndef f(n, m, a, c):\r\n r = 0\r\n index = 0\r\n for i in range(n):\r\n if a[index] >= c[i]:\r\n r += 1\r\n index += 1\r\n if index == m:\r\n print(r)\r\n return\r\n print(r)\r\n\r\nf(n, m, a, c)\r\n", "import sys\nimport math\n\nclass Reader:\n def __init__(self):\n self.data = ''.join(sys.stdin.readlines()).split()\n self.idp = 0\n \n def get(self, t):\n value = t(self.data[self.idp])\n self.idp += 1\n return value\n \n def list(self, t, k):\n value = map(t, self.data[self.idp:self.idp+k])\n self.idp += k\n return list(value)\n\n\nr = Reader()\nn, m = r.get(int), r.get(int)\nc = r.list(int, n)\na = r.list(int, m)\ni, j = 0, 0\nk = 0\nwhile i < n and j < m:\n if c[i] <= a[j]:\n j += 1\n k += 1\n i += 1\nprint(k)", "n,m = map(int,input().split())\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\n\r\nj = 0\r\nfor i in range(n):\r\n if j<m and arr2[j]>=arr1[i]:\r\n j+=1\r\nprint(j)\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn, m = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nans = 0\r\nfor x in c:\r\n\tif ans < m and x <= a[ans]:\r\n\t\tans += 1\r\nprint(ans)", "string=input()\r\ns=string.split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nno_games=0\r\nstring1=input()\r\ngames=string1.split()\r\nfor i in range(len(games)):\r\n games[i]=int(games[i])\r\nstring2=input()\r\nwallet=string2.split()\r\nfor i in range(len(wallet)):\r\n wallet[i]=int(wallet[i])\r\ncont=1 \r\nwhile(cont==1):\r\n z=wallet[0]\r\n found=0\r\n m=[]\r\n for i in range(len(games)):\r\n if(games[i]<=z):\r\n wallet.pop(0)\r\n m.append(games[i])\r\n no_games=no_games+1 \r\n found=1 \r\n break\r\n if(games[i]>z):\r\n m.append(games[i])\r\n for i in range(len(m)):\r\n games.remove(m[i])\r\n if(found==0):\r\n break\r\n if(len(games)==0):\r\n break \r\n if(len(wallet)==0):\r\n break \r\nprint(no_games)\r\n ", "n,m=map(int,input().split(' '))\r\nl=list(map(int,input().split(' ')))\r\nl2=list(map(int,input().split(' ')))\r\nj=0\r\nc=0\r\ni=0\r\nwhile(i<n and j<m):\r\n if l2[j] >= l[i]:\r\n j+=1\r\n i+=1\r\n c+=1\r\n else:\r\n i+=1\r\n\r\nprint(c)", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\ncount = 0\n# t = 0\n # t = count\nfor j in range(m):\n for i in range(n):\n if a[j] >= c[i]:\n # a[j] = 0\n c[i] = 10000\n count += 1\n break\n else:\n c[i]=10000\n # if t == count:\n # break\nprint(count)\n\n \t \t\t \t \t\t \t \t\t\t\t \t \t\t", "x= [int(i) for i in input().split()]\r\nn,m= x[0],x[1]\r\nnlist= [int(i) for i in input().split()]\r\nmlist=[int(i) for i in input().split() ]\r\nindex=0\r\ni=0\r\nres=0\r\nwhile i < n and index < m:\r\n if nlist[i] <= mlist[index] :\r\n res=res+1\r\n i=i+1\r\n index=index+1\r\n else :\r\n i=i+1\r\nprint(res) \r\n \r\n ", "input()\r\na = list(map(int, input().split()))[::-1]\r\nb = list(map(int, input().split()))[::-1]\r\n\r\nans = 0\r\nwhile a and b:\r\n if a.pop() <= b[-1]:\r\n b.pop()\r\n ans += 1\r\nprint(ans)\r\n", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nc=0\r\nj=0\r\nfor i in l:\r\n if(a[j]>=i):\r\n c+=1\r\n j+=1\r\n if(j==n):\r\n break\r\nprint(c)\r\n", "# list1=input()\r\nnumbers = list(map(int, input().split()))\r\nans = 0\r\ngames = list(map(int, input().split()))\r\nwallet = list(map(int,input().split()))\r\nfor i in range(0,len(wallet)):\r\n for j in range(0,len(games)):\r\n if wallet[i]>games[j] or wallet[i]==games[j]:\r\n ans=ans+1\r\n break\r\n if j == len(games):\r\n break\r\n else:\r\n del games[0:j+1]\r\nprint(ans)", "import sys\r\nimport math\r\nimport bisect\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 i = 0\r\n j = 0\r\n while i < n and j < m:\r\n if A[i] <= B[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n i += 1\r\n print(j)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if(a):\r\n if(a[0]>=c[i]):\r\n c[i]=-1\r\n a.pop(0)\r\n else:\r\n break\r\n #print(c)\r\nprint(c.count(-1))", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ni,j=0,0\r\nc=0\r\nwhile i<n and j<m:\r\n \tif b[j]>=a[i]:\r\n \t\tc+=1\r\n \t\tj+=1\r\n \t\ti+=1\r\n \telse:\r\n \t\ti+=1\r\nprint(c)", "n, m = map(int, input().split())\nlist1 = list(map(int, input().split()))\nlist2 = list(map(int, input().split()))\nj = 0\nk = 0\nfor i in range(n):\n if list2[j] >= list1[i]:\n list2.pop(j)\n k += 1\n if k == m:\n break\nprint(k)\n \t \t\t \t\t \t\t \t\t \t\t\t \t", "\r\n\r\nm, n = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ncounter = 0\r\n\r\ni = 0\r\nj = 0\r\nwhile i < len(a) and j < len(b):\r\n if b[j] >= a[i]:\r\n counter+=1\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\n \r\n\r\nprint(counter)\r\n\r\n\r\n\r\n\r\n\"\"\"n = input()\r\nm = input()\r\ncounter = 0\r\nfor i in range(len(m)):\r\n if m[i] == \"8\":\r\n counter += 1\r\n\r\nc = len(m) // 11\r\n\r\nprint(min(c, counter))\"\"\"", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ni, j, cnt = 0, 0, 0\r\n\r\nwhile i < n and j < m:\r\n #print(c[i], a[j])\r\n if c[i] <= a[j]:\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n else:\r\n i += 1\r\nprint(cnt)", "n, m = map(int, input().split())\r\na = [*map(int, input().split())]\r\nb = [*map(int, input().split())]\r\nres = 0\r\n\r\nfor i in a:\r\n res += (res < len(b) and b[res] >= i)\r\nprint(res)\r\n", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nv=0\r\nfor i in range(x):\r\n\tif b[v]>=a[i]:\r\n\t\tv+=1 \r\n\tif v==len(b):\r\n\t\t\tbreak\r\nprint(v)\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "n,m=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nj,cnt=0,0\r\nfor i in range(n):\r\n if(j<m and c[i]<=a[j]):\r\n cnt+=1\r\n j+=1\r\n if(j==m):\r\n break\r\nprint(cnt)", "n, m = [int(i) for i in input().split()]\r\nC = [int(i) for i in input().split()]\r\nA = [int(i) for i in input().split()]\r\ncnt = 0\r\nfor i in range(n):\r\n if len(A) == 0:\r\n break\r\n if A[0] >= C[i]:\r\n cnt += 1\r\n del A[0]\r\nprint(cnt)", "\r\n\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n c_i= 0\r\n a_i= 0\r\n bought = 0\r\n while c_i!= n and a_i!= m:\r\n if(a[a_i]>=c[c_i]):\r\n a_i+=1\r\n c_i+=1\r\n bought+=1\r\n else:\r\n c_i+=1\r\n print(bought)\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nsd=list(map(int,input().split()))\r\nj=0\r\nans=0\r\nfor i in range(n):\r\n if j<m:\r\n if sd[j]>=s[i]:\r\n j+=1\r\n ans+=1\r\nprint(ans)", "n,m=map(int,input().split())\r\nn1=list(map(int,input().split()))\r\nm1=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(n1)):\r\n\tif len(m1)==0:\r\n\t\tbreak\r\n\telif m1[0]>=n1[i]:\r\n\t\tcount+=1\r\n\t\tm1.remove(m1[0])\r\nprint(count)", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n w = list(map(int, inp[2].split()))\r\n c, j = 0, 0\r\n for i in map(int, inp[1].split()):\r\n if j == len(w): break\r\n if w[j] >= i: c += 1; j += 1\r\n return c\r\n\r\nprint(main())\r\n", "g,b = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nc = 0\r\nn = list(map(int,input().split()))\r\nl = 0\r\nfor i in range(g):\r\n if l < b and n[l] >= x[i]:\r\n l+=1\r\n c+=1\r\nprint(c)\r\n\r\n", "def shopping(n,m,costs,bills):\r\n\tcount = 0\r\n\tfor val in costs :\r\n\t\tif len(bills)==0:\r\n\t\t\tbreak\r\n\t\telif val <= bills[0]:\r\n\t\t\tcount+=1\r\n\t\t\tbills.pop(0)\r\n\tprint(count)\r\nrd = lambda : [int(x) for x in input().split(' ')]\r\nn,m = rd()\r\ncosts = rd()\r\nbills = rd()\r\nshopping(n,m,costs,bills)", "g,w=map(int,input().split())\r\ngf=list(map(int,input().split()))\r\nwf=list(map(int,input().split()))\r\ni=0\r\nt=0\r\nc=0\r\nwhile i!=g and t!=w:\r\n if wf[t]>=gf[i]:\r\n t=t+1\r\n i=i+1\r\n c=c+1\r\n elif wf[t]<gf[i]:\r\n i=i+1\r\nprint(c)\r\n\r\n\r\n", "n, m = (int(x) for x in input().split())\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nj = 0\r\nans = 0\r\nfor i in range(n):\r\n if j < m and a[j] >= c[i]:\r\n ans += 1\r\n j += 1\r\nprint(ans)\r\n", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = deque(map(int, input().split()))\r\n\r\nres = 0\r\nacur = int(a.popleft())\r\nfor x in c:\r\n if acur >= x:\r\n res += 1\r\n if len(a) == 0:\r\n break \r\n acur = int(a.popleft())\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split())) + [0]\r\nans = 0\r\nfor i in c:\r\n if i <= a[ans]:\r\n ans += 1\r\nprint(ans)", "n,m=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=0\r\nj=0\r\nb=0\r\nwhile(i<n and j<m):\r\n if a[j]>=c[i]:\r\n j=j+1\r\n i=i+1\r\n b=b+1\r\n else:\r\n i=i+1\r\nprint(b)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni, j, res = 0, 0, 0\r\nwhile (i < n and j < m):\r\n if (b[j] >= a[i]):\r\n res += 1\r\n i += 1\r\n j += 1\r\n else:\r\n i += 1\r\nprint(res)", "input_int = [int(x) for x in input().split()]\r\nn = input_int[0]\r\nm = input_int[1]\r\n\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if c[i] <= a[count]:\r\n count += 1\r\n\r\n if count == m:\r\n break\r\n\r\nprint(count)\r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn,m=read_ints()\r\n\ta=read_ints()\r\n\tb=read_ints()\r\n\ti=0\r\n\tj=0\r\n\tret=0\r\n\twhile i<n and j<m:\r\n\t\tif a[i]<=b[j]:\r\n\t\t\tret+=1\r\n\t\t\ti+=1\r\n\t\t\tj+=1\r\n\t\telse:\r\n\t\t\ti+=1\r\n\tprint(ret)\r\n\r\nsolve()\r\n", "#!/usr/bin/python3\n\ndef solve(N, M, C, A):\n i = 0\n for c in C:\n if i == M or A[i] < c:\n continue\n i += 1\n return i\n\n\ndef main():\n N, M = [int(e) for e in input().split(' ')]\n C = [int(e) for e in input().split(' ')]\n A = [int(e) for e in input().split(' ')]\n assert len(C) == N\n assert len(A) == M\n print(solve(N, M, C, A))\n\n\nif __name__ == '__main__':\n main()\n", "n, m = [int(elem) for elem in input().split(' ')]\r\nc = [int(elem) for elem in input().split(' ')]\r\na = [int(elem) for elem in input().split(' ')]\r\nposition, count = 0, 0\r\nfor i in c:\r\n if i <= a[position]:\r\n count += 1\r\n if position == len(a) - 1:\r\n break\r\n position += 1\r\nprint(count)", "#! /usr/bin/env python3\n# -*- coding: utf-8 -*-\n\n# n - games\n# m - banknotes\nn, m = [int(x) for x in input().split()]\ngames = [int(x) for x in input().split()]\nnominals = [int(x) for x in input().split()]\n\nc = 0\nfor i in range(n):\n #print(\"i\", i)\n #print(nominals[i])\n #print(games[i])\n if c == len(nominals):\n break\n if nominals[c] >= games[i]:\n c += 1\nprint(c)\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nl = 0\r\nk = 0\r\nfor i in range(m):\r\n for j in range(k,n):\r\n if a[j]<=b[i]:\r\n l+=1\r\n break\r\n k = j+1\r\nprint(l)", "[a,b] = [int(x) for x in input().split()]\r\nN =[int(a) for a in input().split()] \r\nM =[int(b) for b in input().split()]\r\ncount=0\r\nfor i in range(a):\r\n if len(N) == 0 or len(M) == 0:\r\n break\r\n elif N[0] <=M[0]:\r\n N.pop(0)\r\n M.pop(0) \r\n count+=1\r\n else:\r\n N.pop(0)\r\n \r\nprint(count)", "ans = 0\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if a[0] >= c[i]:\r\n a.pop(0)\r\n ans += 1\r\n if len(a) == 0:\r\n break\r\nprint(ans)", "n= list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ng = 0\r\nincr=0\r\nfor i in range(0,n[0]):\r\n if(incr+1<=n[1] and c[i] <= a[incr]):\r\n g+=1\r\n incr+=1\r\n \r\n\r\nprint(g)\r\n ", "g,b=map(int,input().split())\r\ng1=list(map(int,input().split()))\r\nb1=list(map(int,input().split()))\r\nc=0\r\nl=[]\r\nfor i in range(g):\r\n\tif i not in l:\r\n\t\tl.append(i)\r\n\t\tif b1[c]>=g1[i]:\r\n\t\t\tc+=1\r\n\t\t\tif c==b:\r\n\t\t\t\tbreak\r\nprint(c)", "import re\r\ndef main():\r\n\r\n total_games, total_notes = map(int, input().split())\r\n games = [int(i) for i in input().split()]\r\n notes = [int(i) for i in input().split()]\r\n note = 0\r\n for game in games:\r\n if notes[note] >= game:\r\n note += 1\r\n if note == total_notes:\r\n break\r\n print(note)\r\n\r\n\r\n\r\nmain()", "##########################################\r\n#estas librerias nos premite modificar la funcion print\r\n#para tener una salida de datos mas rapido\r\nimport atexit, io, sys\r\nbuffer = io.StringIO()\r\nsys.stdout = buffer\r\n\r\[email protected]\r\ndef write(): sys.__stdout__.write(buffer.getvalue())\r\n###########################################\r\nfrom sys import stdin\r\n\r\ndef main():\r\n _ = stdin.readline()\r\n costo_juegos = [int(n) for n in stdin.readline().split()]\r\n billetera = [int(n) for n in stdin.readline().split()]\r\n cont=0\r\n for juego in costo_juegos:\r\n if billetera:\r\n if billetera[0]>=juego:\r\n cont+=1\r\n billetera.pop(0)\r\n print(cont)\r\n\r\nif __name__ == '__main__': main()", "n,m = map(int,input().split())\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ncount = 0\r\nwhile len(c) > 0 and len(a) > 0:\r\n game = c.pop(0)\r\n if a[0] >= game:\r\n a.pop(0)\r\n count += 1\r\nprint(count)", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().split())\r\na, b = list(map(int, stdin.readline().split())), list(map(int, stdin.readline().split()))\r\n\r\ncnt, ans = 0, 0\r\nfor x in a:\r\n if b[cnt] >= x:\r\n ans += 1\r\n cnt += 1\r\n if cnt == len(b):\r\n break\r\n\r\nprint (ans)", "#!/usr/bin/python3\n\nn, m = [int(x) for x in input().strip().split()]\nc = [int(x) for x in input().strip().split()]\na = [int(x) for x in input().strip().split()]\n\ni = 0\nj = 0\ncount = 0\nwhile(i<n and j<m):\n if c[i] <= a[j]:\n count += 1\n i += 1\n j += 1\n else:\n i += 1\n\nprint(count)", "b = input()\r\na = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\ns = 0\r\nj = 0\r\nfor i in a:\r\n try:\r\n if i <= c[j]:\r\n s+=1\r\n j+=1 \r\n except:break\r\nprint(s)", "n,m = map(int,input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ni=0\r\nj=0\r\ncount = 0\r\nwhile i<n and j<m:\r\n\tif c[i] <= a[j]:\r\n\t\tcount += 1\r\n\t\tj += 1\r\n\ti += 1\r\n\r\nprint(count)", "n, m = map(int, input().split())\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nbought = 0\r\ni = j = 0\r\nwhile i<n and j<m:\r\n if a[j] >= c[i]:\r\n bought += 1\r\n j += 1\r\n i += 1\r\nprint(bought)\r\n", "n, m = map(int, input().split())\r\nC, A = list(map(int, input().split())), list(map(int, input().split()))\r\ni = j = games = 0\r\n\r\nwhile i < n and j < m:\r\n if C[i] <= A[j]:\r\n j, games = j + 1, games + 1\r\n i += 1\r\n\r\nprint(games)", "n, m = map(int, input().split())\r\nG = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\niG, iB = 0, 0\r\nwhile iG < n and iB < m:\r\n if B[iB] >= G[iG]:\r\n ans += 1\r\n iB += 1\r\n iG += 1\r\n \r\n \r\nprint(ans) ", "def main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n c = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n count_games = 0\r\n i, j = 0, 0\r\n while i < len(a) and j < len(c):\r\n if a[i] >= c[j]:\r\n i += 1\r\n j += 1\r\n count_games += 1\r\n else:\r\n j += 1\r\n return count_games\r\n\r\nprint(main_function())\r\n\r\n", "import math\r\nimport sys\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\n\r\nj, res = 0, 0\r\nfor i in range(n):\r\n\tgood = True\r\n\tif j == m:\r\n\t\tbreak\r\n\tif b[j] >= a[i]:\r\n\t\tres += 1\r\n\t\tj += 1\r\n\t\tcontinue\r\n\r\nprint(res)", "import sys\n\nlines = []\nfor Line in sys.stdin:\n lines.append(Line.rstrip('\\n'))\n\n# lines=[\"5 4\",\n# \"2 4 5 2 4\",\n# \"5 3 4 6\"]\n\n# lines=[\"5 2\",\n# \"20 40 50 20 40\",\n# \"19 20\"]\n\n\nn,m = list(map(int,lines[0].split()))\ndel(lines[0])\n\nc=list(map(int,lines[0].split()))\ndel(lines[0])\n\na=list(map(int,lines[0].split()))\ndel(lines[0])\n\n\ni=0\nj=0\nwhile (i<len(a)) and (j<len(c)):\n if a[i]>=c[j]:\n i+=1\n j+=1\n\nprint(i)", "n,m=map(int,input().split())\r\ngame=list(map(int,input().split()))\r\nmoney=list(map(int,input().split()))\r\ni=0\r\nc=0\r\nfor t in money:\r\n for q in range(i,n):\r\n if game[q]<=t:\r\n i+=1\r\n c+=1\r\n break\r\n i+=1\r\n if q==(n-1):\r\n break\r\nprint (c)\r\n", "n,m=input().split()\nc=map(int,input().split())\na=map(int,input().split())\ncount=0\nfor i in a:\n\tfor j in c:\n\t\tif(j<=i):\n\t\t\tcount+=1\n\t\t\tbreak\nprint(count)", "def games(c,a):\r\n k=0\r\n for i in c:\r\n if a==[]:\r\n return k\r\n if i<=a[0]:\r\n a.pop(0)\r\n k+=1\r\n return k\r\nnm=input()\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nprint(games(a,b))", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\na,b= 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(a):\r\n if l<b and n[l]>=m[i]:\r\n l+= 1\r\nprint(l)", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\ncount = 0\ni = 0\nj = 0\nwhile i < n and j < m:\n if c[i] <= a[j]:\n count += 1\n i += 1\n j += 1\n else:\n i += 1\nprint(count)\n", "games, bills = [int(x) for x in input().split()]\r\ngames_cost = [int(x) for x in input().split()]\r\nhas_bill = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor g in games_cost:\r\n if g <= has_bill[0]:\r\n has_bill.pop(0)\r\n cnt += 1\r\n if len(has_bill) < 1:break\r\nprint(cnt)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ncnt=0\r\nwhile(a!=[] and c!=[]):\r\n if(a[0]>=c[0]):\r\n cnt=cnt+1\r\n a.remove(a[0])\r\n c.remove(c[0])\r\n else:\r\n c.remove(c[0])\r\nprint(cnt)", "# 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\nn,m = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n\tif (ans<m) and (a[ans]>=c[i]):\r\n\t\tans+=1\r\nprint(ans)\r\n", "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\nn, m = na()\r\n\r\na = na()\r\nb = na()\r\nj = 0\r\nans = 0\r\nfor i in range(n):\r\n if j < m and b[j] >= a[i]:\r\n ans += 1\r\n j += 1\r\n\r\nprint(ans)\r\n", "r = lambda:map(int,input().split())\r\nr()\r\na,b = r(),[*r()]+[0]\r\ns = 0\r\nfor i in a:\r\n s += i <=b[s]\r\nprint(s)", "first = [int(x) for x in input().split()]\r\nlistc = [int(x) for x in input().split()]\r\nlista = [int(x) for x in input().split()]\r\n\r\nn=first[0]\r\nm=first[1]\r\n\r\nwalletIndex = 0\r\nmaxGames =0 \r\nfor game in range (n):\r\n if (walletIndex < m) and (lista[walletIndex]>= listc[game]) :\r\n walletIndex+=1\r\n maxGames+= 1 \r\n\r\nprint (maxGames) ", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns1=list(map(int,input().split()))\r\nx=0\r\nans=0\r\ny=0\r\nwhile x<n and y<m:\r\n if s[x]<=s1[y]:\r\n ans+=1\r\n y+=1\r\n x+=1\r\n else:\r\n x+=1\r\nprint(ans)\r\n", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nan = input().split()\r\nam = input().split()\r\nx = 0\r\nsum = 0\r\nfor i in range(n):\r\n if int(an[i]) <= int(am[x]):\r\n x += 1\r\n sum += 1\r\n if x >= m:\r\n break\r\nprint(sum)\r\n \r\n", "n,m = map(int,input().split())\r\nA = list(map(int,input().split(\" \")[:n]))\r\nB = list(map(int,input().split(\" \")[:m]))\r\n\r\ntemp = ans = 0\r\n\r\nfor i in A:\r\n if(B[temp]>=i):\r\n ans +=1\r\n temp+=1\r\n if(temp == m):\r\n break\r\n\r\nprint(ans)", "n, m = [int(a) for a in input().split()]\nc = [int(b) for b in input().split()]\na = [int(c) for c in input().split()]\nnum1 = 0\nnum2 = 0\ntotal = 0\nwhile(num1 < n and num2 < m):\n if c[num1] > a[num2]:\n num1 += 1\n continue\n num1 += 1\n num2 += 1\n total += 1\nprint(total)\n\n", "a,b = map(int,input().split())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nc = 0\r\nd = 0\r\ne = 0\r\nwhile c < len(x) and d < len(y):\r\n if x[c] <= y[d]:\r\n e += 1\r\n d += 1\r\n c += 1\r\nprint (e)", "l = lambda: map(int, input().split())\r\nn, m = l()\r\nC = list(l())\r\nA = list(l())\r\nc= 0\r\nj = 0\r\nfor i in C:\r\n if j < m and i <= A[j]:\r\n c += 1\r\n j += 1\r\nprint(c)", "input()\r\narr1 = [int(i) for i in input().split()]\r\narr2 = [int(i) for i in input().split()]\r\n \r\nindex1 = 0\r\n \r\ncounter = 0\r\n \r\nfor i in arr1:\r\n try:\r\n if i <= arr2[index1]:\r\n counter += 1\r\n index1 += 1\r\n except:\r\n break \r\nprint(counter)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split())) + [0]\r\nind = 0\r\nans = 0\r\nfor i in range(n):\r\n if a[i] <= b[ind]:\r\n ind += 1\r\n ans += 1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nj,l,i=0,0,0\r\nwhile(len(a)>0):\r\n\tif a[i]>=c[j]:\r\n\t\tl+=1\r\n\t\tj+=1\r\n\t\tdel a[i]\r\n\telse:\r\n\t\tj+=1\r\n\tif j==len(c):\r\n\t\tbreak\r\nprint(l)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=0;y=0;c=0\r\nwhile x!=n and y!=m:\r\n if a[x]<=b[y]:c+=1;x+=1;y+=1\r\n else: x+=1\r\nprint(c)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nbuy=0;k=0\r\nfor i in range(n):\r\n if k==m:\r\n break\r\n if a[k]>=c[i]:\r\n k+=1;buy+=1\r\nprint(buy)", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni, ans = 0, 0\r\nfor ci in c:\r\n if i == m: break\r\n if b[i] >= ci:\r\n ans += 1\r\n i += 1\r\nprint(ans)", "n, m = map(int,input().split())\r\ngames = list(map(int,input().split()))\r\nmoney = list(map(int,input().split()))\r\ncurrent = 0\r\ni = 0\r\ns = 0\r\nwhile i != len(games):\r\n if games[i] <= money[current]:\r\n s += 1\r\n current += 1\r\n if current == len(money):\r\n break\r\n i += 1\r\nprint(s)", "n, m = map(int, input().split())\n\nc = list(map(int, input().split()))\n\na = list(map(int, input().split()))\n\ntotal = 0\napos = 0\n\nfor cost in c:\n if apos < m:\n if a[apos] < cost:\n pass\n else:\n total += 1\n apos += 1\n \nprint(total)\n", "n, m = map(int, input().split())\r\na = [int(c) for c in input().split()]\r\nb = [int(c) for c in input().split()]\r\nres = 0\r\nfor i in a:\r\n if res<len(b) and b[res]>=i:\r\n res+=1\r\nprint(res)", "n, m = list(int(x) for x in input().split(' '))\na = list(int(x) for x in input().split(' '))\nc = list(int(x) for x in input().split(' '))\ncc = []\nans = 0\n\np = len(c)\nq = len(a)\n\nk = m = n = 0\n\nfor i in range(m, p):\n for j in range(n, q):\n if c[i] >= a[j]:\n m = i + 1\n n = j + 1\n ans = ans + 1\n k = k + 1\n break\n if k == 0:\n break\n k = 0\n\nprint(ans)", "nm = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ngames = 0\r\nfor i in range(nm[0]):\r\n\tif len(a) > 0:\r\n\t\tif c[i] <= a[0]:\r\n\t\t\tgames += 1\r\n\t\t\ta.pop(0)\r\n\telse:\r\n\t\tbreak\r\nprint(games)", "games,bills = map(int,input().split())\r\ng = list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ntotal = 0\r\ni=0\r\nj=0\r\n\r\nwhile(i < games and j < bills):\r\n if g[i] <= b[j]:\r\n total+=1\r\n i+=1\r\n j+=1\r\n elif g[i] > b[j]:\r\n i+=1\r\nprint(total)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nk=0\r\nwhile len(a)!=0 and len(b)!=0:\r\n if a[0]<=b[0]:\r\n k+=1\r\n del(b[0])\r\n del(a[0])\r\nprint(k)", "from collections import deque\r\n\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nc = deque(c)\r\na = deque(a)\r\nans = 0\r\nwhile a and c:\r\n if a[0] >= c[0]:\r\n a.popleft()\r\n c.popleft()\r\n ans += 1\r\n else:\r\n c.popleft()\r\nprint(ans)\r\n ", "[n,m] = [int(i) for i in input().split()]\r\n\r\ncosts = [int(i) for i in input().split()]\r\nbills = [int(i) for i in input().split()]\r\n\r\nstart = 0\r\nout = 0\r\nfor i in range(n):\r\n if start < m:\r\n if costs[i] <= bills[start]:\r\n out += 1\r\n start += 1\r\n else:\r\n break\r\n\r\nprint(out)\r\n", "\r\ndone = False\r\n\r\ndef solve(c, a):\r\n ans = 0\r\n tempJ = -1\r\n for i in a:\r\n done = False\r\n j = tempJ + 1\r\n while j < len(c):\r\n if i >= c[j]:\r\n ans += 1\r\n done = True\r\n tempJ = j\r\n break\r\n j += 1\r\n if done == False:\r\n break\r\n\r\n return ans;\r\n#end function\r\n\r\n# Main\r\ndef main():\r\n n, m = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n\r\n print(solve(c, a))\r\n \r\n#end main\r\n\r\n#Program Start\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input()\r\nI = lambda:[*map(int,input().split())]\r\na,b = I(),I()\r\nprint(sum(1 for x in a if len(b)>0 and b[0]>=x and b.pop(0)))\r\n", "n, m = map(int, input().split(' '))\r\nc = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\ncnt = 0\r\nfor i in range(0, n):\r\n if (c[i] <= a[cnt]):\r\n cnt += 1\r\n if (cnt == m):\r\n break\r\nprint(cnt)", "n , m = [int(x) for x in input().split()]\r\nlst1 = [int(x) for x in input().split()]\r\nlst2 = [int(x) for x in input().split()]\r\nx=0\r\ny=0\r\ns=0\r\nwhile x!=n and y!=m:\r\n #print(x,m)\r\n if lst1[x]<=lst2[y]:\r\n s+=1\r\n y+=1\r\n x+=1\r\n elif lst1[x]>lst2[y]:\r\n x+=1\r\nprint(s)\r\n \r\n", "input().split()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ncount=0\r\ni=0\r\nj=0\r\nwhile i<len(a) and j<len(b):\r\n if b[j]>=a[i]:\r\n count+=1\r\n j+=1\r\n i+=1\r\n elif b[j]<a[i]:\r\n i+=1\r\nprint(count)\r\n", "def Jueguitos(games,bills):\n cont = 0\n for g in range(len(games)):\n if len(bills)!= 0:\n if bills[0] >= games[g]:\n cont+=1\n bills.pop(0)\n return cont\n\n\nn, m = [int(x) for x in input().split()]\ngamesNumbers = input()\nbillNumbers = input()\ngames = [int(i) for i in gamesNumbers.split(' ')]\nbills = [int(i) for i in billNumbers.split(' ')]\n\nprint(Jueguitos(games,bills)) \n\n\n\n\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\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nj = 0\r\nans = 0\r\nwhile i < n and j < m:\r\n if c[i] <= a[j]:\r\n j += 1\r\n ans += 1\r\n i += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\nc=[int(_) for _ in input().split()]\r\na=[int(_) for _ in input().split()]\r\nj=0\r\nfor v in c:\r\n if j<m and v<=a[j]:\r\n j+=1\r\nprint(j)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\ntmp=input().split()\r\ncost=[ int(tmp[i]) for i in range(n) ]\r\ntmp=input().split()\r\nbills=[ int(tmp[i]) for i in range(m) ]\r\n\r\nans=0\r\nj=0\r\n\r\nfor i in cost:\r\n if(j==m):\r\n break\r\n if(i<=bills[j]):\r\n ans+=1\r\n j+=1\r\n \r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ny = 0\r\nfor i in range(n):\r\n if m != 0:\r\n if b[0] >= a[i]:\r\n m -= 1\r\n y += 1\r\n b.remove(b[0])\r\nprint(y)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tif c<m and b[c]>=a[i]:\r\n\t\tc+=1\r\nprint(c)", "nbGames, nbBills=map(int, input(\"\").split(\" \"))\r\ngames = input(\"\").split(\" \")\r\nbills = input(\"\").split(\" \")\r\nbillToSpend = 0\r\ngamesBought = 0\r\nfor loop in range(nbGames):\r\n if (int(bills[billToSpend])>=int(games[loop])) and billToSpend<(nbBills-1):\r\n billToSpend+=1\r\n gamesBought+=1\r\n elif (int(bills[billToSpend])>=int(games[loop])):\r\n gamesBought+=1\r\n bills[billToSpend]=-1\r\nprint(gamesBought)", "n,m=map(int,input().split())\r\ngame=list(map(int,input().split()))\r\ncash=list(map(int,input().split()))\r\ng,c=0,0\r\ntotal=0\r\nwhile c<m and g<n:\r\n if game[g]<=cash[c]:\r\n total+=1\r\n c+=1\r\n g+=1\r\n else:\r\n g+=1\r\nprint(total)", "i=lambda:map(int,input().split())\nn,m=i()\na,b=i(),[*i()]\nk=0\nfor x in a:\n k=k+(x<=b[k])\n if k==m:break\nprint(k)\n \t \t\t\t\t \t \t \t \t \t \t\t\t \t", "n, m = list(map(int, input().split()))\r\ncosts = list(map(int, input().split()))\r\nmoney = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(n):\r\n if (len(money)!=0 and (costs[i] <= money[0])):\r\n counter += 1\r\n money.pop(0)\r\nprint(counter)", "n,m = map(int, input().split())\nli = list(map(int, input().split()))\nli2 = list(map(int, input().split()))\nc = 0\nfor i in li:\n c += (c < len(li2) and li2[c] >= i)\nprint(c)\n \t\t \t \t\t\t\t\t \t \t \t\t\t \t\t\t \t", "# -*- coding: utf-8 -*-\r\nm,n = map(int, input().split(\" \"))\r\ncosts = list(map(int, input().split(\" \")))\r\nmoney = list(map(int, input().split(\" \")))\r\nbought = 0\r\ncurr_game = 0\r\nwhile curr_game < m and bought < n :\r\n if costs[curr_game] <= money[bought]:\r\n curr_game += 1\r\n bought += 1\r\n else :\r\n curr_game +=1\r\nprint(bought)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nr = 0\r\nfor i in a:\r\n\tr += (r < len(b) and b[r] >= i)\r\nprint(r)", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\ncount = 0\r\nj = 0\r\nfor i in range(n):\r\n if c[j]>=a[i]:\r\n count += 1\r\n j += 1\r\n if j == m:\r\n break\r\nprint(count)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split())) \r\ni,j=0,0\r\nwhile i<n and j<m:\r\n\tif a[i]<=b[j]:\r\n\t\ti=i+1\r\n\t\tj=j+1\r\n\telse:\r\n\t\ti=i+1\r\nprint(j)", "a,b=map(int,input().split())\r\ngames=[int(x) for x in (input().split())]\r\nmoney=[int(x) for x in (input().split())]\r\nans=i=p=0\r\nwhile((i<a) and (p<b)):\r\n if money[p]>= games[i]:\r\n ans+=1\r\n p+=1\r\n i+=1\r\nprint(ans)\r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n\tif(len(p)==0):\r\n\t\tbreak\r\n\tif(p[0]>=i):\r\n\t\tc+=1\r\n\t\tp.remove(p[0])\r\nprint(c)", "n,m=[int(x) for x in input().split()]\r\nc=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nposc,posa=0,0\r\nwhile posc<len(c) and posa<len(a):\r\n if c[posc]<=a[posa]:\r\n posa+=1 \r\n posc+=1 \r\nprint(posa)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\ni, j = 0, 0\r\nwhile i < m and j < n:\r\n if a[i] >= c[j]:\r\n ans += 1\r\n i += 1\r\n j += 1\r\nprint(ans)\r\n", "\r\nn, m = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ngames = 0\r\nfor price in c:\r\n if len(a) > 0:\r\n if a[0] >= price:\r\n games += 1\r\n a.pop(0)\r\n else:\r\n if price == 0:\r\n games += 1\r\nprint(games)", "n,m = map(int, input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nj = 0\r\nans = 0\r\nfor i in range(0,m):\r\n\twhile j < n and c[j] > a[i]:\r\n\t\tj = j+1\r\n\tif j < n and c[j] <= a[i]:\r\n\t\tans = ans + 1\r\n\t\tj = j+1\r\nprint(ans)", "n, m = map(int, input().split())\nC = list(map(int, input().split()))\nA = list(map(int, input().split()))\nA.reverse()\nC.reverse()\nans = 0\nwhile A and C:\n if A[-1] >= C[-1]:\n ans += 1\n C.pop()\n A.pop()\n else:\n C.pop()\nprint(ans)\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nlast_game = 0\r\nlast_money = 0\r\nanswer = 0\r\nwhile last_game != n:\r\n if last_money == m:\r\n break\r\n if b[last_money] >= c[last_game]:\r\n last_game += 1\r\n last_money += 1\r\n answer += 1\r\n elif b[last_money] < c[last_game]:\r\n last_game += 1\r\nprint(answer)", "R=lambda:map(int,input().split())\nR()\nc,a=R(),R()\nr=0\nfor x in a:r+=next((1 for y in c if y<=x),0)\nprint(r)\n\n\n\n# Made By Mostafa_Khaled", "n,m = map(int, input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\ni,j,res = 0,0,0\r\nwhile i<n and j<m:\r\n\tif a[i]<=b[j]:\r\n\t\tj+=1\r\n\t\ti+=1\r\n\t\tres+=1\r\n\telse:\r\n\t\ti+=1\r\nprint(res)", "n, m = map(int, input().split(' '))\r\n\r\nprices = list(map(int, input().split(' ')))\r\n\r\nmoney = list(map(int, input().split(' ')))\r\n\r\ni = 0\r\nj = 0\r\nans = 0\r\nwhile i < n and j < m:\r\n if money[j] >= prices[i]:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n else:\r\n i += 1\r\nprint(ans) ", "\"\"\"\r\ninstagram : essipoortahmasb\r\ntelegram channel : essi_python\r\n\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nl1 = [*map(int,input().split())]\r\nl2 = [*map(int,input().split())]\r\nc = 0\r\nind1 = ind2 = 0\r\nwhile ind1!=n and ind2!=m:\r\n if l2[ind2] >= l1[ind1]:\r\n c+=1\r\n ind1+=1\r\n ind2+=1\r\n else:\r\n ind1+=1\r\nprint(c)\r\n\"\"\"\r\n5 4\r\n2 4 5 2 4\r\n5 3 4 6\r\n\"\"\"", "n,m=map(int,input().split())\r\nc=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(len(c)):\r\n if len(a)==0:\r\n print(m)\r\n exit(0)\r\n if c[i]<=a[0]:\r\n count+=1\r\n a.remove(a[0])\r\nprint(count)\r\n ", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=0;cnt=0\r\nwhile(a!=[] and i!=len(c)):\r\n if(a[0]>=c[i]):\r\n cnt=cnt+1\r\n a.remove(a[0])\r\n i=i+1\r\n else:\r\n i=i+1\r\nprint(cnt)", "n,m = map(int,input().split())\r\nc= list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in c:\r\n count+=(count<len(a) and a[count]>=i)\r\nprint(count)", "n,m=(int(i) for i in input().split())\r\nc=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\ni=0\r\nj=0\r\nwhile(i<m and j<n):\r\n if(a[i]>=c[j]):\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i)", "n,m = map(int, input().split())\n\nc = list(map(int,input().split()))\na = list(map(int,input().split()))\n\nr = 0\nw = 0\n\nfor i in range(n):\n if w >= len(a):\n break\n if c[i] <= a[w]:\n w += 1\n r += 1\n\nprint(r)\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ni = j = ans = 0\r\n\r\nwhile i < n and j < m:\r\n if a[j] >= c[i]:\r\n ans += 1\r\n j += 1\r\n i += 1\r\n\r\nprint(ans)\r\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 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\nb > a\r\ngcd(b,a) == 1\r\n\r\nn = 1000\r\nb => (2,n+1)\r\n a = n-b\r\n if gcd(a,b) == 1:\r\n cnt += 1\r\nprint(cnt)\r\n\r\n6\r\n1 5\r\n2 4 x\r\n\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x x x x\r\nx x ! x x\r\nx x x x x\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\ndirections = [[-1,-1],[-1,1],[1,-1],[1,1]]\r\n\r\ndef isCross(i,j,grid):\r\n for di, dj in directions:\r\n if grid[i+di][j+dj] != 'X':\r\n return False\r\n return True\r\n\r\n'''\r\nPossible annoyance with discard 2 being better than discard 3\r\n\r\nHave to try every possible pair of 3 and then possible pair of 2\r\n'''\r\ndef solve():\r\n n,m = MII()\r\n c = LII()\r\n a = LII()[::-1]\r\n\r\n ans = 0\r\n for i in range(n):\r\n if a:\r\n if c[i] <= a[-1]:\r\n a.pop()\r\n ans += 1\r\n else:\r\n break\r\n print(ans)\r\n\r\nsolve() ", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\na, b = list(map(int, stdin.readline().split())), list(map(int, stdin.readline().split()))\r\ncur = 0\r\nans = 0\r\n\r\nfor i in range(m):\r\n if cur == n:\r\n break\r\n \r\n while cur < n and a[cur] > b[i]:\r\n cur += 1\r\n \r\n if cur < n:\r\n ans += 1\r\n cur += 1\r\n\r\nstdout.write(str(ans))", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\nc = list(map(int, input().rstrip().split()))\r\na = list(map(int, input().rstrip().split()))\r\ncount = 0\r\nwhile(len(a) > 0) and (len(c) > 0):\r\n\tif(a[0] >= c[0]):\r\n\t\tdel a[0]\r\n\t\tdel c[0]\r\n\t\tcount = count + 1\r\n\telse:\r\n\t\tdel c[0]\r\nprint(count)", "n, m = map(int, input().split())\r\n\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if ans < m and a[ans] >= c[i]:\r\n ans += 1\r\nprint(ans)\r\n", "# LUOGU_RID: 101777648\n(n, m), c, a = [[*map(int, s.split())] for s in open(0)]\r\na += 0,\r\np = 0\r\nfor x in c:\r\n if x <= a[p]:\r\n p += 1\r\nprint(p)", "a = list(input().split(' '))\r\nn, m = int(a[0]), int(a[1])\r\nc = list(input().split(' '))\r\nc = list(int(x) for x in c)\r\na = list(input().split(' '))\r\na = list(int(x) for x in a)\r\nans = 0\r\nfor i in range(n):\r\n if ans == m:\r\n break\r\n if a[ans] >= c[i]:\r\n ans += 1\r\nprint(ans) \r\n", "input()\r\ncs = map(int, input().split())\r\nvs = list(map(int, input().split()))\r\nvi = 0\r\nres = 0\r\nfor c in cs:\r\n if c <= vs[vi]:\r\n res += 1\r\n vi += 1\r\n if vi >= len(vs):\r\n break\r\nprint(res)\r\n", "def do():\r\n n, k = map(int, input().split())\r\n datn = list(map(int, input().split()))\r\n datm = list(map(int, input().split()))\r\n cur = 0\r\n res = 0\r\n for i in range(n):\r\n if datn[i] <= datm[cur]:\r\n res += 1\r\n cur += 1\r\n if cur >= k:\r\n break\r\n print(res)\r\n\r\n\r\ndo()\r\n\r\ndef resolve():\r\n #input = sys.stdin.readline\r\n from pprint import pprint\r\n #import sys\r\n #sys.setrecursionlimit(100000)\r\n\r\n\r\n q = int(input())\r\n for _ in range(q):\r\n s = input()\r\n n = int(input())\r\n n, k = map(int, input().split())\r\n dat = list(map(int, input().split()))\r\n\r\n\r\n dat = [1, 2, 3]\r\n print(\" \".join(list(map(str, res))))\r\n\r\n pass\r\n import math\r\n math.ceil(1.2)\r\n math.floor(1.2)\r\n round(1.2, 3)\r\n\r\n", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\ntotal = 0\r\n\r\nwhile a and c:\r\n if a[0]>=c[0]:\r\n total += 1\r\n a.pop(0)\r\n c.pop(0)\r\n else:\r\n c.pop(0)\r\nprint(total)", "n, m = map(int, input().split())\r\n\r\nc = list(map(int, input().split()))\r\n\r\na = list(map(int, input().split()))\r\n\r\ni, j, k = 0, 0, 0\r\n\r\nwhile i < n and j < m:\r\n\tif c[i] <= a[j]:\r\n\t\tj, k = j + 1, k + 1\r\n\r\n\ti += 1\r\n\r\nprint(k)\r\n", "n,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli1=list(map(int,input().split()))\r\nj=0\r\ncount=0\r\ni=0\r\n\r\nwhile j<len(li) and i<len(li1):\r\n if li[j]<=li1[i]:\r\n count+=1\r\n j+=1\r\n i+=1\r\n else:\r\n j+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nci=list(map(int,input().split()))\r\nai=list(map(int,input().split()))\r\ntoys=0\r\nj=0\r\nfor i in range(n):\r\n if j>m-1:\r\n break\r\n if ci[i]<=ai[j]:\r\n toys+=1\r\n j+=1\r\n\r\n\r\nprint(toys)", "# A. Game Shopping\n\nn, m = map(int, input().split())\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nans = 0\ni = 0\nfor bill in a:\n try:\n i += next(ind for ind, el in enumerate(c[i:]) if el <= bill) + 1\n ans += 1\n except StopIteration:\n break\n\nprint(ans)\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nc=0\r\nx=0\r\nfor i in range(n):\r\n if(d[x]>=l[i]):\r\n c=c+1\r\n x=x+1\r\n if(x>=m):\r\n break\r\nprint(c)\r\n", "# (n, k) = list(map(int, input().split()))\r\n# s = list(map(int, input().split()))\r\n\r\n\r\n(n, k) = list(map(int, input().split()))\r\nc = list(map(int, input().split())) \r\nm = list(map(int, input().split())) \r\n\r\nresult = 0\r\nfor cc in c:\r\n if len(m) == 0:\r\n break\r\n if m[0] >= cc:\r\n result += 1\r\n m = m[1:]\r\nprint(result)", "def solve():\r\n # Read input\r\n n, m = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n # pos will give us the number of games Maxim will buy.\r\n pos = 0\r\n # iterate through available games\r\n for i in range(n):\r\n # if cost of game i is less than or equal to value of present bill in his wallet\r\n if c[i] <= a[pos]:\r\n pos += 1\r\n if pos == m: # break loop if wallet is empty\r\n break\r\n print(pos)\r\n\r\nsolve()", "n,m = map(int,input().split())\r\n\r\ns = [int(i) for i in input().split()]\r\nd = [int(i) for i in input().split()]\r\n\r\ni , t = 0,0\r\n\r\nwhile len(d)>i and len(s)>t :\r\n\tif d[i]>=s[t]:\r\n\t\ti+=1\r\n\t\tt+=1\r\n\telse:\r\n\t\tt+=1\r\n\r\n\r\nprint(i)", "# cf 1009 A 800\nn, m = map(int, input().split())\nC = [*map(int, input().split())]\nA = [*map(int, input().split())]\n\nap = 0\ncp = 0\ncc = 0\nwhile cp < len(C) and ap < len(A):\n if A[ap] >= C[cp]:\n ap += 1\n cc += 1\n cp += 1\nprint(cc)\n\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=0\r\nj=0\r\np=0\r\nwhile(i<len(a) and j<len(c)):\r\n if a[i]>=c[j]:\r\n j+=1\r\n i+=1\r\n p+=1\r\n else:\r\n j+=1\r\nprint(p)", "count = input();\ngames = input().split();\ncoins = input().split();\ncounter = 0;\ni = 0\nj = 0\nwhile(i < len(coins) and j < len(games)):\n\tif(int(coins[i]) >= int(games[j])):\n\t\ti += 1\n\t\tj += 1\n\t\tcounter += 1\n\telse:\n\t\tj += 1\n\t\t\nprint(counter)\n", "no_of_games, no_of_bills = map(int, input().split())\n\ngames = list(map(int, input().split()))\nbills = list(map(int, input().split()))\n\ngame, bill, buy = 0, 0, 0\n\nfor g in games :\n if bill < no_of_bills and bills[bill] >= g :\n bill += 1\n buy += 1\n\nprint(buy)\n\n", "\r\nn,m = map(int, input().split())\r\nln = list(map(int, input().split()))\r\nlm = list(map(int, input().split()))\r\nn1 = 0\r\np = 0\r\nfor i in range(m):\r\n\tfor j in range(p,n):\r\n\t\tif lm[i] >= ln[j]:\r\n\t\t\tp = j + 1\r\n\t\t\tn1 += 1\r\n\t\t\tbreak\r\n\t\tif j == n - 1:\r\n\t\t\tprint(n1)\r\n\t\t\texit()\r\n\r\nprint(n1)\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nj=0\r\ncount=0\r\nfor i in range(n):\r\n if(j>=m):\r\n break\r\n if(a[j]>=c[i]):\r\n count+=1\r\n j+=1\r\n \r\nprint(count)", "n,m = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nq = 0\n\nfor i in range(len(a)):\n if q != len(b) and a[i] <= b[q]:\n q = q + 1\nprint(q)\n ", "zzzzz = input()\r\ngames = list(map(int, input().split()))\r\ncash = list(map(int, input().split()))\r\nneed = 0\r\ng_c = 0\r\nc_c = 0\r\nwhile g_c < len(games) and len(cash) > 0:\r\n if cash[c_c] >= games[g_c]:\r\n cash.remove(cash[0])\r\n g_c += 1\r\n need += 1\r\n else:\r\n g_c += 1\r\nprint(need)\r\n", "from collections import deque\nn, m = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nB = deque(B)\ncnt = 0\nfor i in range(n):\n if B[0] >= A[i]:\n cnt += 1\n B.popleft()\n if cnt == min(n, m):\n print(cnt)\n exit(0)\nprint(cnt)", "g,b=map(int,input().split())\r\n#g is for games\r\n#b is for bills\r\nci=[int(x) for x in input().split()]\r\nai=[int(x) for x in input().split()]\r\npos=0\r\nfor i in ci:\r\n #pos ensures that we are not going out of range when it comes to bills\r\n #and if our bill\r\n pos+=(pos<len(ai) and ai[pos]>=i)\r\nprint(pos)\r\n \r\n", "n, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nc = 0\r\nfor i in range(n):\r\n if len(a) == 0:\r\n break\r\n if a[0] >= w[i]:\r\n a.pop(0)\r\n c += 1\r\n\r\n\r\nprint(c)", "n, m = [int(i) for i in input().split()]\r\nig= [int(i) for i in input().split()]\r\nk= [int(i) for i in input().split()]\r\nt=0\r\nj, r=0,0\r\nwhile r<m and j<n:\r\n if k[r]>=ig[j]:\r\n r+=1\r\n j+=1\r\n t+=1\r\n else:\r\n j+=1\r\nprint(t) ", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nl, r = 0, 0\r\nres = 0\r\nwhile l <= n - 1 and r <= m - 1:\r\n if a[r] >= c[l]:\r\n l += 1\r\n r += 1\r\n res += 1\r\n else:\r\n l += 1\r\n \r\nprint(res)\r\n ", "games, bills = map(int,input().split())\r\ncost = list(map(int,input().split()))\r\nvalue = list(map(int,input().split()))\r\nidx = 0 \r\nans = 0\r\nfor x in cost:\r\n if ans < bills and value[idx] >= x:\r\n ans += 1\r\n idx += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\na= list(map(int, input().split()))[:n]\r\nb=list(map(int, input().split()))[:m]\r\nres=0\r\nfor i in a:\r\n\tres+=(res<len(b) and b[res]>=i)\r\nprint(res)", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ni = 0\r\nj = 0\r\nwhile i<n and j<m:\r\n if a[j]>=c[i]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\nprint(j)", "\r\ngame_num,bill_num=map(int,(input().split()))\r\ngame=list(map(int,input().split()))\r\nbill=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in range(0,game_num):\r\n if bill[0]>=game[0]:\r\n game.pop(0)\r\n bill.pop(0)\r\n count=count+1\r\n if len(bill)==0:\r\n break\r\n else:\r\n game.pop(0)\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=0\r\nfor i in range(n):\r\n if(c[i]<=a[0]):\r\n b+=1\r\n a.remove(a[0])\r\n if(len(a)==0):\r\n break\r\nprint(b)", "n,m=map(int,input().split())\r\n\r\nx=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\n\r\ni,j = 0,0\r\ncount=0\r\nwhile i<len(x) and j<len(k):\r\n if k[j]>=x[i]:\r\n count+=1\r\n j+=1\r\n i+=1\r\n else:\r\n i+=1\r\nprint(count)", "n,m=map(int,input().split())\r\ncog=list(map(int,input().split()))\r\nbill=list(map(int,input().split()))\r\nbuy=0\r\nfor i in range(n):\r\n\tflag=0\r\n\tif len(bill) == 0 or len(cog) == 0:\r\n\t\tbreak\r\n\tfor j in range(len(cog)):\r\n\t\tif bill[0] >= cog[0]:\r\n\t\t\tbuy+=1\r\n\t\t\tflag=1\r\n\t\t\tbill.pop(0)\r\n\t\t\tcog.pop(j)\r\n\t\t\tbreak\r\n\t\tif flag == 0:\r\n\t\t\tcog.pop(j)\r\n\t\t\tbreak\r\nprint(buy)", "input()\ngames = [int(x) for x in input().split()]\nwallet = [int(x) for x in input().split()]\n\nnumgames = 0\nfor game in games:\n if len(wallet):\n if wallet[0] >= game:\n del wallet[0]\n numgames += 1\n else:\n break\n\nprint(numgames)\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nd = 0\r\nans = 0\r\ni = 0\r\nwhile (d<m) and (i<n):\r\n if a[d]>=c[i]:\r\n d+=1\r\n ans+=1\r\n i+=1\r\nprint(ans)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nn,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\ng=0\r\nwhile(len(c)>0):\r\n\tif(w[0]>=c[0]):\r\n\t\tc.pop(0)\r\n\t\tw.pop(0)\r\n\t\tg+=1\r\n\telif(w[0]<c[0]):\r\n\t\tc.pop(0)\r\n\tif(len(w)==0):\r\n\t\tbreak\t\r\nprint(g)\r\n\r\n\r\n", "n,m=input().split()\nn=int(n)\nm=int(m)\nlis1=input().split(' ')\nlis1=[int(i) for i in lis1]\nlis2=input().split(' ')\nlis2=[int(i) for i in lis2]\ncnt=0\nfor i in range(max(n,m)):\n if lis2[0] >= lis1[0]:\n cnt += 1\n lis1.pop(0)\n lis2.pop(0)\n if len(lis1)==0 or len(lis2)==0:\n break\n else:\n lis1.pop(0)\n if len(lis1)==0:\n break\nprint(cnt)\n\t\t \t \t \t\t\t\t\t \t\t \t\t\t \t \t\t\t\t", "if __name__ == '__main__' :\r\n n, m = map(int, input().split())\r\n c = [int(num) for num in input().split()]\r\n a = [int(num) for num in input().split()]\r\n ans = 0\r\n for i in c :\r\n for j in a :\r\n if i <= j :\r\n ans = ans+1\r\n a.remove(j)\r\n break\r\n print(ans)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nbought = 0\r\nfor game in c:\r\n\tif len(a) > 0 and a[0] >= game:\r\n\t\t# print(\"C[0] = \" + str(c[0]) + \", game = \" + str(game))\r\n\t\tbought += 1\r\n\t\ta.pop(0)\r\n\r\nprint(bought)", "import math\r\ndef main():\r\n n,m = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n i = j = co = 0\r\n while j < len(a):\r\n if i == len(c):\r\n break\r\n if a[j] >= c[i]:\r\n co += 1\r\n j += 1\r\n i += 1\r\n print(co)\r\nif __name__ == '__main__':\r\n main()\r\n", "input()\r\nc = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nres = 0\r\ni = 0\r\nj = 0\r\nwhile i < len(a) and j < len(c):\r\n if c[j] <= a[i]:\r\n res += 1\r\n i += 1\r\n j += 1\r\nprint(res)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\n\r\nj = 0\r\nfor i in range(n):\r\n if c[i] <= a[j]:\r\n j += 1\r\n if j >= m:\r\n break\r\n\r\nprint(j)", "n, m = map(int, input().split())\r\n\r\nc = tuple(map(int, input().split()))\r\na = tuple(map(int, input().split()))\r\n\r\ni = j = 0\r\nwhile i < n and j < m:\r\n if a[j] >= c[i]:\r\n j += 1\r\n i += 1\r\n\r\nprint(j)\r\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ni = j = ans = 0\r\nwhile i < len(a) and j < len(c):\r\n if a[i] >= c[j]:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni=0\r\nfor t in c:\r\n\tif i==m:\r\n\t\tbreak\r\n\tif a[i]>=t:\r\n\t\ti+=1\r\nprint(i)", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ni,j,cnt = 0,0,0\r\nwhile True:\r\n if i>n-1 or j>m-1: break\r\n if c[i]<=a[j]:\r\n cnt+=1\r\n j+=1\r\n i+=1\r\nprint(cnt)", "n,m=map(int, input().split(' '))\r\ncline=input().split(' ')\r\naline=input().split(' ')\r\nc=[int(i) for i in cline]\r\na=[int(i) for i in aline]\r\ncnt=0\r\nj=0\r\nanow=a[j]\r\nfor i in c:\r\n if i<=anow:\r\n cnt+=1\r\n j+=1\r\n if j<m:\r\n anow=a[j]\r\n else:\r\n break\r\n else:\r\n if j<m:\r\n anow=a[j]\r\n else:\r\n break\r\nprint(cnt)\r\n", "n, m = list(map(int, input().split(' ')))\r\ngames = [int(x) for x in input().split(' ')]\r\nbills = [int(x) for x in input().split(' ')]\r\ni, j, numGames = 0, 0, 0\r\nwhile i < len(games) and j < len(bills):\r\n if games[i] <= bills[j]:\r\n j += 1\r\n numGames += 1\r\n i += 1\r\nprint(numGames)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in a:\r\n l = len(c)\r\n for j in range(l):\r\n if i >= c[0]:\r\n count += 1;\r\n c.pop(0)\r\n break\r\n else:\r\n c.pop(0)\r\nprint(count)", "c, a = map(int, input().split())\n\ncost = list(map(int, input().split()))\nwallet = list(map(int, input().split()))\n\ni = 0; ans = 0\nfor j in range (len(cost)) :\n if i == len(wallet) :\n break\n if wallet[i] >= cost[j] :\n i += 1\n ans += 1\n\nprint (ans)\n\n\n\n\n\n\n\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in c:\r\n try:\r\n if i <= a[0]:\r\n ans += 1\r\n a.pop(0)\r\n except:\r\n continue \r\n\r\nprint(ans)", "N,M=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nS=list(map(int,input().split()))\r\ncount=0\r\nj=0\r\nfor i in range(N):\r\n\tif j<M:\r\n\t\tif S[j]>=L[i]:\r\n\t\t\tj+=1\r\n\t\t\tcount+=1\r\n \r\n \r\nprint(count)", "def solve(n, m, c, a):\n s = 0\n for i in c:\n if a and a[0] >= i:\n s += 1\n a.pop(0)\n return s\n \n\n\ndef main():\n n, m = list(map(int, input().split()))\n c = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, m, c, a))\n\n\nmain()\n", "n, m = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nc = c[::-1]\na = a[::-1]\ncounter = 0\nwhile len(a) != 0 and len(c) != 0:\n if a[len(a)-1] >= c[len(c)-1]:\n a.pop()\n counter += 1\n c.pop()\n\nprint(counter)\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl2.append(0)\r\ncount=0\r\nfor i in range(n):\r\n\tif l[i]<=l2[0] and count<m:\r\n\t\tcount+=1\r\n\t\tl2.pop(0)\r\nprint(count)", "n,m = input().split(\" \")\r\nc = input().split(\" \")\r\nb = input().split(\" \")\r\ncount = 0\r\nfor i in c :\r\n if b!=[] and int(i)<=int(b[0]) :\r\n count+=1\r\n del(b[0])\r\nprint(count)\r\n \r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nbuy=0\r\ni=0\r\nj=0\r\nwhile i<m and j<n:\r\n if a[i]>=c[j]:\r\n buy+=1\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(buy)\r\n", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nh=list(map(int,input().split()))\r\nj=0\r\nk=0\r\nfor i in range(n):\r\n if j==len(h):\r\n break\r\n if s[i]<=h[j]:\r\n k+=1\r\n j+=1\r\nprint(k)\r\n", "basura=input()\ngames=input().split(\" \")\nfor i in range(len(games)):\n games[i]=int(games[i])\nbills=input().split(\" \")\nfor i in range(len(bills)):\n bills[i]=int(bills[i])\ni=0\nj=0\ncount=0\nwhile j<len(games) and i<len(bills):\n if bills[i]>=games[j]: \n i+=1\n count-=-1\n j+=1\n else:\n j+=1\nprint(count)\n\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\ngame = list(map(int,input().split()))\r\nbill = list(map(int,input().split()))\r\nc = 0\r\na = 0\r\ncnt = 0\r\nwhile a<m and c<n:\r\n if game[c] <= bill[a]:\r\n c+=1\r\n a+=1\r\n cnt += 1\r\n else:\r\n c+=1\r\nprint(cnt)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nx=0\r\ny=0\r\ncount=0\r\nfor i in range(n):\r\n if x>=m:\r\n break\r\n elif c[i]<=k[x]:\r\n x+=1\r\n count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nj=0\r\nans=0\r\nfor i in c:\r\n if i<=a[j]:\r\n j+=1\r\n ans+=1\r\n if j==m:break\r\nprint(ans)", "from array import array\r\nfrom sys import stdin\r\nimport bisect\r\nfrom bisect import *\r\nimport itertools\r\nfrom itertools import *\r\n\r\ndef scan_gen():\r\n for line in stdin: yield from iter(line.split())\r\nscan = scan_gen()\r\ndef nint(): return int(next(scan))\r\ndef nintk(k): return tuple(nint() for _ in range(k))\r\ndef nfloat(): return float(next(scan))\r\ndef intar_init(size): return array('i',[0]) *size\r\ndef intar(size=None):\r\n if size == None: size = nint()\r\n arr = intar_init(size) \r\n for x in range(size): arr[x]=nint()\r\n return arr\r\n\r\n\r\ndef solve():\r\n n,m = nintk(2)\r\n C = intar(n)\r\n A = intar(m)\r\n ci=0\r\n res =0\r\n for m in A:\r\n while ci<n and C[ci] > m:\r\n ci+=1\r\n if ci ==n:\r\n break\r\n ci +=1\r\n res+=1\r\n print(res)\r\n\r\nsolve()\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\nc = [*map(int,input().split())]\r\na = [*map(int,input().split())]\r\ngames = 0\r\n\r\nfor g in c:\r\n if g<=a[0] and a!=[]:\r\n games+=1 \r\n a = a[1:]\r\n if a == []:\r\n break \r\nprint(games)", "IL = lambda: list(map(int, input().split()))\r\n\r\nn, m = IL()\r\nG = IL()\r\nB = IL()\r\nans = 0\r\ni = 0\r\n\r\nfor b in B:\r\n while i < n and G[i] > b:\r\n i += 1\r\n if i == n:\r\n break\r\n\r\n if b >= G[i]:\r\n ans += 1\r\n i += 1\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nj=0\r\nfor i in c:\r\n if j<m and i<=a[j]:\r\n j+=1 \r\nprint(j)", "import sys\r\nfrom array import array\r\n\r\n\r\ndef readline(): return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, m = map(int, readline().split())\r\nc = list(map(int, readline().split()))\r\na = list(map(int, readline().split()))\r\ni, ans = 0, 0\r\n\r\nfor bill in a:\r\n while i < n and bill < c[i]:\r\n i += 1\r\n if i < n:\r\n ans += 1\r\n i += 1\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\npos=0\r\nfor i in range(n):\r\n\tif b[pos]>=a[i]:\r\n\t\tpos+=1\r\n\tif pos==m:\r\n\t\tbreak\r\nprint(pos)\r\n\r\n", "# cook your dish here\r\nn,n1=list(map(int,input().split(' ')))\r\na=list(map(int,input().split(' ')))\r\na1=list(map(int,input().split(' ')))\r\nc=0;j=0\r\nfor i in a:\r\n if j<n1 and a1[j]>=i:\r\n c+=1;\r\n j+=1;\r\n \r\nprint(c) ", "n, m = map(int, input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nj = 0\r\nfor i in range(n):\r\n\tif ((j < m) and (c[i] <= a[j])):\r\n\t\tj+=1\r\nprint(j)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.reverse()\r\na=list(map(int,input().split()))\r\na.reverse()\r\nres=0\r\nfor i in range(n-1, -1, -1):\r\n if len(a)-1 >= 0 and c[i]<=a[len(a)-1]:\r\n a.pop()\r\n res+=1\r\nprint(res)\r\n", "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\nk=0\r\ns=0\r\nfor i in range(len(a)):\r\n if b[k]>=a[i]:\r\n k+=1\r\n s+=1\r\n if s==m:\r\n break\r\nprint(s)", "n,m=map(int, input().split())\r\ng=[int(x) for x in input().split()]\r\nb=[int(y) for y in input().split()]\r\ncnt=0\r\nindex=0\r\nfor x in g:\r\n\tif b[index]>=x:\r\n\t\tcnt+=1\r\n\t\tindex+=1\r\n\t\tif index==m: break\r\nprint(cnt)", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\ni = j = 0\nans = 0\nwhile i < n and j < m:\n if c[i] <= a[j]:\n ans += 1\n j += 1\n i += 1\nprint(ans)\n", "n, m = map(int, input().split())\r\nc = map(int, input().split())\r\na = list(map(int, input().split()))\r\nind = 0\r\nans = 0\r\nfor elem in c:\r\n if ind < len(a) and a[ind] >= elem:\r\n ans += 1\r\n ind += 1\r\nprint(ans)", "n,m = map(int,input().split())\r\nc = [int(_) for _ in input().split()]\r\na = [int(_) for _ in input().split()]\r\ng = 0\r\nfor v in c:\r\n if g<m and v<=a[g]:\r\n g+=1\r\nprint(g)\r\n", "n , m = map(int,input().split())\r\ncosts = list(map(int,input().split()))\r\nbills = list(map(int,input().split()))\r\n\r\npos = 0\r\ncnt = 0\r\nfor i in range(n):\r\n if bills[pos] >= costs[i]:\r\n pos += 1\r\n cnt +=1\r\n\r\n if pos == m :\r\n break\r\n\r\nprint(cnt)", "kol_game, kol_pap = map(int, input().split())\r\nprice_game = list(map(int, input().split()))\r\nnom_pap = list(map(int, input().split()))\r\n\r\nif min(nom_pap) < min(price_game):\r\n print(0)\r\nelse:\r\n i, s, new_j = 0, 0, 0\r\n while i < kol_game:\r\n j = new_j\r\n while j < kol_pap:\r\n if nom_pap[j] >= price_game[i]:\r\n s += 1\r\n new_j += 1\r\n j = kol_pap\r\n else:\r\n j = kol_pap\r\n i += 1\r\n print(s)", "n,m = list(map(int, input().split()))\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ni=0\nj=0\nb=0\nwhile i<n and j<m:\n\tif c[i]<=a[j]:\n\t\tb+=1\n\t\tj+=1\n\ti+=1\nprint(b)\n", "a, b = map(int, input().split())\nar = list(map(int, input().split()))\nbr = list(map(int, input().split()))\nrez = 0\nj = 0\nfor i in br:\n flag = 1\n while j != a:\n if i >= ar[j]:\n rez += 1\n flag = 0\n j += 1\n break\n j += 1\n if flag:\n break\nprint(rez)", "n,m=input().split()\r\nn,m=int(n),int(m)\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\ns=0\r\nwhile m>0 and n>0:\r\n if b[-m]>=a[-n]:\r\n s+=1\r\n m-=1\r\n n-=1\r\n else:\r\n n-=1\r\nprint(s)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nj=0\r\nc=d=0\r\n#l1=sorted(l1)\r\n#l2=sorted(l2)\r\nfor i in range(len(l1)):\r\n if (l2[j] >= l1[i]):\r\n j += 1\r\n c += 1\r\n if(j==m):\r\n break\r\n\r\nprint(c)\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\np = 0\r\nans = 0\r\nfor x in a:\r\n if p >= m:\r\n break\r\n if b[p] >= x:\r\n ans += 1\r\n p += 1\r\nprint(ans)\r\n", "R = lambda: map(int, input().split())\r\nn, m = R()\r\nC = list(R())\r\nA = list(R())\r\nans = 0\r\nj = 0\r\nfor c in C:\r\n if j < m and c <= A[j]:\r\n ans += 1\r\n j += 1\r\nprint(ans)", "n,m=[int(x) for x in input().split()]\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nm=0\r\nwhile c!=[] and a!=[]:\r\n\tif a[0]>=c[0]:\r\n\t\tm+=1\r\n\t\ta.remove(a[0])\r\n\t\tc.remove(c[0])\r\n\telse:\r\n\t\tc.remove(c[0])\r\nprint(m)", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\nfor i in c:\r\n try:\r\n if i <= a[0]:\r\n a.pop(0)\r\n except:\r\n break\r\nprint(m-len(a))", "n, m = [int(s) for s in input().split(' ')]\r\nc = [int(s) for s in input().split(' ')]\r\na = [int(s) for s in input().split(' ')]\r\npurchased = 0\r\nfor game in c:\r\n if len(a) == 0:\r\n break\r\n elif a[0] >= game:\r\n purchased += 1\r\n a = a[1:]\r\nprint(purchased)", "R=lambda:map(int,input().split())\r\nR()\r\nc,a=R(),R()\r\nr=0\r\nfor x in a:r+=next((1 for y in c if y<=x),0)\r\nprint(r)", "input()\np=[int(i) for i in input().split()]\nb=[int(i) for i in input().split()]\nans=0\nm=len(b)\n\ni=0\nfor tmp in p:\n if tmp<=b[i]:\n ans+=1\n i+=1\n if i==m:\n break;\nprint(ans)\n", "input()\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ni = 0\r\ns=0\r\nfor K in c:\r\n if i >= len(a):\r\n break\r\n if a[i]>=K:\r\n s+=1\r\n i+=1\r\nprint(s)\r\n \r\n", "_ = input()\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\n\nc.reverse()\na.reverse()\n\nans = 0\n\nwhile c and a:\n if c[-1] <= a[-1]:\n a.pop()\n ans += 1\n c.pop()\n\nprint(ans)\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.reverse()\r\nans=0\r\nfor i in c:\r\n\tif i<=a[-1]:\r\n\t\tans+=1\r\n\t\ta.pop()\r\n\tif ans==m:\r\n\t\tbreak\r\nprint(ans)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ni = j = k = 0\nwhile i < n and j < m:\n\tif a[i] <= b[j]:\n\t\tj += 1\n\t\tk += 1\n\ti += 1\nprint(k)", "x, y = map(int, input().split())\r\nc = map(int, input().split())\r\na = map(int, input().split())\r\ncounter = 0\r\nfor i in a:\r\n for j in c:\r\n if j <= i:\r\n counter += 1\r\n break\r\nprint(counter)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncnt = 0\r\ntry:\r\n\tfor i in range(n):\r\n\t\tif c[i] <= a[0]:\r\n\t\t\tcnt += 1\r\n\t\t\tdel a[0]\r\nexcept:\r\n\tpass\r\nprint(cnt)\r\n", "n, m=map(int, input().split())\r\ngames=list(map(int, input().split()))\r\nwallet=list(map(int, input().split()))\r\n\r\ncount=i=k=0\r\nwhile i<m:\r\n\tp=False\r\n\tfor j in range(k,n):\r\n\t\tif wallet[i]>=games[j]:\r\n\t\t\tcount+=1;i+=1;k=j+1\r\n\t\t\tp=True;break\r\n\tif p==False:\r\n\t\tbreak\r\n\tif k>n-1:\r\n\t\tbreak\r\nprint(count)", "n,m=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ns=tuple(a)\r\nans=0\r\nfor i in range(len(c)):\r\n if len(a)==0:\r\n print(len(s))\r\n exit()\r\n if a[0]>=c[i]:\r\n a.pop(0)\r\n ans+=1\r\nprint(ans)", "a,b = map(int,input().split())\r\nm = list(map(int,input().split()))\r\nn = list(map(int,input().split()))\r\ni,j =0,0\r\nz =0\r\nwhile j <a and i <b:\r\n\tif m[j]<= n[i]:\r\n\t\tz+=1\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telse:\r\n\t\tj+=1\r\nprint(z)\r\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nx = 0\r\nfor i in range(n):\r\n\ttry:\r\n\t\tif a[0] >= c[i]:\r\n\t\t\tx += 1\r\n\t\t\ta.pop(0)\r\n\texcept IndexError:\r\n\t\tpass\r\n\r\nprint(x)", "n,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ni,j = 0,0\r\nwhile(j!=m and i!=n):\r\n\tif a[j]>=c[i]:\r\n\t\tj+=1\r\n\t\ti+=1\r\n\telse:\r\n\t\ti+=1\r\nprint(j)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ngame = 0\r\nwallet = 0\r\ncnt = 0\r\nwhile game < n and wallet < m:\r\n\r\n if a[wallet] >= c[game]:\r\n cnt += 1\r\n game += 1\r\n wallet += 1\r\n else:\r\n game += 1\r\n\r\nprint(cnt)\r\n", "n, m = map(int, input().split())\r\ngames = list(map(int, input().split()))\r\nbills = list(map(int, input().split()))\r\nbought = 0\r\nfor i in range(n):\r\n if bought < m and bills[bought] >= games[i]:\r\n bought += 1\r\nprint(bought)\r\n", "n,m=map(int,input().split())\r\nc=[]\r\na=[]\r\nwhile len(c)!= n :\r\n c=list(map(int,input().split()))\r\nwhile len(a)!= m :\r\n a=list(map(int,input().split()))\r\n\r\nk=0\r\ni=0\r\nwhile (i<n) and (len(a)>0) :\r\n if c[i]<=a[0] :\r\n k+=1\r\n del (a[0])\r\n i+=1\r\nprint(k)\r\n", "no = input()\r\ngame = input().split()\r\nbill = input().split()\r\nfor i in range(len(game)):\r\n\tgame[i] = int(game[i])\r\nfor i in range(len(bill)):\r\n\tbill[i] = int(bill[i])\r\nresult = 0\r\nj = 0\r\ni = 0\r\nwhile True:\r\n\tif i>=len(game) or j>=len(bill) : break\r\n\tif game[i] <= bill[j]:\r\n\t\ti+=1\r\n\t\tj+=1\r\n\t\tresult+=1\r\n\telse:\r\n\t\ti+=1\r\nprint(result)", "n, m = map(int, input().split())\r\ncost = list(map(int, input().split()))\r\nwallet = list(map(int, input().split()))\r\ncount = 0\r\nlength = list([len(cost), len(wallet)])\r\nlength.sort()\r\nfor i in range(length[1]):\r\n try:\r\n if wallet[0] >= cost[0]:\r\n count += 1\r\n wallet.pop(0)\r\n cost.pop(0)\r\n continue\r\n else:\r\n cost.pop(0)\r\n except IndexError:\r\n print(count)\r\n exit()\r\nprint(count)\r\n", "n, m = map(int, input().split(' '))\r\nc = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\ni = 0\r\nfor j in range(n):\r\n if i < m and a[i] >= c[j]:\r\n i += 1\r\n\r\nprint(i)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nif n>m:\r\n i=0\r\n j=0\r\n while i<n and j<m:\r\n if a[i]<=b[j]:\r\n c=c+1\r\n j=j+1\r\n i=i+1\r\nelse:\r\n i=0\r\n j=0\r\n while i<n and j<m:\r\n if a[i]<=b[j]:\r\n c=c+1\r\n j=j+1\r\n i=i+1\r\nprint(c)", "'''input\n6 4\n4 8 15 16 23 42\n1000 1000 1000 1000\n'''\nn, m = map(int, input().split())\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\ng = 0\ni, j = 0, 0\nwhile i < n and j < m:\n\tif a[j] >= c[i]:\n\t\tg += 1\n\t\ti += 1\n\t\tj += 1\n\telse:\n\t\ti += 1\nprint(g)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\np=0\r\nfor i in range(n):\r\n if len(a)==0:\r\n break\r\n else:\r\n if c[i]<=a[0]:\r\n p=p+1\r\n a.remove(a[0])\r\nprint(p)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans, st = 0, 0\r\nfor i in range(n):\r\n if a[st] >= c[i]:\r\n ans += 1\r\n st += 1\r\n if st >= m:\r\n break\r\nprint(ans)", "#!/usr/bin/env python3\n#-*- encoding: utf-8 -*-\n\nimport sys\nimport bisect\nfrom collections import Counter\n\nread_int = lambda : int(sys.stdin.readline())\nread_ints = lambda : map(int,sys.stdin.readline().split())\nread_int_list = lambda : list(read_ints())\nread = lambda : sys.stdin.readline().strip()\nread_list = lambda : sys.stdin.readline().split()\n\ndef main():\n n,m = read_ints()\n c = read_int_list()\n a = read_int_list()\n i,j = 0,0\n res = 0\n while i<n and j<m:\n if c[i] <= a[j]:\n res+=1\n i+=1\n j+=1\n else:\n i+=1\n print(res)\n\nmain()\n", "n, m = map(int, input().split())\r\n\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ni = totPurch = 0\r\nwhile i < n and len(a) > 0:\r\n if a[0] >= c[i]:\r\n totPurch += 1\r\n a.pop(0)\r\n i += 1\r\nprint(totPurch)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\ni,j,c=0,0,0\r\nwhile(i<n and j<m):\r\n if(p[j]>=l[i]):\r\n c+=1\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\nprint(c) ", "[n,m] = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\ndef f(prix, portefeuille):\n if portefeuille == [] or prix == []:\n return 0\n \n elif prix[0]>portefeuille[0]:\n return f(prix[1:],portefeuille)\n \n else:\n return 1+f(prix[1:],portefeuille[1:])\n\nprint(f(c,a))\n\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\ni=0\r\nj=0\r\nc=0\r\nwhile(i<n and j<m):\r\n if l[i]<=l1[j]:\r\n c=c+1\r\n i=i+1\r\n j=j+1\r\n \r\n else:\r\n i=i+1\r\nprint(c) ", "n,m=map(int,input().split())\r\nc=[int(c) for c in input().split()]\r\na=[int(a) for a in input().split()]\r\nj=0\r\ncount=0\r\nfor i in range(n):\r\n if c[i]<=a[j]:\r\n count+=1\r\n j+=1\r\n if j==m:\r\n break\r\nprint(count)", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nm = int(string[1])\r\n\r\ncost = input().split(' ')\r\n\r\nwallet = input().split(' ')\r\n\r\ncurrentGame = 0\r\ncount = 0\r\n\r\nwhile len(wallet) > 0 and currentGame <= n-1:\r\n if int(wallet[0]) >= int(cost[currentGame]):\r\n count += 1\r\n wallet.pop(0)\r\n currentGame += 1 \r\n\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\n\r\nj=0\r\nk=0\r\nfor i in range(n):\r\n if j<m and c[i]<=a[j]:\r\n k+=1\r\n j+=1\r\n\r\nprint(k)\r\n \r\n \r\n", "n , m = map(int, input().split())\r\n\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nbill = 0\r\nans = 0\r\nfor i in range(len(c)):\r\n if bill < len(a) and c[i] <= a[bill]:\r\n ans += 1\r\n bill += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nfor i in a:\r\n if b[c]>=i:\r\n d+=1\r\n c+=1\r\n if c==len(b): break\r\nprint(d)", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nj=0\r\ncount=0\r\ni=0\r\nwhile i<a[0] and j<a[1]:\r\n if c[j]>=b[i]:\r\n j+=1\r\n count+=1\r\n i+=1\r\nprint(count)", "n,m = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli2 = list(map(int, input().split()))\r\nc = 0\r\nfor i in li:\r\n c += (c < len(li2) and li2[c] >= i)\r\nprint(c)", "n,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\ni1,i2=0,0\r\nwhile(i1!=n and i2!=m):\r\n if l1[i1]<=l2[i2]:\r\n i2+=1 \r\n i1+=1 \r\nprint(i2)", "a=[int(q) for q in input().strip().split()]\r\nb=[int(q) for q in input().strip().split()]\r\nc=[int(q) for q in input().strip().split()]\r\nct=0\r\nwhile len(b)>0 and len(c)>0:\r\n if b[0]<=c[0]:\r\n c.remove(c[0])\r\n ct+=1\r\n b.remove(b[0])\r\nprint(ct)", "import sys\ninput=sys.stdin.readline\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\nm=list(map(int,input().split()))\ni=0\nj=0\nc=0\nwhile(i<n and j<k):\n if(m[j]>=l[i]):\n i+=1\n j+=1\n c+=1\n else:\n i+=1\nprint(c)\n \n", "n,m=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\n\r\ni,j = 0,0\r\ncount=0\r\nwhile i<len(l) and j<len(k):\r\n if k[j]>=l[i]:\r\n count+=1\r\n j+=1\r\n i+=1\r\n else:\r\n i+=1\r\nprint(count)", "#!/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,m = map(int, wtf[0].split())\r\n C = map(int, wtf[1].split())\r\n A = map(int, wtf[2].split())\r\n ans = 0\r\n for a in A:\r\n f = False\r\n s = False\r\n while True:\r\n c = next(C, None)\r\n if c is None:\r\n s = True\r\n break\r\n if c <= a:\r\n f = True\r\n break\r\n if f is True:\r\n ans += 1\r\n if s is True:\r\n break\r\n print(ans)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tif len(l1)==0:\r\n\t\tbreak\r\n\tif l1[0]>=l[i]:\r\n\t\tc+=1\r\n\t\tl1.pop(0)\r\nprint(c)", "str1 = input();\r\ntp1 = str1.split();\r\nn = int(tp1[0]);\r\nm = int(tp1[1]);\r\nstr1 = input();\r\na = str1.split(\" \");\r\nstr1 = input();\r\nb = str1.split(\" \");\r\nj = 0;\r\ncnt = 0;\r\nfor i in range(n):\r\n if (j < m):\r\n if (int(b[j]) >= int(a[i])):\r\n j = j + 1;\r\n cnt = cnt + 1;\r\nprint(cnt); \r\n", "n, m = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nbought_games = 0\r\nci = 0\r\nai = 0\r\nwhile ci < len(c) and ai < len(a):\r\n if a[ai] >= c[ci]:\r\n bought_games += 1\r\n ai += 1\r\n ci += 1\r\n\r\nprint(bought_games)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\npos = 0\r\nfor i in a:\r\n\tpos += (pos < len(b) and b[pos] >= i)\r\nprint(pos)", "(n,m) = map(int, input().split())\nc = list(map(int, input().split()))\na = list(map(int, input().split()))\na_i = 0\ngames = 0\nfor (i, current_game) in enumerate(c):\n if a_i >= m:\n break\n if a[a_i] >= current_game:\n #print(\"buy {} with {}\".format(i, a[a_i]))\n games += 1\n a_i += 1\n else:\n\n continue\n #print(\"no buy {} with {}\".format(i, a_i))\nprint(games)", "n,m = list(map(int,input().split()))\r\nc = list(map(int,input().split()[:n]))\r\na = list(map(int,input().split()[:m]))\r\n\r\ncount = 0\r\nfor i in range(len(c)):\r\n\tif c[i] <= a[0]:\r\n\t\tcount+=1\r\n\t\ta.remove(a[0])\r\n\tif len(a) == 0:\r\n\t\tbreak\r\nprint(count)", "n,m = map(int , input().split(\" \"))\r\nc=list(map(int ,input().split(\" \")))\r\na=list(map(int ,input().split(\" \")))\r\ni=0\r\nj=0\r\nnombre=0\r\nwhile j<n and i<m:\r\n if a[i]>=c[j]:\r\n nombre+=1\r\n i+=1\r\n j+=1\r\n \r\n else:\r\n j+=1\r\n\r\nprint(nombre)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n\t\tif len(b)>0:\r\n\t\t\tif a[i]<=b[0]:\r\n\t\t\t\tcount+=1\r\n\t\t\t\tb.remove(b[0])\r\n\t\telif len(b)==0:\r\n\t\t\tbreak\t\t\r\nprint(count)\t\t\t\r\n", "a,b = list(map(int,input().split()))\r\nc = list(map(int,input().split()[:a]))\r\nn = list(map(int,input().split()[:b]))\r\n \r\nflag = 0\r\nfor i in range(len(c)):\r\n\tif c[i] <= n[0]:\r\n\t\tflag+=1\r\n\t\tn.remove(n[0])\r\n\t\r\n\tif flag==b:\r\n\t\tbreak\r\nprint(flag)", "a = lambda: map(int, input().split())\r\nn,m = a()\r\nl=list(a())\r\nd =list(a())\r\nc= 0\r\nj = 0\r\nfor i in l:\r\n if j < m and i <= d[j]:\r\n c += 1\r\n j += 1\r\nprint(c)", "n,m=map(int,input().split())\r\n*a,=map(int,input().split())\r\n*b,=map(int,input().split())\r\ni=j=games=0\r\nwhile i<n:\r\n try:\r\n if a[i]<=b[j]:games+=1;j+=1\r\n i+=1\r\n except:break\r\nprint(games)", "[n, m] = input().split()\r\nn = int(n)\r\ngames = input().split()\r\nmoney = input().split()\r\n\r\nanswer, i = 0, 0\r\n\r\nwhile len(money) > 0:\r\n while int(games[i]) > int(money[0]) and i < n - 1:\r\n i += 1\r\n if i == n - 1:\r\n if int(games[i]) <= int(money[0]):\r\n answer += 1\r\n break\r\n money.pop(0)\r\n answer += 1\r\n i += 1\r\n\r\nprint(answer)\r\n", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncounter = 0\r\nfor cost in c:\r\n if a == []:break\r\n if a[0] >= cost:\r\n counter += 1\r\n del (a[0])\r\nprint(counter)", "[n, m] = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nj = 0\r\nb=0\r\ni=0\r\nwhile i<n and j<m:\r\n if a[j]>=c[i]:\r\n j=j+1\r\n b=b+1\r\n i=i+1\r\nprint(b)", "inp = input().split(' ')\r\nn,m = int(inp[0]),int(inp[1])\r\nc = input().split(' ')\r\na = input().split(' ')\r\nbill = 0\r\nfor i in range(n):\r\n if bill == len(a):\r\n break\r\n if int(a[bill])>=int(c[i]):\r\n bill+=1\r\nprint(bill)", "R=lambda:map(int,input().split())\nR()\nc,a=R(),[*R()]+[0]\ni=0\nfor x in c:i+=x<=a[i]\nprint(i)", "a,b=input().split()\r\na,b=int(a),int(b)\r\nc=input().split()\r\nv=input().split()\r\nk=0\r\nfor i in range(a):\r\n if len(v)>0:\r\n if int(c[i])<=int(v[0]):\r\n k+=1\r\n v.pop(0)\r\n else:\r\n break\r\nprint(k) ", "n, m = map(int, input().split())\r\nc, a, dem = list(map(int, input().split())), list(map(int, input().split())), 0\r\nfor x in c:\r\n if dem >= m: break\r\n if a[0] >= x: dem, a = dem + 1, a[1:len(a)]\r\nprint(dem)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tif c<k and b[c]>=a[i]:\r\n\t\tc+=1\r\nprint(c)\t\t", "import functools\r\nimport time\r\n\r\ndef timer(func):\r\n @functools.wraps(func)\r\n def wrapper(*args, **kwargs):\r\n stime = time.perf_counter()\r\n res = func(*args, **kwargs)\r\n elapsed = time.perf_counter() - stime\r\n print(f\"{func.__name__} in {elapsed:.4f} secs\")\r\n return res\r\n return wrapper\r\n\r\nclass solver:\r\n # @timer\r\n def __init__(self):\r\n pass\r\n\r\n def __call__(self):\r\n n, m = map(int, input().strip().split())\r\n c = list(map(int, input().strip().split()))\r\n a = list(map(int, input().strip().split()))\r\n\r\n res = 0\r\n p = 0\r\n for ci in c:\r\n if p < m and ci <= a[p]:\r\n p += 1\r\n res += 1\r\n print(res)\r\n\r\nsolver()()", "n,m=map(int,input().split())\r\ntemp1=list(input().split())\r\ntemp2=list(input().split())\r\nfor i in range (n):\r\n temp1[i]=int(temp1[i])\r\nfor i in range (m):\r\n temp2[i]=int(temp2[i])\r\ncount=0\r\nfor q in range (n):\r\n if temp2==[]:\r\n print(count)\r\n exit()\r\n elif temp2[0]>=temp1[q]:\r\n del temp2[0]\r\n count+=1\r\nprint(count)\r\n", "l,k=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\npp=list(map(int,input().split()))\r\ny=0\r\nc=0\r\ntp=0\r\nt=len(pp)\r\nfor x in range(555555):\r\n if y<=len(pp)-1 and tp<=len(p)-1:\r\n if pp[y]>=p[tp]:\r\n y+=1\r\n tp+=1\r\n else:\r\n tp+=1\r\n else:\r\n print(y)\r\n break\r\n \r\n\r\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\nc=0\r\na=list(q())\r\nb=list(q())\r\nwhile a and b:\r\n for i in a:\r\n for j in b:\r\n if j>=i:\r\n b.remove(j)\r\n a.remove(i)\r\n else: a.remove(i)\r\n break\r\n break\r\nprint(m-len(b))", "count = input().split()\r\n\r\nn = int(count[0])\r\nm = int(count[1])\r\nx = 0\r\nj = 0\r\ngames = []\r\nbills = []\r\n\r\ngames = input().split()\r\nbills = input().split()\r\n\r\nfor i in range(n):\r\n\tc = int(games[i])\r\n\r\n\tif j < m:\r\n\t\ta = int(bills[j])\r\n\tif j == m:\r\n\t\tbreak\r\n\r\n\tif a>=c:\r\n\t\tx = x + 1\r\n\t\ti = i + 1\r\n\t\tj = j + 1\r\n\r\n\r\nprint(x)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ngames_bought = 0\r\n\r\nfor i in range(n):\r\n if a:\r\n if a[0] >= c[i]:\r\n games_bought += 1\r\n a.pop(0)\r\n\r\nprint(games_bought)" ]

[ "#!/usr/bin/env python\n'''\n' Author: Cheng-Shih Wong\n' Email: [email protected]\n' Date: 2017-08-08\n'''\n\nfrom itertools import chain\nfrom time import time\n\ndef main():\n\n BITS = [1 << sh for sh in range(24)]\n B2N = {v: u for u, v in enumerate(BITS)}\n\n def getPt():\n return tuple(map(int, input().split()))\n\n def dist(ptA, ptB):\n return sum(((u-v)**2 for u, v in zip(ptA, ptB)))\n\n def getBits(val):\n return tuple(filter(lambda x: x&val, BITS))\n\n def chooseTwo(pool):\n n = len(pool)\n for i in range(n):\n for j in range(i+1, n):\n yield (pool[i], pool[j])\n\n ori = getPt()\n pts = []\n N = int(input())\n\n for _ in range(N):\n pts.append(getPt())\n\n vis = set([0])\n mint = [0]+[1e8]*(1<<N) # minimal time for dp\n pres = [None]*(1<<N) # previous step for reconstruct path\n allb = (1 << N)-1 # all objects contained state\n B2P = {BITS[u]: v for u, v in enumerate(pts)}\n B2P[0] = ori\n alld = {u: {v: dist(B2P[u], B2P[v]) for v in B2P} for u in B2P}\n\n getDP = lambda x: mint[x]\n newDist = lambda stt, p: mint[stt] + alld[p[0]][p[1]] \\\n + alld[p[0]][0] \\\n + alld[p[1]][0] \n\n for stt in range(1<<N):\n if stt not in vis:\n continue\n\n bits = getBits(~stt&allb)\n\n sb = bits[0] if bits else None\n\n for bit in bits:\n\n newstt = stt | sb | bit\n nd = newDist(stt, (sb, bit))\n if getDP(newstt) > nd:\n mint[newstt] = nd\n pres[newstt] = sb | bit\n vis.add(newstt)\n\n print(mint[allb])\n path = ['0']\n stt = allb\n\n while stt:\n\n bits = getBits(pres[stt])\n for bit in bits:\n path.append(str(B2N[bit]+1))\n path.append('0')\n\n stt ^= pres[stt]\n\n print(' '.join(path))\n\nif __name__ == '__main__':\n import sys\n st = time()\n main()\n print('Run {:.6f} seconds.'.format(time()-st), file=sys.stderr)\n", "x,y=map(int,input().split())\r\nn=int(input())\r\nXY=[tuple(map(int,input().split())) for i in range(n)]\r\n\r\nDP=[1<<30]*(1<<n)\r\nFR=[-1]*(1<<n)\r\nDP[0]=0\r\n\r\nfor i in range(1<<n):\r\n if DP[i]==1<<30:\r\n continue\r\n for j in range(n):\r\n if i & (1<<j) == 0:\r\n nec=j\r\n break\r\n \r\n z,w=XY[nec]\r\n if DP[i|(1<<nec)]>DP[i]+((z-x)**2+(w-y)**2)*2:\r\n DP[i|(1<<nec)]=DP[i]+((z-x)**2+(w-y)**2)*2\r\n FR[i|(1<<nec)]=(nec,)\r\n\r\n for j in range(n):\r\n if j!=nec and i & (1<<j) == 0:\r\n z2,w2=XY[j]\r\n\r\n if DP[i|(1<<j)|(1<<nec)]>DP[i]+(z-x)**2+(w-y)**2+(z2-x)**2+(w2-y)**2+(z-z2)**2+(w-w2)**2:\r\n DP[i|(1<<j)|(1<<nec)]=DP[i]+(z-x)**2+(w-y)**2+(z2-x)**2+(w2-y)**2+(z-z2)**2+(w-w2)**2\r\n FR[i|(1<<j)|(1<<nec)]=nec,j\r\n\r\nprint(DP[-1])\r\nANS=[0]\r\nNOW=(1<<n)-1\r\n\r\nwhile NOW!=0:\r\n if len(FR[NOW])==1:\r\n x=FR[NOW][0]\r\n ANS.append(x+1)\r\n ANS.append(0)\r\n NOW^=1<<x\r\n else:\r\n x,y=FR[NOW]\r\n ANS.append(x+1)\r\n ANS.append(y+1)\r\n ANS.append(0)\r\n\r\n NOW^=(1<<x)^(1<<y)\r\n\r\nprint(*ANS[::-1])\r\n \r\n \r\n\r\n\r\n \r\n \r\n", "# O(n*2^n) (however quite a few states are not visited)\r\n# most important optimization is not transitioning from unvisited states\r\n# (only ~ 1% of states are visited) (transition is O(n))\r\n# other optimizations are using floats, bitwise operators, and precomputing dists/ reducing ops\r\nxs,ys = map(float,input().split())\r\n\r\nn = int(input())\r\n\r\ndist = [[0]*(n+1) for i in range(n+1)]\r\ndist2 = [[0]*(n) for i in range(n)]\r\n\r\nobjects = [list(map(float,input().split())) for i in range(n)] + [[xs,ys]] # objects[n] is handbag\r\n\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n dist[i][j] = (objects[i][0] - objects[j][0])**2 + (objects[i][1] - objects[j][1])**2\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n dist2[i][j] = dist[n][i] + dist[i][j] + dist[j][n]\r\n\r\ndp = [1e6]*(1<<n)\r\nvis = set([0]) #alot of states are not visited after optimization\r\ndp[0] = 0\r\n\r\nfor i in range((1<<n)-1):\r\n if i in vis:\r\n # reduce O(n^2) transition to O(n) via assuming 1 of the objects taken must be the\r\n # first object not yet taken in order\r\n for j in range(n):\r\n if i&(1<<j) == 0:\r\n # get 1 new object\r\n newi = i + (1 << j)\r\n dp[newi] = min(dp[newi], dp[i] + 2*dist[n][j])\r\n vis.add(newi)\r\n\r\n for k in range(j+1,n):\r\n # get 2 new objects at a time\r\n if i&(1<<k) == 0:\r\n newi |= 1<<k\r\n dp[newi] = min(dp[newi], dp[i] + dist2[j][k])\r\n vis.add(newi)\r\n newi ^= 1<<k\r\n\r\n break\r\n\r\ncurr = (1<<n) - 1\r\npath = [0]\r\nwhile curr:\r\n for i in range(n):\r\n if curr & (1<<i):\r\n # 1 object taken\r\n if dp[curr] == dp[curr - (1<<i)] + 2*dist[n][i]:\r\n path.extend([i+1,0])\r\n curr ^= (1<<i)\r\n\r\n # 2 objects taken\r\n for j in range(i+1,n):\r\n if curr & (1<<j):\r\n if dp[curr] == dp[curr - (1<<i) - (1<<j)] + dist2[i][j]:\r\n path.extend([j+1,i+1,0])\r\n curr ^= (1<<i) + (1<<j)\r\n\r\nprint(int(dp[(1<<n)-1]))\r\nprint(*path[::-1])", "################################################################################\r\nx0,y0=map(int,input().split())\r\nn=int(input())\r\nx=[0 for i in range(n)]\r\ny=[0 for i in range(n)]\r\nfor i in range(n):\r\n x[i],y[i]=map(int,input().split())\r\n\r\n# x0,y0=0,0\r\n# x=[1,-1]\r\n# y=[1,1]\r\n\r\n# x0,y0=1,1\r\n# x=[4,3,0]\r\n# y=[3,4,0]\r\n################################################################################\r\nn=len(x)\r\nx.append(x0)\r\ny.append(y0)\r\ndis=[ [0 for i in range(n+1)] for i in range(n+1) ]\r\n\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n dis[i][j] = (x[i] -x[j])**2 + (y[i] -y[j])**2\r\n\r\ndp=[ 2**31-1 for i in range(1<<n) ]\r\npre=[ -1 for i in range(1<<n) ]\r\ndp[0]=0\r\nfor i in range(1<<n):\r\n if dp[i]==2**31-1:\r\n continue\r\n for j in range(n):\r\n if (1<<j)&i==0:\r\n for k in range(j,n):\r\n if (1<<k)&i==0:\r\n temp=i|(1<<j)|(1<<k)\r\n dis_add=dis[n][j]+dis[j][k]+dis[k][n]\r\n if dp[temp]>dp[i]+dis_add:\r\n dp[temp]=dp[i]+dis_add\r\n pre[temp]=i\r\n break\r\n\r\nprint(dp[(1<<n)-1])\r\nout='0'\r\nnow=(1<<n)-1\r\nwhile pre[now]!=-1:\r\n for i in range(n):\r\n if ((1<<i)&now) and not ((1<<i)&pre[now]):\r\n out=out+' '+str(i+1)\r\n out=out+' 0'\r\n now=pre[now]\r\nprint(out)\r\n", "xs, ys = map(int, input().split())\r\nthings = [[xs, ys, 0]]\r\nn = int(input())\r\nfor i in range(n):\r\n things.append(list(map(int, input().split())) + [i + 1])\r\n\r\n\r\ndistance = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\nfor i in range(n + 1):\r\n for j in range(i, n + 1):\r\n distance[i][j] = distance[j][i] = (things[i][0] - things[j][0]) ** 2 + (things[i][1] - things[j][1]) ** 2\r\n\r\nINF = float('inf')\r\nDP = [INF for _ in range((1 << n) + 10)]\r\nPath = [None for _ in range((1 << n) + 10)]\r\nDP[0] = 0\r\n\r\nfor cur in range(1 << n):\r\n if DP[cur] == INF:\r\n continue\r\n for nxt1 in range(n):\r\n if cur & (1 << nxt1) != 0:\r\n continue\r\n \r\n if DP[cur | (1 << nxt1)] > DP[cur] + distance[0][nxt1 + 1] + distance[nxt1 + 1][0]:\r\n DP[cur | (1 << nxt1)] = DP[cur] + distance[0][nxt1 + 1] + distance[nxt1 + 1][0]\r\n Path[cur | (1 << nxt1)] = cur\r\n \r\n for nxt2 in range(n):\r\n if (cur | (1 << nxt1)) & (1 << nxt2) != 0:\r\n continue\r\n if DP[cur | (1 << nxt1) | (1 << nxt2)] > DP[cur] + distance[0][nxt1 + 1] + distance[nxt1 + 1][nxt2 + 1] + distance[nxt2 + 1][0]:\r\n DP[cur | (1 << nxt1) | (1 << nxt2)] = DP[cur] + distance[0][nxt1 + 1] + distance[nxt1 + 1][nxt2 + 1] + distance[nxt2 + 1][0]\r\n Path[cur | (1 << nxt1) | (1 << nxt2)] = cur\r\n break\r\n\r\nprint(DP[(1 << n) - 1])\r\n\r\npath = []\r\ncur = (1 << n) - 1\r\nwhile cur != 0:\r\n path.append(0)\r\n father = Path[cur]\r\n diff = cur ^ father\r\n d1 = len(bin(diff)[2:])\r\n path.append(d1)\r\n diff ^= (1 << (d1 - 1))\r\n if diff != 0:\r\n d2 = len(bin(diff)[2:])\r\n path.append(d2)\r\n cur = father\r\npath.append(0)\r\npath = list(reversed(path))\r\nprint(' '.join(map(str, path)))", "import functools\nINF=10**9\nc=functools.lru_cache(maxsize=None)\n@c\ndef p(i,j):\n q=lambda i,j: (d[i][0]-d[j][0])**2+(d[i][1]-d[j][1])**2\n if j==0:\n return 2*q(i,j),(0,i,0)\n return q(0,i)+q(i,j)+q(j,0),(0,i,j,0)\n@c\ndef u(m):\n l=len(m)\n if l==1: return 0,()\n a=(INF,())\n for i in range(1,l):\n n=m[1:]\n if i!=l-1:\n n=m[1:i]+m[i+1:]\n h,f = u(n),p(m[0],m[i])\n if h[0]+f[0]<a[0]:\n a=(h[0]+f[0],h[1]+f[1])\n return a\nw=lambda:list(map(int,input().split()))\nd=[w()]+[w() for i in range(int(input()))]\nt=tuple(range(len(d)-1,-1,-1))\ng=u(t)\nprint(g[0])\nprint(' '.join([str(i) for i in g[1]]).replace(' 0 0 ',' 0 '))\n\n\n\n" ]

[ "n , p , t = input ( ) . split ( )\n\nn = int ( n )\np = float ( p )\nt = int ( t )\n\nif n >= t :\n\n ans = 0\n \n for tt in range ( t ) :\n \n ans = p * ( ans + 1 ) + ans * ( 1 - p )\n \n print(round(ans,7))\n \n exit()\n \nN = [ 0 for i in range ( n + 1 ) ]\n\nN [ 0 ] = 1\n\nfor tt in range ( t ) :\n\n NN = [ 0 for i in range ( n + 1 ) ]\n \n NN[0] = N[0] * ( 1 - p ) \n \n for i in range ( 1 , n ) :\n \n NN[i] = N[i-1] * ( p ) + N[i] * ( 1 - p ) \n \n NN[n] = N[n-1] * p + N[n]\n \n N = NN\n \nans = 0\n\nfor i in range ( n + 1 ) :\n\n ans += i * N[i]\n \nprint(round(ans,7))\n\t \t\t\t \t\t\t \t \t \t \t \t \t\t", "n,p,t=input().split()\r\nn,t=map(int,(n,t))\r\np=float(p)\r\nq=1-p\r\nans=0\r\ndp=[[0 for i in range(n+3)] for j in range(t+3)]\r\n\r\ndp[0][0]=1\r\n\r\nfor i in range(t):\r\n for j in range(n):\r\n dp[i+1][j+1]+=dp[i][j]*p\r\n dp[i+1][j]+=dp[i][j]*q\r\n dp[i+1][n]+=dp[i][n]\r\n\r\n##for i in dp: print(i)\r\n\r\nfor i in range(n+1):\r\n ans+=i*dp[t][i]\r\nprint(ans)\r\n", "from collections import Counter\n\ndef escalator(n, p, t):\n q = 1-p\n P = [0] * (n+1)\n P[0] = 1\n Q = [None] * (n+1)\n for _ in range(t):\n Q[0] = q * P[0]\n for i in range(1, n):\n Q[i] = p * P[i-1] + q * P[i]\n Q[n] = p * P[n-1] + P[n]\n P, Q = Q, P\n return sum(i*P[i] for i in range(n+1))\n\ndef read_npt():\n sn, sp, st = input().split()\n return int(sn), float(sp), int(st)\n\n\ndef main():\n n, p, t = read_npt()\n print(escalator(n, p, t))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintl():\n return list(readinti())\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\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 = [(\"\"\"\\\n1 0.50 1\n\"\"\", \"\"\"\\\n0.5\n\"\"\"), (\"\"\"\\\n1 0.50 4\n\"\"\", \"\"\"\\\n0.9375\n\"\"\"), (\"\"\"\\\n4 0.20 2\n\"\"\", \"\"\"\\\n0.4\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", "n, p, t = [float(x) for x in input().split()]; n = int(n); t = int(t)\r\n\r\nif t <= n:\r\n print(p * t)\r\nelse:\r\n dp = [[0 for j in range(t + 1)] for i in range(n + 1)]; \r\n dp[0][0] = 1\r\n\r\n\r\n for j in range(1, t + 1):\r\n for i in range(min(j + 1, n + 1)):\r\n prev1 = 0; prev2 = 0\r\n if i - 1 >= 0 and j - 1 >= 0: prev1 = dp[i - 1][j - 1]\r\n if j - 1 >= 0: prev2 = dp[i][j - 1]\r\n\r\n if i == n:\r\n coeff_2 = 1\r\n else:\r\n coeff_2 = (1 - p)\r\n\r\n dp[i][j] = p * prev1 + coeff_2 * prev2\r\n\r\n ev = 0\r\n for i in range(n + 1):\r\n ev += (i * dp[i][t])\r\n\r\n print(ev)\r\n\r\n\r\n ", "n, p, t = map(float, input().split())\r\nn, t = int(n), int(t)\r\ndp = [[0 for i in range(t + 1)] for j in range(n + 1)]\r\nfor i in range(1, n + 1):\r\n for j in range(1, t + 1):\r\n dp[i][j] = p * (dp[i - 1][j - 1] + 1) + (1 - p) * dp[i][j - 1]\r\nprint(dp[n][t])", "n,p,t = input().strip().split()\r\nn,p,t = int(n),float(p),int(t)\r\nif t <= n: print(p*t); exit()\r\n\r\n# P[T][N]\r\n\r\nP = [[0]*(n+1) for i in range(t+1)]\r\n\r\nP[0][0] = 1\r\n\r\nfor t in range(1,t+1):\r\n for i in range(0,n+1):\r\n if i == 0: P[t][i] = P[t-1][i]*(1-p)\r\n elif i == n: P[t][n] = P[t-1][n] + P[t-1][n-1]*p\r\n else: P[t][i] = P[t-1][i]*(1-p) + P[t-1][i-1]*p\r\n\r\nprint(sum(k*P[t][k] for k in range(n+1)))", "def solve():\n a=list(input().split())\n n=eval(a[0])\n p=eval(a[1])\n t=eval(a[2])\n dp=[]\n for i in range(0,t+1):\n dp1=[]\n for j in range(0,n+1):\n dp1.append(0)\n dp.append(dp1)\n dp[0][0]=1;\n for i in range(1,t+1):\n for j in range(0,n+1):\n if(j==n):\n dp[i][j]+=dp[i-1][j];\n else:\n dp[i][j]+=dp[i-1][j]*(1-p);\n dp[i][j+1]+=dp[i-1][j]*p;\n ans=0;\n for i in range(0,n+1):\n ans+=i*dp[t][i];\n print(ans)\n\nfor _ in range(1):\n solve()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, p, t = map(float, input().split())\r\nn = int(n)\r\nt = int(t)\r\nc = 0\r\ndp = [[0]*(t+1) for i in range(t+1)]\r\ndp[0][0] = 1\r\nfor i in range(t):\r\n for j in range(t):\r\n dp[i+1][j] += dp[i][j] * p\r\n dp[i+1][j+1] += dp[i][j] * (1-p)\r\nc = 0\r\nfor i in range(t):\r\n c += dp[t][i]*min(n,(t-i))\r\nprint(c)\r\n", "import math \r\ndef round_up(n, decimals=0): \r\n multiplier = 10 ** decimals \r\n return math.ceil(n * multiplier) / multiplier\r\na = list(map(float, input().split())) \r\nn = int(a[0]) \r\nt = int(a[2]) \r\np = a[1] \r\ndp = [[float(0) for k in range(n+1)] for i in range(t+1)] \r\ndp[0][n] = 1 \r\ndp[1][n] = 1-p \r\ndp[1][n-1] = p\r\nfor i in range(t+1) : \r\n dp[i][n] = (1-p)**(i) \r\n\r\nfor j in range(n)[::-1] : \r\n for i in range(1,t+1) : \r\n dp[i][j] = (1-p)*dp[i-1][j] + p*dp[i-1][j+1] \r\nsum = float(0) \r\nfor j in range(n+1) : \r\n sum += dp[t][j]*j\r\nprint(round_up((n-sum),6))", "s = list(map(str, input().split()))\r\nn = int(s[0])\r\np = float(s[1])\r\nt = int(s[2])\r\ncombi = [[0 for _ in range(t+1)] for _ in range(t+1)]\r\ncombi[1][0] = 1 * p\r\ncombi[1][1] = 1 * (1-p)\r\n\r\nfor i in range(2, t+1):\r\n combi[i][0] = combi[i-1][0] * p\r\n for j in range(1, i+1):\r\n combi[i][j] = combi[i-1][j-1] * (1-p) + combi[i-1][j] * (p)\r\n\r\ne = 0\r\nfor i in range(t+1):\r\n v = n if (t-i) > n else (t-i)\r\n e += combi[t][i] * v\r\nprint(e)", "n,p,t=(i for i in input().split())\r\nn=int(n)\r\np=float(p)\r\nt=int(t)\r\ndp=[]\r\ndp.append(list(0 for i in range(n+1)))\r\ndp[0][0]=1\r\nfor i in range(1,t+1):\r\n list1=[]\r\n for j in range(n+1):\r\n if(not j):\r\n list1.append((1-p)*dp[i-1][j])\r\n elif j==n:\r\n list1.append(p*dp[i-1][j-1]+dp[i-1][j])\r\n else :\r\n list1.append(p*dp[i-1][j-1]+(1-p)*dp[i-1][j])\r\n dp.append(list1)\r\nans=0\r\nfor i in range(n+1):\r\n ans+=i*dp[t][i]\r\nprint(ans)", "n, p, t = input().split()\nn, p = int(n), float(p)\nf = [p] * n + [0]\nfor i in range(int(t) - 1): f = [f[k] * (1 - p) + p * (1 + f[k - 1]) for k in range(n)] + [0]\nprint(f[-2])\n\t\t\t\t \t \t \t\t \t\t\t \t \t \t\t\t\t", "n,p,t=map(float,input().split())\r\nn,t=int(n),int(t)\r\ndp=[[0 for i in range(t+1)] for j in range(t+1)]\r\ndp[0][0]=1\r\nfor i in range(1,t+1):\r\n for j in range(i+1):\r\n if j>=1:\r\n dp[i][j]=p*dp[i-1][j-1]+(1-p)*dp[i-1][j]\r\n else:\r\n dp[i][j] = (1 - p) * dp[i - 1][j]\r\n\r\n\r\n\r\ns=0\r\ns1=sum(dp[t])\r\ns2=0\r\nfor j in range(t+1):\r\n if j>n:\r\n s+=n*(s1-s2)\r\n break\r\n s+=dp[t][j]*j\r\n s2+=dp[t][j]\r\n\r\n\r\n\r\n\r\nprint(s)\r\n", "n,p,t = map(float,input().split())\nn = int(n)\nt = int(t)\n\nd = [0]*(n+1)\nd[0] = 1\n\nfor i in range(t):\n for j in range(n+1)[::-1]:\n if j==0:\n d[j] = d[j]*(1-p)\n elif j==n:\n d[j] = d[j-1]*p + d[j]\n else:\n d[j] = d[j]*(1-p)+d[j-1]*p\nans = 0\nfor i in range(n+1):\n ans += i*d[i]\nprint(ans)\n\n", "n,p,t=[float(x) for x in input().split()]\r\nn=int(n)\r\nt=int(t)\r\n\r\n#probab[x][t]=p*probab[x-1][t-1]+(1-p)*probab[x][t-1]\r\nprobab=[[0 for _ in range(t+1)] for __ in range(t+1)]\r\nprobab[0][1]=1-p\r\nprobab[1][1]=p\r\nfor tt in range(2,t+1):\r\n for xx in range(t+1):\r\n probab[xx][tt]=p*probab[xx-1][tt-1]+\\\r\n (1-p)*probab[xx][tt-1]\r\nans=0\r\nfor x in range(t+1):\r\n ans+=min(x,n)*probab[x][t]\r\nprint(ans)", "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\n#threading.stack_size(10**8)\r\n#sys.setrecursionlimit(10**6)\r\n\r\ndef ri():return int(input())\r\ndef rs():return input()\r\ndef rl():return list(map(int,input().split()))\r\ndef rls():return list(input().split())\r\n\r\ndef main():\r\n\tn,p,t=rls()\r\n\tn=int(n);p=float(p);t=int(t)\r\n\tdp=[[0 for i in range(t+1)] for i in range(n+1)]\r\n\tfor i in range(1,n+1):\r\n\t\tfor j in range(1,t+1):\r\n\t\t\tdp[i][j]=p*(dp[i-1][j-1]+1)+(1-p)*(dp[i][j-1])\r\n\tprint(dp[n][t])\r\n\tpass\r\n\t\r\nmain()\r\n#threading.Thread(target=main).start()", "n, p, t = input().split()\r\nn = int(n)\r\nt = int(t)\r\np = float(p)\r\nans = 0.0\r\ns = t\r\nif abs(1.0 - p) > 1e-6:\r\n a1 = 1.0\r\n for i in range(1, t + 1):\r\n a1 = a1 * (t - i + 1) / i if i <= t else 0\r\n a1 = a1 * p\r\n while (a1 > 1e5) and (s > i):\r\n a1 *= (1 - p)\r\n s -= 1\r\n while (s < i):\r\n a1 /= (1 - p)\r\n s += 1\r\n a2 = (1 - p) ** (s - i)\r\n #print(a1, a2, s, i)\r\n ans += a1 * a2 * min(i, n)\r\nelse:\r\n ans = min(n, t)\r\nprint(ans)", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/9/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\ndef solve(N, P, T):\n dp = [[0 for _ in range(N+1)] for _ in range(T+1)]\n p = 1\n for t in range(T+1):\n dp[t][0] = p\n p *= (1 - P)\n \n for t in range(1, T+1):\n for i in range(1, min(N, t) + 1):\n dp[t][i] += dp[t-1][i-1] * P + dp[t-1][i] * (1-P if i < N else 1)\n \n # for row in dp:\n # print(row)\n \n return sum([i * dp[T][i] for i in range(N+1)])\n \n\nline = [x for x in input().split()]\nN, P, T = int(line[0]), float(line[1]), int(line[2])\nprint(solve(N, P, T))", "n,p,t=input().split()\r\nnumber=int(n)\r\ntime=int(t)\r\np=float(p)\r\nwinpros=p\r\nlospros=1-p\r\ndp=[[0]*(2005) for _ in range(2005)]\r\ndp[0][0]=1\r\nfor i in range(time):\r\n for j in range(number+1):\r\n if j==number:\r\n dp[i+1][j]+=dp[i][j]\r\n else:\r\n dp[i+1][j]+=(lospros*dp[i][j])\r\n dp[i+1][j+1]+=(winpros*dp[i][j])\r\nans=0\r\nfor j in range(1,number+1):\r\n ans+=dp[time][j]*j\r\nprint(ans)", "n, p, t = list(map(float, input().split()))\r\nn, t = int(n), int(t)\r\ndp = [[0] * (n + 1) for __ in range(t)]\r\ndp[0][0] = 1 - p\r\ndp[0][1] = p\r\nfor i in range(1, t):\r\n dp[i][0] = dp[i - 1][0] * (1 - p)\r\n for j in range(1, n):\r\n dp[i][j] += dp[i - 1][j] * (1 - p)\r\n dp[i][j] += dp[i - 1][j - 1] * p\r\n dp[i][n] = dp[i - 1][n] + dp[i - 1][n - 1] * p\r\nans = 0\r\nfor i in range(n + 1):\r\n ans += i * dp[t - 1][i]\r\nprint(ans)", "import sys\r\nimport math\r\n# Fast input\r\ninput = sys.stdin.readline\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '\\n')\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\ndef listing():\r\n l=list(map(int,input().split()))\r\n return l\r\ndef listin():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n return n,l\r\ndef two():\r\n n,m=map(int,input().split())\r\n return n,m\r\ndef three():\r\n n,m,p=map(float,input().split())\r\n return n,m,p\r\nn,p,t=three()\r\nt=int(t)\r\nn=int(n)\r\ndp=[[0]*(n+1) for _ in range(t+1)]\r\ndp[0][0]=1\r\nfor i in range(t):\r\n for j in range(n+1):\r\n if j==n:\r\n dp[i+1][j]+=dp[i][j]\r\n continue\r\n dp[i+1][j+1]+=dp[i][j]*p\r\n dp[i+1][j]+=dp[i][j]*(1-p)\r\ns=0\r\nfor i in range(1,n+1):\r\n s+=i*dp[-1][i]\r\nprint(s)\r\n \r\n", "# #1 .5 1 (n>=t)\r\n# # 1 => .5\r\n\r\n# #1 .5 4 (n<t)\r\n# # 1 => (.5) + (.5^2) + (.5^3) + (.5^4) (n < t)\r\n\r\n# #2 .4 4\r\n# # 1 => 4*(.4)(.6)^3 \r\n# # 2 => (.4)(.4) + (.4)(.6)(.4) + (.4)(.6.)(.6)(.4) + (.6)(.4)(.4) + (.6)(.4)(.6)(.4) + (.6)(.6)(.4)(.4)\r\n# # =(.4)^2 [1 + 2(.6) + 3(.6)^2 ]\r\n\r\n# # if we had 3\r\n# # everything before is basically t * p **\r\n# # 3 => (.4)(.4)(.4) + (.4)(.4)(.6)(.4) + (.4)(.6)(.4)(.4) + (.6)(.4)(.4)(.4)\r\n# # =(.4)^3 (1+3(.6))\r\n\r\n# #2 p 5\r\n# #2 => pp + pqp + pqqp + pqqqp + qpp + qpqp + qpqqp + qqpp + qqpqp + qqqpp\r\n# # = p^2 (1 + 2q + 3qq + 4qqq)\r\n\r\n# #4 .2 2 (n>t)\r\n# #1 => (.2*(.8) + (.8*.2))\r\n# #2 => .2^2*2\r\n\r\n# #4 .2 4 (n >= t)\r\n# #1 => (.2(.8)^3)*4 \r\n# #2 => (.2^2 (.8)^2) ()\r\n\r\n# #(n >= t)\r\n# #k * (p^k) * ((1-p)^(t-k))\r\n\r\n# #(n < t)\r\n\r\n# from math import factorial as fact\r\n\r\n# def bin(n, k):\r\n# return fact(n)/(fact(k)*fact(n-k))\r\n\r\n# n,p,t = map(float, input().split())\r\n\r\n# #closed form of Sum{p^k} = p/(-1+p)*(-1+p**n)\r\n# # t-n number of spots\r\n# # 1 + (n)(1-p) + (n+1)(1-p)^2oup = 0.0\r\n# oup = 0.0\r\n# if(n>=t):\r\n# for i in range(1, int(t)+1):\r\n# oup += bin(t, i)*i*(p**i)*((1-p)**(t-i))\r\n# else:\r\n# for i in range(1, int(n)):\r\n# oup += bin(t, i)*i*(p**i)*((1-p)**(t-i)) \r\n# n_spots = t-n\r\n# quant = 1\r\n# for i in range(int(n_spots)):\r\n# quant += (n+i)*(1-p)**(i+1)\r\n# oup += p**(n)*quant*n\r\n\r\n# print(\"%.10f\"%(oup))\r\nn, p, t = map(float, input().split())\r\n\r\n\r\nmx = int(max(n,t)+1)\r\ndp = [[0 for i in range(mx+10)]for j in range(mx+10)]\r\ndp[0][0]=1\r\n#dp[0][0] = 1\r\n#dp[0][1] = dp[0][0]*(1-p)\r\n#dp[0][2] = dp[0][1]*(1-p)\r\n#dp[0][3] ...\r\n#dp[1][1] = dp[0][0]*p + dp[1][0]*(1-p)\r\n#dp[1][2] = dp[0][1]*p + dp[1][1]*(1-p)\r\n\r\n#dp[n][m] = dp[n-1][m-1]*p + dp[n][m-1]*(1-p)\r\n\r\nfor i in range(mx):\r\n for j in range(1,mx):\r\n if(i-1>=0):\r\n dp[i][j]+=dp[i-1][j-1]*p\r\n if(i>=int(n)):\r\n dp[i][j]+=dp[i][j-1]\r\n else:\r\n dp[i][j]+=dp[i][j-1]*(1-p)\r\n \r\n \r\n\r\noup = 0\r\nprev = 0\r\nfor i in range(int(n)+1):\r\n oup += (i)*dp[i][int(t)]\r\nprint(oup)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, p, t = map(float, input().split())\r\nn, t = int(n), int(t)\r\n\r\ndp = [[0] * (n + 1) for i in range(t + 1)]\r\ndp[0][0] = 1\r\nfor i in range(t):\r\n for j in range(n):\r\n dp[i + 1][j] += dp[i][j] * (1 - p)\r\n dp[i + 1][j + 1] += dp[i][j] * p\r\n dp[i + 1][n] += dp[i][n]\r\n\r\nans = 0\r\nfor i in range(n + 1):\r\n ans += i * dp[t][i]\r\n\r\nprint(ans)\r\n", "import sys\n\nsys.setrecursionlimit(4005)\n\nn, p, t = input().split()\nn = int(n)\np = float(p)\nt = int(t)\n\ndp = [[0 for y in range(0, t+1)] for x in range(0, t+1)]\n\ndef P(x, y):\n if cache[x][y] != -1: return cache[x][y]\n if y == 0: return (x==0) \n if x == 0: return pow(1-p, y)\n cache[x][y] = P(x-1, y-1)*p + P(x, y-1)*(1-p)\n return cache[x][y]\n\nfor i in range(0, t+1):\n for j in range(0, t+1):\n if j == 0: dp[i][j] = float(i == 0)\n elif i == 0: dp[i][j] = pow(1-p, j)\n else: dp[i][j] = dp[i-1][j-1]*p + dp[i][j-1]*(1-p)\n\nprint(sum([dp[i][t]*min(n, i) for i in range(0, t+1)]))\n\n", "n, p, t = input().split()\r\nn, p = int(n), float(p)\r\nf = [p] * n + [0]\r\nfor i in range(int(t) - 1): f = [f[k] * (1 - p) + p * (1 + f[k - 1]) for k in range(n)] + [0]\r\nprint(f[-2])" ]

[ "n,l,r,x = [int(x) for x in input().split()]\r\ntemp2 = sorted([int(x) for x in input().split()])\r\ndef choo(h,amount,prev,total):\r\n #print(prev)\r\n if amount == h:\r\n #print(total,prev,h)\r\n if temp2[prev[-1]] - temp2[prev[0]] >= x and total >= l and total <= r:\r\n return 1\r\n else:\r\n return 0\r\n elif amount == 0:\r\n take = 0\r\n for i in range(len(temp2)):\r\n prev.append(i)\r\n take += choo(h,amount+1,prev.copy(),total+temp2[i])\r\n prev.pop()\r\n return take\r\n else:\r\n take = 0\r\n for i in range(prev[-1]+1,n):\r\n prev.append(i)\r\n take += (choo(h,amount+1,prev.copy(),total+temp2[i]))\r\n prev.pop()\r\n return take\r\nanswer = 0\r\nfor i in range(2,n+1):\r\n answer += choo(i,0,[],0)\r\nprint(answer)", "from itertools import combinations\n\n# crear lista de listas de combinaciones de los valores en en input 2\n\ndef preparador(lista, n,l, r, x):\n\tcont = 0\n\tfor i in range(2,n+1):\n\t\tfor j in combinations(lista,i):\n\t\t\tsuma = sum(j)\n\t\t\tif(l <= suma and suma <= r and abs(j[-1]-j[0]) >= x):\n\t\t\t\tcont += 1\n\treturn cont\n\t\nn,l,r,x = input().split()\nlis2 = input().split()\nfor i in range(len(lis2)):\n\tlis2[i] = int(lis2[i])\nlis2 = sorted(lis2)\n\nprint(preparador(lis2,int(n),int(l),int(r),int(x)))\n\n", "n, l, r, x = map(int, input().split())\narr = list(map(int, input().split()))\n\nres = 0\nfor i in range(1 << n):\n total_dif = 0\n mini = float('inf')\n maxi = float('-inf')\n for j in range(n):\n total_dif += arr[j] * ((1 << j) & i != 0)\n for j in range(n):\n if ((1 << j) & i != 0):\n mini = min(mini, arr[j])\n maxi = max(maxi, arr[j])\n if l <= total_dif <= r and maxi - mini >= x:\n res += 1\n\nprint(res)\n\n\t\t\t \t\t\t \t \t \t \t \t \t", "from itertools import permutations, combinations\r\n\r\n\r\nn, l, r, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n if n == 1:\r\n print(0)\r\n return\r\n\r\n if n == 2 and l <= c[0] + c[1] <= r and abs(c[1] - c[0]) >= x:\r\n print(1)\r\n return\r\n\r\n res = []\r\n for i in range(2, len(c) + 1):\r\n p = list(combinations(c, i))\r\n\r\n for i in p:\r\n if l <= sum(i) <= r and max(i) - min(i) >= x:\r\n res.append(i)\r\n\r\n print(len(res))\r\n\r\n\r\nsolve()\r\n", "from itertools import combinations\r\n\r\nn, l, r, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(1, n + 1):\r\n for j in combinations(a, i):\r\n if l <= sum(j) <= r and max(j) - min(j) >= x:\r\n c += 1\r\nprint(c)\r\n", "from itertools import combinations\r\nn,l,r,x=map(int,input().split())\r\n*a,=map(int,input().split())\r\nprint(sum([sum([max(j)-min(j)>=x and l<=sum(j)<=r for j in combinations(a,i)])for i in range(2,n+1)]))", "n, l, r, x = [int(y) for y in input().split()]\r\nc = [int(y) for y in input().split()]\r\n\r\ndef verify(problems):\r\n return (len(problems) >= 2) and (l <= sum(problems) <= r) and (max(problems)-min(problems) >= x)\r\n \r\ndef solve(i, problems):\r\n if i == n:\r\n if len(problems) < 2:\r\n return 0\r\n return verify(problems)\r\n\r\n total = solve(i+1, problems)\r\n problems.append(c[i])\r\n total += solve(i+1, problems)\r\n problems.pop()\r\n\r\n return total\r\n\r\nproblems = []\r\nprint(solve(0, problems))", "def sum_groups(nums, groups, l, r, x, prev = []):\r\n if groups == 1:\r\n ret = []\r\n for i in nums:\r\n harder = max(prev + [i])\r\n easiest = min(prev + [i])\r\n v = sum(prev + [i])\r\n if l <= v and v <= r and harder - easiest >= x:\r\n ret.append(v)\r\n return ret\r\n else:\r\n\r\n ret = []\r\n for pos, i in enumerate(nums):\r\n ret += sum_groups(nums[pos + 1 : ], groups - 1, l, r, x, prev + [i])\r\n return ret\r\n\r\nn, l, r, x = list(map(int, input().split(\" \")))\r\nnums = list(map(int, input().split(\" \")))\r\n\r\ncant = 0\r\nret = []\r\n\r\nfor i in range(2, n + 1):\r\n ret += sum_groups(nums, i, l, r, x)\r\nprint(len(ret))", "def count_problemsets(problems, l, r, x, idx, total, min_difficulty, max_difficulty):\r\n if idx == len(problems):\r\n # Check if the subset satisfies the conditions\r\n if total >= l and total <= r and max_difficulty - min_difficulty >= x:\r\n return 1\r\n return 0\r\n\r\n # Two options for each problem: include it or exclude it from the subset\r\n include = count_problemsets(problems, l, r, x, idx + 1, total + problems[idx], min(min_difficulty, problems[idx]), max(max_difficulty, problems[idx]))\r\n exclude = count_problemsets(problems, l, r, x, idx + 1, total, min_difficulty, max_difficulty)\r\n return include + exclude\r\n\r\nif __name__ == \"__main__\":\r\n n, l, r, x = map(int, input().split())\r\n problems = list(map(int, input().split()))\r\n\r\n ways = count_problemsets(problems, l, r, x, 0, 0, float('inf'), float('-inf'))\r\n print(ways)\r\n", "n, l, r, x = map(int, input().split())\r\n\r\nA= list(map(int, input().split()))\r\n\r\n\r\nA.sort()\r\nBB = '000000000000000'\r\nans = 0\r\nfor i in range(1, 2 ** n):\r\n BBB = format(i, 'b')\r\n B = BB[0:n - len(BBB)] + BBB\r\n C = list(B)\r\n D = []\r\n for j in range(0, n):\r\n if C[j] == '1':\r\n D.append(A[j])\r\n m1 = min(D)\r\n m2 = max(D)\r\n m3 = sum(D)\r\n if m3 <= r and m3 >= l and (m2 - m1) >= x:\r\n ans +=1\r\nprint(ans)", "problems, minimum, maximum, min_diff = [int(x) for x in input().split()]\r\ndiff = [int(x) for x in input().split()]\r\ncounter = 0\r\n\r\ndef check(soln):\r\n if sum(soln) <= maximum and sum(soln) >= minimum:\r\n if max(soln) - min(soln) >= min_diff:\r\n return True\r\n return False\r\n \r\n\r\ndef solve(current_soln, n):\r\n global counter\r\n if n < len(diff):\r\n solve(current_soln, n + 1)\r\n current_soln.append(diff[n])\r\n solve(current_soln, n + 1)\r\n current_soln.remove(diff[n])\r\n else:\r\n if check(current_soln):\r\n counter += 1\r\n # else:\r\n # print(\"INVALID\")\r\n # print(current_soln) \r\n\r\nsolve([], 0)\r\nprint(counter)", "n,l,r,x = [int(x) for x in input().split()]\r\nc=[int(x) for x in input().split()]\r\n\r\ncount = 0\r\n\r\ndef checkSum(array):\r\n\tsumArray=0\r\n\tfor i,x in enumerate(array):\r\n\t\tif x==1:\r\n\t\t\tsumArray+=c[i]\r\n\treturn sumArray\r\n\r\ndef checkDiff(array):\r\n\tglobal x\r\n\tproblems = []\r\n\tfor i,p in enumerate(array):\r\n\t\tif p==1:\r\n\t\t\tproblems.append(c[i])\r\n\r\n\treturn (max(problems)-min(problems)>=x)\r\n\r\ndef included(n,overall=[]):\r\n\tglobal count\r\n\tif len(overall)==n:\r\n\t\tif l<=checkSum(overall)<=r and checkDiff(overall):\r\n\t\t\tcount+=1\r\n\telse:\r\n\t\tincluded(n,overall+[0])\r\n\t\tincluded(n,overall+[1])\r\n\r\nincluded(n)\r\nprint(count)\r\n\r\n", "from math import inf\r\nfrom itertools import combinations\r\nn,l,r,x = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\ndef find_subsets(s,n):\r\n return list(combinations(s,n))\r\nans = 0\r\nfor i in range(1,n+1):\r\n lst1 = find_subsets(lst,i)\r\n for j in range(len(lst1)):\r\n a = lst1[j]\r\n min1 = inf\r\n max1 = 0\r\n sum1 = 0\r\n for k in range(len(a)):\r\n min1 = min(min1,a[k])\r\n max1 = max(max1,a[k])\r\n sum1 += a[k]\r\n if sum1 <= r and sum1 >= l and (max1-min1) >= x:\r\n ans += 1\r\nprint(ans) \r\n", "import sys,threading\r\nfrom collections import defaultdict,deque\r\ndef main():\r\n n,l,r,x = map(int,input().split())\r\n num = list(map(int,input().split()))\r\n num.sort()\r\n memo = {}\r\n def dp(i,count,mi,ma):\r\n if (i,count,mi,ma) in memo:\r\n return memo[(i,count,mi,ma)]\r\n if i == len(num):\r\n if count <= r and count >= l and abs(mi - ma) >= x:\r\n return 1\r\n return 0\r\n memo[(i,count,mi,ma)] = dp(i+1,count +num[i],min(mi,num[i]),max(ma,num[i])) + dp(i+1,count,mi,ma)\r\n return dp(i+1,count +num[i],min(mi,num[i]),max(ma,num[i])) + dp(i+1,count,mi,ma)\r\n print(dp(0,0,float(\"inf\"),0))\r\n\r\nsys.setrecursionlimit(1 << 30)\r\n\r\nthreading.stack_size(1 << 27)\r\n\r\nmain_thread = threading.Thread(target = main)\r\n\r\nmain_thread.start()\r\n\r\nmain_thread.join()\r\n \r\n", "from itertools import combinations\r\nn,l,r,x = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncount = 0 \r\nd = []\r\na.sort()\r\nfor i in range(n+1):\r\n d.append([j for j in combinations(a,i)])\r\n\r\nfor i in d:\r\n for j in i:\r\n if sum(j) <= r and sum(j) >= l and j[-1]-j[0] >= x:\r\n count += 1\r\n\r\nprint(count) ", "def main(difficulties, l, r, x):\n counter = 0\n for i in range(1 << len(difficulties)):\n j = 0\n total_sum = 0\n min = max = None\n tmp_counter = 0\n while j < len(difficulties):\n if i & (1 << j):\n tmp_counter += 1\n if min is None or min > difficulties[j]:\n min = difficulties[j]\n if max is None or max < difficulties[j]:\n max = difficulties[j]\n total_sum += difficulties[j]\n j += 1\n if tmp_counter >= 2 and l <= total_sum <= r and max - min >= x:\n counter += 1\n return counter\n\n\nif __name__ == '__main__':\n n, l, r, x = [int(x) for x in input().split()]\n costs = [int(x) for x in input().split()]\n print(main(costs, l, r, x))\n", "from itertools import combinations\r\n\r\ndef main():\r\n n, l, r, x = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n c.sort()\r\n count = 0\r\n for i in range(2, n + 1):\r\n q = list(combinations(c, i))\r\n for j in range(len(q)):\r\n sum_ = 0\r\n for k in q[j]:\r\n sum_ += k\r\n t = q[j][-1] - q[j][0]\r\n if t >= x and l <= sum_ <= r:\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nprint(main())", "import copy\r\n\r\nn, mini, maxi, mindiff = map(int, input().split())\r\nproblems = list(map(int, input().strip().split()))\r\n\r\nways = 0\r\ndef problemMaking(current, inventory):\r\n global ways\r\n if current == n:\r\n if sum(inventory) >= mini and sum(inventory) <= maxi and max(inventory) - min(inventory) >= mindiff and len(inventory) >= 2:\r\n ways+=1\r\n else:\r\n problemMaking(current+1, inventory)\r\n newInventory = copy.copy(inventory)\r\n newInventory.append(problems[current])\r\n problemMaking(current+1, newInventory) \r\nproblemMaking(0, [])\r\nprint (ways)\r\n\r\n", "n, l, r, x = map(int, input().split())\n\ndificulties = list(map(int, input().split()))\n\nimport itertools\n\ncombs = []\n\nfor i in range(2, len(dificulties) + 1):\n comb = list(itertools.combinations(dificulties, i))\n for com in comb:\n combs.append(com)\n\npossible = 0\n\nfor comb in combs:\n if sum(comb) >= l and sum(comb) <= r and max(comb) - min(comb) >= x:\n possible += 1\n\nprint(possible)\n\n \t \t\t \t \t\t \t \t \t \t\t\t \t\t", "from itertools import combinations\r\nn , l , r , x =map(int , input().split())\r\nli =list(map(int , input().split()))\r\nans=0\r\nfor i in range (2 , n+1):\r\n c=list(combinations(li , i))\r\n for k in c :\r\n s=sum(k)\r\n if (s<=r and s>=l and max(k)-min(k)>=x):\r\n ans+=1\r\nprint (ans)", "from sys import stdin, stdout\r\ninput = stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n\tstdout.write(sep.join(map(str, args)) + end)\r\ndef int_map():\r\n\treturn map(int, input().split())\r\ndef list_int():\r\n\treturn list(map(int, input().split()))\r\n\r\n\r\ndef rec_generator(arr, i, sum, mn, mx, cnt):\r\n\tglobal r, l, n, x\r\n\tglobal valids\r\n\tif i == n:\r\n\t\tif cnt >= 2 and l<=sum<=r and mx - mn >= x:\r\n\t\t\tvalids += 1\r\n\t\treturn\r\n\trec_generator(arr, i + 1, sum + arr[i], min(arr[i], mn), max(arr[i], mx), cnt + 1)\r\n\trec_generator(arr, i + 1, sum, mn, mx, cnt)\r\n\r\n\r\n\r\nn, l, r, x = int_map()\r\narr = list_int()\r\nvalids = 0\r\nrec_generator(arr, 0, 0, 10**9, 0, 0)\r\nprint(valids)\r\n\r\n", "import itertools\r\n\r\np_input = input()\r\nn, l, r, x = p_input.split(' ')\r\nn = int(n)\r\nl = int(l)\r\nr = int(r)\r\nx = int(x)\r\n\r\nseq_input = input()\r\nmy_list = seq_input.split(' ')\r\nmy_list = [int(i) for i in my_list]\r\nres = 0\r\nfor i in range(2, n + 1):\r\n combinations = list(itertools.combinations(my_list, i))\r\n for combination in combinations:\r\n combination = sorted(combination)\r\n combination_max = max(combination)\r\n combination_min = min(combination)\r\n combination_sum = sum(combination)\r\n if l <= combination_sum <= r and x <= combination_max - combination_min:\r\n res += 1\r\n\r\nprint(res)", "n,l_,r,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=1;ans=0\r\nwhile l<2**n:\r\n y=bin(l)[2:]\r\n lenn=len(y)\r\n y=\"0\"*(n-lenn)+y\r\n count_=0;maxi=0;mini=10**6;summ=0\r\n for i in range(n):\r\n if y[i]==\"1\":count_+=1;summ+=a[i];mini=min(mini,a[i]);maxi=max(maxi,a[i])\r\n if maxi-mini>=x and count_>1 and summ>=l_ and summ<=r:ans+=1\r\n l+=1\r\nprint(ans)", "import itertools\r\nq=0\r\nn, l, r, x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nfor j in range(2,n+1):\r\n for i in itertools.combinations(c,j):\r\n if l<=sum(i)<=r and max(i)-min(i)>=x:\r\n q+=1\r\nprint(q)", "import itertools\r\n\r\nn,l,r,x = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\ncnt = 0\r\ndef tro(s,l,r,x):\r\n if len(s)>1 and (max(s)-min(s))>=x and sum(s)>=l and sum(s)<=r:\r\n return 1\r\n return 0\r\nfor i in range(n+1):\r\n for j in itertools.combinations(s,i):\r\n cnt += tro(j,l,r,x)\r\nprint(cnt)\r\n\r\n\r\n\r\n", "from itertools import product\r\n\r\nn, l, r, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\na = list(product([0,1],repeat=n))\r\nans = 0\r\n\r\nfor i in a:\r\n sm = 0\r\n mx = float('-inf')\r\n mn = float('inf')\r\n for j in range(n):\r\n if i[j] == 1:\r\n mn = min(mn, arr[j])\r\n mx = max(mx, arr[j])\r\n sm += arr[j]\r\n\r\n if sm >= l and sm <= r and mx - mn >= x:\r\n ans += 1\r\nprint(ans)", "from itertools import combinations\r\n\r\nn, l, r, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = 0\r\ntemp = [j for j in range(n)]\r\nfor i in range(2, n + 1):\r\n comb = list(combinations(temp, i))\r\n # print(comb)\r\n for ls in comb:\r\n total = 0\r\n mx = float('-inf')\r\n mn = float('inf')\r\n for num in ls:\r\n total += arr[num]\r\n mx = max(mx, arr[num])\r\n mn = min(mn, arr[num])\r\n # print(mx, mn)\r\n if l <= total <= r and mx - mn >= x:\r\n res += 1\r\n\r\nprint(res)\r\n", "n, l, r, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = 0\r\nfor j in range(1, 2**n):\r\n a = [arr[i] for i in range(n) if (((j >> i) & 1) == 1)]\r\n s = sum(a)\r\n res += (max(a) - min(a) >= x and s >= l and s <= r)\r\nprint(res)\r\n", "def check(i, c, l, r, x):\r\n bi = str(bin(i))[2:]\r\n bi = bi.zfill(len(c))\r\n\r\n if bi.count('1') < 2:\r\n return False\r\n\r\n first = bi.find('1')\r\n last = bi.rfind('1')\r\n\r\n if c[last] - c[first] < x:\r\n return False\r\n\r\n s = sum(c[i] for i in range(len(c)) if bi[i] == '1')\r\n\r\n return l <= s <= r\r\n\r\n\r\ndef main():\r\n n, l, r, x = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n c.sort()\r\n\r\n result = 0\r\n\r\n for i in range(0, 2**n):\r\n if check(i, c, l, r, x):\r\n result += 1\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "def valid(lst, l, r, x):\r\n if len(lst) >= 2 and sum(lst) >= l and sum(lst) <= r and max(lst) - min(lst) >= x:\r\n return True\r\n else:\r\n return False\r\n\r\ndef generate_sublists(nums, cur=[], ind=0):\r\n if ind == len(nums):\r\n return [cur[:]]\r\n\r\n cur.append(nums[ind])\r\n sub_1 = generate_sublists(nums, cur, ind + 1)\r\n\r\n cur.pop()\r\n sub_2 = generate_sublists(nums, cur, ind + 1)\r\n\r\n return sub_1 + sub_2\r\n\r\nn, l, r, x = [int(i) for i in input().split()]\r\nproblems = [int(i) for i in input().split()]\r\nall_sets = generate_sublists(problems)\r\nct = 0\r\nfor s in all_sets:\r\n if valid(s, l, r, x):\r\n ct += 1\r\n\r\nprint(ct)", "def helper(b,l,r,x):\r\n mx,mn,s=0,float('inf'),0\r\n for y in b:\r\n mx=max(mx,y)\r\n mn=min(mn,y)\r\n s+=y\r\n if s<=r and s>=l and mx-mn>=x:return True\r\n return False\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\n\r\nn,l,r,x=map(int,input().split())\r\na=list(map(int,input().strip().split()))\r\nif n==1:print(0)\r\nelse:\r\n count=0\r\n for i in range(pow(2,n)):\r\n b=[]\r\n for j in range(n):\r\n if i & (1<<j):b.append(a[j])\r\n \r\n if helper(b,l,r,x):count+=1\r\n print(count)", "def main():\r\n n, l, r,x = list(map(int, input().split()))\r\n C = list(map(int, input().split()))\r\n subset = []\r\n def powerset(A, index, n):\r\n if index == n:\r\n subset.append(list(A))\r\n return\r\n A.append(C[index])\r\n powerset(A, index + 1, n)\r\n A.pop(-1)\r\n powerset(A, index + 1, n)\r\n return\r\n powerset([], 0, n)\r\n count = 0\r\n for set in subset:\r\n if len(set) > 1:\r\n if (sum(set) >= l and sum(set) <= r):\r\n if max(set) - min(set) >= x:\r\n count += 1\r\n print(count)\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "# https://codeforces.com/problemset/problem/550/B\n\n\nn, l, r, x = map(int, input().split())\ncs = list(map(int, input().split()))\ncs.sort(reverse=True) # hardest -> easiest\n\n# print(n, l, r, x)\n# print(cs)\n\nans = 0\nfor config in range(2**n):\n # print(bin(config)[2:])\n n_1s = bin(config)[2:].count('1')\n if n_1s < 2:\n # skip configurations having less than 2 problems\n continue\n m, M = None, None # m: easiest problem, M: hardest problem\n total = 0 # sum of problem difficulties\n for i in range(n):\n if (1 << i) & config:\n # note that the easiest problem should be on the right-most 1 bit\n # and the hardest problem should be on the left-most 1 bit of the configuration\n if m is None:\n m = cs[n - 1 - i]\n M = cs[n - 1 - i]\n total += cs[n - 1 - i]\n\n # print(repr(bin(config)[2:]), m, M)\n # print(repr(format(config, '0' + str(n) + 'b')),\n # m, M, end=' -> ') # [DEBUG]\n # check if the current problem set is valid\n valid = all([total >= l, total <= r, (M - m) >= x])\n if valid:\n ans += 1\n\n # print('YES' if valid else 'NO') # [DEBUG]\n\n\nprint(ans)\n\n\n# References\n# https://stackoverflow.com/questions/16926130/convert-to-binary-and-keep-leading-zeros\n", "n,l,r,x=map(int,input().split())\r\nf=sorted(map(int,input().split()))\r\ntr=0\r\ndef solve(i,sum,m,M,fl):\r\n global tr\r\n if sum>r:\r\n return 0\r\n if M-m>=x and fl and sum>=l:\r\n tr+=1\r\n if i<n:\r\n return solve(i+1,sum+f[i],min(m,f[i]),max(M,f[i]),True)+solve(i+1,sum,m,M,False)\r\n else:\r\n return 0\r\n(solve(0,0,1e10,0,False))\r\nprint(tr)", "n, l, r, x = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nN = 20\r\n\r\nans = 0\r\nfor i in range(1 << n):\r\n minv = float('inf')\r\n maxv = 0\r\n tot = 0\r\n cnt = 0\r\n\r\n for j in range(n):\r\n if (i >> j) & 1:\r\n cnt += 1\r\n minv = min(minv, w[j])\r\n maxv = max(maxv, w[j])\r\n tot += w[j]\r\n\r\n if cnt >= 2 and maxv - minv >= x and tot >= l and tot <= r:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def count_problemsets(n, l, r, x, difficulties, current_sum=0, min_difficulty=float('inf'), max_difficulty=float('-inf'), index=0):\r\n if index == n:\r\n if current_sum >= l and current_sum <= r and max_difficulty - min_difficulty >= x:\r\n return 1\r\n else:\r\n return 0\r\n \r\n # Include the current problem in the problemset\r\n count_with_current = count_problemsets(n, l, r, x, difficulties, current_sum + difficulties[index], min(min_difficulty, difficulties[index]), max(max_difficulty, difficulties[index]), index + 1)\r\n \r\n # Exclude the current problem from the problemset\r\n count_without_current = count_problemsets(n, l, r, x, difficulties, current_sum, min_difficulty, max_difficulty, index + 1)\r\n \r\n return count_with_current + count_without_current\r\n\r\n# Input\r\nn, l, r, x = map(int, input().split())\r\ndifficulties = list(map(int, input().split()))\r\n\r\n# Calculate and print the number of ways to choose a suitable problemset\r\nresult = count_problemsets(n, l, r, x, difficulties)\r\nprint(result)\r\n", "n, l, r, x = map(int, input().split())\r\nnums = [int(i) for i in input().split()]\r\nans = 0\r\n\r\ndef solve(arr):\r\n if len(arr) == n:\r\n do_something(arr)\r\n return\r\n solve(arr + [0])\r\n solve(arr + [1])\r\n\r\ndef do_something(arr):\r\n global ans\r\n mn = float('inf')\r\n mx = -1\r\n tot = 0\r\n for i in range(n):\r\n if arr[i]:\r\n mn = min(mn, nums[i])\r\n mx = max(mx, nums[i])\r\n tot += nums[i]\r\n \r\n if (mx-mn >= x) and ( (tot >= l) and (tot <= r) ):\r\n ans += 1\r\n\r\nsolve([])\r\nprint(ans)", "n, l, r, x = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\n\r\nways = 0\r\n\r\ndef count_ways(i,cur,low,high):\r\n global ways\r\n global n, l, r, x\r\n\r\n if i == n:\r\n if (cur >= l and cur <= r) and high - low >= x:\r\n ways += 1\r\n else:\r\n count_ways(i+1, cur + arr[i], min(low, arr[i]), max(high, arr[i]))\r\n count_ways(i+1, cur, low, high) \r\n\r\ncount_ways(0, 0, float('inf'), -1)\r\nprint(ways)", "n,l,r,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\ndef prep(ln,arr,c,sm,lst):\r\n global ans,n,l,r,k\r\n if c==ln:\r\n if l<=sm<=r and max(lst)-min(lst)>=k and len(lst)>1:\r\n ans+=1\r\n return\r\n prep(ln,arr,c+1,sm+arr[c],lst+[arr[c]])\r\n prep(ln,arr,c+1,sm,lst) \r\nprep(n,arr,0,0,[])\r\nprint(ans)", "n, l, r, x = map(int, input().split())\nc = list(map(int, input().split()))\nans = 0\nfor i in range(1, 2 ** n):\n total = []\n s = bin(i)[2:].zfill(n)\n for j in range(len(s)):\n if s[j] == '1':\n total.append(c[j])\n if max(total) - min(total) >= x and l <= sum(total) <= r:\n ans += 1\nprint(ans)\n \n \n\n \t \t \t\t \t\t \t\t \t \t\t\t", "n, l, r, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(3, 1 << n):\r\n mn = float('inf')\r\n mx = float('-inf')\r\n s = 0\r\n for j in range(n):\r\n if i & (1 << j):\r\n s += a[j]\r\n mx = max(mx, a[j])\r\n mn = min(mn, a[j])\r\n if l <= s <= r and (mx - mn) >= x:\r\n cnt += 1\r\nprint(cnt)", "from itertools import combinations\r\nn,l,r,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(2,n+1):\r\n for j in combinations(a,i):\r\n if max(j)-min(j)>=x and l<=sum(j)<=r:\r\n c+=1\r\nprint(c)", "# /**\r\n# * author: brownfox2k6\r\n# * created: Wed 12 Apr 2023 at 08:50:37 UTC+7, Hanoi, Vietnam\r\n# **/\r\n\r\nfrom itertools import combinations\r\n\r\nn, l, r, x = map(int, input().split())\r\na = [x for x in map(int, input().split())]\r\n\r\nok = 0\r\nfor problems in range(2, n+1):\r\n for problemset in combinations(a, problems):\r\n s = sum(problemset)\r\n ok += (l <= s <= r and max(problemset) - min(problemset) >= x)\r\n\r\nprint(ok)", "n,l,r,x= [int(x) for x in input().split()]\r\nC=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(2**n):\r\n b=bin(i)[2:]\r\n while len(b)<n:\r\n b='0'+b\r\n L=[]\r\n for j in range(n):\r\n if b[j]=='1':\r\n L.append(C[j])\r\n if len(L)!=0 and max(L)-min(L)>=x and l<=sum(L) and sum(L)<=r:\r\n res+=1\r\nprint(res)\r\n\r\n", "from sys import stdin, stderr, stdout, maxsize\nfrom math import *\nfrom bisect import *\nfrom collections import Counter, deque, defaultdict\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\nfrom itertools import combinations\n\ninput = lambda: stdin.buffer.readline().decode().rstrip()\ninp = lambda dtype: [dtype(x) for x in input().split()]\nprint = lambda *args, end=\"\\n\": stdout.write(\" \".join([str(x) for x in args]) + end)\n\n\n# Solution here\ndef solve(tt):\n n, l, r, tol = inp(int)\n a = inp(int)\n step = 0\n for i in range(2, n + 1):\n for x in combinations(a, i):\n if l <= sum(x) <= r and max(x) - min(x) >= tol:\n step += 1\n print(step)\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 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", "n, l, r, x = map(int, input().split())\n# n problems\n# total = l min, r max\n# x min diff\nc = list(map(int, input().split()))\n# c[i] is the difficulty of problem i\n\n\nproblemas = list(range(n))\n\nimport itertools\ncombinaciones = []\nfor i in range(2, n+1):\n combinaciones+=(list(itertools.combinations(problemas, i)))\n\ndef check_comb(comb, c, l, r, x):\n suma = 0\n minimo = c[comb[0]]\n maximo = c[comb[0]]\n for i in comb:\n suma += c[i]\n if c[i] < minimo:\n minimo = c[i]\n if c[i] > maximo:\n maximo = c[i]\n if suma >= l and suma <= r and maximo-minimo >= x:\n return True\n else:\n return False\n \ncount = 0\nfor comb in combinaciones:\n if check_comb(comb, c, l, r, x):\n count += 1\nprint(count)\n\t \t\t\t\t\t \t\t \t \t \t\t \t", "def count_valid_problemsets(n, l, r, x, c):\r\n # Generate all possible subsets of problems\r\n subsets = []\r\n for i in range(2**n):\r\n subset = []\r\n for j in range(n):\r\n if i & (1 << j):\r\n subset.append(c[j])\r\n subsets.append(subset)\r\n \r\n # Check if each subset satisfies the conditions\r\n valid_problemsets = 0\r\n for subset in subsets:\r\n total_difficulty = sum(subset)\r\n if l <= total_difficulty <= r:\r\n min_difficulty = min(subset)\r\n max_difficulty = max(subset)\r\n if max_difficulty - min_difficulty >= x:\r\n valid_problemsets += 1\r\n \r\n return valid_problemsets\r\n\r\nif __name__ == '__main__':\r\n n, l, r, x = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n print(count_valid_problemsets(n, l, r, x, c))", "n,l,r,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nans=0\r\nfor i in range(0,1<<n):\r\n s=0\r\n temp=[]\r\n for j in range(0,n):\r\n if i &(1<<j)==0:\r\n s+=c[j]\r\n temp.append(c[j])\r\n if (s>=l and s<=r) and (max(temp)-min(temp)>=x):\r\n ans+=1\r\nprint(ans)", "n,l,r,diff = [int(x) for x in input().split()]\r\nprobs = [int(x) for x in input().split()]\r\nans = 0\r\ndef backtrack(x):\r\n global ans\r\n if len(x) == n:\r\n total = 0\r\n p = []\r\n for y in range(len(x)):\r\n if x[y] == '1':\r\n total += probs[y]\r\n p.append(probs[y])\r\n if len(p) != 0:\r\n if max(p) - min(p) >= diff and total >= l and total <= r:\r\n ans += 1\r\n else:\r\n backtrack(x+\"1\")\r\n backtrack(x+\"0\")\r\nbacktrack('')\r\nprint(ans)", "n, l, r, x = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\ndef binary(k):\n global n\n res = \"\"\n while k != 0:\n res = str(k % 2) + res\n k //= 2\n return \"0\"*(n-len(res)) + res\n\ndef partes(S):\n res = []\n for i in range(2**len(S)):\n dig = binary(i)\n L = []\n for j in range(len(S)):\n if dig[j] == \"1\":\n L.append(S[j])\n\n res.append(L)\n\n return res\n\nparts = partes(c)\nrr = 0\n \nfor e in parts:\n if len(e) >= 2:\n if (l <= sum(e)) and (r >= sum(e)) and (max(e) - min(e) >= x):\n rr += 1\n\nprint(rr)\n\t \t\t\t\t\t \t\t \t\t\t\t \t\t \t\t \t \t\t\t", "import itertools\r\n\r\nMAX_N = 16\r\n\r\ndef solve():\r\n ans = 0\r\n for f in range(1, 2**n):\r\n if f & (f-1):\r\n tot = 0\r\n mi = 1e7\r\n mx = 0\r\n for i in range(n):\r\n if f >> i & 1:\r\n tot += c[i]\r\n mi = min(mi, c[i])\r\n mx = max(mx, c[i])\r\n if tot >= l and tot <= r and mx - mi >= x:\r\n ans += 1\r\n print(ans)\r\n\r\nn, l, r, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nsolve()\r\n", "gl = []\r\ndef func(k, lt) :\r\n if k == 0 :\r\n gl.append(lt.copy())\r\n lt.append(ls[k])\r\n gl.append(lt.copy())\r\n lt.remove(ls[k])\r\n return\r\n func(k-1, lt)\r\n lt.append(ls[k])\r\n func(k-1, lt)\r\n lt.remove(ls[k])\r\ndef check(elem) :\r\n if len(elem) < 2 :\r\n return False\r\n if sum(elem) < l or sum(elem) > r :\r\n return False\r\n if elem[-1] - elem[0] < x :\r\n return False\r\n return True\r\nn, l, r, x = map(int,input().split())\r\nls = list(map(int,input().split()))\r\nls.sort(reverse = True)\r\nlt = []\r\nfunc(n-1, lt)\r\nans = 0\r\nfor elem in gl :\r\n if check(elem) :\r\n ans += 1\r\nprint(ans)", "n,l,r,x = map(int,input().split()) \r\narr = list(map(int,input().split())) \r\nsubsets = [] \r\nfor i in range(1, 2 ** n):\r\n subset_arr = [] \r\n for j in range(n):\r\n if (i >> j) & 1 == 1:\r\n arr_ele = arr[j] \r\n subset_arr.append(arr_ele)\r\n total_dif = sum(subset_arr)\r\n \r\n if (len(subset_arr) >= 2) and ((max(subset_arr)- min(subset_arr)) >= x) and total_dif >= l and total_dif <= r:\r\n subsets.append(subset_arr) \r\nprint(len(subsets))", "from itertools import combinations\r\nn,l,r,x= map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nc=0\r\nfor i in range(1,n+1):\r\n for j in combinations(a,i):\r\n if l<=sum(j)<=r:\r\n if j[-1]-j[0]>=x:\r\n c+=1\r\nprint(c)", "n,l,r,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nans=0\r\nfor i in range(2**n):\r\n s=[]\r\n for j in range(n):\r\n if (1<<j) & i > 0:\r\n s.append(c[j])\r\n if len(s) >= 2 and l <= sum(s) <= r and max(s) - min(s) >= x:\r\n ans+=1\r\nprint(ans)\r\n", "def solve(idx, min_diff, max_diff, diff):\r\n if idx == len(c):\r\n if max_diff - min_diff >= x and l <= diff <= r:\r\n return 1\r\n return 0\r\n taken = solve(idx + 1, min(c[idx], min_diff), max(c[idx], max_diff), diff + c[idx])\r\n not_taken = solve(idx + 1, min_diff, max_diff, diff)\r\n return taken + not_taken\r\n\r\nn, l, r, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nprint(solve(0, float('inf'), -float('inf'), 0))\r\n", "import sys\r\nimport math\r\n\r\ndef powerset(result: set[int], curr_val: int, i: int, n: int):\r\n \"\"\"\r\n Create the powerset of length n where the ith bit is on if 1, else 0\r\n i.e 1000, 1001, 1010, 1011, 1111, ...\r\n \"\"\"\r\n if i == n:\r\n result.add(curr_val)\r\n return\r\n # Include the current value (set the ith bit)\r\n curr_val |= 1 << i\r\n powerset(result, curr_val, i + 1, n)\r\n # Do not include it\r\n curr_val &= ~ (1 << i)\r\n powerset(result, curr_val, i + 1, n)\r\n\r\ndef get_values(values: list[int]) -> list[list[int]]:\r\n results: set[int] = set()\r\n powerset(results, 0, 0, len(values))\r\n subsets = []\r\n for result in results:\r\n curr_subset = []\r\n for i in range(len(values)):\r\n if result & 1 << i:\r\n curr_subset.append(values[i])\r\n subsets.append(curr_subset)\r\n return subsets\r\n\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n n, l, r, x = (int(i) for i in read().split())\r\n values = [int(i) for i in read().split()]\r\n values.sort()\r\n subsets = get_values(values)\r\n valid = 0\r\n for subset in subsets:\r\n if not subset:\r\n continue\r\n if l <= sum(subset) <= r and subset[-1] - subset[0] >= x :\r\n valid += 1\r\n\r\n print(valid)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, l, r, x=map(int,input().split())\r\ndiff = list(map(int,input().split()))\r\nans=0\r\nbits =(2**n)\r\nfor m in range(bits):\r\n mn=1e9\r\n mx=-1e9\r\n cnt=sum=0\r\n for i in range(n):\r\n if (m&(1<<i))!=0:\r\n cnt+=1\r\n sum+=diff[i]\r\n mn=min(mn,diff[i])\r\n mx=max(mx,diff[i])\r\n if l<=sum<=r and mx-mn>=x and cnt>=2:\r\n ans+=1\r\n \r\nprint(ans)", "from itertools import combinations\r\n \r\nn, l, r, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsumu = 0\r\nfor i in range(2, n + 2):\r\n for j in combinations(a, i):\r\n if (r >= sum(j) >= l) and (max(j) - min(j) >= x):\r\n sumu += 1\r\nprint(sumu)", "import sys\r\nfrom itertools import chain, combinations\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef powerset(iterable):\r\n s = list(iterable)\r\n return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))\r\n\r\nn, l, r, x = get_ints()\r\nc = list(get_ints())\r\ndef isValid(list, l, r, x):\r\n intervalSum = sum(list)\r\n if l <= intervalSum <= r and max(list) - min(list) >= x:\r\n return True\r\n return False\r\n\r\nans = 0\r\nfor list in powerset(c):\r\n if isValid(list, l, r, x):\r\n ans += 1\r\n\r\nprint(ans)", "\nn, l, r, x = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 0\n#find all subsets using bitmasking and find values and compare with restrictions\nfor i in range(1 << n):\n mx = -1\n mn = 1000000\n sum_val = 0\n for j in range(n):\n if i & (1 << j):\n sum_val += a[j]\n mx = max(mx, a[j])\n mn = min(mn, a[j])\n\n if l <= sum_val <= r and (mx - mn) >= x:\n ans += 1\n\nprint(ans)\n \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, l, r, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ninf = pow(10, 9) + 1\r\npow2 = [1]\r\nfor _ in range(n):\r\n pow2.append(2 * pow2[-1])\r\nans = 0\r\nfor i in range(1, pow2[n]):\r\n u, v, mi, ma = 0, 0, inf, -inf\r\n for j in range(n):\r\n if i & pow2[j]:\r\n u += 1\r\n v += c[j]\r\n mi, ma = min(mi, c[j]), max(ma, c[j])\r\n if u >= 2 and l <= v <= r and ma - mi >= x:\r\n ans += 1\r\nprint(ans)", "import itertools\r\n\r\nn, l, r, x = input().split()\r\nn = int(n)\r\nl = int(l)\r\nr = int(r)\r\nx = int(x)\r\nc = input().split()\r\nfor i in range(len(c)):\r\n c[i] = int(c[i])\r\nc = sorted(c)\r\ntotal = 0\r\nfor L in range(2,n + 1):\r\n for subset in itertools.combinations(c, L):\r\n suma = sum(subset)\r\n if ((suma >= l) and (suma <= r) and (abs(subset[len(subset)-1] - subset[0])) >= x):\r\n total += 1\r\n\r\nprint(total)", "from sys import stdin\r\ndef input(): return stdin.readline().rstrip(\"\\r\\n\")\r\nn,l,r,x = map(int,input().split())\r\nc = list(map(int,input().split()))\r\ncount1 = 0\r\nfor i in range(1<<n):\r\n min1 = 9e18\r\n max1 = -9e18\r\n sum1 = 0\r\n for j in range(n):\r\n if i>>j&1:\r\n min1 = min(min1,c[j])\r\n max1 = max(max1,c[j])\r\n sum1+=c[j]\r\n if l<=sum1<=r and max1-min1>=x:\r\n count1+=1\r\nprint(count1)", "n,l,r,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,2**n):\r\n\tbm=bin(i)[2:].zfill(n)\r\n\tu=[]\r\n\tfor id,j in enumerate(bm):\r\n\t\tif j==\"1\":\r\n\t\t\tu.append(a[id])\r\n\tif max(u)-min(u)>=x and l<=sum(u) and sum(u)<=r:\r\n\t\t\t\tans+=1\r\nprint(ans)", "import itertools\n\nn, l, r, x = map(int, input().split())\ndifficulties = [int(i) for i in input().split()]\ndifficulties.sort()\n\nsubSets = []\nfor i in range(2, n + 1):\n subSets.extend(list(itertools.combinations(difficulties, i)))\n\ncount = 0\nfor subSet in subSets:\n if subSet[-1] - subSet[0] < x:\n continue\n if sum(subSet) < l:\n continue\n if sum(subSet) > r:\n continue\n count += 1\n\nprint(count)\n\n\t \t\t \t \t\t\t\t\t \t\t\t \t \t\t\t\t\t \t", "n, l, r, x = map(int, input().split())\na = [int(i) for i in input().split()]\ncnt = 0\ntmp = []\nfor mask in range(0, 2 ** n):\n for j in range(0, n):\n if mask & (2 ** j) == 2 ** j:\n tmp.append(a[j])\n\n if l <= sum(tmp) <= r and (max(tmp) - min(tmp)) >= x and len(tmp) >= 2:\n cnt += 1\n tmp = []\nprint(cnt)\n" ]

[ "n = int(input())\r\na = []\r\nwk1 = \"0\" * 18\r\nrules = str.maketrans(\"0123456789\", \"0101010101\")\r\ntrans = lambda x : str.translate(x, rules)\r\nd = {}\r\nfor _ in range(n):\r\n x, y = input().split()\r\n y = int(trans(y), 2)\r\n if x == \"+\":\r\n d[y] = d.get(y, 0) + 1\r\n elif x == \"-\":\r\n d[y] -= 1\r\n elif x == \"?\":\r\n print(d.get(y, 0))\r\n\r\n\r\n", "def get_pattern_from_number(number):\n pattern = \"\"\n for i in number:\n if i in '02468':\n pattern += '0'\n else:\n pattern += '1'\n return int(pattern)\n\n\nstorage = {}\nfor _ in range(int(input())):\n query, number = input().split()\n if query == \"+\":\n pattern = get_pattern_from_number(number)\n storage[pattern] = storage.get(pattern, 0) + 1\n if query == \"-\":\n pattern = get_pattern_from_number(number)\n storage[pattern] = storage.get(pattern, 0) - 1\n if query == \"?\":\n print(storage.get(int(number), 0))\n\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\r\nfrom sys import stdout\r\nfrom collections import defaultdict\r\n\r\nr = set('02468')\r\n\r\ndef mask(n):\r\n result=\"\"\r\n for x in n:\r\n if x in r:\r\n result+=\"0\"\r\n else:\r\n result+=\"1\"\r\n \r\n return int(result)\r\n\r\nn = int(stdin.readline())\r\na = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n command, x = stdin.readline().strip().split(' ')\r\n \r\n m = mask(x)\r\n \r\n if command == '+':\r\n a[m]+=1\r\n if command == '-':\r\n a[m] -= 1\r\n if command == '?':\r\n stdout.write(str(a[m]) + '\\n')\r\n stdout.flush()", "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\nmp = defaultdict(int)\r\ndef key(x):\r\n res = 0\r\n for i in range(len(x)):\r\n res = 2*res+int(x[i])%2\r\n return res\r\nfor _ in range(int(input())):\r\n a = input().strip().split()\r\n #print(*a)\r\n if a[0]==\"+\":\r\n mp[key(a[1])]+=1\r\n #print(mp[a[1]])\r\n elif a[0]==\"-\":\r\n mp[key(a[1])]-=1\r\n pass\r\n else:\r\n print(mp[key(a[1])])\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/713/A\r\n\r\nfrom collections import defaultdict\r\nfrom sys import stdin\r\nfrom sys import stdout\r\n\r\nn = int(stdin.readline())\r\n\r\nd = defaultdict(int) \r\nfor _ in range(n):\r\n s, x = stdin.readline().split()\r\n y = \"\".join([\"1\" if c in [\"1\", \"3\", \"5\", \"7\", \"9\"] else \"0\" for c in x]).zfill(18)\r\n \r\n if s == \"+\": \r\n d[y] += 1\r\n elif s == \"-\": \r\n d[y] -= 1\r\n else: \r\n stdout.write(str(d[y]) + '\\n')", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom collections import defaultdict\nfrom sys import stdin, stdout\n\ninp = stdin.readline\nout = stdout.write\n\n\ndef convert_num(number):\n number_list = list(map(int, number))\n res = \"\".join(str(d & 1) for d in number_list)\n return \"0\" * (18 - len(res)) + res\n\n\ndef convert_pattern(pattern):\n return \"0\" * (18 - len(pattern)) + pattern\n\n\nt = int(inp())\nmultiset = defaultdict(int)\n\nwhile t:\n t -= 1\n op, item = inp().split()\n if op == \"+\":\n multiset[convert_num(item)] += 1\n elif op == \"-\":\n multiset[convert_num(item)] -= 1\n else:\n out(\"%d\\n\" % multiset[convert_pattern(item)])\n", "t=str.maketrans('0123456789','0101010101')\r\nC=[0]*(1<<18)\r\nfor _ in range(int(input())):\r\n c,a=input().split()\r\n if c=='?':\r\n print(C[int(a,2)])\r\n else:\r\n if c=='+':\r\n C[int(a.translate(t),2)]+=1\r\n else:\r\n C[int(a.translate(t),2)]-=1", "def pattern_of_number(n):\n pattern = ''\n p = 10**17\n for i in range(18):\n pattern += '0' if n // p % 2 == 0 else '1'\n p //= 10\n\n return pattern\n\n\ndef solve():\n pattern_dict = {}\n\n t = int(input())\n for i in range(t):\n query = input()\n\n if query[0] == '+':\n number = int(query[2:])\n pattern = pattern_of_number(number)\n if pattern in pattern_dict:\n pattern_dict[pattern] += 1\n else:\n pattern_dict[pattern] = 1\n\n elif query[0] == '-':\n number = int(query[2:])\n pattern = pattern_of_number(number)\n if pattern_dict[pattern] > 1:\n pattern_dict[pattern] -= 1\n else:\n pattern_dict.pop(pattern)\n\n else:\n pattern = query[2:].strip()\n\n actual_pattern = '0' * (18 - len(pattern)) + pattern\n\n if actual_pattern in pattern_dict:\n print(pattern_dict[actual_pattern])\n else:\n print(0)\n\n\nif __name__ == \"__main__\":\n solve()\n\n\t \t\t \t\t \t\t\t \t\t\t \t\t\t\t \t", "from sys import stdin, stdout\nfrom collections import defaultdict\ninput()\nd = defaultdict(int)\nregex = str.maketrans(\"0123456789\",\"0101010101\")\nfor line in stdin.readlines():\n typ, val = line.split()\n if typ == \"?\":\n print(d[int(val,2)])\n else:\n val = int(val.translate(regex), 2)\n if typ == \"+\":\n d[val]+=1\n else:\n d[val]-=1\n", "MAX_DIGITS=18\r\ndef get_pattern(num):\r\n pattern_str=''\r\n while num!=0:\r\n digits=num%10\r\n if (digits & 1): # digits is odd\r\n pattern_str='1'+pattern_str\r\n else:\r\n pattern_str='0'+pattern_str\r\n num=num//10\r\n zero_to_append=MAX_DIGITS-len(pattern_str)\r\n pattern_str='0'*zero_to_append+pattern_str\r\n\r\n return pattern_str\r\nif __name__ == \"__main__\":\r\n t=int(input())\r\n nums_hashmap={}\r\n pattern_hashmap={}\r\n # ans=[]\r\n for _ in range(t):\r\n query_type,num=input().split()\r\n\r\n if query_type=='+':\r\n num=int(num)\r\n num_pattern=get_pattern(num)\r\n nums_hashmap[num]=nums_hashmap.get(num,0)+1\r\n pattern_hashmap[num_pattern]=pattern_hashmap.get(num_pattern,0)+1\r\n elif query_type=='-':\r\n num=int(num)\r\n num_pattern=get_pattern(num)\r\n nums_hashmap[num]-=1\r\n pattern_hashmap[num_pattern]-=1\r\n else:\r\n # num is str in this case\r\n zero_to_append=MAX_DIGITS-len(num)\r\n check_pattern='0'*zero_to_append+num\r\n # ans.append(pattern_hashmap.get(check_pattern,0))\r\n print(pattern_hashmap.get(check_pattern,0))\r\n # print(*ans)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nt=str.maketrans('0123456789','0101010101')\nC=(1<<18)*[0]\nfor _ in range(int(input())):\n\tc,a=input().split()\n\tif'?'==c:print(C[int(a,2)])\n\telse:C[int(a.translate(t),2)]+=1 if'-'!=c else-1\n", "from collections import defaultdict\r\nfrom sys import stdin\r\nfrom sys import stdout\r\n\r\ndef main():\r\n\tn = int(stdin.readline())\r\n\r\n\td = defaultdict(int)\t\t\r\n\tfor i in range(n):\r\n\t\ts, x = stdin.readline().split()\r\n\t\ty = ''.join(['1' if c in ['1', '3', '5', '7', '9'] else '0' for c in x]).zfill(18)\r\n\t\t\r\n\t\tif s == '+': d[y] += 1\r\n\t\telif s == '-': d[y] -= 1\r\n\t\telse: stdout.write(str(d[y]) + '\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "t = int(input())\nd = dict()\nrule = str.maketrans(\"0123456789\", \"0101010101\")\ntrans = lambda x : str.translate(x, rule)\nfor i in range(t):\n x, y = map(str, input().split())\n obj = int(trans(y), 2)\n if x == \"+\":\n d[obj] = d.get(obj, 0) + 1\n elif x == \"-\":\n d[obj] -= 1\n else:\n print(d.get(obj, 0))\n", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\nd = defaultdict(int)\r\nfor i in range(n):\r\n s = input().split()\r\n if(s[0] == '?'):\r\n a = '0' * (18 - len(s[1])) + s[1]\r\n print(d[a])\r\n else:\r\n a = ''\r\n m = int(s[1])\r\n while(m > 0):\r\n c = m % 10 \r\n if(c % 2):\r\n a += '1'\r\n else:\r\n a += '0'\r\n m //= 10 \r\n a = a + '0' * (18 - len(s[1])) \r\n a = a[ :: -1]\r\n if(s[0] == '+'):\r\n d[a] += 1 \r\n else:\r\n d[a] -= 1", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom collections import defaultdict\nfrom sys import stdin\n\ninp = stdin.readline\n\n\ndef convert_num(number):\n number_list = list(map(int, number))\n res = \"\".join(str(d & 1) for d in number_list)\n return \"0\" * (18 - len(res)) + res\n\n\ndef convert_pattern(pattern):\n return \"0\" * (18 - len(pattern)) + pattern\n\n\nt = int(inp())\nmultiset = defaultdict(int)\n\nwhile t:\n t -= 1\n op, item = inp().split()\n if op == \"+\":\n multiset[convert_num(item)] += 1\n elif op == \"-\":\n multiset[convert_num(item)] -= 1\n else:\n print(multiset[convert_pattern(item)])\n", "cnt = [0]*262200\r\ntrans = str.maketrans('0123456789', '0101010101')\r\nt = int(input())\r\nfor _ in range(t):\r\n o, a = input().split()\r\n\r\n if o == '+':\r\n cnt[int(a.translate(trans), 2)] += 1\r\n elif o == '-':\r\n cnt[int(a.translate(trans), 2)] -= 1\r\n else:\r\n print(cnt[int(a, 2)])\r\n", "n = int(input())\r\ns = []\r\n\r\nfor _ in range(n):\r\n s.append(input())\r\n\r\ndef parity_rep(a):\r\n res = []\r\n for i in range(len(a) - 1, -1, -1):\r\n num = int(a[i])\r\n if num % 2 == 0:\r\n res.append('0')\r\n else:\r\n res.append('1')\r\n\r\n while len(res) < 18:\r\n res.append('0')\r\n\r\n return ''.join(res)\r\n\r\ndef parity_set():\r\n obj = {}\r\n\r\n r = []\r\n for sub in s:\r\n\r\n sub_arr = sub.split()\r\n op, num = sub_arr[0], sub_arr[1]\r\n cur_s_rep = parity_rep(num)\r\n\r\n if op == '+':\r\n obj[cur_s_rep] = obj.get(cur_s_rep, 0) + 1\r\n elif op == '-':\r\n obj[cur_s_rep] -= 1\r\n elif op == '?':\r\n r.append(obj.get(cur_s_rep, 0))\r\n\r\n return r\r\n\r\nres = parity_set()\r\n\r\nfor el in res:\r\n print(el)", "import sys, os, io\r\nfrom sys import stdin, stdout \r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline \r\ndef binaryToDecimal(n):\r\n num = n;\r\n dec_value = 0;\r\n base1 = 1;\r\n len1 = len(num);\r\n for i in range(len1 - 1, -1, -1):\r\n if (num[i] == '1'): \r\n dec_value += base1;\r\n base1 = base1 * 2;\r\n \r\n return dec_value;\r\n \r\ndef convert(n):\r\n ss = []\r\n for i in n:\r\n ss.append(str(int(i)&1))\r\n return binaryToDecimal(ss)\r\n\r\n\r\nt = stdin.readline()\r\n# print(t)\r\nd = {}\r\nab = [0]*(262145)\r\nfor _ in range(int(t)):\r\n a, b = map(str, sys.stdin.readline().strip().split())\r\n if(a == \"+\"):\r\n c = convert(b)\r\n ab[c]+=1\r\n b = int(b)\r\n if(b not in d):\r\n d[b] = 0\r\n d[b]+=1\r\n\r\n\r\n elif(a == '-'):\r\n c = convert(b)\r\n ab[c]-=1\r\n b = int(b)\r\n if(d[b] == 1):\r\n d.pop(b)\r\n else:\r\n d[b]-=1\r\n \r\n\r\n else:\r\n b = binaryToDecimal(b)\r\n print(ab[b])\r\n\r\n\r\n\r\n", "from sys import stdin\n\ninput()\n\ncnt=[0]*2**18\n\nt=str.maketrans(\"0123456789\",\"0101010101\")\n\nfor ch,s in map(str.split,stdin):\n\n if ch=='?' :\n\n print(cnt[int(s,2)])\n\n else :\n\n cnt[int(s.translate(t),2)]+= (1 if ch=='+' else -1 )\n\n\n\n# Made By Mostafa_Khaled", "from sys import stdin, exit, setrecursionlimit\r\n\r\nsetrecursionlimit(10000000)\r\nfrom math import *\r\nfrom bisect import bisect_left\r\nfrom collections import deque\r\n\r\ninput = stdin.readline\r\nlmi = lambda: list(map(int, input().split()))\r\nmi = lambda: map(int, input().split())\r\nsi = lambda: input().strip('\\n')\r\nssi = lambda: input().strip('\\n').split()\r\n\r\ndef conv(b):\r\n news = \"\"\r\n for j in range(18 - len(b)):\r\n news += \"0\"\r\n for j in range(len(b)):\r\n if int(b[j]) % 2 == 0:\r\n news += \"0\"\r\n else:\r\n news += \"1\"\r\n return news\r\n\r\n\r\nmp = {}\r\nfor _ in range(int(input())):\r\n a, b = ssi()\r\n if a == \"+\":\r\n news = conv(b)\r\n if news not in mp:\r\n mp[news] = 0\r\n mp[news] += 1\r\n elif a == \"-\":\r\n tmp = conv(b)\r\n mp[tmp] -= 1\r\n if mp[tmp] == 0:\r\n del mp[tmp]\r\n else:\r\n b = (18-len(b))*\"0\"+b\r\n if b not in mp:\r\n print(0)\r\n else:\r\n print(mp[b])\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nw = Counter()\r\nfor _ in range(int(input())):\r\n a, b = input()[:-1].split()\r\n\r\n d = ''\r\n for i in b:\r\n if int(i) % 2:\r\n d += '1'\r\n else:\r\n d += '0'\r\n d = d.rjust(18,'0')\r\n if a == '+':\r\n w[d] += 1\r\n elif a == '-':\r\n w[d] -= 1\r\n else:\r\n print(w[d])\r\n", "\r\nt=str.maketrans(\"0123456789\",\"0101010101\")\r\ndct={}\r\nfor _ in range(int(input())):\r\n q,a=input().split()\r\n if(q==\"+\"):\r\n c=int(a.translate(t))\r\n try:\r\n dct[c]+=1\r\n except:\r\n dct[c]=1\r\n elif(q==\"-\"):\r\n c=int(a.translate(t))\r\n try:\r\n dct[c] -= 1\r\n except:\r\n dct[c] = 1\r\n else:\r\n c=int(a.translate(t))\r\n try:\r\n print(dct[c])\r\n except:\r\n print(0)", "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 Counter, List\r\n\r\nsys.setrecursionlimit(99999)\r\n\r\nmp = collections.defaultdict(int)\r\n\r\nfor _ in range(int(input())):\r\n c, x = input().split()\r\n if c == \"+\":\r\n n = len(x)\r\n flag = \"\"\r\n for j in range(n - 1, -1, -1):\r\n if x[j] in \"02468\":\r\n flag = \"0\" + flag\r\n else:\r\n flag = \"1\" + flag\r\n mp[flag] += 1\r\n elif c == \"-\":\r\n n = len(x)\r\n flag = \"\"\r\n for j in range(n - 1, -1, -1):\r\n if x[j] in \"02468\":\r\n flag = \"0\" + flag\r\n else:\r\n flag = \"1\" + flag\r\n mp[flag] -= 1\r\n else:\r\n ans = 0\r\n while x and x[0] == '0':\r\n x = x[1:]\r\n if not x:\r\n x = \"0\"\r\n while len(x) < 19:\r\n ans += mp[x]\r\n x = \"0\" + x\r\n print(ans)\r\n", "num = int(input())\r\nmultiset = [0] * 2 ** 18\r\nt = str.maketrans('0123456789', '0101010101')\r\n\r\nwhile num:\r\n opr = input().split()\r\n if opr[0] == '+':\r\n multiset[int(opr[1].translate(t), 2)] += 1\r\n elif opr[0] == '-':\r\n multiset[int(opr[1].translate(t), 2)] -= 1\r\n elif opr[0] == '?':\r\n print(multiset[int(opr[1], 2)])\r\n num -= 1\r\n", "n = int(input())\r\ng = [0] * 262144\r\nfor _ in range(n):\r\n event, digit = input().split()\r\n digit = int(''.join(list(map(lambda x: str(int(x in '13579')), digit))), 2)\r\n if event == '?':\r\n print(g[digit])\r\n elif event == '+':\r\n g[digit] += 1\r\n else:\r\n g[digit] -= 1", "t=int(input())\nT=str.maketrans('0123456789','0101010101')\nl=[0]*300000\nfor _ in ' '*t:\n a,b=input().split()\n if a=='?':print(l[int(b,2)])\n else:l[int(b.translate(T),2)]+=1if a=='+'else -1\n\t \t\t\t\t\t\t\t\t\t \t \t\t\t \t\t \t\t\t", "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\nclass Tree:\r\n def __init__(self):\r\n self.children = ['0']*2\r\n self.count = 0\r\n\r\nclass Main:\r\n def __init__(self):\r\n self.root = self.getNode()\r\n \r\n def getNode(self):\r\n return Tree()\r\n \r\n def insert(self,s):\r\n head = self.root\r\n n = len(s)\r\n for i in range(n):\r\n x = int(s[i]) % 2\r\n if head.children[x] == '0':\r\n head.children[x] = self.getNode()\r\n head = head.children[x]\r\n head.count += 1\r\n \r\n def fun(self,s):\r\n head = self.root\r\n n = len(s)\r\n c = 0\r\n for i in range(n):\r\n x = int(s[i]) % 2\r\n if head.children[x] == '0':\r\n return c\r\n head = head.children[x]\r\n if head.count >= 1:\r\n if all(int(j)%2 == 0 for j in s[i+1:]):\r\n c += head.count\r\n x = 0\r\n while head.children[x] != '0':\r\n head = head.children[x]\r\n c += head.count\r\n return c\r\n \r\n def remove(self,s):\r\n head = self.root\r\n n = len(s)\r\n for i in range(n):\r\n x = int(s[i]) % 2 \r\n if head.children[x] == '0':\r\n head.children[x] = self.getNode()\r\n head = head.children[x]\r\n head.count -= 1\r\n head.isEnd = False\r\n \r\n \r\nt = Main()\r\nN = int(input())\r\nfor i in range(N):\r\n S = input()\r\n if S[0] == '+':\r\n a = S[1:][::-1].strip()\r\n t.insert(a)\r\n elif S[0] == \"-\":\r\n a = S[1:][::-1].strip()\r\n t.remove(a)\r\n else:\r\n a = S[1:][::-1].strip()\r\n print(t.fun(a))\r\n ", "from collections import defaultdict\r\nfrom sys import stdin, stdout\r\n\r\ndef convertNum(val):\r\n digs = list(map(int, val))\r\n res = ''.join((str(d & 1) for d in digs))\r\n return '0' * (18 - len(res)) + res\r\n\r\ndef convertPat(pat):\r\n return '0' * (18 - len(pat)) + pat\r\n\r\ncnt = defaultdict(int)\r\nfor _ in range(int(stdin.readline())):\r\n op = stdin.readline().split()\r\n if op[0] == '+':\r\n cnt[convertNum(op[1])] += 1\r\n elif op[0] == '-':\r\n cnt[convertNum(op[1])] -= 1\r\n elif op[0] == '?':\r\n stdout.write('%d\\n' % cnt[convertPat(op[1])])\r\n else:\r\n raise Exception", "from sys import stdin\n\n\ndef main():\n cnt = [0] * 2 ** 18\n t = str.maketrans(\"0123456789\", \"0101010101\")\n _, *l = stdin.read().splitlines()\n for sign, s in map(str.split, l):\n if sign == '?':\n print(cnt[int(s, 2)])\n else:\n cnt[int(s.translate(t), 2)] += 1 if sign == '+' else -1\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nfrom collections import Counter\r\nfrom sys import stdin\r\n\r\ninput()\r\nc = [0]*2**18\r\ndeg = [0]*18\r\nfor i in range(18):\r\n\tdeg[i] = 2**i\r\nt=str.maketrans(\"0123456789\",\"0101010101\")\r\nfor ch,n in map(str.split,stdin):\r\n\t\r\n\tif ch == '?':\r\n\t\tprint(c[int(n, 2)])\r\n\tn = n.translate(t)\r\n\tif ch == '+':\r\n\t\tc[int(n,2)] += 1\r\n\t\r\n\tif ch == '-':\r\n\t\tc[int(n,2)] -= 1\r\n\t\r\n\t" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom collections import defaultdict\r\n\r\nN,X = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nM = max(A)\r\n\r\nans = 0\r\nlib = defaultdict(int)\r\nfor a in A:\r\n ans+=lib[a^X]\r\n lib[a]+=1\r\n \r\nprint(ans)\r\n\r\n\r\n", "from collections import defaultdict\r\nn, x = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\n\r\ndic = defaultdict(int)\r\nans = 0\r\nfor i in nums:\r\n target = x^i\r\n if target in dic:\r\n ans += dic[target]\r\n dic[i] += 1\r\n\r\nprint(ans)\r\n\r\n", "# If you win, you live. You cannot win unless you fight.\r\nfrom math import sin\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nimport heapq\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict as unsafedict,deque,Counter as unsafeCounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom math import gcd\r\nfrom random import randint\r\nrandom = randint(1, 10 ** 9)\r\nmod=998244353\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\nclass myDict:\r\n def __init__(self,func):\r\n self.RANDOM = randint(0,1<<32)\r\n self.default=func\r\n self.dict={}\r\n def __getitem__(self,key):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n self.dict[myKey]=self.default()\r\n return self.dict[myKey]\r\n def get(self,key,default):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n return default\r\n return self.dict[myKey]\r\n def __setitem__(self,key,item):\r\n myKey=self.RANDOM^key\r\n self.dict[myKey]=item\r\n def getKeys(self):\r\n return [self.RANDOM^i for i in self.dict]\r\n def __str__(self):\r\n return f'{[(self.RANDOM^i,self.dict[i]) for i in self.dict]}'\r\n\r\nn,x=rd()\r\na=list(rd())\r\ncnt=unsafeCounter(a)\r\nans=0\r\nvis=unsafedict(int)\r\nfor i in cnt:\r\n if vis[i]:\r\n continue\r\n res=i^x\r\n vis[i]=1\r\n vis[res]=1\r\n if res==i:\r\n ans+=(cnt[i]*(cnt[i]-1))//2\r\n else:\r\n ans+=(cnt[i]*cnt[res])\r\nprint(ans)\r\n", "n,x=map(int,input().split())\r\nd={}\r\na=0\r\nfor i in map(int,input().split()):\r\n a+=d.get(i^x,0)\r\n d[i]=d.get(i,0)+1\r\nprint(a)", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\n# n,m=map(int,input().split())\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\ndef lcm(n):\r\n ans=1\r\n for i in range(2,n):\r\n ans=(ans*i)//(gcd(ans,i))\r\n return(ans)\r\ndef main():\r\n n,x=map(int,input().split())\r\n arr=list(map(int, input().split()))\r\n dic={}\r\n dic[arr[0]]=1\r\n ct=0\r\n for i in range(1,n):\r\n g=x^arr[i]\r\n if(g in dic):\r\n ct+=dic[g]\r\n if(arr[i] in dic):\r\n dic[arr[i]]+=1\r\n else:\r\n dic[arr[i]]=1\r\n print(ct)\r\nmain()", "from collections import defaultdict\r\n\r\n\r\nn, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = defaultdict(int)\r\nans = 0\r\n\r\nfor num in a:\r\n dif = x^num\r\n ans += count[dif]\r\n count[num] += 1\r\n\r\nprint(ans) \r\n ", "\"\"\" Prositka\r\n6.11.2022\"\"\"\r\n\r\nn, x = map(int, input().split())\r\nl, res = [0] * 131073, 0\r\nfor a in map(int, input().split()):\r\n res, l[a] = res + l[a ^ x], l[a] + 1\r\nprint(res)", "def solve():\r\n n, x = input().split()\r\n x = int(x)\r\n b = dict()\r\n # count repeated elements\r\n count = 0\r\n \r\n for i in input().split():\r\n i = int(i)\r\n if i in b:\r\n b[i] += 1\r\n else:\r\n b[i] = 1\r\n \r\n if x == 0:\r\n for i in b.values():\r\n count = count + (i*(i - 1))//2\r\n else:\r\n for key in b:\r\n if b.__contains__(key ^ x):\r\n count = count + b[key ^ x]*b[key]\r\n count = count // 2\r\n print(count)\r\n \r\nsolve()", "n,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nmp = dict() \r\ncnt = 0\r\nmp[a[-1]]=1\r\nfor i in range(n-2,-1,-1):\r\n y = x^a[i]\r\n cnt+= mp.get(y,0)\r\n mp[a[i]] = mp.get(a[i],0)+1\r\n \r\nprint(cnt)", "import sys, collections\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn, x = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nm = collections.Counter()\r\nres = 0\r\nfor i in a:\r\n res += m[i ^ x]\r\n m[i] += 1\r\n \r\nprint(res)", "from collections import Counter\r\nn,x=map(int,input().split())\r\nc=Counter()\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in a:\r\n if c[x^i]:\r\n res+=c[x^i]\r\n c[i]+=1\r\nprint(res)", "# 2022-08-15 23:22:25.776455\n# https://codeforces.com/problemset/problem/742/B\nimport sys\nfrom collections import Counter\n\n_DEBUG = True\nif not _DEBUG:\n input = sys.stdin.readline\n # print = sys.stdout.write\n\n\ndef proc(n, x, a):\n c = Counter()\n ans = 0\n for e in a:\n ans += c[e ^ x]\n c[e] += 1\n return ans\n\n\nn, x = map(int, input().split())\na = list(map(int, input().split()))\n\nprint(proc(n, x, a))\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfreq = {}\r\n\r\nfor i in range(n):\r\n if (a[i] ^ x) in freq:\r\n count += freq[a[i] ^ x]\r\n \r\n if a[i] in freq:\r\n freq[a[i]] += 1\r\n else:\r\n freq[a[i]] = 1\r\n\r\nprint(count)\r\n", "n, x = [int(x) for x in input().split()]\r\n\r\nl = [int(x) for x in input().split()]\r\n\r\nla = [0]*int(10e5+5)\r\n\r\nans = 0\r\n\r\nfor i in l:\r\n ans += la[i ^ x]\r\n la[i] += 1\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nc = 0\r\nd = {}\r\n\r\nfor i in l:\r\n x = i ^ k\r\n if x in d:\r\n c += d[x]\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n\r\nprint(c)\r\n", "#import io, os\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, x = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nfreq = {}\r\n\r\nfor i in arr:\r\n if str(i) in freq:\r\n\r\n freq[str(i)] += 1\r\n\r\n else:\r\n\r\n freq[str(i)] = 1\r\n\r\n\r\ncounter = 0\r\n\r\nfor i in arr:\r\n\r\n zor = i ^ x\r\n\r\n if x == 0:\r\n\r\n if str(zor) in freq and freq[str(zor)] > 1:\r\n\r\n counter += freq[str(zor)] - 1\r\n \r\n elif str(zor) in freq and freq[str(zor)] > 0:\r\n\r\n counter += freq[str(zor)]\r\n\r\nprint(counter // 2)" ]

[ "n=int(input())\r\nl=[]\r\nl1=[]\r\nfor i in range(n):\r\n l.append([int(j) for j in input().split()])\r\n l1.append(0)\r\ni=0\r\nwhile (i<n):\r\n if (l1[i]==0):\r\n l1[i]=1\r\n v=l[i][0]\r\n d=0\r\n for j in range(i+1,n):\r\n if (l1[j]==0):\r\n l[j][2]-=(v+d)\r\n if (v>=1):\r\n v-=1\r\n if (l[j][2]<0):\r\n l1[j]=-1\r\n d+=l[j][1]\r\n i+=1\r\nprint (l1.count(1), end = '\\n')\r\nfor i in range(n):\r\n if (l1[i]==1):\r\n print (i+1, end= ' ')", "T = int(input())\r\nchilds = []\r\nfor i in range(1, T+1):\r\n child = list(map(int, input().split(' ')))\r\n child.insert(0, i)\r\n childs.append(child)\r\n\r\nc_l = []\r\ncheck = True\r\nwhile check:\r\n at_o = childs.pop(0)\r\n c_l.append(at_o[0])\r\n for i in range(len(childs)):\r\n childs[i][3] -= at_o[1]\r\n at_o[1] -= 1\r\n if at_o[1] <= 0:\r\n break\r\n\r\n if len(childs) <= 0:\r\n break\r\n\r\n i = 0\r\n run = True\r\n while run:\r\n if childs[i][3] < 0:\r\n at_h = childs.pop(i)\r\n for j in range(i, len(childs)):\r\n childs[j][3] -= at_h[2]\r\n # run = False\r\n i -= 1\r\n i += 1\r\n if i > len(childs)-1:\r\n run = False\r\n\r\n if len(childs) <= 0:\r\n check = False\r\n\r\nprint(len(c_l))\r\nprint(*c_l)\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\nv = [ list(map(int, input().split())) for i in range(n)]\r\n\r\nres = []\r\n\r\nfor i in range(n):\r\n\tif v[i][2] >= 0:\r\n\t\tres.append(i + 1)\r\n\t\tdec = 0\r\n\t\tfor j in range(i + 1, n):\r\n\t\t\tif v[j][2] >= 0:\r\n\t\t\t\tif v[i][0] > 0:\r\n\t\t\t\t\tv[j][2] -= v[i][0]\r\n\t\t\t\t\tv[i][0] -= 1\r\n\t\t\t\tv[j][2] -= dec\r\n\t\t\t\tif v[j][2] < 0: dec += v[j][1]\r\n\r\nprint(len(res))\r\nprint(\" \".join(map(str, res)))", "ans=0\r\nl = []\r\nt = int(input())\r\nfor i in range(t):\r\n n,m,k = map(int,input().split())\r\n l.append([n,m,k])\r\n\r\nans=0\r\np = []\r\nfor i in range(t):\r\n\r\n if l[i][2]>=0:\r\n k = 0\r\n v = 0\r\n for j in range(i+1,t):\r\n if l[j][2]>=0:\r\n l[j][2]-=(max(0,l[i][0]-k)+v)\r\n if l[j][2]<0:\r\n v+=l[j][1]\r\n l[j][1]=0\r\n k+=1\r\n p.append(i+1)\r\n #print(l)\r\n\r\nprint(len(p))\r\nprint(*p)\r\n\r\n\r\n \r\n \t\t \t\t \t\t\t\t\t\t \t\t\t \t\t \t\t", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/15/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\nclass ListNode:\n def __init__(self, v, d, p, index):\n self.v = v\n self.d = d\n self.p = p\n self.index = index\n self.left = None\n self.right = None\n\n\ndef list2a(head):\n a = []\n h = head\n while h:\n a.append(h.p)\n h = h.right\n return a\n\n\ndef solve(N, A):\n head = ListNode(A[0][0], A[0][1], A[0][2], 1)\n h = head\n for i in range(1, N):\n v, d, p = A[i]\n node = ListNode(v, d, p, i + 1)\n h.right = node\n node.left = h\n h = node\n \n ans = []\n h = head\n while h:\n ans.append(h.index)\n nh = h.right\n cry = h.v\n while nh and cry > 0:\n nh.p -= cry\n cry -= 1\n nh = nh.right\n \n # print(list2a(head))\n ch = h\n nh = h.right\n while nh:\n if nh.p < 0:\n cry = nh.d\n dh = nh.right\n while dh:\n dh.p -= cry\n dh = dh.right\n\n ch.right = nh.right\n if nh.right:\n nh.right.left = ch\n \n else:\n ch = nh\n nh = nh.right\n h = h.right\n \n # print(list2a(head))\n \n print(len(ans))\n print(' '.join(map(str, ans)))\n \n \n \n \n \n\n \nN = int(input())\nA = []\nfor i in range(N):\n v, d, p = map(int, input().split())\n A.append([v, d, p])\n\nsolve(N, A)\n", "n=int(input())\r\na=[[i+1]+list(map(int,input().split())) for i in range(n)]\r\nans=[]\r\ndef go():\r\n pp=0\r\n global a\r\n for j in range(len(a)):\r\n a[j][3]-=pp\r\n if a[j][3]<0: pp+=a[j][2]\r\n a=[a[i] for i in range(len(a)) if a[i][3]>=0]\r\n return len(a)\r\n\r\nwhile go():\r\n nom,v,d,p=a.pop(0)\r\n ans+=[str(nom)]\r\n j=0\r\n while v>0 and j<len(a): a[j][3]-=v; v-=1; j+=1\r\nprint(len(ans))\r\nprint(' '.join(ans))", "n = int(input())\nkids = []\nfor i in range(1, n+1):\n kids.append([int(x) for x in input().split()] + [i])\nkids.reverse()\nans = []\nwhile kids:\n v, d, p, k = kids.pop()\n ans.append(k)\n for i in range(max(-v,-len(kids)), 0):\n kids[i][2] -= v+i+1\n for i in range(len(kids)-1, -1, -1):\n if kids[i][2] < 0:\n for j in range(i):\n kids[j][2] -= kids[i][1]\n kids.pop(i)\nprint(len(ans))\nfor kid in ans: print(kid, end = ' ')\n \n", "n = int(input())\nv, d, p = map(lambda x: [0 for i in range(n)], range(3))\nfor i in range(n):\n\tv[i], d[i], p[i] = map(int, input().split())\nans = []\nfor i in range(n):\n\tif p[i] < 0: continue\n\tans.append(i + 1)\n\tx, y = v[i], 0\n\tq = []\n\tfor j in range(i+1, n):\n\t\tif p[j] >= 0:\n\t\t\tp[j] -= x + y\n\t\t\tif x > 0: x -= 1\n\t\t\tif p[j] < 0:\n\t\t\t\ty += d[j]\nprint(len(ans))\nprint(' '.join(map(str, ans)))\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nvdp=[list(map(int,input().split())) for i in range(n)]\r\nans=[]\r\nfor i in range(n):\r\n if vdp[i][2]>=0:\r\n ans.append(i+1)\r\n dec=0\r\n for j in range(i+1,n):\r\n if vdp[j][2]>=0:\r\n if vdp[i][0]>0:\r\n vdp[j][2]-=vdp[i][0]\r\n vdp[i][0]-=1\r\n vdp[j][2]-=dec\r\n if vdp[j][2]<0:\r\n dec+=vdp[j][1]\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\narr, res = [], []\r\nfor i in range(n):\r\n arr.append([int(j) for j in input().split()])\r\n res.append(0)\r\nfor i in range(n):\r\n if res[i] != 0:\r\n continue\r\n res[i] = 1\r\n v = arr[i][0]\r\n d = 0\r\n for j in range(i+1, n):\r\n if res[j] != 0:\r\n continue\r\n arr[j][2] -= v + d\r\n if v >= 1:\r\n v -= 1\r\n if arr[j][2] < 0:\r\n res[j] = -1\r\n d += arr[j][1]\r\nprint(res.count(1), end='\\n')\r\nfor i in range(n):\r\n if res[i] == 1:\r\n print(i+1, end= ' ')\r\n" ]

[ "from math import *\r\nn,r = map(int,input().split()) \r\nprint(n*r*r/(1/tan(pi/(2*n))+1/tan(pi/n)))", "# /**\r\n# * author: brownfox2k6\r\n# * created: 16/08/2023 16:36:45 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom math import tan, pi\r\n\r\nn, r = map(int, input().split())\r\n\r\nstri = (r**2) / (2 * (1/tan(pi/n) + 1/tan(pi/(2*n))))\r\nprint(2*n*stri)" ]

[ "maxn = 200500\r\ng = [[] for i in range(maxn)] # Array de array g[i][j] en el cual la posicion i representa gcd(a,m)\r\n # y en el array [j] se guardan todos los ¨a¨ con gcd comunes\r\ndp = [0 for i in range(maxn)] # guarda la profundidad mayor para cada nodo\r\nban = [0 for i in range(maxn)] # Array donde se guardan los productos prefijos mod m prohibidos\r\nnxt = [0 for i in range(maxn)] # Array que contiene la proxima posicion ¨i¨ a leer en el array g\r\nm = 0 #\r\n\r\ndef gcd(a, b): #maximo comun divisor de a y b\r\n if (b == 0):\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef exgcd(a, b): # Algoritmo de Euclides extendido (recursivo),\r\n if b == 0: # el cual devuelve los menores x, y\r\n x = 1 # tales que se cumple que\r\n y = 0 # a * x + b * y = gcd(a, b)\r\n return a,x,y #\r\n ret, x, y = exgcd(b, a % b) #\r\n tmp = x #\r\n x = y #\r\n y = tmp -int(a / b) * y #\r\n return ret, x, y #\r\n\r\n\r\ndef f(a, b): # resuelve ecuacion de congruencia lineal\r\n r1, x, y = exgcd(a, m) # haciendo uso del algoritmo de Euclides extendido\r\n if b % r1 != 0: # si !=0\r\n return -1 # la ecuacion no tiene solucion\r\n x = ((x + m) % m * int(b / r1)) % m # solucion de la ecuacion\r\n return x\r\n\r\ndef dfs(p): # Algoritmo DFS (Depth First Search) utilizado para encontrar\r\n if dp[p]!=0: # la secuencia de mayor longitud\r\n return #\r\n res = 0 #\r\n for i in range(p*2,m,p): # recorrido por los nodos\r\n if (len(g[i])>0): #\r\n dfs(i) #\r\n if (dp[i] > res): #\r\n res = dp[i] #\r\n nxt[p] = i # guardar indice i para despues recorrer desde la raiz (1) todos los nodos que\r\n if len(g[p])>0: # se encuentran en el camino mas largo e ir accediendo a los elementos asociados a i\r\n res+= len(g[p]) #\r\n dp[p] = res #\r\n\r\n\r\n#print(\"teclee n y m, dar enter e introducir 2da linea listado separados por coma \")\r\na, b = input().split(' ')\r\nn = int(a)\r\nm = int(b)\r\nif n>0:\r\n lista = input().split(' ')\r\nfor i in range(1,n+1):\r\n x = int(lista[i - 1])\r\n ban[x] = 1 #marcar elem x como prohibido\r\nfor i in range(1,m):\r\n if ban[i] == 0:\r\n d = gcd(i, m)\r\n g[d].append(i) #guardando los numeros con gcd =d si no es un elemento prohibido\r\ndfs(1)\r\nban0 = 0\r\nif ban[0] == ban0: #verificar si 0 no es elemento prohibido, en ese caso se añade a la secuencia\r\n ban0=1\r\nprint(dp[1] + ban0) #en dp[1] se encuentra la longitud mayor, [1] (origen del recorrido)\r\nu = 1\r\nx = 1\r\nsec = \"\"\r\nwhile (u != 0): # recorrer nxt para obtener los elementos que estan en la misma clase modulo m\r\n for i in range(0,len(g[u])): #\r\n v = g[u][i]\r\n print(str(f(x, v)) + \" \", end=\" \") #solucion de la ecuacion\r\n x = v\r\n u = nxt[u] # obtener siguiente indice u para recorrer todos los elementos i asociados a u (gcd(i,m)=u)\r\nif ban0==1 :\r\n print(\"0\")\r\n\r\n\r\n", "import sys\r\ndef gcd(p, q):\r\n while q > 0:\r\n r = p % q\r\n p = q\r\n q = r\r\n return p\r\ndef getprimefac(p):\r\n primefacl = 0\r\n primefac = []\r\n for i in range(2, int(p ** 0.5) + 1):\r\n if p % i == 0:\r\n primefac.append(i)\r\n while p % i == 0:\r\n p //= i\r\n primefacl = len(primefac)\r\n if p > 1 and (primefacl == 0 or primefac[-1] != p):\r\n primefac.append(p)\r\n return primefac\r\ndef getinv(n, m):\r\n r0 = m\r\n s0 = 1\r\n t0 = 0\r\n r1 = n\r\n s1 = 0\r\n t1 = 1\r\n while r1 > 0:\r\n q = r0 // r1\r\n r2 = r0 - q * r1\r\n s2 = s0 - q * s1\r\n t2 = t0 - q * t1\r\n r0 = r1\r\n s0 = s1\r\n t0 = t1\r\n r1 = r2\r\n s1 = s2\r\n t1 = t2\r\n if t0 < 0:\r\n t0 += m\r\n return t0\r\nn, m = map(int, sys.stdin.readline().split())\r\ntaboo = [False] * 200009\r\nbest = [0] * 200009\r\nfrom_ = [0] * 200009\r\ncand = [[] for _ in range(200009)]\r\nansl = []\r\nansb = []\r\nif n != 0:\r\n forbidden = list(map(int, sys.stdin.readline().split()))\r\n for t in forbidden:\r\n taboo[t] = True\r\nfor i in range(m):\r\n if not taboo[i]:\r\n pos = gcd(m, i)\r\n if pos == 0:\r\n pos = m\r\n cand[pos].append(i)\r\nbest[1] = len(cand[1])\r\nfor i in range(2, m + 1):\r\n best[i] = len(cand[i])\r\n primefac = getprimefac(i)\r\n for j in primefac:\r\n if best[i] < len(cand[i]) + best[i // j]:\r\n best[i] = len(cand[i]) + best[i // j]\r\n from_[i] = i // j\r\ni = m\r\nwhile i > 0:\r\n for j in range(len(cand[i]) - 1, -1, -1):\r\n ansl.append(cand[i][j])\r\n ansb.append(i)\r\n i = from_[i]\r\nsys.stdout.write(str(len(ansl)) + '\\n')\r\nsys.stdout.write(str(ansl[-1]) + ' ')\r\nfor i in range(len(ansl) - 2, -1, -1):\r\n p1 = getinv(ansl[i + 1] // ansb[i + 1], m // ansb[i + 1])\r\n p2 = ansl[i] // ansb[i + 1]\r\n sys.stdout.write(str((p1 * p2) % m) + ' ')\r\nsys.stdout.write('\\n')# 1692695738.5238814" ]

[ "# import sys\r\n# input = sys.stdin.readline\r\n\r\nfor _ in range(1):#int(input())):\r\n s = input()\r\n a, b, c = 0, 0, 0\r\n flag = 0\r\n if (s[0] == 'a'): a += 1\r\n for i in range(1, len(s)):\r\n if (s[i] >= s[i-1]):\r\n if (s[i] == 'a'):\r\n a += 1\r\n elif (s[i] == 'b'):\r\n b += 1\r\n elif (s[i] == 'c'):\r\n c += 1\r\n else:\r\n flag = 1\r\n break\r\n if (flag == 0):\r\n if(a > 0 and b > 0 and c > 0):\r\n if (c == a or c == b):\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\")", "s = input(); a = s.count('a'); b = s.count('b'); c = s.count('c')\r\nif a==0 or b==0:\r\n print('No')\r\n exit(0)\r\n\r\nss = \"\"\r\nfor i in sorted(s):\r\n ss = ss + i\r\n#print(ss)\r\n#print(s)\r\nif ss!=s:\r\n print(\"No\")\r\n exit(0)\r\nif (a==c or b==c):\r\n print('Yes')\r\nelse:\r\n print('No')", "s = input();\r\nif s.startswith('a') and s.endswith('c') and (list(s).count('c') == list(s).count('a') or list(s).count('c') == list(s).count('b')) and sorted(list(s)) == list(s) and 'a' in s and 'b' in s:\r\n print('YES');\r\nelse:\r\n print('NO');\r\n", "s=input()\r\nl=sorted(s)\r\nprint(\"YES\" if( (s.count(\"a\")>=1 and s.count(\"b\")>=1) and (s.count(\"c\")==s.count(\"a\") or s.count(\"c\")==s.count(\"b\")) and (s==''.join(l))) else \"NO\")\r\n\r\n", "from itertools import *\r\nz=[\"a\",\"b\",\"c\"]\r\nz=list(permutations(z,2))\r\nk=input()\r\nfor i in z:k=k.replace(\"\".join(i),str(i[0]+\" \"+i[1]))\r\nk=k.split()\r\nif len(k)!=3:print(\"NO\")\r\nelif \"a\" not in k[0] or \"b\" not in k[1] or \"c\" not in k[2] :print(\"NO\")\r\nelse:\r\n if len(k[0])==len(k[2]) or len(k[1])==len(k[2]):print(\"YES\")\r\n else:print(\"NO\")\r\n", "s = input()\nfreq = [0] * 3\nll = {'a': 0 ,'b': 1, 'c': 2 }\n\nmaximo = -1\n\nfor i in range(0,len(s)):\n freq[ll[s[i]]] = freq[ll[s[i]]] + 1\n if maximo <= ll[s[i]]:\n maximo = ll[s[i]]\n else:\n print(\"NO\")\n exit()\n\nif freq[0]== 0 or freq[1] == 0:\n print(\"NO\")\nelif freq[2] == freq[1] or freq[2] == freq[0]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "def f(s):\r\n ia = ib = ic = False\r\n ac = bc = cc = 0\r\n for c in s:\r\n if c == 'a':\r\n ac += 1\r\n ia = True\r\n if ib or ic:\r\n return False\r\n \r\n if c == 'b':\r\n bc += 1\r\n ib = True\r\n if ic:\r\n return False\r\n \r\n if c == 'c':\r\n cc += 1\r\n ic = True\r\n \r\n if cc > 0 and bc > 0 and ac > 0 and (cc == bc or ac == cc):\r\n return True\r\n return False\r\n \r\ns = input()\r\nif f(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nl = len(s)\r\ncount = 0\r\ncount2 = 0\r\ncount3 = 0\r\ncount4 = 0\r\nodd = [\"ba\", \"ca\", \"ac\", \"cb\"]\r\nlenght = len(odd)\r\nif(s.islower()):\r\n for j in range(lenght):\r\n if s.find(odd[j])>0:\r\n count4+=1\r\n if s[0]==\"a\" and s[l-1]==\"c\" and count4==0:\r\n count+=1\r\n for i in range(1,l):\r\n if s[i]==\"a\":\r\n count+=1\r\n if s[i]==\"b\":\r\n count2+=1\r\n if s[i]==\"c\":\r\n count3+=1\r\n \r\n if count >= 1 and count2 >=1 and (count3==count or count3==count2 or (count3==count and count3==count3)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nchars = ['a', 'b', 'c']\r\ncount = [s.count(c) for c in chars]\r\na, b, c = count \r\ncond = True \r\n\r\ntry:\r\n part = s.partition('b'*b)\r\nexcept ValueError:\r\n cond = False\r\n\r\nif cond:\r\n if (a == 0 or b == 0 or c==0) or (c != a and c != b): \r\n cond = False\r\n\r\nif cond:\r\n for i in range(3):\r\n if part[i] != chars[i]*count[i]:\r\n cond = False\r\n\r\nprint('YES' if cond else 'NO')\r\n\r\n", "def main():\r\n s = input()\r\n cnt_a = 0\r\n cnt_b = 0\r\n cnt_c = 0\r\n for c in s:\r\n if c == 'a':\r\n if cnt_b != 0 or cnt_c != 0:\r\n print('NO')\r\n return\r\n cnt_a += 1\r\n if c == 'b':\r\n if cnt_c != 0:\r\n print('NO')\r\n return\r\n cnt_b += 1\r\n if c == 'c':\r\n cnt_c += 1\r\n if cnt_a != 0 and cnt_b != 0 and (cnt_c == cnt_a or cnt_c == cnt_b):\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nmain()", "I = lambda:int(input())\r\nID = lambda:map(int, input().split())\r\nIL = lambda:list(ID())\r\ns = input()\r\na = s.count('a')\r\nb = s.count('b')\r\nc = s.count('c')\r\nn = len(s)\r\naa = s[:a]\r\nba = s[a:a+b]\r\nca = s[a+b:]\r\nif (c ==a or c == b) and list(set(aa))==['a'] and list(set(ba))== ['b']:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\r\n\r\ns = input()\r\nC = Counter(s)\r\n\r\nprint('YES' if s==''.join(sorted(s)) and len(C) > 2\r\n and C['c'] in (C['a'], C['b']) else 'NO')", "s = input()\r\na, b, c = 0, 0, 0\r\naf, bf, cf = False, False, False\r\nres = True\r\nfor i in range(len(s)):\r\n if not res:\r\n break\r\n if i == 0:\r\n if s[i] != 'a':\r\n res = False\r\n break\r\n else:\r\n a += 1\r\n af = True\r\n else:\r\n if af and bf and cf:\r\n if (s[i] != 'c'):\r\n res = False\r\n break\r\n else:\r\n c += 1\r\n elif af and bf:\r\n if (s[i] != 'b') and (s[i] != 'c'):\r\n res = False\r\n break\r\n elif s[i] == 'b':\r\n b += 1\r\n elif s[i] == 'c':\r\n cf = True\r\n c += 1\r\n elif af:\r\n if (s[i] != 'a') and (s[i] != 'b'):\r\n res = False\r\n break\r\n elif s[i] == 'a':\r\n a += 1\r\n elif s[i] == 'b':\r\n b += 1\r\n bf = True\r\n#print(a, b, c)\r\nif res and ((a == c and a and c) or (b == c and b and c)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\nac = bc = cc = 0\nfor i in range(len(s)):\n\tif i>=1:\n\t\tif s[i]<s[i-1]:\n\t\t\tprint(\"NO\")\n\t\t\tbreak\n\tif s[i] == 'a':\n\t\tac += 1\n\telif s[i] == 'b':\n\t\tbc += 1\n\telse:\n\t\tcc += 1\nelse:\n\tif (ac == cc or bc == cc) and (ac>=1 and bc>=1):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n", "s = input()\r\nflag = 0\r\nans = 1\r\naa = s.count(\"a\")\r\nbb = s.count(\"b\")\r\ncc = s.count(\"c\")\r\nif min(aa,bb) == 0 or (bb != cc and aa != cc):\r\n print(\"NO\")\r\nelse:\r\n for i in s:\r\n if flag == 0:\r\n if i == \"b\":\r\n flag = 1\r\n continue\r\n if i != \"a\":\r\n ans = 0\r\n break\r\n elif flag == 1:\r\n if i == \"c\":\r\n flag = 2\r\n continue\r\n if i != \"b\":\r\n ans = 0\r\n break\r\n else:\r\n if i != \"c\":\r\n ans = 0\r\n break\r\n if ans == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\na = [s.count('a'), s.count('b'), s.count('c')]\r\nif s==''.join(sorted([ch for ch in s])) and min(a)>0 and a[2] in a[:2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nif s != ''.join(sorted(s)):\r\n print('NO')\r\n exit()\r\n \r\na = s.count('a')\r\nb = s.count('b')\r\nc = s.count('c')\r\nif a > 0 and b > 0 and (c == a or c == b):\r\n print('YES')\r\nelse:\r\n print('NO')", "# LUOGU_RID: 101739063\nimport re\r\ns = input()\r\nif not re.fullmatch('a+b+c+', s) or s.count('c') != s.count('a') and s.count('c') != s.count('b'):\r\n print('NO')\r\nelse:\r\n print('YES')", "from collections import *\nfrom functools import reduce\nimport sys\ninput = sys.stdin.readline\n\ndef factors(n): \n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\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\ns = st()\ncnt = Counter(s)\nif (cnt['c']!=cnt['b'] and cnt['c']!=cnt['a']) or not cnt['a'] or not cnt['b']:\n print('NO')\n exit()\n\nsn = 'a'*cnt['a'] + 'b'*cnt['b'] + 'c'*cnt['c']\nprint('YES' if s == sn else 'NO')", "import sys\r\n\r\ns = input()\r\na = 0\r\nb = 0\r\nc = 0\r\nstate = 'a'\r\nfor i in s:\r\n if state == 'a':\r\n if i == 'a':\r\n a += 1\r\n elif i == 'b':\r\n b += 1\r\n state = 'b'\r\n elif i == 'c':\r\n state = 'c'\r\n c += 1\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\n elif state == 'b':\r\n if i == 'a':\r\n print(\"NO\")\r\n sys.exit()\r\n elif i == 'b':\r\n b += 1\r\n elif i == 'c':\r\n state = 'c'\r\n c += 1\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\n elif state == 'c':\r\n if i == 'a':\r\n print(\"NO\")\r\n sys.exit()\r\n elif i == 'b':\r\n print(\"NO\")\r\n sys.exit()\r\n elif i == 'c':\r\n state = 'c'\r\n c += 1\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\nif a == 0 or b == 0 or (c != a and c != b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "st = input()\r\nif 'a' in st and 'b' in st and 'c' in st and (st.count('c') == st.count('a') or st.count('c') == st.count('b')):\r\n f = False\r\n for i, j in enumerate(st[:-1]):\r\n if (j == st[i+1]) or (j == 'a' and st[i+1] == 'b') or (j == 'b' and st[i+1] == 'c'):\r\n continue\r\n else:\r\n print('NO')\r\n f = True\r\n break\r\n if f == False:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=str(input())\r\na=[]\r\nna=s.count(\"a\")\r\nnb=s.count(\"b\")\r\nnc=s.count(\"c\")\r\nif (nc==na or nc==nb) and na>0 and nb>0:\r\n if \"ba\" in s or\"cb\" in s or \"ca\" in s:\r\n print(\"NO\")\r\n\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "state = 1\r\n\r\ns = input()\r\n\r\n\r\nif ((s.count('a') == 0) or (s.count('b') == 0) or ((s.count('c') != s.count('a') and (s.count('c') != s.count('b'))))):\r\n print('NO')\r\n exit()\r\n\r\nfor el in s:\r\n if el == 'b':\r\n state = max(state, 2)\r\n if el == 'c':\r\n state = max(state, 3)\r\n if state != 1 and el == 'a':\r\n print(\"NO\")\r\n exit()\r\n if state != 2 and el == 'b':\r\n print(\"NO\")\r\n exit()\r\n if state != 3 and el == 'c':\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")", "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\ncnt = [0] * 3\r\nfor i in s:\r\n cnt[i - 97] += 1\r\nans = \"YES\"\r\nfor i in range(len(s) - 1):\r\n if not s[i] <= s[i + 1]:\r\n ans = \"NO\"\r\n break\r\nif cnt[0] ^ cnt[2] and cnt[1] ^ cnt[2]:\r\n ans = \"NO\"\r\nif not min(cnt):\r\n ans = \"NO\"\r\nprint(ans)", "has_letter = {}\r\nfor i in range (0, 3):\r\n letter = chr(ord('a') + i)\r\n has_letter[letter] = 0\r\n\r\nstr_abc = input()\r\nnow = 'a'\r\nvalid = True\r\nfor char in str_abc:\r\n if(char < now):\r\n valid = False\r\n break\r\n now = char\r\n has_letter[char] += 1\r\n\r\n# print(has_letter)\r\n\r\nif valid == False or has_letter['a'] * has_letter['b'] * has_letter['c'] == 0 or (has_letter['a'] != has_letter['c'] and has_letter['b'] != has_letter['c']):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import re\n\ninp = input().strip()\n\nif re.match(r'^a+b+c*$', inp) and inp.count('c') in [inp.count('a'), inp.count('b')]:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "l=list(input())\r\nd=sorted(l)\r\nx,y,z=l.count('a'),l.count('b'),l.count('c')\r\nif(l==d):\r\n if(x==0 or y==0 or z==0):\r\n print(\"NO\")\r\n elif(x==z or y==z):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin\n\nrInt = lambda : int(stdin.readline().strip(\"\\n\"))\nrIntArray = lambda : [int(x) for x in stdin.readline().split()]\n\nrString = lambda : stdin.readline().strip(\"\\n\")\nrStrArray = lambda : [x for x in stdin.readline().split()]\n\n#for _ in range(rInt()):\n\nstretch = 'a'\ncou = {'a': 0, 'b': 0, 'c': 0}\n\nflag = True\n\nfor i in rString():\n\tif i < stretch: flag = False\n\tif i != stretch: stretch = i\n\tcou[i] += 1\n\nif cou['a'] == 0 or cou['b'] == 0: flag = False\nif cou['c'] != cou['a'] and cou['c'] != cou['b']: flag = False\n\nprint(\"YES\" if flag else \"NO\")\n\n", "string = list(input().strip())\r\nwant = sorted(string)\r\n\r\nfor i in range(len(string)):\r\n if want[i] != string[i]:\r\n print(\"NO\")\r\n quit()\r\n\r\na, b, c = 0, 0, 0\r\n\r\nfor i in string:\r\n if i == 'a':\r\n a += 1\r\n if i == 'b':\r\n b += 1\r\n if i == 'c':\r\n c += 1\r\n\r\nif a > 0 and b > 0:\r\n if c == a or c == b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "_str =input()\na =b =c =0\nai =_str.rfind('a')\nbi =_str.find('b')\nci =_str.find('c')\nfor char in _str:\n\tif char == 'a':\n\t\ta+=1\n\telif char == 'b':\n\t\tb+=1\n\telif char == 'c':\n\t\tc+=1\nif (c == a or c == b) and (ai!= -1 and bi != -1 and ci != -1) and (_str.rfind('a') < _str.find('b') and _str.rfind('b') < _str.find('c')):\n\tprint ('YES')\nelse:\n\tprint ('NO')", "s = input()\r\nif s[0] != 'a':\r\n print('NO')\r\nelse:\r\n res = ['a']\r\n j = 0\r\n a , b , c = 0, 0 , 0\r\n for i in range(len(s)):\r\n if s[i] != res[j]:\r\n res.append(s[i])\r\n j += 1\r\n if s[i] == 'a':\r\n a += 1\r\n if s[i] == 'b':\r\n b += 1\r\n if s[i] == 'c':\r\n c += 1\r\n if len(res) == 3:\r\n if res[0] == 'a' and res[1] == 'b' and res[2] == 'c':\r\n if c == a or c == b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n\r\n else:\r\n print('NO')\r\n", "from sys import stdin\nfrom collections import deque\nimport sys\nimport math\n\ndef ist(s):\n if s.rindex('a')<s.index('b') and s.rindex('b')<s.index('c')\\\n and s.rindex('c')>s.rindex('a') and s.rindex('c')>s.rindex('b'):\n return True\n return False\n\ns = input()\nif (('a' in s) and ('b' in s) and ('c' in s)) and \\\n ist(s) == True and \\\n (s.count('c') == s.count('a') or s.count('c') == s.count('b')):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\r\n\r\nx1 = s.find('a')\r\nx2 = s.find('b')\r\nx3 = s.find('c')\r\n\r\ns1 = s[x1 : x2]\r\ns2 = s[x2 : x3]\r\ns3 = s[x3 : ]\r\n\r\n#print(s1)\r\n#print(s2)\r\n#print(s3)\r\n\r\nif 'b' not in s1 and 'c' not in s1 and 'a' not in s2 and 'c' not in s2 and 'a' not in s3 and 'b' not in s3 and len(s1) > 0 and len(s2) > 0 and len(s3) > 0 and (len(s3) == len(s1) or len(s3) == len(s2)):\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n\r\n", "data = input()\nnum = {\"a\": 0, \"b\": 0, \"c\": 0}\nfa = True\nfb = True\nfor i in data:\n\tif i == \"b\":\n\t\tfa = False\n\tif i == \"c\":\n\t\tfa = False\n\t\tfb = False\n\tif (i == \"a\") and (fa == False):\n\t\tprint(\"NO\")\n\t\tquit()\n\tif (i == \"b\") and (fb == False):\n\t\tprint(\"NO\")\n\t\tquit()\n\tnum[i] += 1\nif (num[\"a\"] == 0) or (num[\"b\"] == 0) or (num[\"c\"] == 0):\n\tprint(\"NO\")\n\tquit()\nif (num[\"c\"] != num[\"a\"]) and (num[\"c\"] != num[\"b\"]):\n\tprint(\"NO\")\n\tquit()\nprint(\"Yes\")\n", "s = input()\r\ni = 0\r\nn = len(s)\r\nwhile i < n-1:\r\n if ord(s[i]) <= ord(s[i+1]):\r\n i += 1\r\n else:\r\n break\r\nif i == n-1 and s.count('a') > 0 and s.count('b') > 0 and (s.count('c') == s.count('a') or s.count('c') == s.count('b')):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nmas = ['']\r\nq = 0\r\nfor i in range(len(s) - 1):\r\n mas[q] += s[i]\r\n if s[i] != s[i+1]:\r\n q += 1\r\n mas.append(\"\")\r\nmas[q] += s[len(s)-1]\r\nif len(mas) == 3 and \"a\" in mas[0] and 'b' in mas[1] and \"c\" in mas[2] and (len(mas[0]) == len(mas[2]) or len(mas[1]) == len(mas[2])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nL=[0,0,0]\r\nss=s.lstrip(\"a\")\r\nL[0]=len(s)-len(ss)\r\nsss=ss.lstrip(\"b\")\r\nL[1]=len(ss)-len(sss)\r\nssss=sss.lstrip(\"c\")\r\nL[2]=len(sss)-len(ssss)\r\nif ssss!=\"\":\r\n print(\"NO\")\r\nelif 0 in L:\r\n print(\"NO\")\r\nelse:\r\n if L[2] in (L[0],L[1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# author: violist\n# created: 01.05.2021 12:20:22\n\nimport sys\ninput = sys.stdin.readline\n\ndef solve1(s):\n a = ''\n ans = 1\n for c in s:\n if c not in a:\n a += c\n\n if a != 'abc':\n ans = 0\n elif s.count('a') != s.count('c') and s.count('b') != s.count('c'):\n ans = 0\n else:\n flag = 0\n for i in range(len(s)):\n if flag == 0:\n if s[i] == 'a':\n pass\n elif s[i] == 'b':\n flag = 1\n else:\n ans = 0\n elif flag == 1:\n if s[i] == 'b':\n pass\n elif s[i] == 'c':\n flag = 2\n else:\n ans = 0\n break\n else:\n if s[i] != 'c':\n ans = 0\n break\n\n return \"YES\" if ans else \"NO\"\n\ndef solve2(s):\n ans = 1\n a = s.count('a')\n b = s.count('b')\n if a and b and (s == 'a' * a + 'b' * b + 'c' * a or s == 'a' * a + 'b' * b + 'c' * b):\n pass\n else:\n ans = 0\n\n return \"YES\" if ans else \"NO\"\n\ns = input()[:-1]\n\nprint(solve2(s))\n", "from collections import defaultdict\r\ns = list(input())\r\nt = sorted(s)\r\nflag = True\r\nif s[0] != \"a\":\r\n flag = False\r\nif s != t:\r\n flag = False\r\ndic = defaultdict(int)\r\nfor i in s:\r\n dic[i] += 1\r\n\r\nif dic[\"a\"] == 0 or dic[\"b\"] == 0:\r\n flag = False\r\n\r\nif dic[\"a\"] != dic[\"c\"] and dic[\"b\"] != dic[\"c\"]:\r\n flag = False\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\ns = input()\r\na, b, c = s.count('a'), s.count('b'), s.count('c')\r\nif re.match(r'a+b+c+$', s) and (a == c or b == c):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = str(input())\nca = x.count('a')\ncb = x.count('b')\ncc = x.count('c')\nif ca == 0 or cb == 0 :\n print('NO')\nelif ca*'a'+cb*\"b\"+cc*\"c\" == x and (cc == ca or cc == cb):\n print('YES')\nelse :\n print('NO')\n", "s = input()\r\nif s[0] != 'a':\r\n print('NO')\r\nelse:\r\n first_a = 0\r\n last_a = 0\r\n for i in range(1, len(s)):\r\n if s[i] == 'a':\r\n last_a = i\r\n first_b = -1\r\n last_b = -1\r\n for i in range(len(s)):\r\n if s[i] == 'b':\r\n if first_b == -1:\r\n first_b = i\r\n last_b = i\r\n else:\r\n last_b = i\r\n first_c = -1\r\n last_c = -1\r\n for i in range(len(s)):\r\n if s[i] == 'c':\r\n if first_c == -1:\r\n first_c = i\r\n last_c = i\r\n else:\r\n last_c = i\r\n \r\n if first_b == -1 or first_c == -1:\r\n print('NO')\r\n elif last_a > first_b:\r\n print('NO')\r\n elif last_b > first_c:\r\n print('NO')\r\n else:\r\n count_a = last_a - first_a + 1\r\n count_b = last_b - first_b + 1\r\n count_c = last_c - first_c + 1\r\n if count_c == count_a or count_c == count_b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "s=input()\r\nfrom collections import Counter\r\nf1=[pos for pos, char in enumerate(s) if char == \"a\"]\r\nf2=[pos for pos, char in enumerate(s) if char == \"b\"]\r\nf3=[pos for pos, char in enumerate(s) if char == \"c\"]\r\nif f1==[] or f2==[] or f3==[]:\r\n print(\"NO\")\r\nelif min(f3)<max(f1) or min(f3)<max(f2) or min(f2)<max(f1):\r\n print(\"NO\")\r\nelse:\r\n res = Counter(s)\r\n if (res[\"c\"])==(res[\"b\"]) or (res[\"c\"])==(res[\"a\"]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "str1=input()\r\nindex=0\r\nstr2='a'*str1.count('a')+'b'*str1.count('b')+'c'*str1.count('c')\r\nif (str1.count('c')==str1.count('b') or str1.count('c')==str1.count('a')) and str1.count('a') and str1.count('b'):\r\n index=1\r\nif str1==str2 and index==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\n\r\ns = input()\r\nm = re.match(r\"^(a+)(b+)(c+)$\", s)\r\nif m:\r\n a, b, c = m.groups()\r\n if len(c) in (len(a), len(b)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\n\ndata = {'a':[], 'b':[], 'c':[]}\n\nfor i in range(len(string)):\n data[string[i]] += [i]\n\nflag = False\na = data.get('a')\nb = data.get('b')\nc = data.get('c')\nif a and b and c:\n if b[0] > a[-1] and c[0] > b[-1]:\n if len(a)==len(c) or len(b)==len(c):\n flag = True\n\nif flag:\n print('YES')\nelse:\n print('NO')\n\n\n", "s=input().strip()\r\na_count=s.count('a')\r\nb_count=s.count('b')\r\nc_count=s.count('c')\r\narr=list(s)\r\narr1=arr.copy()\r\narr1.sort()\r\nif a_count>0 and b_count>0 and (a_count==c_count or b_count==c_count) and arr==arr1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st = input()\r\na = st.count('a')\r\nb = st.count('b')\r\nc = st.count('c')\r\ns = 'a'*a + 'b'*b + 'c'*c\r\n\r\nif a>=1 and b>=1 and (c==a or c==b) and s==st:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\na=s.count('a')\r\nb=s.count('b')\r\nprint(('NO','YES')[a*b and s in('a'*a+'b'*b+'c'*i for i in (a,b))])", "s = input()\r\na = ['ba','ca','ac','cb']\r\nflag = True\r\nfor i in a:\r\n if i in s:\r\n flag = False\r\nif flag == False:\r\n print('NO')\r\nelse:\r\n x = s.count('a')\r\n y = s.count('b')\r\n z = s.count('c')\r\n\r\n if x > 0 and y > 0:\r\n if z == x:\r\n print('YES')\r\n elif z == y:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "import re\r\n\r\nstring = input()\r\nif re.match(\"a+b+c+$\", string):\r\n count = {\"a\": 0, \"b\": 0, \"c\": 0}\r\n for ch in string:\r\n count[ch] += 1\r\n if count[\"a\"] == count[\"c\"] or count[\"b\"] == count[\"c\"]: print(\"YES\")\r\n else: print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns+=\"d\"\r\nl=[]\r\nans=\"\"\r\nfor i in range(0,len(s)-1):\r\n if s[i]==s[i+1]:\r\n ans+=s[i]\r\n else:\r\n ans+=s[i]\r\n l.append(ans)\r\n ans=\"\"\r\nif len(l)!=3:\r\n print(\"NO\")\r\nelse:\r\n a=len(l[0])\r\n b=len(l[1])\r\n c=len(l[2])\r\n if l[0][0]!=\"a\" or l[1][0]!=\"b\" or l[2][0]!=\"c\":\r\n print(\"NO\")\r\n else:\r\n if a==c or b==c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "s = input()\r\na = [0] * 3\r\nk = 0\r\nok = True\r\nfor i in s:\r\n c = ord(i) - ord('a')\r\n if c == k:\r\n a[k] += 1\r\n elif c == k + 1:\r\n k += 1\r\n a[k] += 1\r\n else:\r\n ok = False\r\n break\r\nif a[0] == 0 or a[1] == 0 or (a[0] != a[2] and a[1] != a[2]):\r\n ok = False\r\nif ok: print('YES')\r\nelse: print('NO')", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\ns=input()\r\nn=len(s)-1\r\nc=1\r\nc1,c2,c3=0,0,0\r\nm='a'\r\nfor i in range(n):\r\n if(s[i]==m):\r\n if(m=='a'):\r\n c1+=1\r\n elif(m=='b'):\r\n c2+=1\r\n else:\r\n c3+=1\r\n else:\r\n if(m=='a'):\r\n if(s[i]=='b'):\r\n m='b'\r\n c2+=1\r\n else:\r\n c=0\r\n break\r\n elif(m=='b'):\r\n if(s[i]=='c'):\r\n m='c'\r\n c3+=1\r\n else:\r\n c=0\r\n break\r\n else:\r\n c=0\r\n break\r\nif(c==0):\r\n print(\"NO\")\r\nelse:\r\n if(c1>0 and c2>0 and (c3==c1 or c3==c2)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = str(input())\r\na = s.count('a')\r\nb = s.count('b')\r\nc = s.count('c')\r\nif a == 0 or b == 0:\r\n print('NO')\r\n exit()\r\nif a != c and b != c:\r\n print('NO')\r\n exit()\r\nt = 'a'*a+'b'*b+'c'*c\r\nif s == t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l=list(input())\r\na=b=c=0\r\ndone=0\r\nfor i in range(len(l)):\r\n if l[0]=='a':\r\n a+=1\r\n l.remove('a')\r\n else:\r\n break\r\n\r\nfor j in range(len(l)):\r\n if l[0]=='b':\r\n b+=1\r\n l.remove('b')\r\n elif j=='a':\r\n done=1\r\n break\r\n else:\r\n break\r\n\r\nfor k in range(len(l)):\r\n if l[0]=='c':\r\n c+=1\r\n l.remove('c')\r\n else:\r\n done=1\r\n break\r\n\r\nif done==1:\r\n print(\"NO\")\r\nelse:\r\n if a==0 or b==0 or c==0:\r\n print(\"NO\")\r\n else: \r\n if c==a or c==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "s = input()\r\nl = list(s)\r\ncounta = l.count('a')\r\ncountb = l.count('b')\r\ncountc = l.count('c')\r\n#print(counta,countb,countc)\r\nif(counta>0 and countb>0 and countc>0 and (counta==countc or countb==countc)):\r\n if(s.index('c')>s.rindex('a') and s.index('c')>s.rindex('b') and s.rindex('a')<s.index('b')):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n ", "\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n#inp = open(\"lepus.in\", \"r\"); input = inp.readline; out = open(\"lepus.out\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n \r\n \r\ndef solution():\r\n s = list(input())\r\n s1 = sorted(s)\r\n if s != s1: print(\"NO\")\r\n else:\r\n a = s.count(\"a\")\r\n b = s.count(\"b\")\r\n c = s.count(\"c\")\r\n if a>0 and b>0 and (c == a or c == b): print(\"YES\")\r\n else: print(\"NO\")\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()", "import sys\r\na = list(input())\r\n\r\noj = 'a'\r\nfor i in range(len(a)):\r\n if a[i] != oj:\r\n if oj == 'a' and a[i] == 'b':\r\n oj = 'b'\r\n elif oj == 'b' and a[i] == 'c':\r\n oj = 'c'\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\nC = a.count('c')\r\nA = a.count('a')\r\nB = a.count('b')\r\nif (C == A or C == B) and (A and B and C):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\ncounta = 0\ncountb = 0\ncountc = 0\nadone = 0\nbdone = 0\nfor i in range(len(string)):\n\tif string[i] != 'a' and i == 0:\n\t\tprint(\"NO\")\n\t\tquit()\n\tif string[i] == 'a' and adone == 1:\n\t\tprint(\"NO\")\n\t\tquit()\n\tif string[i] == 'b' and bdone == 1:\n\t\tprint(\"NO\")\n\t\tquit()\n\tif string[i] == 'a':\n\t\tcounta += 1\n\tif string[i] == 'b':\n\t\tadone = 1\n\t\tcountb += 1\n\tif (string[i] == 'c' and countb == 0) or (string[i] == 'c' and countc > counta and countc > countb):\n\t\tprint(\"NO\")\n\t\tquit()\n\tif string[i] == 'c':\n\t\tbdone = 1\n\t\tcountc += 1\nif counta == 0 or countb == 0 or countc == 0 or (countc != counta and countc != countb):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\n\t\n", "\r\n\r\ns = input()\r\n\r\ntwo = (s.count('c') == s.count('a') or s.count('c') == s.count('b'))\r\n\r\nfirst, second, third = 0, 0, 0\r\n\r\nif 'a' in s:\r\n first = s[s.find('a'):s.rfind('a')].count('b') + s[s.find('a'):s.rfind('a')].count('c') == 0\r\nif 'b' in s:\r\n second = s[s.find('b'):s.rfind('b')].count('c') + s[s.find('b'):s.rfind('b')].count('a') == 0\r\nif 'c' in s:\r\n third = s[s.find('c'):s.rfind('c')].count('b') + s[s.find('c'):s.rfind('c')].count('a') == 0\r\n\r\nchars = ''\r\n\r\nfor i in s:\r\n if i not in chars:\r\n chars += i\r\n\r\nif two and first and second and third and chars in 'abc':\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nslen = len(s)\r\n\r\n\r\ndef solve():\r\n\tif s[0] != 'a':\r\n\t\tprint(\"NO\")\r\n\t\treturn \r\n\r\n\ta_count = 1\r\n\tb_count = 0\r\n\tc_count = 0\r\n\r\n\ti = 1\r\n\twhile (i < slen):\r\n\t\t#print(\"got: \", s[i])\r\n\t\tif ((s[i] == 'a') and (s[i - 1] != 'a')):\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn \r\n\t\tif ((s[i] == 'b') and (s[i - 1] == 'c')):\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn \r\n\t\tif ((s[i] == 'c') and (s[i - 1] == 'a')):\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn \r\n\t\tif (s[i] == 'a'):\r\n\t\t\ta_count += 1\r\n\t\telif (s[i] == 'b'):\r\n\t\t\tb_count += 1\r\n\t\telif (s[i] == 'c'):\r\n\t\t\tc_count += 1\r\n\t\t#print(a_count, b_count, c_count)\r\n\t\ti += 1\r\n\r\n\tif ((a_count == 0) or (b_count == 0) or (c_count == 0)):\r\n\t\t#print(\"5\")\r\n\t\tprint(\"NO\")\r\n\t\treturn \r\n\t#print(a_count, b_count, c_count)\r\n\tif ((c_count == a_count) or (c_count == b_count)):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\treturn\r\n\r\nsolve()\r\n", "#py3com\r\n#pycom\r\n#ciphereck\r\n#t=int(input())\r\n#n=list(map(int,input().split()))\r\n#a,b=map(int,input().split())\r\n#print(n)\r\n# n.sort()\r\n#print(*ans) to print list with spaces without brackets\r\nfrom sys import stdin, stdout\r\nfrom math import *\r\ns=input()\r\na=s.count('a')\r\nb=s.count('b')\r\nc=s.count('c')\r\nt=sorted(s)\r\nt=''.join(t)\r\nif a>0 and b>0 and (a==c or b==c) and t==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\ns=input()\r\nss=s\r\ns=tuple(list(s))\r\nd=Counter(s)\r\nres=\"\"\r\nres=res+\"a\"*d['a']\r\nres=res+\"b\"*d['b']\r\nres=res+\"c\"*d['c']\r\nif res==ss and d['a']>0 and d['b']>0 and (d['c']==d['a'] or d['c']==d['b']):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solution(string):\n a = b = c = 0\n i = 0\n for p in string:\n if p != \"a\":\n break\n i += 1\n a += 1\n for p in string[i:]:\n if p != \"b\":\n break\n i += 1\n b += 1\n for p in string[i:]:\n if p != \"c\":\n break\n i += 1\n c += 1\n if a + b + c != len(string) or a == 0 or b == 0 or c == 0:\n return \"NO\"\n elif a == c or b == c:\n return \"YES\"\n else:\n return \"NO\"\n\nstring = input()\nprint(solution(string))\n", "a=input()\r\nc1=a.count(\"a\");c2=a.count(\"b\");c3=a.count(\"c\")\r\nif (c1==c3 or c2==c3) and a==\"a\"*c1+\"b\"*c2+\"c\"*c3 and c1*c2 :print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\na = 0\r\nb = 0\r\nc = 0\r\ni = 0\r\nwhile i < len(s) and s[i] == 'a':\r\n a+=1\r\n i+=1\r\nwhile i < len(s) and s[i] == 'b':\r\n b+=1\r\n i+=1\r\nwhile i < len(s) and s[i] == 'c' :\r\n c+=1\r\n i+=1\r\nif i == len(s) and (a == c or b == c) and a*b!=0:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "\r\ns = input()\r\na = []\r\nx = s.count('a')\r\ny = s.count('b')\r\nz = s.count('c')\r\nfor i in range(0,len(s)):\r\n a.append(s[i])\r\nc = s.count('a')\r\nso = sorted(s)\r\nif (so == a) and (x == z or y == z) and x != 0 and y != 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s=input()\r\na1,a2,b1,b2,c1,c2=-1,-1,-1,-1,-1,-1\r\na,b,c=0,0,0\r\nfor i in range(len(s)):\r\n if s[i]=='a':\r\n a+=1\r\n if a1==-1:\r\n a1=i\r\n a2=i\r\n if s[i]=='b':\r\n b+=1\r\n if b1==-1:\r\n b1=i\r\n b2=i\r\n if s[i]=='c':\r\n c+=1\r\n if c1==-1:\r\n c1=i\r\n c2=i\r\nif a1==0 and a2<b1 and b2<c1 and (a==c or b==c):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\na=s.count('a')\nb=s.count('b')\nif a and b and (s=='a'*a+'b'*b+'c'*a or s=='a'*a+'b'*b+'c'*b):\n\tprint('YES')\nelse:\n\tprint('NO')", "inps = input()\n\ncountmap = {'a': 0, 'b': 0, 'c': 0}\n\n\nif inps.count(\"a\") == 0 or inps.count(\"b\") == 0:\n print(\"NO\")\n exit()\n\nif \"ab\" in inps and \"bc\" in inps and \"ca\" not in inps and \"cb\" not in inps and \"ba\" not in inps:\n if inps.count(\"c\") == inps.count(\"a\") or inps.count(\"c\") == inps.count(\"b\"):\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "import fileinput\r\nimport sys\r\n\r\nclass MyInput(object) :\r\n def __init__(self,default_file=None) :\r\n self.fh = sys.stdin\r\n if (len(sys.argv) >= 2) : self.fh = open(sys.argv[1])\r\n elif default_file is not None : self.fh = open(default_file)\r\n def getintline(self,n=-1) : \r\n ans = tuple(int(x) for x in self.fh.readline().rstrip().split())\r\n if n > 0 and len(ans) != n : raise Exception('Expected %d ints but got %d in MyInput.getintline'%(n,len(ans)))\r\n return ans\r\n def getfloatline(self,n=-1) :\r\n ans = tuple(float(x) for x in self.fh.readline().rstrip().split())\r\n if n > 0 and len(ans) != n : raise Exception('Expected %d floats but got %d in MyInput.getfloatline'%(n,len(ans)))\r\n return ans\r\n def getstringline(self,n=-1) :\r\n ans = tuple(self.fh.readline().rstrip().split())\r\n if n > 0 and len(ans) != n : raise Exception('Expected %d strings but got %d in MyInput.getstringline'%(n,len(ans)))\r\n return ans\r\n def getbinline(self,n=-1) :\r\n ans = tuple(int(x,2) for x in self.fh.readline().rstrip().split())\r\n if n > 0 and len(ans) != n : raise Exception('Expected %d bins but got %d in MyInput.getbinline'%(n,len(ans)))\r\n return ans\r\n\r\ndef compress(s) :\r\n s2 = [s[0]]\r\n for c in s :\r\n if c != s2[-1] : s2.append(c)\r\n return \"\".join(s2)\r\n\r\nif __name__ == \"__main__\" :\r\n myin = MyInput()\r\n (s,) = myin.getstringline(1)\r\n ## Make sure there are a's followed by b's followed by c's\r\n ## Make sure the count of cs either equals count of as or count of bs\r\n s1 = compress(s)\r\n ans = \"NO\"\r\n if s1 == 'abc' and ( s.count('c') == s.count('a') or s.count('c') == s.count('b') ) : ans = \"YES\"\r\n print(ans)\r\n\r\n", "s = input()\r\na = b = c = 0\r\nlast = s[0]\r\nr = s[0]\r\nfor i in s:\r\n\tif i == \"a\":\r\n\t\ta += 1\r\n\telif i == \"b\":\r\n\t\tb += 1\r\n\telse:\r\n\t\tc += 1\r\n\tif last != i:\r\n\t\tr += i\r\n\tlast = i\r\nif len(r) != 3 or (a != c and b != c) or r != \"abc\":\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "s = input()\r\nl = len(s)\r\n\r\nstate = 0\r\n\r\nacount = 1\r\nbcount = 1\r\nccount = 1\r\n\r\nfor c in s:\r\n if c == 'a':\r\n if state == 0:\r\n state = 1\r\n elif state == 1:\r\n acount += 1\r\n else:\r\n state = -1\r\n break\r\n elif c == 'b':\r\n if state == 1:\r\n state = 2\r\n elif state == 2:\r\n bcount += 1\r\n else:\r\n state = -1\r\n break\r\n elif c == 'c':\r\n if state == 2:\r\n state = 3\r\n elif state == 3:\r\n ccount += 1\r\n else:\r\n state = -1\r\n break\r\n\r\nif state == 3 and (acount == ccount or bcount == ccount):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nl,flag=list(s),True\r\nl.sort()\r\nif s.find('a')>=0 and s.find('b')>=0 and s.find('c')>=0:\r\n\tpass\r\nelse:\r\n\tflag=False\r\nif flag:\r\n\tfor i in range(len(s)):\r\n\t\tif l[i]==s[i]:\r\n\t\t\tcontinue\r\n\t\tflag=False\r\n\t\tbreak\r\nif flag:\r\n\td={}\r\n\td['a'],d['b'],d['c']=0,0,0\r\n\tfor i in s:\r\n\t\td[i]+=1\r\n\tif d['a']==d['c'] or d['b']==d['c']:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tprint('NO')", "s = input()\r\na = s.count(\"a\")\r\nb = s.count(\"b\")\r\nprint((\"NO\", \"YES\")[a * b and s in (\"a\" * a + \"b\" * b + \"c\" * i for i in (a, b))])\r\n", "s=input()\n\nfrom collections import defaultdict\n\n\nd=defaultdict(list)\n\n\nfor i in range(len(s)):\n\n d[s[i]].append(i)\n\n\nif len(d)!=3:\n print(\"NO\")\n \nelse:\n \n if sorted(list(d.keys()))!=[\"a\",\"b\",\"c\"]:\n print(\"NO\")\n \n else:\n\n\n\n\n if len(d[\"c\"])!=len(d[\"a\"]) and len(d[\"c\"])!=len(d[\"b\"]):\n print(\"NO\")\n \n else:\n if s[:d[\"a\"][-1]+1]==\"a\"*(d[\"a\"][-1]+1) and s[d[\"a\"][-1]+1:d[\"b\"][-1]+1]==\"b\"*(-d[\"a\"][-1]+d[\"b\"][-1]):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n", "# python3\n# utf-8\n\ns = input()\nnrs = {}\nnrs['a'] = 0\nnrs['b'] = 0\nnrs['c'] = 0\ncurr_state = 0\nflag = True\nfor sym in s:\n nrs[sym] += 1\n if curr_state == 0:\n if sym == 'a':\n continue\n elif sym == 'b':\n curr_state += 1\n elif sym == 'c':\n flag = False\n elif curr_state == 1:\n if sym == 'a':\n flag = False\n elif sym == 'b':\n continue\n elif sym == 'c':\n curr_state += 1\n elif curr_state == 2:\n if sym != 'c':\n flag = False\nif nrs['a'] < 1:\n flag = False\nif nrs['b'] < 1:\n flag = False\nif nrs['c'] != nrs['a'] and nrs['c'] != nrs['b']:\n flag = False\nif flag:\n print('YES')\nelse:\n print('NO')\n", "# from collections import Counter\n\n# n, k1, k2 = list(map(int, input().split()))\n# a = list(map(int, input().split()))\n# b = list(map(int, input().split()))\n\n# diff = [abs(a[i] - b[i]) for i in range(len(a))]\n\n# c = sorted(map(list, Counter(diff).items()), key=lambda pair: pair[1], reverse=True)\n\n# # print(c)\n\n# total = 0\n# for i in range(len(c) - 1):\n# \td = (c[i][0] - c[i + 1][0]) * c[i][1]\n# \tif total + d <= k1 + k2:\n# \t\tc[i + 1][1] += c[i][1]\n# \t\tc[i][1] = 0\n# \t\ttotal += d\n# \telse:\n# \t\td = (c[i][0] - c[i + 1][0])\n# \t\twhile total + d <= k1 + k2:\n# \t\t\tc[i + 1][1] += 1\n# \t\t\tc[i][1] -= 1\n# \t\t\ttotal += d\n\n# while total < k1 + k2:\n# \tleft = k1 + k2 - total\n# \tc.append([c[-1][0] - 1, min(c[-1][1], left)])\n# \ttotal += min(c[-1][1], left)\n\n# # print(c)\n\n# print(sum([d[0] ** 2 * d[1] for d in c]))\nimport re\n\ns = input()\nregex = re.compile(r'^a+b+c+$')\n\nif regex.fullmatch(s) is not None and (s.count('c') == s.count('a') or s.count('c') == s.count('b')):\n\tprint('YES')\nelse:\n\tprint('NO')\n", "s = input()\r\nif len(set(s)) == 3:\r\n if 'ba' in s or 'ca' in s or 'cb' in s:\r\n exit(print('NO'))\r\n elif s.count('a') == s.count('c') or s.count('b') == s.count('c'):\r\n exit(print('YES'))\r\nprint('NO')\r\n", "def main() -> None:\r\n s = input()\r\n n = len(s)\r\n a = 0\r\n b = 0\r\n c = 0\r\n while a < n and s[a] == 'a':\r\n a += 1\r\n while a + b < n and s[a + b] == 'b':\r\n b += 1\r\n while a + b + c < n and s[a + b + c] == 'c':\r\n c += 1\r\n print('YES' if a + b + c == n and a > 0 and b > 0 and c > 0 and (c == a or c == b) else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# LUOGU_RID: 113880419\na=input()\nb,c=list(a),list(a)\nb.sort()\nif b==c and 'a' in a and 'b' in a and 'c' in a and (a.count('c')==a.count('a') or a.count('c')==a.count('b')):\n print('YES')\nelse:\n print('NO')", "\r\nimport math\r\nimport sys\r\nfrom collections import deque,OrderedDict,defaultdict\r\nimport heapq,re\r\nfrom collections import Counter\r\ndef inp(): return sys.stdin.readline().rstrip()\r\ndef mpp(): return map(int,inp().split())\r\ndef lis(): return list(mpp())\r\ndef yn(n):\r\n if n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ndef cd(s):\r\n return ord(s)-ord('a')+1\r\ndef fn(s):\r\n arr=[i for i in s]\r\n if arr!=sorted(arr):\r\n return False\r\n di=Counter(s)\r\n if di[\"a\"]==0 or di[\"b\"]==0:return False\r\n if di[\"c\"]==di[\"a\"] or di[\"c\"]==di[\"b\"]:return True\r\n return False\r\n\r\ndef main():\r\n s=inp()\r\n print(yn(fn(s)))\r\n\r\nif __name__==\"__main__\":\r\n main()", "s=input()\r\nif list(s)==sorted(list(s)) and s.count(\"a\")>0 and s.count(\"b\")>0 and (s.count(\"a\")==s.count(\"c\") or s.count(\"b\")==s.count(\"c\")):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s= input()\r\nif list(s)==sorted(list(s)) and s.count('a')>=1 and s.count('b')>=1 and (s.count('c')==s.count('a') or s.count('c')==s.count('b')):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nif sorted(s) == list(s) and s.count('a') >= 1 and s.count('b') >= 1 and (s.count('a') == s.count('c') or s.count('b') == s.count('c')) :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n", "\n# coding: utf-8\n\n# In[ ]:\n\n\ns = input()\na = s.count('a')\nb = s.count('b')\nc = s.count('c')\nif a !=0:\n ind_a = s.index('a')\nif b!= 0:\n ind_b = s.index('b')\nif c != 0:\n ind_c = s.index('c')\nif a == 0 or b == 0 or c == 0:\n print ('NO')\nelif ind_a > ind_b or ind_a > ind_c or ind_b > ind_c:\n print ('NO')\nelif s[:ind_b].count('a') != a or s[ind_b:ind_c].count('b') != b or s[ind_c:].count('c') != c:\n print ('NO')\nelif c != a and c != b:\n print ('NO')\nelse:\n print ('YES')\n\n", "s = input()\r\ncount_a = 0\r\ncount_b = 0\r\ncount_c = 0\r\nflag = True\r\nflagA = False\r\nflagB = False\r\nflagC = False\r\nfor i in s:\r\n if i == 'a':\r\n if flagC or flagB:\r\n flag = False\r\n count_a += 1\r\n flagA = True\r\n if i == 'b':\r\n if flagC:\r\n flag = False\r\n count_b += 1\r\n flagB = True\r\n if i == 'c':\r\n count_c += 1\r\n flagC = True\r\nif count_c != count_a and count_c != count_b:\r\n flag = False\r\nif count_a == 0 or count_b == 0 or count_c == 0:\r\n flag = False\r\nif flag == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "\ndef main():\n s = input()\n\n ind_b = s.index('b')\n if ind_b == 0 or s[:ind_b] != 'a' * ind_b:\n print('NO')\n return\n\n ind_c = s.index('c')\n if s[ind_b:ind_c] != 'b' * (ind_c - ind_b):\n print('NO')\n return\n\n if s[ind_c:] != 'c' * (len(s) - ind_c):\n print('NO')\n return\n\n if len(s) - ind_c != ind_b and len(s) - ind_c != ind_c - ind_b:\n print('NO')\n return\n\n print('YES')\n\ntry:\n main()\nexcept:\n print('NO')\n", "s = input()\r\ntemp = []\r\nchkFlag = True\r\nfor i in range(len(s)-1):\r\n if (s[i] == 'b' and s[i+1] == 'a') or (s[i] == 'c' and s[i+1] == 'b') or (s[i] == 'c' and s[i+1] == 'a'):\r\n chkFlag = False\r\n if s[i] not in temp:\r\n temp.append(s[i])\r\nif 'c' not in temp and s[len(s)-1] == 'c':\r\n temp.append('c')\r\nif chkFlag == False:\r\n print(\"NO\")\r\nelif temp == ['a', 'b', 'c']:\r\n aCount = s.count('a')\r\n bCount = s.count('b')\r\n cCount = s.count('c')\r\n if aCount == cCount or bCount == cCount:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\ni,a,b,c=0,0,0,0\r\nwhile(i<len(s) and s[i]=='a'):\r\n i+=1\r\n a+=1\r\nwhile(i<len(s) and s[i]=='b'):\r\n i+=1\r\n b+=1\r\nwhile(i<len(s) and s[i]=='c'):\r\n i+=1\r\n c+=1\r\n\r\nif(c!=b and c!=a):\r\n print(\"NO\")\r\n exit()\r\nif len(s)<3:\r\n print(\"NO\")\r\n exit()\r\nif (a==0 or b==0 or i!=len(s)):\r\n print(\"NO\")\r\n exit()\r\nif(a==c or b==c):\r\n print(\"YES\")\r\n", "S = input()\r\n\r\nA, B, C = [], [], []\r\n\r\nfor i, v in enumerate(S):\r\n if v == 'a':\r\n A += [i]\r\n if v == 'b':\r\n B += [i]\r\n if v == 'c':\r\n C += [i]\r\n \r\n\r\nif A != [] and B != [] and C != [] and A[-1] < B[0] and B[-1] < C[0] and (len(C) == len(A) or len(C) == len(B)):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "s = input()\r\na = s.count('a')\r\nb = s.count('b')\r\nc = s.count('c')\r\nif (s==a*'a' + 'b'*b + c*'c') and ((a==c) or (b==c)) and (a>0) and (b>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nr = re.compile(r\"^(a+)(b+)(c+)$\")\r\ns = input()\r\nans = \"NO\"\r\nm = re.match(r, s)\r\nif m:\r\n if len(m.group(1))==len(m.group(3)) or len(m.group(2))==len(m.group(3)):\r\n ans = \"YES\"\r\nprint(ans)", "#-------------------------------------------#\r\n#INCLUDE <HajLorenzo>\r\n#INCLUDE <MUSIC.H>\r\n#Together We Will Live Forever - The Fountain\r\n#-------------------------------------------#\r\n\r\n\r\n_=input()\r\n__=[len(_)-_[::-1].find(\"a\")-1,_.find(\"b\"),len(_)-_[::-1].find(\"b\")-1,_.find(\"c\"),_.count(\"a\"),_.count(\"b\"),_.count(\"c\")]\r\nprint(\"YES\" if((__[0]<__[1] and __[2]<__[3]) and (__[6]==__[5] or __[6]==__[4])) else \"NO\")\r\n\r\n\r\n\r\n'''\r\n_X1=[]\r\n_X2=[]\r\n_X3=[]\r\ndef Y__Y(_):\r\n for __ in range(len(_)):\r\n if(_[__]==\"a\"):\r\n _X1.append(__)\r\n elif(_[__]==\"b\"):\r\n _X2.append(__)\r\n else:\r\n _X3.append(__)\r\nY__Y(_)\r\nprint(_X1,_X2,_X3)'''\r\n", "s=input()\r\n\r\na=0\r\nb=0\r\nc=0\r\n\r\nif (''.join(sorted(s))==s):\r\n for i in s:\r\n if i=='a':\r\n a+=1\r\n elif i=='b':\r\n b+=1\r\n elif i=='c':\r\n c+=1\r\n #print(a,b,c)\r\n if a>0 and b>0 and (c==a or c==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: UTF-8 -*-\n\ns = input()\nstatus = ['a', 'b', 'c']\ncount = [0, 0, 0]\np = 0\nflag = True\n\nfor c in s:\n while p < 3 and c != status[p]:\n p += 1\n if p >= 3:\n flag = False\n break\n count[p] += 1\n\nif count[0] == 0 or count[1] == 0 or count[2] == 0:\n flag = False\nif count[0] != count[2] and count[1] != count[2]:\n flag = False\nif flag:\n print('YES')\nelse:\n print('NO')\n", "import re\r\n\r\ns = input()\r\n\r\nm = re.match('(a+)(b+)(c+)$', s)\r\nif m:\r\n a, b, c = m.groups()\r\n if len(c) == len(b) or len(c) == len(a): print(\"YES\")\r\n else: print(\"NO\")\r\nelse: print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\nfor i in range(n-1):\r\n if s[i] > s[i+1]:\r\n print('NO')\r\n break\r\nelse:\r\n c = s.count('c')\r\n a = s.count('a')\r\n b = n-a-c\r\n if a == 0 or b == 0 or c == 0 or (c!=b and c!=a):\r\n print(\"NO\")\r\n else:\r\n print('YES')", "s=input()\r\n\r\na=s.count('a')\r\nb=s.count('b')\r\n\r\nif a and b and (s=='a'*a+'b'*b+'c'*a or s=='a'*a+'b'*b+'c'*b):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "s=input()\na=s.count('a')\nb=s.count('b')\nc=s.count('c')\n\n\nizm=0\nizmlist=[]\nfor i in range(1, len(s)):\n if s[i]!=s[i-1]:\n izm+=1\n izmlist.append(s[i])\nif (c==a or c==b) and izm==2 and izmlist[0]=='b' and izmlist[1]=='c':\n print('YES')\nelse:\n print('NO')\n", "s = input (); n = len (s)\r\ni, j = 0, 0\r\nif s[0] != 'a' : print (\"NO\"); exit (0)\r\nwhile j < n and s[j] == 'a' : j += 1\r\ncnta = j - i; i = j\r\nif j >= n : print (\"NO\"); exit (0)\r\nif s[i] != 'b' : print (\"NO\"); exit (0)\r\nwhile j < n and s[j] == 'b' : j += 1\r\ncntb = j - i; i = j\r\nif j >= n : print (\"NO\"); exit (0)\r\nif s[i] != 'c' : print (\"NO\"); exit (0)\r\nwhile j < n and s[j] == 'c' : j += 1\r\nif j < n : print (\"NO\"); exit (0)\r\ncntc = j - i\r\nif cntc != cnta and cntc != cntb : print (\"NO\")\r\nelse : print (\"YES\")\r\n", "a=input()\r\nx=1;\r\nfor i in range(len(a)-1):\r\n if(a[i]>a[i+1]):\r\n x=0;\r\n break\r\n\r\np=a.count(\"a\")\r\nq=a.count('b')\r\nr=a.count('c')\r\nif(x and p and q and r and (p==r or q==r)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\nstep=0\nflag=1\nsuma=0;sumb=0;sumc=0\nfor i in range(len(s)):\n if s[i]!='a':\n step=i\n break\n suma+=1\nfor i in range(step,len(s)):\n if s[i]!='b':\n step=i\n break\n sumb+=1\nfor i in range(step,len(s)):\n if s[i]!='c':\n flag=0\n break\n sumc+=1\n step=i\nif step!=len(s)-1:\n flag=0\nif suma>0 and sumb>0 and sumc>0 and (sumc==suma or sumc==sumb) and flag==1:\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\t", "import re\n\nl, r = re.findall(r'(a+|b+|c+)', input()), True\nif [s[0] for s in l] == ['a', 'b', 'c']:\n a, b, c = map(len, l)\n r = a != c != b\nprint(('YES', 'NO')[r])", "st = input()\r\nif st.count('a')!=0 and st.count('b')!=0 and st.count('c')!=0 and st==''.join(sorted(st)) and (st.count('c')==st.count('a') or st.count('c')==st.count('b')):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\n\r\nimport collections\r\nd = collections.Counter(s)\r\nf = 0\r\nfor i in range(1, len(s)):\r\n if ord(s[i-1])>ord(s[i]):\r\n f = 1\r\n break \r\nif (d[\"c\"] == d[\"a\"] or d[\"c\"] == d[\"b\"]) and not f and d[\"a\"]>=1 and d[\"b\"]>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nac, bc, cc = s.count('a'), s.count('b'), s.count('c')\r\nprint('YES' if ac and bc and ac * 'a' + bc * 'b' + cc * 'c' == s and cc in (ac, bc) else 'NO')", "s = input()\r\na, b, c = s.count('a'), s.count('b'), s.count('c')\r\n\r\nif a + b + c == len(s) and (c == a or c == b) and set(s[:a]) == {'a'} and set(s[a: a + b]) == {'b'}:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nfa = 0\r\nfb = 0\r\nfc = 0\r\nsl = [i for i in s]\r\nif('a' in sl):fa = 1\r\nif('b' in sl):fb = 1\r\n\r\nif((fa==1 and fb==0) or (fa == 0 and fb == 1)):\r\n print(\"NO\")\r\n exit(0)\r\nss = [i for i in s]\r\nss.sort()\r\nac = sl.count('a')\r\nbc = sl.count('b')\r\ncc = sl.count('c')\r\nif(ss==sl):\r\n if(cc == ac or cc == bc):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=b=c=0\r\nt1=t2=t3=0\r\na=s.count('a')\r\nb=s.count('b')\r\nc=s.count('c') \r\nt1=s.count(\"ba\")\r\nt2=s.count(\"ca\")\r\nt3=s.count(\"cb\")\r\nif(t1>0 or t2>0 or t3>0):\r\n print(\"No\")\r\nelif a!=0 and b!=0 and (c==a or c==b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nar=list(s)\r\np=0\r\nif(ar!=sorted(ar)):\r\n print(\"NO\")\r\nelse:\r\n if((\"a\" in s) and (\"b\" in s) and (\"c\" in s)):\r\n if(ar.count(\"c\")==ar.count(\"a\") or ar.count(\"c\")==ar.count(\"b\")):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "\r\ns = input()\r\na = s.count('a')\r\nb = s.count('b')\r\nif a and b and (s == 'a' * a + 'b' * b + 'c' * a or s == 'a' * a + 'b' * b + 'c' * b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input(); a = s.count('a'); b = s.count('b'); c = s.count('c')\r\nif a==0 or b==0:\r\n print('No')\r\n exit(0)\r\nif a*'a' + b*'b' + c*'c' == s and (a==c or b==c):\r\n print('Yes')\r\nelse:\r\n print('No')", "import re \r\ns = input()\r\nres = re.match(r'^a+b+c+$', s)\r\nif res and s.count('c') in [s.count('a'), s.count('b')]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\nquit()\r\n\r\n\r\n\r\n\r\nchars = ['a', 'b', 'c']\r\ncount = [s.count(c) for c in chars]\r\na, b, c = count \r\ncond = True \r\n\r\ntry:\r\n part = s.partition('b'*b)\r\nexcept ValueError:\r\n cond = False\r\n\r\nif cond:\r\n if (a == 0 or b == 0 or c==0) or (c != a and c != b): \r\n cond = False\r\n\r\nif cond:\r\n for i in range(3):\r\n if part[i] != chars[i]*count[i]:\r\n cond = False\r\n\r\nprint('YES' if cond else 'NO')\r\n\r\n", "if __name__ == '__main__':\r\n cin = input\r\n s = list(cin())\r\n a = [0] * 3\r\n if len(set(s)) < 3 or s != sorted(s):\r\n print(\"NO\")\r\n else:\r\n for c in s:\r\n a[\"abc\".index(c)] += 1\r\n print(\"YNEOS\"[not (a[0] == a[2] or a[1] == a[2])::2])", "def no():\r\n print('NO')\r\n quit()\r\ns=input()\r\na,b,c=0,0,0\r\nfor i in s:\r\n if i =='a':\r\n if c+b:\r\n no()\r\n else:\r\n a+=1\r\n elif i=='b':\r\n if c:\r\n no()\r\n else:\r\n b+=1\r\n else:\r\n c+=1\r\nif not(a*b):\r\n no()\r\nif not (c==a or c==b):\r\n no()\r\nprint('YES')\r\n", "s = input()\r\nd = list(set(s))\r\nd.sort()\r\nn = len(s)\r\nans=1\r\nif (d==['a','b','c']):\r\n for i in range(1,n):\r\n if (s[i]<s[i-1]):\r\n ans=-1\r\n cnta=0\r\n cntb=0\r\n cntc=0\r\n for i in range(n):\r\n if (s[i]=='a'):\r\n cnta+=1\r\n if (s[i]=='b'):\r\n cntb+=1\r\n if (s[i]=='c'):\r\n cntc+=1\r\n if (cntc!=cnta and cntc!=cntb):\r\n ans=-1\r\nelse:\r\n ans=-1\r\nif (ans==-1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n", "text = input()\r\n\r\norder = []\r\n\r\nfor i in range(len(text) - 1):\r\n if text[i] != text[i + 1]: order.append(text[i])\r\norder.append(text[len(text) - 1])\r\n\r\nif order != ['a', 'b', 'c']: print('NO')\r\nelif text.count('c') == text.count('a') or text.count('c') == text.count('b'): print('YES')\r\nelse: print('NO')", "import re\r\ns = input()\r\n#counting\r\ndef count(x):\r\n r = re.compile('{}+'.format(x))\r\n m = r.search(s)\r\n xa = len(m.group())\r\n return xa\r\n#order checking\r\nr = re.compile(r'a+b+c+')\r\nm = r.search(s)\r\nif m!=None and m.group()==s:\r\n xa = count('a')\r\n xb = count('b')\r\n xc = count('c')\r\n if xc==xa or xc==xb:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n\r\n\r\n" ]

[ "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nc=0\r\nfor i in range(n):\r\n c+=x[i]*max((m-i),1)\r\nprint(c)", "\n\"\"\"\nSolved by Fuad Ashraful BBabu\n#soled date 12 july 2019\n#verdict : AC \n\n\"\"\"\n\n\nn,p=map(int,input().split())\n\n\n\nar=list(map(int,input().split()))\n\n\nar.sort()\n\nans=0\nfor a in ar:\n\n\tans+=a*p\n\n\tif p>1:\n\t\tp-=1\n\n\n\nprint(ans)\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\ntime = 0\r\nfor subject in a:\r\n time += subject*x\r\n x = max(1, x-1)\r\nprint(time)\r\n", "n, x = map(int,input().split())\r\nc = list(map(int,input().split()))\r\n\r\nc.sort()\r\n\r\nans = 0\r\ni = 0\r\nn = len(c)\r\nwhile i<n and x>1:\r\n\tans += c[i]*x\r\n\tx-=1\r\n\ti+=1\r\n\r\nif i<n:\r\n\twhile i<n:\r\n\t\tans += c[i]\r\n\t\ti+=1\r\n\r\nprint(ans)", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\nres = 0\r\n\r\nfor i in a:\r\n res += x * i\r\n if x > 1:\r\n x -= 1\r\n\r\nprint(res)\r\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\nn,x = get_int()\r\narr = int_arr()\r\n\r\narr.sort()\r\nct = 0\r\nfor i in range(n):\r\n ct += arr[i] * x\r\n if x > 1:\r\n x -= 1\r\nprint(ct)\r\n\r\n", "n, x = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nsum = 0\r\nfor i in range(n):\r\n sum += x*a[i]\r\n if(x>1):\r\n x -= 1\r\n\r\nprint(sum)\r\n\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncounter = 0\r\nfor i in a:\r\n counter += i*x\r\n if x > 1:\r\n x -= 1\r\nprint(counter)", "n, x = [int(j) for j in input().split()]\r\nc = [int(j) for j in input().split()]\r\nc.sort()\r\ns = 0\r\nfor i in range(n):\r\n\ts += max(x, 1) * c[i]\r\n\tx -= 1\r\nprint(s)\r\n", "mod = 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, x=f()\r\nl = sorted(il())\r\nsm=0\r\nfor i in range(n):\r\n sm+=max(1,x)*l[i]\r\n x-=1\r\nprint(sm)", "n,x=map(int, input().split()) # n subjects, initial hr = x\r\nchaps=list(map(int, input().split()))\r\nsorted=sorted(chaps)\r\n\r\ntime=0\r\nj=0\r\nfor i in range(len(sorted)):\r\n # while time + (x - j) * sorted[i] <= n:\r\n time+=(x-j)*sorted[i]\r\n if x - j >= 2:\r\n j+=1\r\n\r\nprint(time)", "# ý tưởng: sắp xếp mảng c tăng dần, sau đó dùng biến i để duyệt xuôi và ngược lại\r\n# mỗi lượt duyệt tính toán thời gian, sau đó so sánh 2 thời gian và in ra kết quả nhỏ hơn\r\n# độ phức tạp: O(n)\r\n\r\nn, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nc.sort()\r\nt1 = t2 = 0\r\ni = 0\r\nx_ = x\r\nwhile i < n:\r\n t1 += c[i] * x\r\n if x > 1:\r\n x -= 1\r\n i += 1\r\n\r\nwhile i != 0:\r\n i -= 1\r\n t2 += c[i] * x_\r\n if x_ > 1:\r\n x_ -= 1\r\n\r\nprint(min(t1, t2))", "inp = input().split(\" \")\r\nx = int(inp[1])\r\narr = sorted([int(i) for i in input().split(\" \")])\r\nresult = 0\r\nfor j in range(len(arr)):\r\n\tresult += x*arr[j]\r\n\tif x > 1:\r\n\t\tx-=1\r\nprint(result)", "n, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\n\r\n# Sap xep lai phan tu\r\nl.sort()\r\n# Thoi gian ngan nhat\r\ns = 0\r\n\r\nfor i in l:\r\n\tif x <= 1:\r\n\t\ts += i\r\n\telse:\r\n\t\ts += i*x\r\n\t\tx -= 1\r\n\r\n\r\nprint(s)", "n, x = list(map(int, input().split()))\nci = list(map(int, input().split()))\nci = sorted(ci)\nres = 0\nfor c in ci:\n res += c * x\n x = max(x-1, 1)\nprint(res)\n", "n, x = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\n\r\na.sort()\r\n\r\nres = 0\r\n\r\nfor i in range(0, n):\r\n res += a[i] * max(1, x)\r\n x -= 1\r\n\r\nprint(res)", "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\nmod = 1000000007\r\n\r\ndef solve(n,l,arr):\r\n\tarr.sort()\r\n\ttot = 0\r\n\tfor i in range(n):\r\n\t\tif l == 0:\r\n\t\t\tl = 1\r\n\t\ttot += l*arr[i]\r\n\t\tl -= 1\r\n\tprint(tot)\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nn,l = get_int()\r\narr = int_arr()\r\nsolve(n,l,arr)\r\n", "n, x = map(int, input().split())\r\nc = [int(i) for i in input().split()]\r\nc.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += x * c[i]\r\n x -= 1\r\n x = max(1, x)\r\nprint(ans)", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n\tans+=x*a[i]\r\n\tif x>1:\r\n\t\tx-=1\r\nprint(ans)", "n, x = map(int, input().split())\nlista = list(map(int, input().split()))\n\nlista.sort()\nsomatorio = 0\n\nfor c in lista:\n somatorio += c * x\n x = max(1, x-1)\n\nprint(somatorio)\n", "n, x = map(int, input().split())\nc = list(map(int, input().split()))\n\nc.sort()\nt1 = t2 = 0\ni = 0\nx_ = x\nwhile i < n:\n t1 += c[i] * x\n if x > 1:\n x -= 1\n i += 1\n\nwhile i != 0:\n i -= 1\n t2 += c[i] * x_\n if x_ > 1:\n x_ -= 1\n\nprint(min(t1, t2))", "n,x=map(int,input().split())\r\nw=sorted(list(map(int,input().split())))\r\ns,i=0,0\r\nwhile True:\r\n s+=(w[i]*x)\r\n if x>1:\r\n x-=1\r\n i+=1\r\n if i==n:\r\n break\r\nprint (s)", "n,m=map(int,input().strip().split(' '))\r\narr=list(map(int,input().strip().split(' ')))\r\narr.sort()\r\ntota=0\r\nfor i in arr:\r\n if m!=1:\r\n tota+=i*m \r\n m-=1 \r\n else:\r\n tota+=i \r\nprint(tota)", "n, x = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nc.sort()\r\nt = 0\r\nfor i in range(n):\r\n t=t+x*c[i]\r\n if(x>1):\r\n x = x-1\r\nprint(t)", "# 439B\r\nn,x = map(int,input().split()) # n: so luong subject, x: so hour hoc lan dau tien\r\nc = list(map(int,input().split())) # so chapter moi subject\r\nc.sort()\r\ntotal_hours = 0\r\nfor i in range(n):\r\n total_hours += c[i]*max(x-i,1)\r\nprint (total_hours)", "n,h=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ncount=0\r\nc.sort()\r\n\r\nfor i in range(n):\r\n #print(count)\r\n count+=c[i]*max(1,h)\r\n h=h-1\r\nprint(count)\r\n", "def main(arr,l):\r\n\r\n\r\n arr.sort()\r\n ans=0\r\n for e in arr:\r\n ans+=e*l \r\n l=max(1,l-1)\r\n \r\n return ans\r\n\r\nn,l=list(map(int,input().split()))\r\n\r\narr=list(map(int,input().split()))\r\nprint(main(arr,l))", "n, x = [int(x) for x in input().split()]\r\nch = [int(x) for x in input().split()]\r\nch.sort()\r\n\r\nres = 0\r\nfor c in ch:\r\n t = max(1, x)\r\n res += t * c\r\n x -= 1\r\n \r\nprint(res)", "from sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\nrds = lambda: stdin.readline().rstrip()\nii = lambda: int(stdin.readline())\nINF = 1 << 62\nmod = 10**9 + 7\n\nn, x = rd()\ncs = rd()\n\ncs.sort()\n\nres = 0\nfor i in range(n):\n res += x * cs[i]\n if x > 1:\n x -= 1\n\nprint(res)\n\n#stdout.write(' '.join(map(str, ar)))\n#stdout.write(f'{res}')\n\n", "X = list(map(int, input().split()))\r\nChapters = sorted(list(map(int, input().split())))\r\nSum = 0\r\nfor i in range(X[0]):\r\n Sum += Chapters[i] * X[1]\r\n X[1] = max(1, X[1] - 1)\r\nprint(Sum)\r\n", "def main():\r\n n=list(map(int,input().split(' ')))\r\n m=list(map(int,input().split(' ')))\r\n m.sort()\r\n result=0\r\n for i in range(n[0]):\r\n result+=n[1]*m[i]\r\n if n[1]>1:\r\n n[1]-=1\r\n print(result)\r\nif __name__ == \"__main__\":\r\n main()", "n,x=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nans=0\r\nl1.sort()\r\nfor i in range(n):\r\n \r\n \r\n ans+=l1[i]*x\r\n if(x>1):\r\n x-=1\r\n \r\nprint(ans)", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\nfrom os import *\r\n\r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(s):\r\n\tfor i in range(len(s)):\r\n\t\tprint(s[:i],end='\\r')\r\n\t\tsle(1/len(s))\r\n\tprint(s)\r\n\r\ndef solve():\r\n\tn,x = map(int,input().split())\r\n\tc = sorted([int(q) for q in input().split()])\r\n\tans = 0\r\n\tfor ci in c:\r\n\t\tans += ci*x\r\n\t\tif x > 1:\r\n\t\t\tx -= 1\r\n\tprint(ans)\r\n\r\n\r\nsolve()", "n,x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = 0\r\n\r\nfor i in range(len(arr)):\r\n ans += arr[i] * x \r\n if x > 1: x -= 1\r\n\r\nprint(ans)\r\n", "n, x = [int(q) for q in input().split()]\r\ns = [int(q) for q in input().split()]\r\ns.sort()\r\n\r\ntime = 0\r\nfor c in s:\r\n time += c*x\r\n if x > 1:\r\n x -= 1\r\nprint(time)\r\n", "n,x=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nif len(lst)!=x:\r\n for i in range(x-len(lst)):\r\n lst.append(0)\r\ns=0\r\ni=0\r\nwhile x>0:\r\n s+=(lst[i]*x)\r\n x-=1\r\n i+=1\r\nif i!=n:\r\n m=lst[i:]\r\n s+=sum(m)\r\n print(s)\r\nelse:\r\n print(s)\r\n", "(subjects, initial_learning_speed) = map(int, input().split(' '))\nchapters_per_subject = list(map(int, input().split(' ')))\n\nchapters_per_subject.sort()\n\nhours = 0\n\nfor i in range(subjects):\n hours += chapters_per_subject[i] * initial_learning_speed\n initial_learning_speed -= 1\n if initial_learning_speed <= 1:\n initial_learning_speed = 1\n\nprint(hours)\n", "\r\nn,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nsum=0\r\nfor i in range(n):\r\n sum+=c[i]*x\r\n if x>1:\r\n x-=1\r\nprint(sum)", "n, x = map(int, input().split())\r\narr = sorted([*map(int, input().split())])\r\nans = 0\r\nfor e in arr:\r\n ans += (max(1, x) * e)\r\n x -= 1\r\nprint(ans)", "inp = input()\r\nlst = inp.split()\r\na = int(lst[0])\r\nb = int(lst[1])\r\ninp = input()\r\nlst = inp.split()\r\nfor i in range(a):\r\n lst[i] = int(lst[i])\r\nlst.sort()\r\nsum = 0\r\nfor i in lst:\r\n sum += i * b\r\n if b > 1: b -= 1\r\nprint(sum)\r\n", "n,x=map(int,input().split())\r\nS=sorted(map(int,input().split()))\r\nDA=0\r\nfor i in range(x):\r\n DA+=S[i]*(x-i)\r\n if i==n-1:\r\n break\r\nelse:\r\n DA+=sum(S[i+1:])\r\nprint(DA)\r\n\r\n", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc.sort()\r\nmin_time = 0\r\n\r\nfor chapters in c:\r\n min_time += chapters * x\r\n if x > 1:\r\n x -= 1\r\n \r\nprint(min_time)", "n, x = map(int, input().split())\r\nc = sorted(list(map(int, input().split())))\r\ntime = 0\r\nfor item in c:\r\n time += x*item\r\n\r\n\r\n x = max(1, x-1)\r\nprint(time)", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=100000007\r\nn,x=vary(2)\r\nnum=array_int()\r\nnum.sort()\r\nans=0\r\nfor i in range(n):\r\n if x<1:\r\n x=1\r\n ans+=num[i]*x\r\n x-=1\r\nprint(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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\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\nc = list(map(int, input().split()))\r\n\r\ntemp = sorted(c)\r\ntime = 0\r\n\r\n\r\nfor i in range (n):\r\n time += temp[i] * x\r\n if x > 1: \r\n x -= 1\r\n\r\nprint(time)", "n , hours = map(int , input().split())\r\nl = list(map(int ,input().split())) \r\nl.sort() \r\nresult = 0\r\nfor i in range(n) : \r\n result += l[i] * hours\r\n if hours > 1: \r\n hours -=1 \r\nprint(result)", "n, x = map(int, input().split(\" \"))\r\nchapter_times = [int(i) for i in input().split(\" \")]\r\n\r\nchapter_times.sort()\r\n\r\ntotal_time = 0\r\nfor i in range(n):\r\n time_needed = max(1, x - i)\r\n total_time += chapter_times[i] * time_needed\r\nprint(total_time)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\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\nfor t in range(1):\r\n n,k=get_ints()\r\n arr=get_list()\r\n arr.sort()\r\n ans=0\r\n for i in arr:\r\n ans+=(i*max(1,k))\r\n k-=1\r\n print(ans)", "inp = input().split(' ')\r\nn = int(inp[0])\r\nhrs = int(inp[1])\r\norder = input().split(' ')\r\norder = [int(x) for x in order]\r\n\r\norder = sorted(order)\r\ntime = 0\r\nfor chapters in order:\r\n tps = chapters * hrs\r\n if hrs > 1:\r\n hrs -= 1\r\n time += tps\r\n\r\nprint(time)\r\n \r\n", "\r\n\"\"\"\r\nSolved by Fuad Ashraful BBabu\r\n#soled date 12 july 2019\r\n#verdict : AC \r\n\r\n\"\"\"\r\n\r\n\r\nn,p=map(int,input().split())\r\n\r\n\r\n\r\nar=list(map(int,input().split()))\r\n\r\n\r\nar.sort()\r\n\r\nans=0\r\nfor a in ar:\r\n\r\n\tans+=a*p\r\n\r\n\tif p>1:\r\n\t\tp-=1\r\n\r\n\r\n\r\nprint(ans)\r\n", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\nC = [int(i) for i in input().split()]\r\nC.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += x*C[i]\r\n if x > 1 :\r\n x-=1\r\nprint(ans)", "n, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nsum = 0\r\nfor i in l:\r\n sum = sum+i*x\r\n if x-1 >= 1:\r\n x -= 1\r\nprint(sum)\r\n", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=l[i]*x\r\n if x!=1:\r\n x-=1\r\nprint(ans)", "subjects, power = map(int, input().split())\r\nchapters = [*map(int, input().split())]\r\nchapters.sort()\r\ntotal = 0\r\nfor c in chapters:\r\n\ttotal += power * c\r\n\tpower = max(1, power - 1)\r\nprint(total)", "n , d = input('').split(' ')\nn , d = int(n) , int(d)\nnums = [int(x) for x in input('').split(' ')]\nnums.sort()\n\nsum = 0\n\nfor num in nums :\n sum += num*d\n if d != 1:\n d -= 1\nprint(sum)", "\r\n\r\n#####451-B\r\nresult = 0\r\nsubjects = []\r\n\r\nn, hour = map(int, input().split())\r\nsubjects= list(map(int,input().split()))\r\n\r\nsubjects.sort()\r\n\r\nfor i in range(n):\r\n result += subjects[i] * hour\r\n if hour>1:\r\n hour-= 1\r\n\r\nprint(result)", "n, x = map(int, input().split())\r\nls = [int(a) for a in input().split()]\r\n\r\nls.sort() # n log n time\r\nt = 0\r\n\r\nfor i in range(len(ls)):\r\n t += ls[i]*x\r\n x = max(1, x-1)\r\nprint(t)", "n, x = map(int, input().rstrip().split())\r\narray = list(map(int, input().rstrip().split()))\r\nsum = 0\r\narray.sort()\r\n\r\nfor i in range(n):\r\n if x > 1:\r\n sum += array[i] * x\r\n x -= 1\r\n else:\r\n sum += array[i]\r\n\r\nprint(sum)\r\n", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\n\r\ncount=0\r\n\r\nfor i in range(n):\r\n count+=l[i]*x\r\n if x>1:\r\n x-=1\r\n else:\r\n x=1\r\n \r\nprint(count)", "n,m = map(int,input().split())\r\nz = list(map(int,input().split()))\r\nz = sorted(z)\r\ns = 0\r\nfor i in z :\r\n s += m* i\r\n if m == 1 :\r\n continue\r\n else :\r\n m-=1\r\nprint(s)\r\n", "first_line = list(map(int, input().split()))\r\nn = first_line[0]\r\nx = first_line[1]\r\n\r\na = list(map(int, input().split()))\r\n\r\n# first sort the array so that the subjects with the most\r\n# chapters will go before the others with fewer chapters. \r\na.sort() \r\n\r\n# now we just have to compute the total time spent teaching Devu.\r\n# for each chapter we decrease Devu's learning power by 1, \r\n# until it reaches 1\r\n\r\nans = 0\r\n\r\nfor i in a:\r\n ans += i*x\r\n\r\n if x != 1:\r\n x -= 1\r\n \r\nprint(ans) ", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += x * c[i]\r\n if x > 1: x -= 1\r\n else: x = 1\r\nprint(ans)", "def getMinTime(arr,n,x):\r\n arr.sort()\r\n minTime = 0\r\n for i in range(n):\r\n minTime += arr[i] * x\r\n if x > 1:\r\n x -= 1\r\n return minTime\r\n\r\nn, x = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nprint(getMinTime(arr,n,x))", "n, x = map(int, (input().split()))\r\nc = list(map(int, input().split()))\r\nc.sort()\r\ntotal = 0\r\nfor i in range(len(c)):\r\n if x > 1:\r\n total = total + (c[i]*x)\r\n x = x - 1\r\n else:\r\n total = total + c[i]\r\nprint(total)\r\n \r\n \r\n\r\n", "n, x = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nc.sort()\r\n\r\ntotal = 0\r\n\r\nfor i in c:\r\n total += i * x\r\n if x > 1:\r\n x -= 1\r\n\r\nprint(total)", "n,x=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nc.sort()\r\ni=0\r\nsum=0\r\nwhile x>1 and i<n:\r\n sum+=(c[i]*x)\r\n x-=1\r\n i+=1\r\nwhile i<n:\r\n sum+=c[i]\r\n i+=1\r\nprint(sum)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nres = 0\r\nfor i in arr:\r\n\tres += i * k\r\n\tk -= 1\r\n\tk = max(k, 1)\r\nprint(res)\r\n", "a,b=map(int,input().split())\nc=list(map(int,input().split()))\nc.sort()\nk=[]\nfor i in range(a):\n\tif b!=1:\n\t\tw=c[i]*b\n\t\tb=b-1\n\t\tk.append(w)\n\telif b==1:\n\t\tk.append(c[i])\nprint(sum(k))", "n, x = list(map(int, input().split()))\r\na = list(map(int , input().split()))\r\na = sorted(a)\r\ns = 0\r\nfor i in a:\r\n s += i * x \r\n if(x > 1):\r\n x -= 1 \r\n else:\r\n x = 1\r\n\r\nprint(s)", "n, x = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\n\r\nans = 0\r\nfor i in range(n):\r\n if x > 1:\r\n ans += x * a[i]\r\n x -= 1\r\n else:\r\n ans += a[i]\r\n\r\nprint(ans)\r\n", "# import sys\r\n# input = lambda: sys.stdin.readline().rstrip()\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\nn,x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc.sort()\r\nans = 0\r\nfor i in range(n):\r\n if x-i>=1:\r\n chh = x-i\r\n else:\r\n chh = 1\r\n ans+=(chh)*c[i]\r\nprint(ans)", "n, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nsum1 = 0\r\nfor i in range(len(arr)):\r\n\tsum1 = sum1 + arr[i] * x\r\n\tx = max(1, x - 1)\r\nprint(sum1)\r\n", "# https://codeforces.com/problemset/problem/439/B\n\nn,x=map(int, input().split())\nl=[int(i) for i in input().split()]\nl.sort()\nans=0\nfor i in l:\n ans+=i*x;\n x-=1;\n x=max(1,x)\nprint(ans)\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in a:\r\n c+=(i*x)\r\n x=max(1,x-1)\r\nprint(c)", "n, k = map(int, input().split())\n\na = list(map(int, input().split()))\na.sort()\n\nans = 0\n\nfor i in a:\n ans += i*k\n\n k -= 1\n if k == 0:\n k=1\n\nprint(ans)", "# https://codeforces.com/problemset/problem/439/B\r\n\r\nn, x = map(int, input().split())\r\nsubjects = list(map(int, input().split()))\r\nsubjects.sort()\r\n\r\nminTime = 0\r\nfor s in subjects:\r\n x = max(x, 1)\r\n minTime += x*s \r\n x = x - 1\r\n\r\nprint(minTime)\r\n", "import sys \n\nfor line in sys.stdin:\n line = line.strip(\"\\n\").split(\" \")\n n, x = int(line[0]), int(line[1])\n c = sys.stdin.readline()\n c = c.strip(\"\\n\").split(\" \")\n c = [int(i) for i in c]\n\n c.sort()\n counter = 0\n for i in c:\n counter += i * x\n if x > 1:\n x -= 1\n print(counter)\n", "n,x=map(int,input().split())\ny = sorted(list(map(int,input().split())))\nmim = 0\nfor i in y:\n mim += i*x\n if x>1:\n x=x-1\nprint(mim)\n \t\t\t \t \t\t \t \t \t\t \t\t \t \t\t\t", "arra = list(map(int,input().split()))\r\nchapters = list(map(int,input().split()))\r\ntime_learn_a_chapter=arra[1]\r\ntotal_min_time=0\r\nchapters.sort()\r\nfor c in chapters:\r\n total_min_time = total_min_time + time_learn_a_chapter * c\r\n if time_learn_a_chapter <= 1:\r\n time_learn_a_chapter = 1\r\n else:\r\n time_learn_a_chapter = time_learn_a_chapter - 1\r\nprint(total_min_time)", "inp = lambda: map(int, input().split())\r\nn, k = inp()\r\na = sorted(inp())\r\nans = 0\r\nfor i in range(n):\r\n ans+=(k*a[i])\r\n if k>1: k-=1\r\nprint(ans)", "n, c = map(int, input().split())\r\nt = sorted(list(map(int, input().split())))\r\nsum = 0\r\nfor i in t:\r\n sum += c * i\r\n if c > 1: \r\n c -= 1\r\n\r\nprint(sum)", "n,x = map(int, input().split())\r\nc = list(map(int,input().split()))\r\nc.sort()\r\ni = 0\r\noutput = 0\r\nwhile i < n:\r\n output += c[i] * x\r\n if (x > 1):\r\n x -= 1\r\n i += 1\r\nprint(output)", "n,x = map(int,input().split())\r\nls = map(int,input().split())\r\nls = sorted(ls)\r\nans =0\r\nfor i in range(0,len(ls)):\r\n ans+=ls[i]*x\r\n if(x>1):\r\n x-=1\r\nprint(ans) \r\n \r\n", "n,m=map(int,input().split())\r\nB = input().split()\r\nA = [int(x) for x in list(B)]\r\nA = sorted(A)\r\ndem = 0\r\nfor i in range(0,n):\r\n dem = dem + A[i]*m\r\n if m > 1:\r\n m -= 1\r\n else:\r\n m = 1\r\nprint(dem)", "n,k=list(map(int,input().split(\" \")))\r\na=list(map(int,input().split(\" \")))\r\nsum=0\r\na.sort()\r\nfor i in range(n):\r\n sum+=a[i]*k\r\n k=k-1\r\n k=max(k,1)\r\nprint(sum)", "n, x = map(int, input().split())\r\nb = sorted(list(map(int, input().split())))\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += x * b[i]\r\n if x > 1:\r\n x -= 1\r\n \r\nprint(s)\r\n\r\n", "n,x=map(int, input().split(\" \"))\r\n\r\narr=[int(i) for i in input().split(\" \")][:n]\r\narr.sort()\r\n# print(arr)\r\ns=0\r\ni=0\r\nwhile x>=1 and i<n:\r\n s+=arr[i]*x\r\n # print(s)\r\n if x<=1:\r\n x=1\r\n else:\r\n x-=1\r\n # print(x)\r\n i+=1\r\nprint(s)", "a=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nc=sorted(b)\r\ncount=0\r\nd=a[1]\r\nfor i in range(0,len(c)):\r\n count=count+(d*c[i])\r\n if(d>1):\r\n d=d-1\r\n else:\r\n continue\r\nprint(count) \r\n", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\ns=0\r\nfor i in range(n):\r\n s+=x*a[i]\r\n if(x>1):\r\n x-=1\r\n elif(x==1):\r\n x=1\r\nprint(s)", "# garbage.py\n\n# from pathlib import Path\n# ROOT = Path(__file__).parent.absolute()\n\n# \"new\", \"def\", \"def-param\", \"pt_mult_inputs\"\n\ndef main():\n\n num_subjects, learning_time = [int(items) for items in input().split()]\n\n subjects = [int(items) for items in input().split()]\n subjects.sort()\n\n total_time = 0\n for i in range(num_subjects):\n total_time += subjects[i] * max((learning_time - i), 1)\n\n print(total_time)\n\n\n\n\nif __name__ == '__main__':\n # print(\"Running garbage.py\")\n main()\n\t\t\t\t\t\t \t\t\t\t \t\t \t\t\t\t \t \t \t \t", "\r\n\r\nif __name__ == \"__main__\":\r\n\r\n temp = input()\r\n n, x = temp.split(' ')\r\n n = int(n)\r\n x = int(x)\r\n\r\n temp = input()\r\n c = list(temp.split(' '))\r\n\r\n for i in range(0, len(c)):\r\n c[i] = int(c[i])\r\n\r\n c.sort()\r\n cost = 0\r\n\r\n for i in range(0, len(c)):\r\n cost += c[i]*x\r\n if x > 1:\r\n x -= 1\r\n\r\n print(cost)", "\r\nn, k = map(int, input().split())\r\n\r\n\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\n\r\ntime = k\r\nans = 0\r\nfor i in a:\r\n ans += i * time\r\n if time > 1:\r\n time -= 1\r\n\r\nprint(ans)", "n,x = map(int, input().split())\r\nplan = sorted([x for x in map(int, input().split())])\r\ntime = 0\r\n\r\nfor item in plan:\r\n time += item * x\r\n if x > 1:\r\n x -= 1\r\n\r\nprint (time)", "nx=input().split()\r\nn,x=int(nx[0]),int(nx[1])\r\narr=list(map(int,(input().split())))\r\narr=sorted(arr)\r\nh=0\r\nfor i in range(n):\r\n h+=(arr[i])*x\r\n x=max(x-1,1)\r\nprint(h)", "def timeToLearn(chapters, k, length):\r\n chapters.sort()\r\n res = 0\r\n for i in range(length):\r\n res += k * chapters[i]\r\n if k > 1:\r\n k -= 1\r\n return res\r\n\r\n\r\nsize, k = list(map(int, input().split(\" \")))\r\nchapters = list(map(int, input().split(\" \")))\r\nprint(timeToLearn(chapters, k, size))\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nk=[]\r\nfor i in range(a):\r\n\tif b!=1:\r\n\t\tw=c[i]*b\r\n\t\tb=b-1\r\n\t\tk.append(w)\r\n\telif b==1:\r\n\t\tk.append(c[i])\r\nprint(sum(k))", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nn, x = inl()\r\na = sorted(inl())\r\n\r\nans = 0\r\nfor e in a:\r\n ans += (e * x)\r\n if x > 1:\r\n x -= 1\r\nprint(ans)", "subjects,initial=map(int,input().split()) ; arr=list(map(int,input().split())) ; arr.sort() ; summ=0\r\nfor i in arr:\r\n summ+=i*initial\r\n if initial>=2:\r\n initial-=1\r\nprint(summ)\r\n \r\n", "first_line = input()\na = first_line.split(' ')\na = [eval(i) for i in a]\nn = a[0]\nx = a[1]\n\narr_string = input()\narr = arr_string.split(' ')\narr = [eval(i) for i in arr]\n\nsum = 0\n\narr = sorted(arr)\nfor i in range(n):\n sum += arr[i]*x\n if x == 1: continue\n else: x= x-1\n\nprint(sum)\n\t\t \t\t\t\t \t \t \t \t \t \t \t \t\t\t\t", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nc.sort()\r\ntotal_time = 0\r\n\r\nfor i in range(n):\r\n total_time += c[i] * x\r\n x = x - 1 if x > 1 else 1\r\n\r\nprint(total_time)\r\n", "n,x =map(int,input().split())\r\nl= list(sorted(map(int,input().split())))\r\ntotal = 0\r\nfor i in l:\r\n if x==0:x=1\r\n total+=x*i\r\n x-=1\r\nprint(total)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nfor i in range(len(l)):\r\n \r\n a = max(m,1)\r\n ans+=l[i]*a\r\n m-=1\r\nprint(ans)\r\n ", "n, x = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\n\r\nc = 0\r\nfor i in range(n):\r\n c += max(1, x - i) * a[i]\r\n\r\nprint(c)", "def solve():\r\n n, x = map(int, input().split())\r\n arr = [int(i) for i in input().split()]\r\n arr.sort()\r\n sum_ = 0\r\n for i in range(n):\r\n sum_+= (arr[i]*x)\r\n if x > 1: x-=1\r\n print(sum_)\r\nsolve()", "n, x = list(map(int, input().split()))\r\nchapters = list(map(int, input().split()))\r\ntotal_hours = 0\r\nfor chapter in sorted(chapters):\r\n total_hours = total_hours + chapter * x\r\n if x > 1:\r\n x = x-1\r\nprint(total_hours)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 24 13:46:35 2020\r\n\r\n@author: dell\r\n\"\"\"\r\n\r\nn,x= map(int,input().split())\r\nl=[x for x in map(int,input().split())]\r\nl.sort()\r\n#print(l)\r\nhrs=0\r\nfor i in range(n):\r\n if x==1:\r\n hrs+=sum(l)*x\r\n break\r\n else:\r\n hrs+=x*l[0]\r\n del l[0]\r\n #print(l)\r\n x-=1\r\n \r\nprint(hrs) \r\n \r\n \r\n\r\n", "n,x=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\ns=0\r\ni=0\r\nwhile i<(len(lst)):\r\n if x==1:\r\n break\r\n else:\r\n s+=lst[i]*x\r\n x-=1\r\n lst.remove(lst[i])\r\n i=-1\r\n i+=1\r\nif len(lst)!=0:\r\n s+=sum(lst)\r\nprint(s)", "n,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\namt=0\r\nfor i in range(n):\r\n amt+=c[i]*x\r\n if x!=1:\r\n x-=1\r\nprint(amt)", "str1=input()\r\nl1=str1.split()\r\nn=l1[0]\r\nx=int(l1[1])\r\nstr1=input()\r\nl2=str1.split()\r\nfor i in range(len(l1)):\r\n l1[i]=int(int(l1[i]))\r\nfor i in range(len(l2)):\r\n l2[i]=int(int(l2[i]))\r\nl2.sort()\r\n# print(l2)\r\nsub=0\r\nfor i in range(len(l2)):\r\n sub = sub + x * l2[i]\r\n if x > 1:\r\n x = x-1\r\nprint(sub)", "n,x=input().split()\r\nn,x=[int(n),int(x)]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nans=0\r\nfor i in range(0,n):\r\n ans+=(a[i]*x)\r\n if x>1:\r\n x-=1\r\nprint(ans)", "# https://codeforces.com/contest/439/problem/B\r\nn, t = [int(n) for n in input().split()]\r\ncs = [int(n) for n in input().split()]\r\ncs = sorted(cs)\r\ntotal = 0\r\nfor c in cs:\r\n\ttotal += t*c\r\n\tt = max(1, t-1)\r\nprint(total)", "n, x = map(int, input().split())\r\nc = [int(x) for x in input().split()]\r\nc.sort()\r\nans = 0\r\nfor t in c:\r\n ans += t*x\r\n if x>1:\r\n x -= 1\r\nprint(ans)\r\n", "n,x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ntotal=0\r\narr.sort()\r\nfor i in range(n):\r\n if x > 1:\r\n total = total + arr[i]*x\r\n x=x-1\r\n else:\r\n total = total + arr[i]\r\n \r\n \r\nprint(total)\r\n ", "number_of_subjects, learning_hour = map(int, input().split())\r\n\r\nchapters_each_subject = list(map(int, input().split()))\r\n\r\nchapters_each_subject.sort()\r\n\r\nidx_subject = 0\r\n\r\ntotal_time = 0\r\n\r\nfor subject in chapters_each_subject:\r\n\ttotal_time += subject * learning_hour\r\n\tlearning_hour = max(1, learning_hour-1)\r\n\t\r\nprint(total_time)", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\ncs = sorted(c)\r\ni = 0\r\nsum = 0\r\n\r\nwhile i < n:\r\n sum += cs[i]*x\r\n if x != 1:\r\n x -= 1\r\n i += 1\r\n\r\nprint(sum)", "n,k = map(int,input().split())\r\nt=map(int,input().split())\r\nt=sorted(t)\r\ns=0\r\nfor i in t:\r\n s+=i*k\r\n if k>1:\r\n k-=1\r\nprint(s)\r\n ", "n, x = map(int, input().split())\r\nchap=list(map(int, input().split()))\r\nchap.sort()\r\nans = 0\r\nfor i in range(n):\r\n if x>=1:\r\n ans += (chap[i]*x)\r\n else:\r\n ans += (chap[i]*1)\r\n x-=1\r\nprint(ans)", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn, x = inp()\r\nc = arr_inp()\r\nc.sort()\r\nans = c[0] * x\r\nfor i in c[1:]:\r\n if x > 1:\r\n x -= 1\r\n ans += i * x\r\n\r\nprint(ans)\r\n", "#1: Devu, the Dumb Guy\nn, x = map(int, input().split())\na = sorted(list(map(int, input().split())))\nprint(sum([a[i]*max(x-i, 1) for i in range(len(a))]))", "N,K=(int(num) for num in input().split())\r\nA=[int(num) for num in input().split()]\r\nA.sort()\r\ni=0\r\nsum=0\r\nwhile i<N and K>1:\r\n sum+=A[i]*K\r\n K-=1\r\n i+=1\r\nwhile i<N:\r\n sum+=A[i]*K\r\n i+=1\r\nprint(sum)", "n,x = map(int,input().split())\r\ns = sorted([int(i) for i in input().split()])\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n\tif x==1:\r\n\t\tcnt+=sum(s[i:n])\r\n\t\tbreak\r\n\telse:\r\n\t\tcnt+=s[i]*x\r\n\t\tx-=1\r\nprint(cnt)\r\n", "'''\r\n @Author: Pham T. Nhan\r\n @Date: 2/11/2018\r\n @Name: Devu, the Dumb Guy\r\n @Link: http://codeforces.com/problemset/problem/439/B\r\n'''\r\n\r\n\r\ndef main():\r\n n, x = map(int, input().split())\r\n chapter = list(map(int, input().split()))\r\n chapter.sort()\r\n\r\n total_time = 0\r\n for i in range(n):\r\n total_time += chapter[i]*x\r\n x -= 1\r\n if x < 1:\r\n x = 1\r\n\r\n print(total_time)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,x=map(int, input().split())\r\nc=list(map(int, input().split()))\r\nc.sort()\r\nt=0\r\nfor i in range (len(c)):\r\n t+=x*c[i]\r\n if x!=1:\r\n x-=1\r\nprint(t)", "n, x = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\n\r\ntotal = 0\r\n\r\nfor chapter in arr:\r\n total += chapter*x\r\n x = max(1, x-1)\r\n\r\n\r\nprint(total)", "def find_min_hour(n, x, arr):\r\n sum = 0\r\n arr = sorted(arr)\r\n\r\n for c in arr:\r\n sum += x * c\r\n if x != 1:\r\n x -= 1\r\n\r\n return sum\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nC = list(map(int, input().split()))\r\nmin_hour = find_min_hour(first_line_input[0], first_line_input[1], C)\r\nprint(min_hour)\r\n", "cost = list(map(int, input().split(\" \")))[1]\r\narr = list(map(int,input().split(\" \")))\r\n\r\narr = sorted(arr)\r\n\r\nsum=0\r\nfor i in range(len(arr)):\r\n sum+=arr[i]*cost;\r\n if cost>1:\r\n cost-=1\r\n\r\nprint(sum)", "\ndef solve(n, x, c):\n c.sort()\n s = 0\n for t in c:\n s += t*x\n x = max(1,x-1)\n return s\n\nn, x = [int(_) for _ in input().split()]\nc = [int(_) for _ in input().split()]\nprint(solve(n, x, c))\n \n", "n, x = [int(j) for j in input().split()]\r\nnums = [int(j) for j in input().split()]\r\ndef sort(l, r):\r\n size = r - l\r\n if size < 2:\r\n return\r\n mid = int(size / 2 + l)\r\n sort(l, mid)\r\n sort(mid, r)\r\n decoy, p1, p2 = [], l, mid\r\n while p1 < mid and p2 < r:\r\n if nums[p1] < nums[p2]:\r\n decoy.append(nums[p1])\r\n p1 += 1\r\n else:\r\n decoy.append(nums[p2])\r\n p2 += 1\r\n while p1 < mid:\r\n decoy.append(nums[p1])\r\n p1 += 1\r\n while p2 < r:\r\n decoy.append(nums[p2])\r\n p2 += 1\r\n for j in range(l, r):\r\n nums[j] = decoy[j - l]\r\n \r\ntotal = 0\r\nsort(0, n)\r\nfor j in range(n):\r\n total += nums[j] * x\r\n x = max(x - 1, 1)\r\nprint(total)\r\n", "n_subs, hours = [int(x) for x in input().split()]\nsubjects = [int(x) for x in input().split()]\nsubjects.sort()\nif hours >= len(subjects):\n decreasing_time = list(range(hours, 0, -1))\n subjects = [x * decreasing_time[i] for i,x in enumerate(subjects)]\n result = sum(subjects)\nelse:\n decreasing_time = list(range(hours, 1, -1))\n decreasing_time = [x * subjects[i] for i,x in enumerate(decreasing_time)]\n result = sum(decreasing_time + subjects[hours-1:])\nprint(result)\n", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\np=0\r\nfor i in range(len(l)):\r\n p=l[i]*x+p\r\n if(x>1):\r\n x=x-1\r\nprint(p)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, x = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n c += w[i] * x\r\n x = max(1, x-1)\r\nprint(c)", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\na=0\r\nfor i in range (x):\r\n if y>=1:\r\n a=a+y*l[i]\r\n y=y-1\r\n else:\r\n y=1\r\n a=a+y*l[i]\r\nprint(a)\r\n \r\n", "subject,hour=map(int,input().split())\r\nchapter=list(map(int,input().split()))\r\nglobal sum\r\nsum=0\r\nchapter.sort()\r\nfor i in range(subject):\r\n if hour==1:\r\n sum+=chapter[i]\r\n else:\r\n sum+=chapter[i]*hour\r\n hour-=1\r\n\r\nprint(sum)", "# link: https://codeforces.com/problemset/problem/439/B\r\n\r\nfrom sys import stdin, stdout\r\n\r\nif __name__ == \"__main__\":\r\n n, x = map(int, stdin.readline().split())\r\n chapters = list(map(int, stdin.readline().split()))\r\n chapters.sort() # necessary\r\n minimum_hours = 0\r\n for count in chapters:\r\n minimum_hours += (count * x)\r\n x -= 1\r\n if x == 0:\r\n x = 1\r\n print(minimum_hours)", "n, x = map(int, input().split())\nc = list(map(int, input().split()))\n\nc1 = sorted(c)\nsum = 0\nfor i in range(n):\n\tsum += x * c1[i]\n\tif (x > 1):\n\t\tx -= 1\nprint(sum)", "import sys\r\nn,x = map(int,sys.stdin.readline().split())\r\narr = list(map(int,sys.stdin.readline().split()))\r\n\r\narr.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans+=arr[i]*x\r\n x-=1\r\n if x<=1:\r\n x=1\r\nprint(ans)", "from math import *\r\nfrom collections import deque\r\nfrom copy import deepcopy\r\nimport sys\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\") #for fast input\r\ndef multi(): return map(int,input().split())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef out(var): sys.stdout.write(str(var)) #for fast output, always take string\r\ndef printlist(a) :\r\n print(' '.join(str(a[i]) for i in range(len(a))))\r\n\r\ndef isPrime(n) :\r\n if (n <= 1) : return False\r\n if (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 = i + 6\r\n return True\r\n\r\n#copied functions end\r\n\r\n#start coding\r\n\r\nn,x=multi()\r\na=lis()\r\n\r\na.sort()\r\n\r\nans=0\r\nfor i in a:\r\n ans+=(x*i)\r\n if(x>1):\r\n x-=1\r\n\r\n\r\nprint(ans)", "n = input()\r\nn = [int(i) for i in n.split()]\r\na = input()\r\na = [int(i) for i in a.split()]\r\na = sorted(a)\r\ns = 0\r\nfor i in range(n[0]):\r\n\ts = s + a[i]*n[1]\r\n\tif n[1]>1:\r\n\t\tn[1]-=1\r\nprint(s)", "n, x = map(int, input().split())\r\nc = sorted(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if x == 0:\r\n x += 1\r\n ans += c[i] * x\r\n x -= 1\r\nprint(ans)", "n,x = map(int , input().split())\r\nl = sorted([int(i) for i in input().split()]) ; ans = 0;\r\nfor i in l:\r\n\r\n if(x > 1):\r\n ans += x * i\r\n x -= 1\r\n else:\r\n ans += i * 1 \r\nprint(ans)\r\n\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort()\r\noutput = 0\r\nfor i in b:\r\n\toutput +=i*a[1]\r\n\ta[1] -=1\r\n\tif a[1] == 0:\r\n\t\ta[1] += 1\r\nprint (output)", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nc=0\r\ni=0\r\nwhile x>1 and i<n:\r\n c+=l[i]*x\r\n i+=1\r\n x=x-1\r\nif x==1 and i<n:\r\n while i<n:\r\n c+=l[i]\r\n i+=1\r\nprint(c)", "n,x = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\n# pre = [0]*n\r\n# pre[0]=l[0]\r\n# for i in range(1,n):\r\n# pre[i]=pre[i-1]+l[i]\r\nt = 0\r\nfor j in range(n):\r\n t+=(l[j]*x)\r\n if x>1:\r\n x-=1\r\nprint(t)", "n,x = map(int,input().split())\r\nnss = [int(i) for i in input().split()]\r\nnss = sorted(nss)\r\n\r\nhours = 0\r\n\r\ni = 0\r\nwhile i < len(nss):\r\n if x != 1:\r\n hours += nss[i]*x\r\n x -= 1\r\n else:\r\n break\r\n i += 1\r\nprint(hours+sum(nss[i:]))", "# Devu, the Dumb Guy\r\ndatain = True\r\n\r\nif datain:\r\n n, x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\nelse:\r\n n, x = 2, 3\r\n a = [4, 1]\r\n\t\r\na.sort()\r\nsa = len(a)\r\n\r\ntime = x * a[0]\r\n\r\nif (sa == 1):\r\n\tprint(time)\r\nelse:\r\n\tfor i in range(1,sa):\r\n\t\tx = max(x-1, 1)\r\n\t\ttime += x * a[i]\r\n\t\t\t\r\n\tprint(time)", "# https://codeforces.com/problemset/problem/439/B\n\nif __name__ == '__main__':\n n, x = map(int, input().split())\n\n A = list(map(int, input().split()))\n A = sorted(A)\n\n time = 0\n\n for i in range(n):\n time += A[i]*x\n x = max(1, x-1)\n\n print(time)", "(n,x) = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\na.sort()\r\nans = 0\r\nfor i in range(0,n):\r\n ans+= a[i]*x\r\n if x > 1:\r\n x-=1\r\nprint(ans)", "n,x=[int(i) for i in input().split()]\r\nc=[int(j) for j in input().split()]\r\nc.sort()\r\ntime=0\r\nfor k in range(n):\r\n time+=(c[k]*x)\r\n if x>1:\r\n x-=1\r\nprint(time)", "n,k=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+k*c[i]\r\n if(k>1):\r\n k=k-1\r\nprint(sum)\r\n ", "n,x = map(int, input().split())\r\ninp = list(map(int, input().split()))\r\nans = 0\r\nfor i in sorted(inp):\r\n ans += i * x\r\n x = max(x-1,1)\r\nprint(ans)", "if __name__ == '__main__':\r\n n, x = map(int, input().rstrip().split())\r\n s = 0\r\n arr = sorted(list(map(int, input().rstrip().split())))\r\n for i, e in enumerate(arr):\r\n if x - i >= 1:\r\n s += (x - i) * e\r\n else:\r\n s += e\r\n print(s)\r\n", "import math\r\n\r\nn,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\nc.sort()\r\nanswer=0;\r\n\r\nfor i in range(n):\r\n answer+=max(1*c[i],c[i]*(x-i))\r\nprint(answer)", "from sys import stdin, stdout, setrecursionlimit\r\nfrom gc import disable\r\n\r\n#stdin = open(\"input.txt\",\"r\")\r\n#stdout = open(\"output.txt\",\"w\")\r\n \r\n#setrecursionlimit((1<<31)-1)\r\n\r\n \r\ngets = input\r\nputs = print\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\n\r\ndef main() -> int:\r\n disable()\r\n n,x = map(int,input().split())\r\n a = sorted(map(int,input().split()))\r\n i = 0\r\n count = 0\r\n while (x != 1 and i < n):\r\n count+=a[i]*x\r\n x-=1\r\n i+=1\r\n count += sum(a[i:])\r\n print(\"%i\"%count)\r\n return 0;\r\n \r\nif (__name__ == \"__main__\"):\r\n main()\r\n \r\n#stdin.close()\r\n#stdout.close()", "x , y = list(map(int,input().split()))\r\n\r\nls = sorted(list(map(int,input().split())))\r\nsum=0\r\nfor i in ls:\r\n if y > 1:\r\n sum+=y*i\r\n y-=1\r\n else:\r\n sum+=i\r\nprint(sum)", "\r\nn, x = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nans = 0\r\nfor i in l:\r\n\tans += max(x, 1) * i\r\n\tx -= 1\r\n\r\nprint(ans)", "# Devu, the Dumb Guy\r\nfrom typing import List\r\n\r\nclass Solution:\r\n\r\n @classmethod\r\n def solve(cls, n: int, x: int, chapters: List[int]):\r\n sorted_arr = sorted(chapters)\r\n total = 0\r\n for i in range(n):\r\n total += sorted_arr[i] * x\r\n if x > 1:\r\n x -= 1\r\n return total\r\n\r\nif __name__ == \"__main__\":\r\n n, x = (input().split(\" \"))\r\n n, x = int(n), int(x)\r\n chapters = list(map(lambda x: int(x), input().split(\" \")))\r\n result = Solution.solve(n, x, chapters)\r\n print(result)\r\n\r\n", "n , x = map(int,input().split())\r\nsubjects = list(map(int,input().split()))\r\nsubjects.sort()\r\ntime = 0\r\nfor i in subjects:\r\n if x > 1:\r\n time += x*i\r\n x -=1\r\n else:\r\n time += i\r\nprint(time)\r\n", "def solve():\r\n n, x = map(int, input().split())\r\n arr = [int(i) for i in input().split()]\r\n arr.sort()\r\n sum_ = 0\r\n for i in arr:\r\n sum_+= (i*x)\r\n if x > 1: x-=1\r\n print(sum_)\r\nsolve()", "n,x=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nsum1=0\r\nfor i in range(0,len(a)):\r\n if x>1:\r\n sum1=sum1+a[i]*x\r\n x=x-1\r\n else:\r\n sum1=sum1+a[i]\r\nprint(sum1)", "n,x=list(map(int,input().rstrip().split()))\r\na=list(map(int,input().rstrip().split()))\r\na.sort()\r\nsum1=0\r\nfor i in range(n):\r\n sum1+=a[i]*x\r\n if x>1:\r\n x-=1\r\nprint(sum1)", "n, m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ntotal=0\r\nfor i in range(n):\r\n if m==1:\r\n for j in range(i,n):\r\n total+=l[j]\r\n break\r\n else:\r\n total+=l[i]*m\r\n m-=1\r\nprint(total) \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n", "n, p = map(int, input().split())\r\nsubjects = list(map(int, input().split()))\r\nsubjects.sort()\r\n\r\ntime = 0\r\nfor s in subjects:\r\n time += p * s\r\n p = p - 1 if p > 1 else 1\r\n \r\nprint(time)", "\"\"\"\n\"\"\"\ndef find_minimum_hours(init_hour, chapters):\n chapters.sort()\n study_hour = init_hour\n total_hours = 0\n for chapter in chapters:\n total_hours += chapter * study_hour\n if study_hour > 1:\n study_hour -= 1\n return total_hours\n\nif __name__ == '__main__':\n num_subjects, init_hour = list(map(int, input().split()))\n chapters = list(map(int, input().split()))\n print(find_minimum_hours(init_hour, chapters))", "n, x = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\na.sort()\r\ni = 0\r\nres = 0\r\nwhile i < n:\r\n res += a[i] * x\r\n if (x > 1):\r\n x -= 1\r\n i += 1\r\nprint(res)", "p=input().rstrip().split(' ')\r\nq=input().rstrip().split(' ')\r\nq.sort(key=int)\r\nl=[]\r\nw=[]\r\nS=[]\r\nD=[]\r\nF=0;\r\nY=int(p[1])\r\nfor i in range(0,len(q)):\r\n l.append(int(q[i]))\r\n w.append(Y);\r\n F+=(l[i]*w[i])\r\n if Y==1:\r\n Y=1;\r\n else:\r\n Y-=1;\r\nprint(F)", "def start():\r\n\r\n n, x = map(int, input().split())\r\n a = list(map(int,input().strip().split()))[:n]\r\n count = 0\r\n time = 0\r\n e = 0\r\n a.sort()\r\n for j in a :\r\n\r\n time += j * x\r\n if x == 1 :\r\n continue\r\n else: x -=1\r\n\r\n print(time)\r\n\r\nif __name__ == '__main__':\r\n start()", "n, m = map(int, input().split())\r\nres = 0\r\nl = sorted([int(i) for i in input().split()])\r\nfor i in range(n):\r\n\tif m == 1:\r\n\t\tres += l[i]\r\n\telse:\r\n\t\tres += l[i] * m\r\n\t\tm -= 1\r\nprint(res)", "n, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans1 = 0\r\nfor i in range(n):\r\n ans1 += arr[i] * x\r\n if x > 1:\r\n x -= 1\r\nprint(ans1)", "n,x=map(int,input().split())\r\nl=[int(q) for q in input().split()]\r\n\r\nans=0\r\nq=sorted(l)\r\nfor i in range(len(l)):\r\n ans+= x*(q[i])\r\n if x>1:\r\n x-=1\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=m\r\nans=0\r\nfor i in l:\r\n if k>1:\r\n ans=ans+i*k\r\n k=k-1\r\n else:\r\n ans=ans+i\r\nprint(ans)", "a,b=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nr.sort()\r\ns=0\r\nfor i in range(len(r)):\r\n\ts+=r[i]*max(1,b-i)\r\nprint(s)", "n, x = map(int, input().split())\narr = sorted(list(map(int, input().split())))\np = 0\nfor i in range(n):\n\tp += (x * arr[i])\n\tif x != 1:\n\t\tx -= 1\nprint(p)", "n,x=input().strip().split(\" \")\r\nn,x=[int(n),int(x)]\r\na=list(map(int,input().strip().split(\" \")))\r\na.sort()\r\nans=0\r\nfor i in a:\r\n if x>1:\r\n ans+=i*x\r\n x-=1\r\n else:\r\n ans+=i\r\nprint(ans)\r\n", "\r\nn,x=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nar.sort()\r\n\r\nind = x\r\ntime = 0\r\nfor i in ar:\r\n time += i*ind\r\n if (ind-1)>=1: ind-=1\r\nprint(time)\r\n ", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ns=0\r\nfor i in l:\r\n s=s+(x*i)\r\n if(x>1):\r\n x=x-1\r\nprint(s)", "s, h = [int(i) for i in input().split()]\nsub = [int(i) for i in input().split()]\nsub.sort()\nresult = 0\nfor i in sub:\n result += h*i\n if (h>1):\n h-=1\nprint(result)\n\t \t\t \t\t \t\t \t\t\t \t \t\t \t\t \t", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nc.sort()\r\nres = 0\r\nfor i in c:\r\n res += i * x\r\n if (x > 1):\r\n x -= 1\r\n\r\nprint(res)\r\n", "n,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\n\r\ncnt = 0\r\nfor chap in a:\r\n cnt+= chap*x\r\n if x>1:\r\n x-=1\r\nprint(cnt) ", "n,x=map(int,input().split())\r\np=[int(x) for x in input().split()]\r\np=sorted(p)\r\ns=0\r\nfor i in range (0,n):\r\n s+=x*p[i]\r\n if x>1:\r\n x-=1\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nt1=0\r\nfor i in range(n):\r\n if t>1:\r\n t1=t1+a[i]*(t)\r\n t-=1\r\n else:\r\n t1=t1+a[i]\r\nprint(t1)", "n, x = map(int, input().split())\r\nl_c = list(map(int, input().split()))\r\nl_c.sort()\r\n\r\nt = 0\r\nfor i in range(len(l_c)):\r\n t += max(1, x - i) * l_c[i]\r\n \r\nprint(t) ", "n, x = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=x*a[i]\r\n if(x>1):\r\n x-=1\r\nprint(ans)", "n, x = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nc.sort()\r\ndef min_hour(n,x,c):\r\n result = 0\r\n i = 0\r\n while i < n:\r\n if i == 0:\r\n time = x\r\n else:\r\n if time != 1:\r\n time -= 1\r\n else:\r\n time = 1\r\n result += c[i]*time\r\n i += 1\r\n return result\r\n\r\n# print (c)\r\nprint (min_hour(n,x,c))\r\n ", "\r\nn,x=map(int,input().split())\r\nArray=list(map(int, input().split()))\r\n\r\nArray=sorted(Array,reverse=False)\r\ntime=0\r\nfor item in Array:\r\n time+=(item*x)\r\n if(x>1):\r\n x-=1\r\n\r\nprint(time)", "y=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\nn=y[0]\r\nx=y[1]\r\nif n==1:\r\n print(c[0]*x)\r\nelif x==1:\r\n print(sum(c))\r\nelse:\r\n c.sort()\r\n q=[]\r\n for i in range(len(c)):\r\n p=c[i]*x\r\n q.append(p)\r\n x=x-1\r\n if x<1:\r\n x=1\r\n print(sum(q))", "num=list(map(int,input().split()))\r\nn,x=num[0],num[1]\r\nchap=list(map(int,input().split()))\r\nchap.sort()\r\nmove=0\r\nfor i in chap:\r\n move+=i*x\r\n if x>1:\r\n x-=1\r\nprint(move)", "n,x = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nsum = 0\r\n\r\nmas.sort()\r\n\r\nfor i in mas:\r\n sum += i*x\r\n x = max(x-1,1)\r\n\r\nprint(sum)\r\n", "n,x=map(int,input().split())\r\na,s=sorted(map(int,input().split())),0\r\nfor i in a:\r\n s+=i*x\r\n if x>1:x-=1\r\nprint(s)", "n, x = map(int,input().split())\r\nc = list(map(int,input().split()))\r\n\r\nc.sort()\r\n#print(c)\r\nans = 0\r\ni = 0\r\nj = x\r\nwhile i < n and j > 0:\r\n\tans += c[i] * j\r\n\ti += 1\r\n\tj -= 1\r\n\tif j == 0:\r\n\t\tj = 1\r\nprint(ans)", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n if x>0:\r\n ans+=a[i]*x\r\n x-=1\r\n else:\r\n ans+=a[i]\r\nprint(ans)", "n,h = map(int, input().split())\r\n\r\nlec = list(map(int, input().split()))\r\n\r\nlec = sorted(lec)\r\n\r\ntotal = 0\r\n\r\nfor i in lec:\r\n total+= i* h\r\n if h > 1:\r\n h-=1\r\nprint(total)", "from sys import stdin, stdout\r\n\r\nn, x = map(int, stdin.readline().split())\r\nchapters = list(map(int, stdin.readline().split()))\r\ntime = 0\r\nchapters.sort()\r\n\r\nfor c in chapters:\r\n time += x*c\r\n x = max(x-1, 1)\r\nstdout.write(str(time) + '\\n')", "n,x=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\ni=0\r\nt=0\r\nwhile i<n:\r\n t=t+x*s[i]\r\n if x>1:\r\n x=x-1\r\n i=i+1\r\nprint(t)", "n,x = map(int,input().split())\r\na = []\r\na = list(map(int,input().split()))\r\na.sort()\r\nr = 0\r\nfor i in a:\r\n r += i*x\r\n if x > 1: x -= 1\r\nprint(r)", "n,x=(map(int,input().split()))\r\n# arr=[list(map(int,input().split())) for i in range(n)]\r\narr=list(map(int,input().split()))\r\n# power=int(input())\r\narr.sort()\r\nans=0\r\nfor i in arr:\r\n ans+=i*x\r\n if x>1:\r\n x-=1\r\nprint(ans)\r\n", "n, x = list(map(int, input().split(' ')))\narr = list(map(int, input().split(' ')))\narr.sort()\ntime=0\nfor c in arr:\n time+=c*x\n if x>1:\n x-=1\nprint(time)", "'''\r\n Auther: sayak04 Sayak 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 n,x=mi()\r\n arr=[int(i) for i in input().split()]\r\n arr.sort()\r\n ans=0\r\n for i in range(0,n):\r\n ans = ans + x*arr[i]\r\n if(x>1):\r\n x-=1\r\n else:\r\n x=1\r\n print(ans)\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()", "n, x = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\ni = 0\r\ntime = 0\r\nwhile i < n:\r\n if x > 1:\r\n time += x*a[i]\r\n if x == 1:\r\n time += x*a[i]\r\n x = 2\r\n i += 1\r\n x -= 1\r\nprint(time)\r\n\r\n", "n, x = map(int, input().split(' '))\nc = list(map(int, input().split(' ')))\nsorted_c = sorted(c)\n\nsum = 0\n\nfor i in range(n):\n tmp = max(1, x)\n sum += sorted_c[i] * tmp\n x = x - 1\n\nprint(sum)", "import math\r\nfor _ in range(1):\r\n n,x=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n sum1=0\r\n for i in l:\r\n sum1+=i*x\r\n if x>1:\r\n x=x-1\r\n else:\r\n continue\r\n print(sum1) ", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum=l[0]*x\r\nfor i in range(1,n):\r\n if x>1:\r\n x-=1 \r\n sum+=l[i]*x \r\n else:\r\n sum+=l[i]*x \r\nprint(sum) ", "r = lambda: map(int,input().split())\nn, l = r()\nc = sorted(list(r()))\nprint (sum(x*max(l-i,1) for i,x in enumerate(c)))\n\t\t \t\t\t \t\t \t \t\t\t \t \t\t\t", "def cal_hour(n, x, subjects):\r\n total_hour = 0\r\n # sort out the subject with least chapters, so that he can study it first\r\n subjects = sorted(subjects)\r\n \r\n \r\n for num_subject in subjects:\r\n if x > 1:\r\n total_hour += num_subject * x\r\n x-=1\r\n else:\r\n total_hour += num_subject\r\n return total_hour\r\n\r\nn, x = map(int, input().split())\r\nsubjects = list(map(int, input().split()))\r\nresult = cal_hour(n, x, subjects)\r\nprint(result)", "n, x = map(int, input().rstrip().split(\" \"))\r\nl = list(map(int, input().rstrip().split(\" \")))\r\nl.sort()\r\ntotal = 0\r\nfor i in range(n):\r\n if x < 1:\r\n x = 1\r\n total+= l[i]*x\r\n\r\n x-=1\r\nprint(total)", "n, x = map(int,input().split())\r\nsubject = list(map(int,input().split()))\r\n\r\nsubject.sort()\r\nsum_time = 0\r\nfor i in range(n):\r\n sum_time += (subject[i] * x)\r\n x = max(x - 1, 1)\r\nprint(sum_time)\r\n ", "def main():\r\n n,x=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n ans=0\r\n for i in range(n):\r\n ans+=a[i]*x\r\n if x>1:x-=1\r\n print(ans)\r\nmain()", "n,c=map(int,input().split())\r\nL=sorted([k for k in map(int,input().split())])\r\nresultado=0\r\nfor k in L:\r\n if(c==0):\r\n c=1\r\n resultado+=k*c\r\n c-=1\r\nprint(resultado)\r\n", "n,l=map(int,input().split())\r\nd=list(map(int,input().split()))\r\na=0\r\nd.sort()\r\nfor i in range(len(d)):\r\n a=a+(l*d[i])\r\n if l>1:\r\n l=l-1\r\nprint(a)\r\n", "n, x = map(int, input().split())\na = list(map(int, input().split()))\ni = s = 0\nb = sorted(a)\nwhile i < n:\n\ts += (b[i] * x)\n\tif x > 1:\n\t\tx -= 1\n\ti += 1\nprint(s)", "a = input()\r\nb = input()\r\n\r\nn, x = [int(i) for i in a.split()]\r\nsubjects = [int(i) for i in b.split()]\r\n\r\nsubjects.sort()\r\ntime = 0\r\n\r\nfor i in subjects:\r\n time += x * i\r\n if x > 1:\r\n x -= 1\r\nprint(time)", "n , x = map(int,input().split())\r\n\r\nl = sorted(list(map(int,input().split())))\r\n\r\nans = 0\r\ncur = x\r\n\r\nfor i in range(n):\r\n ans += cur * l[i]\r\n cur -= 1\r\n if cur < 1 :\r\n cur = 1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n", "s=input().split(' ')\r\nn=int(s[0])\r\nx=int(s[1])\r\n\r\nsub=[int(i) for i in input().split(' ')]\r\nsub=sorted(sub)\r\nresult=0\r\nfor i in sub :\r\n result=result+i*x\r\n if(x>1):\r\n x=x-1\r\nprint(result)", "n, x = [int(i) for i in input().split()]\r\n \r\narr = [int(i) for i in input().split()]\r\n \r\narr.sort()\r\ntime = 0\r\nfor i in arr:\r\n time += x * i\r\n \r\n if x > 1:\r\n x -= 1\r\nprint(time)", "# بســـــــــــم الله الرحــــــــمن الرحـــــــــيم\r\ndef solve():\r\n n, x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n sum = 0\r\n for i in range(n):\r\n sum += max(1, x) * a[i]\r\n x -= 1\r\n print(sum)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "def main():\r\n n, x = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n\r\n s = 0\r\n for i in range(n):\r\n s += arr[i] * x\r\n x = max(1, x-1)\r\n print(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in l:\r\n c+=(i*x)\r\n if x>=2:\r\n x-=1\r\nprint(c)\r\n", "(n, x) = map(int, list(input().split()))\r\nc = list(map(int, list(input().split())))\r\n\r\nc = sorted(c)\r\ns = 0\r\n\r\nfor i in range(n):\r\n s += c[i] * x\r\n if x != 1:\r\n x -= 1\r\n\r\nprint(s)\r\n", "n,x=map(int,input().split())\r\na=list(map(int,input().strip().split()))\r\na.sort()\r\nans=0\r\nc=x\r\nfor i in range(n):\r\n ans+=a[i]*c\r\n if c>1:c-=1\r\nprint(ans)", "import sys\r\n\r\n\r\ndef ints_input():\r\n return [int(i) for i in sys.stdin.readline().strip(\"\\n\").split(\" \")]\r\n\r\n\r\ndef print_list(arr):\r\n sys.stdout.writelines(str(x)+\" \" for x in arr)\r\n sys.stdout.write(\"\\n\")\r\n\r\n\r\ndef fast_input(type=str):\r\n return type(sys.stdin.readline().strip(\"\\n\"))\r\n\r\n\r\nn, x = ints_input()\r\na = ints_input()\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += a[i] *x\r\n if x>1:\r\n x-=1\r\n \r\nprint(ans)", "n,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nsum=0\r\nfor i in c:\r\n sum+=i*x\r\n if x>1:\r\n x-=1\r\nprint(sum)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n, x = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()][:n]\r\nresult = 0\r\nc.sort()\r\nfor i in range(n):\r\n result += x * c[i]\r\n if(x == 1):\r\n continue\r\n else:\r\n x -= 1\r\n# for i in range(n):\r\n# print(c[i])\r\nprint(result)\r\n", "inp = int(input().split(\" \")[1])\r\n\r\nsubs = sorted(list(map(lambda a: int(a), input().split(\" \"))))\r\n\r\ntot = 0\r\nfor i in subs:\r\n tot+=i*inp\r\n if inp > 1:\r\n inp-=1\r\nprint(tot)\r\n", "n,x=[int(x) for x in input().split()]\r\nc=[int(x) for x in input().split()]\r\nc.sort()\r\nans=0\r\nfor item in c:\r\n ans+=item*x\r\n if x>1:\r\n x-=1\r\nprint(ans)", "a = list(map(int, input().split(' ')))\r\n# a = [4, 2]\r\nsubject = a[0]\r\nhours = a[1]\r\nchapters = list(map(int, input().split(' ')))\r\n# chapters = [5, 1, 2, 1]\r\nchapter = sorted(chapters)\r\ns = 0\r\nresult = 0\r\nwhile s < subject:\r\n result += chapter[s] * hours\r\n if hours > 1:\r\n hours -= 1\r\n else:\r\n hours = 1\r\n s += 1\r\nprint(result)", "\r\ndef findMinHours(hours, chapters):\r\n total_time = 0\r\n for item in sorted(chapters):\r\n total_time += item*hours\r\n hours -=1\r\n if(hours < 1):\r\n hours = 1\r\n return total_time\r\n\r\n#input\r\nsubjects, hours = list(map(int, input().split()))\r\nchapters = list(map(int, input().split()))\r\nprint(findMinHours(hours, chapters))", "n, x = map(int, input().split())\nA = [int(x) for x in input().split()]\nans = 0\nA.sort()\n\nfor c in A:\n ans += x * c\n x -= 1\n x = max(1, x)\nprint(ans)", "n,x = map(int, input().split())\nnums = list(map(int, input().split()))\nnums.sort()\ntime = 0\nfor num in nums:\n time+= num*x\n if x >1:\n x -= 1\n\nprint(time)\n", "p=input().split();i=0\r\nn=int(p[0]);x=int(p[1])\r\ny=list(map(int,input().split()));y.sort();min=0\r\nwhile i<n:\r\n if (x<=1):\r\n x=1\r\n min+=y[i]*x\r\n x-=1\r\n i+=1\r\nprint(min) \r\n", "n, x = map(int,input().split())\r\na = [int(_) for _ in input().split()]\r\na.sort()\r\nans=0\r\nfor i in a:\r\n ans+=x*i\r\n if x!=1:\r\n x-=1\r\nprint(ans)\r\n", "n,x = map(int,input().split())\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nt.sort()\r\n\r\n\r\np=0\r\n\r\n\r\nfor k in range(n):\r\n p+=t[k]*x\r\n if x>1:\r\n x-=1\r\n else:\r\n x=1\r\n\r\nprint(p)\r\n", "from sys import stdin\nfrom collections import Counter,defaultdict,deque\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\nimport copy\n\n\nn,x = map(int,input().split())\narr = list(map(int,input().split()))\narr.sort()\nans = 0\nfor i in arr:\n ans+=i*x\n x = max(1,x-1)\nprint(ans)\n", "n,x=map(int,input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(a)\r\nresult = 0\r\nfor i in range(n):\r\n result = result + x*b[i]\r\n if x > 1:\r\n x=x-1\r\nprint(result)", "number = list(map(int , input().split()))\r\nchapters = list(map(int , input().split()))\r\nchapters.sort()\r\ncounter = 0\r\nfor i in range(0 , number[0]) :\r\n counter += chapters[i] * number[1]\r\n number[1] = number[1] - 1 if number[1] > 1 else 1\r\nprint(counter)", "n,m = map(int,input().split())\r\nmat = list(map(int, input().split()))\r\nmat = sorted(mat)\r\nresult = 0\r\nif m!=1:\r\n for j in range(n):\r\n result+=(mat[j]*m)\r\n m-=1\r\n if m==1:\r\n break\r\n j+=1\r\n if j<n: result += sum(mat[j::])\r\nelse:\r\n result += sum(mat)\r\nprint(result)\r\n", "n,x=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n ans+=i*x\r\n x=max(x-1,1)\r\nprint(ans)", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nres = 0\r\nfor i in range(n):\r\n res += a[i] * k\r\n k = max(1, k-1)\r\nprint(res)", "n, x = map(int, input().split())\r\nC = list(map(int, input().split()))\r\nC.sort()\r\nC.insert(0, 0)\r\nres = 0\r\nfor i in range(1, n + 1):\r\n res = res + x * C[i]\r\n if x > 1:\r\n x -= 1\r\nprint(res)\r\n", "n,x=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nsum=0\r\nfor i in l:\r\n sum+=x*i\r\n if x>1:\r\n x-=1 \r\nprint(sum)\r\n", "n, x = map(int, input().strip().split())\narr = list(map(int, input().strip().split()))\narr.sort()\nhours = 0\nfor i in arr:\n\thours += i*x\n\tx = max(1, x-1)\nprint(hours)", "n1 = input().split()\r\nn2 = input().split()\r\nn, x = (int(i) for i in n1)\r\narr = [int(i) for i in n2]\r\narr = sorted(arr)\r\nres = 0\r\nfor i in range(n):\r\n res = res + (arr[i] * x)\r\n if x > 1:\r\n x -= 1\r\n\r\nprint(res)\r\n", "n, x = input().strip().split(\" \")\r\nn = int(n)\r\nx = int(x)\r\n\r\nar = input().strip().split(\" \")\r\nfor i in range(len(ar)):\r\n\tar[i] = int(ar[i])\r\n\r\nar.sort()\r\ncount = 0\r\n#print(ar)\r\nfor i in range(len(ar)):\r\n\tif x == 1:\r\n\t\tcount += ar[i]*x\r\n\telse:\r\n\t\tcount += ar[i]*x\r\n\t\tx -=1\r\n\r\nprint(count)\r\n", "# RawCoder : https://clck.ru/S8wGG\r\n\r\nn, x = map(int,input().split())\r\nw = list(map(int,input().split()))\r\nw.sort()\r\nsu = 0\r\nfor k in range(n):\r\n su += (w[k]*x)\r\n if(x != 1):\r\n x -= 1\r\nprint(su) ", "def __init():\r\n num_input = input()\r\n num_input = num_input.split(\" \")\r\n n = int(num_input[0])\r\n x = int(num_input[1])\r\n c = input()\r\n c = c.split(\" \")\r\n for i in range(n):\r\n c[i] = int(c[i])\r\n return n, x, c\r\ndef timeStudy (n, x, c):\r\n c.append(0)\r\n c.sort()\r\n for i in range(1, n + 1):\r\n c[i] = c[i - 1] + c[i] * x\r\n if (x > 1):\r\n x -= 1\r\n return c[n]\r\n\r\nn, x, c = __init()\r\nprint(timeStudy(n, x, c))\r\n", "n,k=map(int,input().split());c=0;ttl=0\r\nx=[int(x) for x in input().split()]\r\nx.sort()\r\nfor i in x:\r\n ttl+=i*(k-c)\r\n c+=1\r\n if c==k:\r\n c=k-1\r\nprint(ttl)", "n = list(map(int, input().rstrip().split()))\r\nchapters = list(map(int, input().rstrip().split()))\r\nchapters.sort()\r\ntime = n[1]\r\nans = 0\r\nfor i in chapters:\r\n if(time > 1):\r\n ans += time * i\r\n time -= 1\r\n else:\r\n ans += i\r\n\r\nprint(ans)\r\n", "n,x = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\na = list(sorted(a))\r\nres = 0\r\nfor i in range(n):\r\n\tres += x * a[i]\r\n\tif x != 1:\r\n\t\tx -= 1\r\nprint(res)", "# Link: https://codeforces.com/problemset/problem/439/B\n# Site: Codeforces\n# Name: Devu, the Dumb Guy\n# ======================================================\n\nif __name__ == '__main__':\n n, x = list(map(int, input().split()))\n li = list(map(int, input().split()))\n\n li = sorted(li)\n res = 0\n for value in li:\n res += (value * x)\n if x > 1:\n x -= 1\n print(res)", "n, x = map(int, input().split())\nm = list(map(int, input().split()))\nm.sort()\nans = 0\nfor i in range(n):\n ans += m[i] * x\n if x > 1:\n x -= 1\nprint(ans)\n", "n,x=map(int,input().split())\r\ny = sorted(list(map(int,input().split())))\r\nmim = 0\r\nfor i in y:\r\n mim += i*x\r\n if x>1:\r\n x=x-1\r\nprint(mim)", "\"\"\"\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, x = map(int, input().split())\r\nm = list(map(int, input().split()))\r\nm.sort()\r\ncnt = 0\r\nfor i in range(n):\r\n\tcnt += x * m[i]\r\n\tif x > 1:\r\n\t\tx -= 1\r\nprint(cnt)\r\n\t\r\n\t\r\n\t\t\r\n\t\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nres = 0\r\nfor i in range(n):\r\n res = res + x * a[i]\r\n if x > 1:\r\n x -=1\r\n\r\nprint(res)\r\n\r\n", "n, x = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in l:\r\n ans += i*x\r\n if x > 1 :\r\n x-=1\r\nprint(ans)", "[n,x]=map(lambda x: int(x), input().strip().split(maxsplit=2))\r\nc=list(map(lambda x:int(x), input().strip().split(maxsplit=n)))\r\nc.sort()\r\ntotal=0\r\ni=0\r\nwhile i<n and x!=1:\r\n total+=c[i]*x\r\n x-=1\r\n i+=1\r\nwhile i<n:\r\n total+=c[i]*x\r\n i+=1\r\nprint(total)", "n,x=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\ni=0\r\ns=0\r\nfor i in range(n):\r\n if(x==0):\r\n s+=l[i]\r\n else:\r\n s+=(x*l[i])\r\n x=x-1\r\nprint(s)", "def main():\n n, x = [int(x) for x in input().split()]\n c = sorted([int(x) for x in input().split()])\n learned = 0\n hours = 0\n for cx in c:\n hours += cx * x\n if x > 1:\n x -= 1\n print(hours)\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\t \t", "n,x = map(int,input().split())\r\nc = list(map(int,input().split()))\r\n\r\nc.sort()\r\ncount = 0\r\n\r\nfor i in c:\r\n count += x*i\r\n x = max(1,x-1)\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ns = 0\r\nfor i in range(n):\r\n if(not k):\r\n s += a[i]\r\n else:\r\n s += k * a[i]\r\n k -= 1 \r\n \r\nprint(s)", "n,x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans = 0\r\nfor i in l:\r\n if x > 1:\r\n ans += (i*x)\r\n x-=1\r\n else:\r\n x = 1\r\n ans += (i*x)\r\nprint(ans)", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ns=0\r\nfor i in range(n):\r\n s+=x*l[i]\r\n if(x>1):\r\n x-=1\r\nprint(s)", "n,x = [int(i) for i in input().split()]\r\narr = sorted([int(i) for i in input().split()])\r\nans = 0\r\nfor i in arr:\r\n if x>1:\r\n ans+=i*x\r\n x-=1\r\n else:\r\n ans+=i\r\n\r\nprint(ans)", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc = sorted(c)\r\nres = 0\r\nfor s in c:\r\n res += s * x\r\n if x > 1: x -= 1\r\nprint(res)", "n, x = map(int, input().split())\r\nc = sorted(map(int, input().split()))\r\np = x\r\nresult = 0\r\nfor ci in c:\r\n result += p * ci\r\n if p > 1:\r\n p -= 1\r\nprint(result)", "n, x = map(int, input().split())\r\ncs = list(map(int, input().split()))\r\ncs.sort()\r\n\r\nsol = 0\r\nfor c in cs:\r\n sol += c * x\r\n if x > 1:\r\n x -= 1\r\n\r\nprint(sol)\r\n", "n,x=map(int,input().split())\r\nlistsub=sorted(map(int,input().split()))\r\nketqua=0\r\nfor i in listsub:\r\n ketqua+=i*x\r\n x=max(x-1,1)\r\nprint(ketqua)", "n, x = list(map(int,input().split()))\r\nl=sorted(list(map(int,input().split())))\r\ntong = 0\r\nfor i in range(n):\r\n tong += l[i]*x\r\n x =max(x-1,1)\r\nprint(tong)\r\n", "n,x=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nans=0\r\nfor i in range(n):\r\n if x>1:\r\n ans+=l[i]*x\r\n x-=1\r\n elif x==1:\r\n ans+=l[i]*x\r\nprint(ans)", "def min_time(x,l):\r\n s=0\r\n for i in l:\r\n s+=max(x,1)*i\r\n x-=1\r\n return s\r\n\r\n\r\nn,x=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nprint(min_time(x,l))", "n, x = map(int, input().split())\nc = sorted(list(map(int, input().split())))\ns = 0\nfor i in range(n):\n s += c[i]*(x-i)*(x-i>0) + c[i]*(x-i<=0)\n\nprint(s)\n \n\n", "n,x=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nsum=0\r\nc=x\r\nfor i in range(n):\r\n sum=sum+l[i]*c\r\n if(c>1 and x>1):\r\n c=c-1\r\nprint(sum)\r\n", "otv = 0\r\nn,m = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\nfor x in range(len(A)):\r\n otv+=(m*A[x])\r\n if m>1:\r\n m-=1\r\nprint(otv)", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort(reverse = False)\r\ntime = 0 \r\nfor i in range(n):\r\n time += a[i] * x\r\n if x > 1: \r\n x -= 1\r\n\r\nprint(time)", "n, k = map(int, input().split())\r\na = sorted([int(i)for i in input().split()])\r\nn = 0\r\nfor i in a:\r\n n += i*k\r\n if k > 1:\r\n k-=1\r\nprint(n)", "n, x = map(int, input().split())\r\nsubjects = [int(i) for i in input().split()]\r\n\r\nsubjects.sort()\r\ncount = res = 0\r\nwhile count < n:\r\n\tres+=subjects[count]*x\r\n\tif x > 1:\r\n\t\tx-=1\r\n\tcount+=1\r\nprint(res)", "# http://codeforces.com/problemset/problem/439/B\r\nn, x = list(map(int, input().split()))\r\nchapters_of_subject = list(map(int, input().split()))\r\n\r\n# sorted this subject\r\nsorted_chapters_of_subject = sorted(chapters_of_subject)\r\ntotal = 0\r\nfor chapters in sorted_chapters_of_subject:\r\n total += (chapters * x)\r\n x -= 1\r\n if x < 1:\r\n x = 1\r\n\r\n# time complexity = o(n)\r\nprint(total)\r\n", "n, k = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nt = 0\r\nfor x in range(n):\r\n t += l[x]*k\r\n k -= 1\r\n if k == 0:\r\n k= 1\r\nprint(t)", "if __name__ == '__main__':\r\n n, x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n ans = 0\r\n for i in range(n):\r\n ans += max(1, x) * a[i]\r\n x -= 1\r\n print(ans)\r\n", "n, x = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli.sort()\r\nt = 0\r\nfor i in range(len(li)):\r\n t+=li[i]*x\r\n if x>1:\r\n x-=1\r\n elif x==0:\r\n x = 1\r\n elif x==1:\r\n continue\r\nprint(t)", "lista = []\n \nx,y = map(int,input().split())\n \ni = 0\n#sta += [map(int(input()))]\nentrada = input().split(\" \")\n\nwhile i < x:\n\taux = int(entrada[i])\n\tlista += [aux]\n\ti += 1\n \nlista.sort()\nr = 0\nfor num in lista:\n\tr += y*num\n\tif y > 1:\n\t\ty -= 1\n\nprint(r)\n\n", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n, x = [int(i) for i in input().split()]\r\n c = [int(i) for i in input().split()]\r\n c = sorted(c)\r\n # print(c)\r\n result = 0\r\n for i in c:\r\n result += x*i\r\n if x != 1:\r\n x -= 1\r\n\r\n print(result)\r\nif __name__ == '__main__':\r\n main()\r\n", "pt = input().split()\r\nnum = pt[0]\r\nx = int(pt[1])\r\ncnt = 0\r\nstudy = input().split()\r\nfor i in range(len(study)):\r\n study[i] = int(study[i])\r\nstudy.sort()\r\nfor i in study:\r\n if x > 1:\r\n cnt += x*i\r\n x -= 1\r\n else:\r\n cnt += i\r\nprint(cnt)", "n, x = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor c in a:\r\n ans += x * c\r\n if x > 1:\r\n x -= 1\r\n\r\nprint(ans)", "\r\nn, x = map(int, input().split())\r\ninputArr = list(map(int, input().split()))\r\ncurrent = x\r\nsum = 0\r\ninputArr.sort()\r\nfor i in range(0, n):\r\n sum += inputArr[i]*x\r\n x -= 1\r\n if x < 1:\r\n x = 1\r\nprint(sum)", "n, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nc.sort()\r\n\r\nminimum_time = 0\r\nfor i in range(n):\r\n if (x == 0):\r\n x = 1\r\n minimum_time += c[i]*x\r\n x-=1\r\nprint(minimum_time)\r\n", "n, x = map(int, input().split())\r\narr = sorted([*map(int, input().split())])\r\nans = 0\r\nfor e in arr:\r\n ans += x * e\r\n if x > 1: x -= 1\r\nprint(ans)", "n, x = map(int, input().split())\nc = list(map(int, input().split()))\n\nc.sort() # nên sắp xếp tăng dần để các bài có số chapters nhỏ nhất ở đầu\nmin_time = 0\n\nfor i in range(n):\n min_time += x * c[i]\n\n if x > 1:\n x -= 1\n\nprint(min_time)", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\nl = [int(p) for p in input().split()]\r\nl.sort()\r\ntotal = 0\r\nfor i in range(len(l)):\r\n total = total + x*l[i]\r\n if x != 1:\r\n x = x - 1\r\nprint(total)", "def mi():\r\n\treturn map(int, input().split())\r\n\r\nn,k = mi()\r\na = list(mi())\r\na.sort()\r\ns = 0\r\nfor i in a:\r\n\ts+=i*k\r\n\tk-=1\r\n\tk = max(k,1)\r\nprint (s)", "n_and_x = input()\r\nc1_to_cn = input()\r\nn, x = int(n_and_x.split()[0]), int(n_and_x.split()[1])\r\nchapter_list = []\r\nfor c in c1_to_cn.split():\r\n\tchapter_list.append(int(c))\r\nchapter_list.sort()\r\n\r\nans = 0\r\nfor i in range(n):\r\n\tans += int(chapter_list[i]) * x\r\n\tif x > 1:\r\n\t\tx -= 1\r\nprint(ans)", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, x = [int(i) for i in input().split(\" \")]\r\n c = sorted([int(i) for i in input().split(\" \")])\r\n count = 0\r\n for i in c:\r\n count += i * x\r\n x = max(1, x - 1)\r\n print(count)\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,x = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=0\r\nlst.sort()\r\nfor i in range(n):\r\n s+=lst[i]*x\r\n if x>1:\r\n x-=1\r\n else:\r\n x=1\r\nprint(s)", "subject, hours = [int(x) for x in input().split()]\r\nchapters = sorted([int(x) for x in input().split()])\r\nneeded = 0\r\nfor i in chapters:\r\n needed += (hours * i)\r\n hours = max(hours - 1, 1)\r\nprint(needed)\r\n", "n,x=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort(); time=0\r\nfor item in c:\r\n time+=item*x\r\n x=x-1 if x>1 else 1\r\nprint(time)", "\r\ndef find_min_time(subject,x):\r\n subject.sort()\r\n min_time = subject[0]*x\r\n i=1\r\n while i<n:\r\n x-=1\r\n if x<1:\r\n x=1\r\n min_time+=subject[i]*x\r\n i+=1\r\n return min_time\r\n\r\nn,x = map(int,input().split())\r\nsubject = list(map(int, input().split()))\r\nmin_time = find_min_time(subject,x)\r\nprint(min_time)", "n,x=map(int, input().split())\r\ns=[int(i) for i in input().split()]\r\ns.sort()\r\n#print(s)\r\nq=0\r\nfor i in range(n):\r\n if i==0:\r\n q=q+s[i]*x\r\n x=x-1\r\n elif i>0 and x>=1:\r\n q=q+s[i]*x\r\n x=x-1 \r\n else:\r\n x=1\r\n q=q+s[i]*x\r\nprint(q)", "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, w = map(int, input().split())\r\n f = list(map(int, input().split()))\r\n f.sort()\r\n s = 0\r\n for z in f:\r\n s += max(1, w)*z\r\n w -= 1\r\n print(s)\r\n\r\ndef test():\r\n run(\"\"\"2 3\r\n4 1\"\"\", \"\"\"11\"\"\")\r\n run(\"\"\"4 2\r\n5 1 2 1\"\"\", \"\"\"10\"\"\")\r\n run(\"\"\"3 3\r\n1 1 1\"\"\", \"\"\"6\"\"\")\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", "n,x=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nz.sort();ans=0\r\nfor i in z:\r\n ans+=i*x\r\n x-=(x-1 >= 1)\r\nprint(ans) ", "n,x = [int(k) for k in input().split()]\r\nc = [int(k) for k in input().split()]\r\n\r\nc = sorted(c)\r\n\r\nans = 0\r\nfor i in c:\r\n ans += i * x\r\n x -= 1\r\n if x < 1:\r\n x = 1\r\n\r\nprint(ans)", "n = input()\nn = n.split(' ')\nc = int(n[1])\nn = int(n[0])\nsoma = 0\nv = 0\nlista = []\nv = input()\nv = v.split(' ')\n\nfor i in v:\n\tval = int(i)\n\tlista.append(val)\n\t\nlista.sort()\nfor i in lista:\n\tif(c > 0):\n\t\tsoma+=i*c;\n\t\tc-=1\n\telse:\n\t\tsoma+=i;\n\t\t\nprint(soma)\n", "n,x=map(int,input().split())\nclist=list(map(int,input().split()))\nclist.sort()\ntime=0\nfor i in clist:\n time=time+x*i\n if x>1:\n x=x-1\nprint(time)\n" ]

[ "n=int(input())\r\nlast_r=None\r\nlast_b=None\r\nlast_p=None\r\nans=0\r\nmax_r=0\r\nmax_b=0\r\nmax_p=0\r\nfor _ in range(n):\r\n s=input().split()\r\n x=int(s[0])\r\n c=s[1]\r\n if c=='B':\r\n if last_b!=None:\r\n ans+=x-last_b\r\n max_b=max(max_b,x-last_b)\r\n last_b=x\r\n if c=='R':\r\n if last_r!=None:\r\n ans+=x-last_r\r\n max_r=max(max_r,x-last_r)\r\n last_r=x\r\n if c=='P':\r\n if last_b!=None:\r\n ans+=x-last_b\r\n max_b=max(max_b,x-last_b)\r\n last_b=x\r\n if last_r!=None:\r\n ans+=x-last_r\r\n max_r=max(max_r,x-last_r)\r\n last_r=x\r\n if last_p!=None:\r\n new_ans=(x-last_p)*3\r\n new_ans-=max_r\r\n new_ans-=max_b\r\n if new_ans<(x-last_p)*2:\r\n ans-=(x-last_p)*2-new_ans\r\n last_p=x\r\n max_b=0\r\n max_r=0\r\nprint(ans)\r\n", "n=int(input())\nb,r,p=None,None,None\nres=0\nmr=-1\nmb=-1\nfor i in range(n):\n ix,t=input().split()\n ix=int(ix)\n if t!='R':\n if b is not None:\n res+=ix-b\n mb=max(mb,ix-b)\n b=ix\n if t!='B':\n if r is not None:\n res+=ix-r\n mr=max(mr,ix-r)\n r=ix\n if t=='P':\n if p is not None:\n if ix-p<mr+mb:res-=(mr+mb)-(ix-p)\n p=ix\n mr=mb=0\nprint(res)\n", "#!/usr/bin/env python3\n\nM = 4 * 10**9 + 1\n\nn = int(input().strip())\nf = lambda t: (int(t[0]), t[1])\n# read and add far P points at both ends\nxcis = [(-M, 'P')] + [f(input().strip().split()) for _ in range(n)] + [(M, 'P')]\n\niPs = [i for i in range(len(xcis)) if (xcis[i][1] == 'P')]\niRs = [i for i in range(len(xcis)) if (xcis[i][1] == 'R')]\niBs = [i for i in range(len(xcis)) if (xcis[i][1] == 'B')]\n\nl = 0\n\nfor iiP in range(1, len(iPs)):\n\tiP0 = iPs[iiP - 1]\n\tiP1 = iPs[iiP]\n\tdRmax = 0\n\tdBmax = 0\n\t(xR, _) = xcis[iP0]\n\t(xB, _) = xcis[iP0]\n\tfor i in range(iP0 + 1, iP1 + 1):\n\t\t(x, c) = xcis[i]\n\t\tif c in 'RP':\n\t\t\tdRmax = max(dRmax, x - xR)\n\t\t\txR = x\n\t\tif c in 'BP':\n\t\t\tdBmax = max(dBmax, x - xB)\n\t\t\txB = x\n\td = xcis[iP1][0] - xcis[iP0][0]\n\tl += d + min(d, 2*d - dBmax - dRmax)\n\tif iiP in [1, len(iPs) - 1]:\n\t\tl -= d # remove connections to extra P points\n\tiP0 = iP1\n\nif len(iPs) == 2: # no P in original data\n\tl = (0 if (len(iRs) < 2) else (xcis[iRs[-1]][0] - xcis[iRs[0]][0]))\n\tl += (0 if (len(iBs) < 2) else (xcis[iBs[-1]][0] - xcis[iBs[0]][0]))\n\nprint (l)\n", "def inpmap():\n return map(int, input().split())\nn = int(input())\nb, r, p = None, None, None\nres = 0\nmr = -1\nmb = -1\nfor i in range(n):\n ix, t = input().split()\n ix = int(ix)\n if t != 'R':\n if b is not None:\n res += ix - b\n mb = max(mb, ix - b)\n b = ix\n if t != 'B':\n if r is not None:\n res += ix - r\n mr = max(mr, ix - r)\n r = ix\n if t == 'P':\n if p is not None:\n if ix - p < mr + mb:\n res -= (mr + mb) - (ix - p)\n p = ix\n mr = mb = 0\nprint(res)\n", "import sys\r\n\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\npos, type_ = [0]*n, ['']*n\r\n\r\nfor i, (x, c) in enumerate(line.decode('utf-8').split() for line in sys.stdin.buffer):\r\n pos[i] = int(x)\r\n type_[i] = c\r\n\r\nr_cnt = type_.count('R')\r\nb_cnt = type_.count('B')\r\np_cnt = n - r_cnt - b_cnt\r\ninf = 2100000000\r\n\r\nif p_cnt == 0:\r\n r_min, r_max = inf, inf\r\n b_min, b_max = inf, inf\r\n for i in range(n):\r\n if type_[i] == 'R':\r\n r_min = min(pos[i], r_min)\r\n r_max = pos[i]\r\n else:\r\n b_min = min(pos[i], b_min)\r\n b_max = pos[i]\r\n\r\n print(r_max - r_min + b_max - b_min)\r\n exit()\r\n\r\n\r\np_index = [i for i in range(n) if type_[i] == 'P']\r\nans = 0\r\nfor c in 'RB':\r\n for i in range(p_index[0]):\r\n if type_[i] == c:\r\n ans += pos[p_index[0]] - pos[i]\r\n break\r\n for i in range(n-1, p_index[-1], -1):\r\n if type_[i] == c:\r\n ans += pos[i] - pos[p_index[-1]]\r\n break\r\n\r\nfor i, j in zip(p_index, p_index[1:]):\r\n r, b = [], []\r\n r_prev = b_prev = pos[i]\r\n for k in range(i+1, j):\r\n if type_[k] == 'R':\r\n r.append(pos[k] - r_prev)\r\n r_prev = pos[k]\r\n else:\r\n b.append(pos[k] - b_prev)\r\n b_prev = pos[k]\r\n r.append(pos[j] - r_prev)\r\n b.append(pos[j] - b_prev)\r\n r.sort()\r\n b.sort()\r\n ans += min(\r\n pos[j]-pos[i] + sum(r) - r[-1] + sum(b) - b[-1],\r\n sum(r) + sum(b)\r\n )\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\tp = None\r\n\tB = []\r\n\tR = []\r\n\tr = 0\r\n\tfor i in range(n):\r\n\t\tx, c = input().split()\r\n\t\tx = int(x)\r\n\t\tif c == 'B':\r\n\t\t\tB.append(x)\r\n\t\telif c == 'R':\r\n\t\t\tR.append(x)\r\n\t\telse:\r\n\t\t\tif p is None:\r\n\t\t\t\tif len(B) != 0:\r\n\t\t\t\t\tr += x - B[0]\r\n\t\t\t\tif len(R) != 0:\r\n\t\t\t\t\tr += x - R[0]\r\n\t\t\telse:\r\n\t\t\t\tif len(B) != 0:\r\n\t\t\t\t\tg = -1\r\n\t\t\t\t\tfor i in range(1,len(B)):\r\n\t\t\t\t\t\tg = max(g, B[i] - B[i-1])\r\n\t\t\t\t\tg = max(g, x - B[-1], B[0] - p)\r\n\t\t\t\telse:\r\n\t\t\t\t\tg = x - p\r\n\t\t\t\tif len(R) != 0:\r\n\t\t\t\t\th = -1\r\n\t\t\t\t\tfor i in range(1,len(R)):\r\n\t\t\t\t\t\th = max(h, R[i] - R[i-1])\r\n\t\t\t\t\th = max(h, x - R[-1], R[0] - p)\r\n\t\t\t\telse:\r\n\t\t\t\t\th = x - p\r\n\t\t\t\tr += min(2 * (x-p), 3 * (x - p) - g - h)\r\n\t\t\tp = x\r\n\t\t\tB = []\r\n\t\t\tR = []\r\n\tif p is None:\r\n\t\tif len(B) > 0:\r\n\t\t\tr += B[-1] - B[0]\r\n\t\tif len(R) > 0:\r\n\t\t\tr += R[-1] - R[0]\r\n\telse:\r\n\t\tif len(B) != 0:\r\n\t\t\tr += B[-1] - p\r\n\t\tif len(R) != 0:\r\n\t\t\tr += R[-1] - p\r\n\tprint(r)\r\n\r\nsolve()\r\n" ]

[ "n, a, d = map(int, input().split())\r\nt = 0;\r\nfor i in range (n):\r\n t0, v = map(int, input().split())\r\n t1 = v / a\r\n s1 = v**2 / (2*a)\r\n if s1 > d:\r\n t = max(t, t0 + (2*d/a)**0.5)\r\n else:\r\n t = max(t0 + t1 + (d - s1)/v, t)\r\n print(t)\r\n", "from sys import stdin, stdout\r\n\r\nn, a, s = map(int, stdin.readline().split())\r\nlast = 0\r\n\r\nfor i in range(n):\r\n t, v = map(int, stdin.readline().split())\r\n \r\n if not i:\r\n if (2 * s / a) ** 0.5 <= v / a:\r\n time = (2 * s / a) ** 0.5\r\n else:\r\n d = s - (v * v) / (a * 2)\r\n time = v / a + d / v\r\n \r\n last = time + t\r\n else:\r\n if (2 * s / a) ** 0.5 <= v / a:\r\n time = (2 * s / a) ** 0.5\r\n else:\r\n d = s - (v * v) / (a * 2)\r\n time = v / a + d / v\r\n \r\n last = max(time + t, last)\r\n \r\n stdout.write(str(last) + '\\n')", "from sys import stdin\r\nimport math\r\n\r\nn,a,d=map(int,stdin.readline().split())\r\nold=0\r\nfor z in stdin.readlines():\r\n t,v=map(int,z.split())\r\n x=(v**2)/2/a\r\n if d<=x: # все время разгон\r\n t1=t+math.sqrt(2*d/a)\r\n else:\r\n t1=t+v/a+(d-x)/v\r\n old=max(t1,old)\r\n print(old)\r\n", "n, a, d = map(int, input().split())\r\np = [0] * n\r\nfor i in range(n):\r\n t, v = map(int, input().split())\r\n x = v / a\r\n y = (2 * d / a) ** 0.5\r\n p[i] = t + y if y < x else t + d / v + x / 2\r\n p[i] = max(p[i - 1], p[i])\r\nprint('\\n'.join(map(str, p)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, d = map(int, input().split())\r\np = [0]*n\r\nfor i in range(n):\r\n t, v = map(int,input().split())\r\n x = v/a\r\n y = (2*d/a) ** 0.5\r\n p[i] = t+y if y < x else t + d/v + x/2\r\n p[i] = max(p[i-1],p[i])\r\nprint('\\n'.join(map(str, p)))", "from sys import stdin\r\nfrom math import sqrt\r\n\r\nn, a, d = map(int, stdin.readline().split())\r\n\r\ntest = stdin.readlines()\r\n\r\nprev = 0\r\nfor line in test:\r\n t, v = map(int, line.split())\r\n x = v * v / 2 / a\r\n\r\n if d <= x:\r\n ans = sqrt(2 * d / a) + t\r\n else:\r\n ans = v / a + (d - x) / v + t\r\n\r\n ans = max(ans, prev)\r\n prev = ans\r\n\r\n print(ans)\r\n", "n, a, d = map(int, input().split())\r\nt = 0;\r\nfor i in range (n):\r\n t1, v = map(int, input().split())\r\n t2 = v / a\r\n s = v ** 2 / (2 * a)\r\n if s > d:\r\n t = max(t, t1 + (2 * d / a) ** 0.5)\r\n else:\r\n t = max(t, t1 + t2 + (d - s) / v)\r\n print(t)", "n,a,d = map(int,input().split())\r\ntv = [list(map(int,input().split())) for i in range(n)]\r\n\r\nans = []\r\nfor i in range(n):\r\n t,v = tv[i]\r\n x = v/a\r\n if d >= x*v/2:\r\n tmp = t+x+ (d-x*v/2)/v\r\n else:\r\n tmp = t + pow(2*d/a, 0.5)\r\n ans.append(tmp)\r\nfor i in range(1, n):\r\n ans[i] = max(ans[i], ans[i-1])\r\nprint(*ans, sep = \"\\n\")", "n,a,d=map(int,input().split())\r\np=[0]*n\r\nfor i in range(n):\r\n t,v=map(int,input().split())\r\n x=v/a\r\n y=(2*d/a) ** 0.5\r\n p[i]=t+y if y<x else t+d/v+x/2\r\n p[i]=max(p[i-1],p[i])\r\nprint('\\n'.join(map(str,p)))", "import collections\r\nimport functools\r\nimport math\r\nimport sys\r\n\r\n\r\ndef In():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ninput = sys.stdin.readline\r\nimport functools\r\nimport math\r\nimport sys\r\n\r\n\r\ndef In():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef wiztroll():\r\n n, maxac, dest = In()\r\n blockingtime = 0\r\n for _ in range(n):\r\n start, pera = In()\r\n ans = 0\r\n if dest > pera ** 2 / (2 * maxac):\r\n ans += max(blockingtime, start + pera / maxac + ((dest - pera * pera / (2 * maxac))/pera))\r\n blockingtime = ans\r\n print(ans)\r\n else:\r\n ans += max(blockingtime, start + math.sqrt(2 * dest / maxac))\r\n blockingtime = ans\r\n print(ans)\r\n\r\n\r\nwiztroll()\r\n", "# written with help of passed solutions\nfrom math import sqrt\n\nn, a, d = map(int, input().split())\na = float(a)\nans = [0] * n\n\ntm = 0\nfor i in range(n):\n t, v = map(int, input().split())\n acc_t = v / a\n add_t = 0\n\n if acc_t ** 2 * a > 2 * d:\n add_t = sqrt(2 * d / a)\n else:\n add_t = acc_t + (d - acc_t ** 2 * a / 2) / v\n\n tm = max(tm, t + add_t)\n ans[i] = tm\n\nprint('\\n'.join(map(str, ans)))\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nN,A,D = map(int, input().split())\r\npre = 0\r\nfor _ in range(N):\r\n t,v = map(int, input().split())\r\n \r\n # 到达最高速度需要的时间\r\n t1 = v/A\r\n # 加速时间段行走距离(已知时间和加速度求距离)\r\n d1 = t1*(t1*A/2)\r\n \r\n # 能加到全速\r\n if d1<=D:\r\n # 剩下距离需要的时间\r\n t2 = (D-d1)/v\r\n tt=t+t1+t2\r\n else: # 不能加到全速\r\n # 已知距离加速度计算时间\r\n t1 = math.pow(D*2/A, 0.5)\r\n tt = t+t1\r\n \r\n tt = max(tt, pre)\r\n pre = tt\r\n print(tt)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "'''input\n1 2 26\n28 29\n'''\nimport math\n\ndef get_time(t, v):\n\ttotal = t\n\n\tt1 = math.sqrt((2 * d)/ a)\n\n\tif a* t1 < v:\n\t\ttotal += t1\n\telse:\n\t\tt2 = v/a\n\t\ttotal += t2\n\t\tr_d = d - 0.5 *(a * t2 * t2)\n\t\ttotal += r_d/v\n\treturn total\n\n\n\nfrom sys import stdin, stdout\n\n\n# main starts\nn,a , d = list(map(int, stdin.readline().split()))\ntime = []\nfor i in range(n):\n\tt, v = list(map(int, stdin.readline().split()))\n\ttime.append(get_time(t, v))\n\nans = []\nans.append(time[0])\nprev = time[0]\nfor i in range(1, n):\n\tif time[i] <= prev:\n\t\tans.append(prev)\n\telse:\n\t\tprev = time[i]\n\t\tans.append(time[i])\n\nfor i in ans:\n\tprint(i)" ]

[ "def div(a, b):\r\n\treturn (a+b-1)//b\r\n\r\nfor t in range(int(input())):\r\n\tx,y,p,q = map(int,input().split())\r\n\tif q == 1:\r\n\t\tif p == 0 and x == 0 or p == 1 and x == y:\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\telse:\r\n\t\tz = max(max(div(x,p),div(y,q)),max(div(y-x,q-p),0))\r\n\t\tprint(z*q-y)", "def ost(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\n\r\ndef maximum(a, b):\r\n if a <= b:\r\n return b\r\n return a\r\n\r\n\r\ndef success(lst):\r\n c = list()\r\n for elem in lst:\r\n if elem[2] == elem[3]:\r\n if elem[0] == elem[1]:\r\n c.append(0)\r\n else:\r\n c.append(-1)\r\n elif elem[2] == 0:\r\n if elem[0] == 0:\r\n c.append(0)\r\n else:\r\n c.append(-1)\r\n else:\r\n res = maximum(ost(elem[2] * elem[1] - elem[0] * elem[3], elem[3] - elem[2]),\r\n ost(elem[0] * elem[3] - elem[2] * elem[1], elem[2]))\r\n c.append(ost(res + elem[1], elem[3]) * elem[3] - elem[1])\r\n return c\r\n\r\n\r\nn = int(input())\r\nd = list()\r\nfor i in range(n):\r\n x, y, p, q = [int(j) for j in input().split()]\r\n d.append([x, y, p, q])\r\nprint(*success(d), sep='\\n')\r\n", "def calc (x, y, p, q):\n if p == q:\n if x == y:\n return 0\n else:\n return -1\n elif p == 0:\n if x == 0:\n return 0\n else:\n return -1\n elif x * q == y * p:\n return 0\n else:\n ans = 0\n k = 1 << 64\n while k != 0:\n cur = ans + k\n if cur * p - x < 0:\n ans = cur\n elif cur * q - y < cur * p - x:\n ans = cur\n k >>= 1\n ans += 1\n\n return ans * q - y\n\ndef main ():\n testc = int(input())\n for i in range(testc):\n arr = input().split(\" \")\n print(calc(int(arr[0]), int(arr[1]), int(arr[2]), int(arr[3])))\n\nmain()\n", "T = int(input())\r\nfor _ in range(T):\r\n x, y, p, q = map(int, input().split())\r\n if p == 0:\r\n print(0 if x == 0 else -1)\r\n elif p < q:\r\n m = max(\r\n (x + p-1) // p,\r\n (y + q-1) // q,\r\n (y-x + q-p-1) // (q-p)\r\n )\r\n print(q * m - y)\r\n else:\r\n print(0 if x == y else -1)", "def reduce(a, b):\r\n if b == 0:\r\n return 1, 0\r\n else:\r\n a1, a2 = reduce(b, a % b)\r\n return a2, a1 - a2 * (a//b)\r\nt = int(input())\r\n\r\nfor i in range(t):\r\n x, y, p, q = list(map(int, input().split()))\r\n\r\n if p == 0:\r\n print(0 if x == 0 else -1)\r\n continue\r\n if q == 1:\r\n print(0 if x == y else -1)\r\n continue\r\n a, b = reduce(q, p)\r\n a *= p*y - q*x\r\n b *= q*x - p*y\r\n if a < 0:\r\n t = (-a+p-1)//p\r\n a += t*p\r\n b += t*q\r\n if b < a:\r\n t = (a-b+q-p-1)//(q-p)\r\n a += t*p\r\n b += t*q\r\n t = min(a//p, (b-a)//(q-p))\r\n a -= t*p\r\n b -= t*q\r\n print(b)\r\n", "\r\nimport sys\r\n\r\nx, y, p, q = [-1] * 4\r\n\r\ndef ok(curr):\r\n\tdiff = curr - y\r\n\r\n\tc1 = x * q <= p * curr\r\n\tc2 = p * curr <= (x + diff) * q\r\n\r\n\treturn c1 and c2\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\tx, y, p, q = [int(x) for x in sys.stdin.readline().split()]\r\n\tif (p == 0 and x != 0) or (p == q and x < y):\r\n\t\tprint(-1)\r\n\t\tcontinue\r\n\r\n\tlo, hi = (y + q - 1) // q, y\r\n\twhile lo < hi:\r\n\t\tmid = (lo + hi) // 2\r\n\t\tif ok(mid * q): hi = mid\r\n\t\telse: lo = mid + 1\r\n\r\n\tprint(lo * q - y)", "INF = 10**40\r\n\r\ndef gcd_ex(A, B):\r\n if A == 0:\r\n return B, 0, 1\r\n g, a1, b1 = gcd_ex(B % A, A)\r\n a = b1 - (B // A) * a1\r\n b = a1\r\n return g, a, b\r\n\r\ndef round_down(a, b):\r\n s = (a < 0) != (b < 0)\r\n a = abs(a)\r\n b = abs(b)\r\n if not s:\r\n return a // b\r\n return -((a + b - 1) // b)\r\n\r\ndef round_up(a, b):\r\n s = (a < 0) != (b < 0)\r\n a = abs(a)\r\n b = abs(b)\r\n if not s:\r\n return (a + b - 1) // b\r\n return -(a // b)\r\n\r\ndef solve():\r\n x, y, p, q = map(int, input().split())\r\n\r\n A = q\r\n B = -p\r\n C = p * y - q * x\r\n\r\n g, a0, b0 = gcd_ex(A, -B)\r\n b0 *= -1\r\n\r\n if C % g != 0:\r\n print(-1)\r\n return\r\n a0 *= C // g\r\n b0 *= C // g\r\n\r\n k_up1 = 0\r\n if B == 0:\r\n if -a0 > 0:\r\n print(-1)\r\n return\r\n k_up1 = INF\r\n else:\r\n k_up1 = round_down(-a0, B // g)\r\n\r\n k_down2 = 0\r\n k_up2 = 0\r\n if A + B == 0:\r\n if b0 - a0 < 0:\r\n print(-1)\r\n return\r\n k_down2 = -INF\r\n k_up2 = INF\r\n elif A + B > 0:\r\n k_down2 = -INF\r\n k_up2 = round_down(b0 - a0, (A + B) // g)\r\n else:\r\n k_down2 = round_up(b0 - a0, (A + B) // g)\r\n k_up2 = INF\r\n\r\n k_down = k_down2\r\n k_up = min(k_up1, k_up2)\r\n if k_down > k_up:\r\n print(-1)\r\n return\r\n\r\n if k_up == INF:\r\n raise Exception\r\n b = b0 - (A // g) * k_up\r\n\r\n print(b)\r\n\r\ndef main():\r\n t = int(input())\r\n for i in range(t):\r\n solve()\r\n\r\nmain()\r\n", "n = int(input())\r\nfor i in range(n):\r\n x, y, p, q = map(int, input().split())\r\n if p == 0:\r\n if x == 0:\r\n print(0)\r\n continue\r\n else:\r\n print(-1)\r\n continue\r\n if p == q:\r\n if x == y:\r\n print(0)\r\n continue\r\n else:\r\n print(-1)\r\n continue\r\n print(max((x - 1) // p, (y - x - 1) // (q - p)) * q + q - y)", "def check(k1, k2, rr):\r\n k3 = p * k2 - rr\r\n return k3 >= 0 and k2 * q + k1 >= k3\r\n\r\ndef binary_search(k1, rr):\r\n r = 1\r\n while not check(k1, r, rr):\r\n r *= 2\r\n l = -1\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if check(k1, m, rr):\r\n r = m\r\n else:\r\n l = m\r\n return r\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n x, y, p, q = map(int, input().split())\r\n if p == 0 and x != 0 or p == q and x != y:\r\n print(-1)\r\n continue\r\n k1 = (y + q - 1) // q * q - y\r\n y += k1\r\n rr = x - y // q * p\r\n r = binary_search(k1, rr)\r\n print(r * q + k1)\r\n", "def xgcd(a, b):\n if b == 0:\n return 1, 0\n x1, y1 = xgcd(b, a % b)\n return y1, x1 - (a // b) * y1\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\nt = int(input())\nfor kek in range(t):\n x, y, p, q = map(int, input().split())\n if p == 0:\n if x == 0:\n print(0)\n else:\n print(-1)\n continue\n if p == q:\n if x == y:\n print(0)\n else:\n print(-1)\n continue\n\n v = p * y - q * x\n g = gcd(q - p, p)\n k0, l0 = xgcd(q - p, p)\n l0 *= -1\n g1 = v // g\n k0 *= g1\n l0 *= g1\n\n xx = (-k0 + p - 1) // p\n \n xx = max(xx, (-l0 + q - p - 1) // (q - p))\n \n l = l0 + xx * (q - p)\n k = k0 + xx * p;\n\n print(k + l)", "def check(np, nq):\r\n return np >= x and nq >= y and (np - x <= nq - y)\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n x, y, p, q = map(int, input().split())\r\n \r\n l = 0\r\n r = 10 ** 18\r\n while l < r - 1:\r\n m = (l + r) // 2\r\n \r\n if check(p * m, q * m):\r\n r = m\r\n else:\r\n l = m\r\n \r\n if r == 10 ** 18:\r\n print(-1)\r\n else:\r\n ans = q * r - y\r\n print(ans)", "def gcd(a, b):\n if b > a:\n return gcd(b, a)\n if b == 0:\n return a\n return gcd(b, a % b)\n\ndef works(a, b, c, d, x):\n return b <= d * x and a <= c * x and d * x - b >= c * x - a\n\ndef solve():\n a, b, c, d = map(int, input().rstrip().split())\n if c == d == 1 and not a / b == 1:\n print(-1)\n return\n if c == 0 and not a == 0:\n print(-1)\n return\n g = gcd(c, d)\n c //= g\n d //= g\n low = -1\n high = 1000000000000\n while low + 1 < high:\n mid = (low + high) // 2\n if works(a, b, c, d, mid):\n high = mid\n else:\n low = mid\n print(d * high - b)\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n solve()\n", "__author__ = 'ilyakuchumov'\r\n\r\nINF = 1\r\nfor i in range(100):\r\n INF *= 10\r\n\r\n\r\ndef check(x, y, p, q, t):\r\n delta = q * t - y\r\n return p * q * t >= x * q and q * t >= y and (x + delta) * q >= q * t * p\r\n\r\n\r\ndef solve():\r\n tokens = input().split()\r\n x = int(tokens[0])\r\n y = int(tokens[1])\r\n p = int(tokens[2])\r\n q = int(tokens[3])\r\n\r\n if not check(x, y, p, q, INF):\r\n print('-1')\r\n return\r\n\r\n l = -1\r\n r = INF\r\n\r\n while r - l > 1:\r\n mid = (l + r) // 2\r\n if check(x, y, p, q, mid):\r\n r = mid\r\n else:\r\n l = mid\r\n\r\n ans = q * r - y\r\n\r\n print(ans)\r\n\r\n\r\ndef main():\r\n t = int(input())\r\n\r\n for i in range(t):\r\n solve()\r\n\r\nmain()", "import math\r\n\r\n\r\ndef result():\r\n x, y, p, q = map(int, input().split())\r\n if p == 1 and q == 1:\r\n if x == y:\r\n print(0)\r\n else:\r\n print(-1)\r\n return\r\n if p == 0 and q == 1:\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n return\r\n\r\n n = max(math.ceil(y/q), math.ceil(x/p), math.ceil((y-x)/(q-p)))\r\n print(n*q-y)\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n result()", "def gcd(a, b):\n if a == 0:\n return b, 0, 1\n\n g, x1, y1 = gcd(b % a, a);\n\n y = x1;\n x = y1 - (b // a) * x1;\n return g, x, y;\n\ndef comp(da, db, t, a, b):\n ra = a + da * t\n rb = b + db * t\n\n # assert(ra.v0 >= 0);\n # assert(ra.v1 >= 0);\n # assert(rb.v0 >= 0);\n # assert(rb.v1 >= 0);\n return ra + rb\n\ndef solve():\n x, y, p, q = map(int, input().split())\n\n if p == q:\n if x == y:\n print(0)\n else:\n print(-1)\n return\n\n if p == 0:\n if x == 0:\n print(0)\n else:\n print(-1)\n return;\n\n r = x * q - y * p;\n g, a, b = gcd(p - q, p);\n if r % g != 0:\n print(-1)\n return\n\n a *= r // g;\n b *= r // g;\n\n da = p;\n db = q - p;\n minT = -10**18;\n minT = max(minT, ((-a + (da - 1)) // da));\n minT = max(minT, ((-b + (db - 1)) // db));\n\n t = minT;\n rr = comp(da, db, t, a, b);\n print(rr)\n\n\ndef main():\n t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\n", "def gcd(a, b):\r\n\tif a == 0:\r\n\t\treturn [b, 0, 1]\r\n\td = gcd(b % a, a)\r\n\treturn [d[0], d[2] - (b // a) * d[1], d[1]]\r\n\r\nt = int(input())\r\nwhile t > 0:\r\n\tt -= 1\r\n\tx, y, p, q = map(int, input().split())\r\n\tif p == q:\r\n\t\tif x == y:\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\t\tcontinue\r\n\tif p == 0:\r\n\t\tif x == 0:\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\t\tcontinue\r\n\ta = p - q\r\n\tb = p\r\n\tc = q * x - p * y\r\n\tg, xa, ya = gcd(abs(a), abs(b))\r\n\tif c % g != 0:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\txa *= c // g\r\n\t\tya *= c // g\r\n\t\tif a < 0:\r\n\t\t\txa = -xa\r\n\t\tif b < 0:\r\n\t\t\tya = -ya\r\n\t\tif xa < 0:\r\n\t\t\tgaps = (-xa + (b // g) - 1) // (b // g)\r\n\t\t\txa += gaps * (b // g)\r\n\t\t\tya -= gaps * (a // g)\r\n\t\tif ya < 0:\r\n\t\t\tgaps = (-ya + (-a // g) - 1) // (-a // g)\t\t\r\n\t\t\txa += gaps * (b // g)\r\n\t\t\tya -= gaps * (a // g)\r\n\t\t#print(xa, ya, a, b, c)\r\n\t\tif xa < 0 or ya < 0:\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\taddon = min(xa // (b // g), ya // (-a // g))\r\n\t\t\txa -= addon * (b // g)\r\n\t\t\tya += addon * (a // g)\r\n\t\t\tprint(xa + ya)\r\n", "for case in range(int(input())):\n x,y,p,q = map(int, input().split())\n\n lo = 0\n hi = 10**10\n while lo < hi:\n mid = lo + (hi - lo) // 2\n \n np,nq = mid*p, mid*q\n if nq >= y and np >= x:\n if nq - y >= np - x:\n hi = mid\n else:\n lo = mid + 1\n else:\n lo = mid + 1\n \n print(lo * q - y if lo != 10**10 else -1)", "import sys\r\ndef de(x, y):\r\n\tif (x % y == 0):\r\n\t\t return x // y\r\n\treturn x // y + 1\r\n\r\ndef euc(a, b):\r\n\tif (b == 0):\r\n\t\treturn 1, 0\r\n\tx, y = euc(b, a % b)\r\n\treturn -y, -x - y * (a // b)\r\n\r\n\r\n\r\ndef solve( x, y, p, q):\r\n\tif (q == p):\r\n\t\tif (x == y):\r\n\t\t\t return 0\r\n\t\treturn -1\r\n\tif (p == 0):\r\n\t\tif (x == 0):\r\n\t\t\t return 0\r\n\t\treturn -1\r\n\t\r\n\t\t\r\n\ta0, b0 = euc(p, q)\r\n\tg = a0 * p - q * b0\r\n\tc = x * q - p * y\r\n\tif (c % g):\r\n\t\treturn -1\r\n\ta0 = a0 * (c // g)\r\n\tb0 = b0 * (c // g)\r\n\tt1 = a0 // q\r\n\t\r\n\tt = max(de(b0 - a0, q - p), de(-b0, p))\r\n\ta = a0 + q * t\r\n\tb = b0 + p * t\r\n\r\n\treturn a\r\n\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n\r\n\r\nt = int(input())\r\nfor it in range(t):\r\n\tx, y, p, q = map(int, input().split())\r\n\tprint(solve(x, y, p, q))\r\n", "for _ in range (int(input())):\r\n\ta, b, p, q = map(int, input().split())\r\n\tl = 1\r\n\tr = 1000000001\r\n\r\n\tans = -1\r\n\twhile l < r:\r\n\t\tmid = (l + r) // 2\r\n\t\tx = p * mid - a\r\n\t\ty = q * mid - b\r\n\t\tif (x <= y and x >= 0 and y >= 0):\r\n\t\t\tans = y\r\n\t\t\tr = mid\r\n\t\telse:\r\n\t\t\tl = mid + 1\r\n\tprint(ans)\r\n", "from random import*\r\nt = int(input())\r\n#t = 1000\r\nfor test_id in range(t):\r\n x, y, p, q = map(int, input().split())\r\n #x, y, p, q = map(int, [randint(0, 10**9), randint(0, 10**9), randint(0, 10**9), randint(0, 10**9)])\r\n if p == 0:\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n if q - p == 0:\r\n if y - x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n k = max((x + p - 1) // p, (y - x + q - p - 1) // (q - p))\r\n print(k * q - y)", "import sys\r\n\r\ndef solve():\r\n t = int(sys.stdin.readline())\r\n\r\n for ti in range(t):\r\n x, y, p, q = map(int, sys.stdin.readline().split())\r\n\r\n if p == 0:\r\n print(0 if x == 0 else -1)\r\n continue\r\n\r\n if p == q:\r\n print(0 if x == y else -1)\r\n continue\r\n\r\n z = max((q*(y - x) + q - p - 1) // (q - p), (q*x + p - 1) // p)\r\n\r\n ans = (z + q - 1) // q * q - y\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "n=int(input())\r\nfor _ in range(n):\r\n x,y,p,q=map(int,input().split())\r\n if p==0 and x!=0:\r\n print(-1)\r\n elif p==q and x!=y:\r\n print(-1)\r\n elif p*y==q*x:\r\n print(0)\r\n else:\r\n print(q*max((x+p-1)//p,(y-x+q-p-1)//(q-p))-y)\r\n", "for i in range(int(input())):x,y,p,q=map(int,input().split());print(-(x>0)if not p else-(y>x)if p==q else max((x-1)//p,(y-x-1)//(q-p))*q+q-y)", "import sys\r\ninput = sys.stdin.readline\r\nt = int(input())\r\n\r\nfor qq in range(t):\r\n x, y, p, q = map(int, input().split())\r\n if p == q:\r\n if x == y:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n elif p == 0:\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n a = x\r\n b = y\r\n L = 0\r\n R = 1000000000000000000\r\n while L < R:\r\n mid = int((L+R)/2)\r\n works = True\r\n if p*mid < a or q*mid < b or p*mid - a > q*mid - b:\r\n works = False\r\n if works:\r\n R = mid\r\n else:\r\n L = mid+1\r\n print(q*L - b)\r\n", "t = int(input())\r\n\r\nfor i in range(t):\r\n x, y, p, q = [int(i) for i in input().split()]\r\n \r\n if p == 0:\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n\r\n l = 0\r\n r = 10000000000\r\n\r\n while l < r:\r\n t = (l + r) // 2\r\n\r\n c1 = p * t - x\r\n c2 = q * t - y - c1\r\n\r\n if c1 >= 0 and c2 >= 0:\r\n r = t\r\n else:\r\n l = t + 1\r\n\r\n if r == 10000000000:\r\n print(-1)\r\n else:\r\n print(q * l - y)\r\n", "for _ in range(int(input())):\r\n x,y,p,q = map(int, input().split())\r\n l,r,res = 0,10**18,-1\r\n while l<=r:\r\n mid=(l+r)//2\r\n a,b=p*mid-x,q*mid-y\r\n if a<=b and a>-1 and b>-1:\r\n res=b\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n print(res)", "def gcd( a, b ):\r\n return a if b == 0 else gcd( b, a % b )\r\n\r\ndef ext_gcd( a, b ):\r\n if b == 0:\r\n return [ 1, 0 ]\r\n xx, yy = ext_gcd( b, a % b )\r\n return [ yy, xx - a // b * yy ]\r\n\r\nT = int( input() )\r\nfor ti in range( T ):\r\n x, y, p, q = map( int, input().split() )\r\n r = p * y - q * x\r\n b, a = ext_gcd( q, p )\r\n a *= -1\r\n a *= r // gcd( p, q )\r\n b *= r // gcd( p, q )\r\n p, q = q, p\r\n if a >= 0 and b >= 0:\r\n k = min( a // p, a // p if q == 0 else b // q )\r\n a -= k * p\r\n b -= k * q\r\n if a < 0:\r\n k = ( -a + p - 1 ) // p\r\n a += k * p\r\n b += k * q\r\n if b < 0 and q:\r\n k = ( -b + q - 1 ) // q\r\n a += k * p\r\n b += k * q\r\n if a < b and p > q:\r\n k = ( b - a + p - q - 1 ) // ( p - q )\r\n a += k * p\r\n b += k * q\r\n if not ( 0 <= b <= a ):\r\n print( -1 )\r\n else:\r\n print( a )\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n x, y, p, q = map(int, input().split())\r\n a0 = p - x\r\n b0 = q - y - p + x\r\n c0 = a0 + b0\r\n if p == 0:\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n if p == q:\r\n if x == y:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n A = c0 // q\r\n B = a0 // p\r\n C = (a0 - c0) // (p - q)\r\n print(min(A, B, C) * (-q) + c0)", "from sys import stdin, stdout\r\n\r\nt = int(stdin.readline().rstrip())\r\n\r\nfor _ in range(t):\r\n x,y,p,q = map(int, stdin.readline().rstrip().split())\r\n if p==0 and x==0:\r\n print(0)\r\n elif p==0:\r\n print(-1)\r\n elif x==y and p==q:\r\n print(0)\r\n elif p==q:\r\n print(-1)\r\n else:\r\n c = max([x//p,y//q,(y-x)//(q-p)])\r\n if p*c<x or q*c<y or q*c-y<p*c-x:\r\n c+=1\r\n print(q*c-y)\r\n", "#https://codeforces.com/problemset/problem/773/A\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n x, y, p, q = map(int, input().split())\r\n left = -1\r\n right = 10**9\r\n r = right\r\n while left + 1 < right:\r\n t = (left + right) // 2\r\n if p*t >= x and q*t - p*t >= y - x:\r\n right = t\r\n else:\r\n left = t\r\n if not (p*r >= x and q*r - p*r >= y - x):\r\n print(-1)\r\n else:\r\n print(q*right - y)\r\n \r\n", "import math\nt = int(input())\nfor cs in range(t):\n\tx, y, p, q = [int(x) for x in input().split()]\n\tg, h = math.gcd(x, y), math.gcd(p, q)\n\tif x//g==p//h and y//g==q//h:\n\t\tprint(0)\n\telif p == 0 or p == q or p*(1<<100)-x > q*(1<<100)-y:\n\t\tprint(-1)\n\telse:\n\t\tprint(max(math.ceil((x-y)/(p-q)), math.ceil(x/p))*q-y)", "import math\r\n\r\n\r\ndef solve():\r\n x, y, p, q = map(int, input().split())\r\n l, r = 0, 10**10\r\n inf = 10**10\r\n while l < r:\r\n mid = (l + r) // 2\r\n mp, mq = mid * p, mid * q\r\n# print(f\"l = {l}, r = {r}, mid = {mid}, mp = {mp}, mq = {mq}\")\r\n if mp >= x and mq >= y and mp - x <= mq - y:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n print(l * q - y if l != inf else -1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "'''\r\nextra=val-y\r\nres=p*(val//q)\r\n\r\nres-x <=extra\r\np*(val//q)-x<=val-y\r\np*(val//q)+val>=y-x\r\np*(val//q)-val<=x-y\r\n\r\n'''\r\n\r\nfrom math import ceil\r\ndef check(x,y,p,q,mid):\r\n return p*mid>=x and mid*p-x<=(mid*q)-y\r\ndef f(x,y,p,q):\r\n if p==q and x!=y:\r\n return -1\r\n lo=ceil(y/q)\r\n hi=10**9\r\n ans=-1\r\n # print(check(x,y,p,q,4))\r\n while lo<=hi:\r\n mid=(lo+hi)//2\r\n if check(x,y,p,q,mid):\r\n hi=mid-1\r\n ans=(mid*q-y)\r\n else:\r\n lo=mid+1\r\n return ans\r\n\r\n\r\nfor _ in range(int(input())):\r\n x,y,p,q=map(int,input().strip().split())\r\n print(f(x,y,p,q))\r\n", "import sys\r\nfrom collections import deque\r\n\r\nmod = 10**9 + 7\r\ninf = 1<<30\r\n\r\ndef solve():\r\n def check(t):\r\n return p*t >= x and (q - p)*t >= y - x\r\n\r\n t = int(sys.stdin.readline().rstrip())\r\n\r\n for ti in range(t):\r\n x, y, p, q = map(int, sys.stdin.readline().split())\r\n\r\n btm = -1\r\n top = inf\r\n\r\n if not check(top):\r\n print(-1)\r\n continue\r\n\r\n while top - btm > 1:\r\n mid = (top + btm) // 2\r\n\r\n if check(mid):\r\n top = mid\r\n else:\r\n btm = mid\r\n\r\n ans = q*top - y\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(int)\r\ndef extended_gcd(a,b):\r\n if(a==0):\r\n return(0,1)\r\n x,y=extended_gcd(b%a,a)\r\n return (y-(b//a)*x,x)\r\ndef check(x,y,p,q):\r\n if(p>=x and (y-x)+p<=q):\r\n return True\r\n return False\r\n\r\nt=I()\r\nfor _ in range(t):\r\n x,y,p,q=M()\r\n if(p==0 and x!=0):\r\n print(-1)\r\n \r\n else:\r\n g=mt.gcd(x,y)\r\n if(x//g==p and y//g==q):\r\n print(0)\r\n elif(p==q):\r\n print(-1)\r\n else:\r\n l=0\r\n r=1\r\n while(not(check(x,y,p*r,q*r))):\r\n l=r\r\n r*=10\r\n #print(\"p\",l,r)\r\n d=0\r\n while(l<=r):\r\n m=(l+r)//2\r\n if(check(x,y,p*m,q*m)):\r\n d=m\r\n r=m-1\r\n else:\r\n l=m+1\r\n if((q*d-y)<0):\r\n print(-1)\r\n else:\r\n print(q*d-y)\r\n \r\n\r\n", "def check(x,y,p,q,t):\r\n if p*t>=x and q*t-p*t>=y-x:\r\n return 1\r\n return 0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y,p,q=map(int,input().split())\r\n l,r=-1,10**9\r\n if not(check(x,y,p,q,r)):\r\n print(-1)\r\n continue\r\n while r-l>1:\r\n m=(r+l)//2\r\n if check(x,y,p,q,m): r=m\r\n else: l=m\r\n print(r*q-y)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n'''\r\n设提交了B次，成功A次\r\n(A+x)/(B+y)=p/q\r\nA+x=p*K\r\nB+y=q*k\r\n二分枚举k\r\n'''\r\nT=int(input())\r\nfor case in range(T):\r\n x,y,p,q=map(int,input().strip().split())\r\n l=int(0)\r\n r=int(1e10)\r\n ans=1<<30\r\n while l<=r:\r\n mid=int((l+r)/2)\r\n A=mid*p-x\r\n B=mid*q-y\r\n if A>=0 and B>=0 and A<=B:\r\n ans=min(ans,mid)\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n if ans<1<<30:\r\n print((ans*q-y))\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n", "import math\nfor _ in range(int(input())):\n x,y,p,q = [int(x) for x in input().split()]\n print(math.ceil(max((y-x)/(q-p),x/p,y/q))*q-y) if p%q else print(0) if (x*q == p*y) else print(-1)\n", "def gcd(a, b):\n\tif (a == 0):\n\t\treturn (b, 0, 1)\n\n\t(g, x, y) = gcd(b % a, a)\n\treturn (g, y - (b // a) * x, x) \n\n\nt = int(input())\n\nfor i in range(t):\n\t(x, y, p, q) = list(map(int, input().split()))\n\tval = p * y - q * x\n\t(g, a, b) = gcd(q, -p)\n\n\tif (val % g != 0):\n\t\tprint(-1)\n\t\tcontinue\n\n\ta *= val // g\n\tb *= val // g\n\n\tda = abs(p // g)\n\tdb = abs(q // g)\n\n\tif (a < 0):\n\t\tif (da == 0):\n\t\t\tprint(-1)\n\t\t\tcontinue\n\n\t\tmul = (abs(a) + da - 1) // da\n\t\ta += mul * da\n\t\tb += mul * db\n\n\n\tif (b < 0):\n\t\tif (db == 0):\n\t\t\tprint(-1)\n\t\t\tcontinue\n\n\t\tmul = (abs(b) + db - 1) // db;\n\t\ta += mul * da\n\t\tb += mul * db\n\n\tif (a > b):\n\t\tif (da == db):\n\t\t\tprint(-1)\n\t\t\tcontinue\n\n\t\tdiff = a - b\n\t\tstep = db - da\n\t\tmul = (diff + step - 1) // step\n\t\ta += mul * da\n\t\tb += mul * db\n\n\tmul = b // db;\n\tif (da != 0):\n\t\tmul = min(mul, a // da)\n\n\tif (da != db):\n\t\tmul = min(mul, (b - a) // (db - da))\n\n\tprint(b - db * mul) \n\t", "qq = int(input())\r\n\r\nwhile qq > 0:\r\n x, y, p, q = map(int, input().split()) \r\n l = 1\r\n r = 1000000001\r\n while l < r:\r\n mid = (l + r) // 2\r\n curr = mid * q\r\n curr2 = (curr * p) // q\r\n if curr >= y and curr2 >= x and (curr - y) >= (curr2 - x):\r\n r = mid\r\n else:\r\n l = mid + 1\r\n if l == 1000000001:\r\n print(\"-1\")\r\n else:\r\n print(int((l * q) - y))\r\n qq = qq - 1", "t = int(input())\r\n\r\nfor _ in range(t):\r\n x, y, a, b = map(int, input().split())\r\n if a == 0:\r\n if x == 0: print(0)\r\n else : print(-1)\r\n continue\r\n if a == b:\r\n if x == y : print(0)\r\n else: print(-1)\r\n continue\r\n \r\n dx = min((-y + x) // (b - a), -x // a)\r\n print(-y - dx * b)", "for _ in range(int(input())):\r\n x, y, p, q = map(int, input().split())\r\n if (p == 0 and x != 0) or (p == q and x != y):\r\n print(-1)\r\n continue\r\n\r\n k1 = (y + q - 1) // q * q - y\r\n y += k1\r\n rr = x - y // q * p\r\n\r\n def check(k2):\r\n k3 = p * k2 - rr\r\n return k3 >= 0 and k2 * q + k1 >= k3\r\n\r\n r = 1\r\n while not check(r):\r\n r *= 2\r\n l = -1\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if check(m):\r\n r = m\r\n else:\r\n l = m\r\n print(r * q + k1)\r\n", "#!/usr/bin/python3\n# Copyright (C) 2017 Sayutin Dmitry.\n#\n# This program is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License as\n# published by the Free Software Foundation; version 3\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; If not, see <http://www.gnu.org/licenses/>.\n\ndef main():\n t = int(input())\n for tc in range(t):\n x, y, p, q = map(int, input().split())\n\n k0 = (y + (q - 1)) // q\n\n lo = -1\n hi = 10 ** 15\n while hi - lo > 1:\n mi = lo + (hi - lo) // 2\n\n if x <= p * (k0 + mi) <= x + (q * (k0 + mi) - y):\n hi = mi\n else:\n lo = mi\n #print(hi, x, y, p, q, k0)\n print(-1 if hi == 10 ** 15 else q * (k0 + hi) - y)\n\nmain()\n", "def gcd(a, b):\r\n if (a == 0):\r\n x = 0\r\n y = 1\r\n return b, x, y\r\n\r\n d, x1, y1 = gcd(b % a, a)\r\n x = y1 - (b // a) * x1\r\n y = x1\r\n return d, x, y\r\n\r\nt = int(input())\r\n\r\nfor _ in range(t):\r\n inp = input().split()\r\n x, y, p, q = int(inp[0]), int(inp[1]), int(inp[2]), int(inp[3])\r\n\r\n if(p == q):\r\n if(x == y):\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n\r\n if(p == 0):\r\n if(x == 0):\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n\r\n c = (y*p) - (x*q)\r\n # print(\"c = {}\".format(c))\r\n\r\n p = -p;\r\n g, d1, d2 = gcd(q, p);\r\n\r\n if(g < 0):\r\n c *= -1;\r\n g *= -1;\r\n\r\n d1 *= c;\r\n d2 *= c;\r\n\r\n # print(\"q = {} d1 = {} + p = {} d2 = {}\".format(q, d1, p, d2))\r\n if(d1 < 0):\r\n val = abs(d1);\r\n t = abs(val//abs(p));\r\n\r\n if( abs(t*(p)) < val):\r\n t+=1;\r\n # print(\"t<0 = {}\".format(t))\r\n\r\n d1 -= t*(p);\r\n d2 += t*(q);\r\n\r\n elif(d1 > 0):\r\n val = abs(d1);\r\n t = abs(val//abs(p));\r\n\r\n # print(\"t>0 = {}\".format(t))\r\n\r\n d1 += t*(p);\r\n d2 -= t*(q);\r\n\r\n if(d1 > d2):\r\n t = (d1 - d2)//(p + q);\r\n\r\n d1 -= t*(p);\r\n d2 += t*(q);\r\n\r\n if(d1 > d2):\r\n d1 -= (p);\r\n d2 += (q);\r\n\r\n print(d2)\r\n\r\n # print(\"q = {} d1 = {} + p = {} d2 = {}\".format(q, d1, p, d2))\r\n", "def chec(a,b,p,q,mid):\r\n if p*r>=a and (q-p)*mid>=b-a:\r\n return True\r\n else:\r\n return False\r\ndef check(np, nq):\r\n return np >= a and nq >= b and (np - a <= nq - b) \r\nfor _ in range(int(input())):\r\n a,b,p,q = map(int,input().split())\r\n l=0\r\n r=10000000000\r\n if check(p*r,q*r)==False:\r\n print(-1)\r\n continue\r\n while l<=r:\r\n mid = l +(r-l)//2\r\n if check(p*mid,q*mid):\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n print(l*q-b)\r\n", "for _ in range(int(input())):\r\n\tx,y,p,q=[int(x) for x in input().split(' ')]\r\n\tif(y*p==x*q):\r\n\t\tprint(0)\r\n\t\tcontinue\r\n\tm1=-1\r\n\tm2=-1\r\n\tif(p==0):\r\n\t\tm1=-1\r\n\telse:\r\n\t\tif(x%p):\r\n\t\t\tm1=(x//p)+1\r\n\t\telse:\r\n\t\t\tm1=(x//p)\r\n\tif(p==q):\r\n\t\tm2=-1\r\n\telse:\r\n\t\tif((y-x)%(q-p)):\r\n\t\t\tm2=((y-x)//(q-p))+1\r\n\t\telse:\r\n\t\t\tm2=((y-x)//(q-p))\r\n\tif(m2==-1 or m1==-1):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(max(m1,m2)*q-y)\r\n", "import sys\r\n\r\nT = int (sys.stdin.readline ())\r\nfor tc in range (T) :\r\n a, b, p, q = map (int, sys.stdin.readline ().split ())\r\n ans = -1\r\n l = 1\r\n r = int (1e40)\r\n while (l <= r) :\r\n y = l + r\r\n y >>= 1\r\n c = p * y - a\r\n d = q * y - b\r\n if c < 0 or d < 0 or c > d :\r\n l = y + 1\r\n else :\r\n ans = d\r\n r = y - 1\r\n print (ans) \r\n\r\n ", "def gcd(a, b):\n\tif b==0:\n\t\treturn a, 1, 0\n\tg, y, x=gcd(b, a%b)\n\ty-=x*(a//b)\n\treturn g, x, y\n\nfor _ in range(int(input())):\n\tx, y, p, q=map(int, input().split())\n\n\tif p==0:\n\t\tprint(0 if x==0 else -1)\n\t\tcontinue\n\tif q==1:\n\t\tprint(0 if x==y else -1)\n\t\tcontinue\n\ta, b=gcd(q, p)[1:]\n\ta*=p*y-q*x\n\tb*=q*x-p*y\n\tif a<0:\n\t\tt=(-a+p-1)//p\n\t\ta+=t*p\n\t\tb+=t*q\n\tif b<a:\n\t\tt=(a-b+q-p-1)//(q-p)\n\t\ta+=t*p\n\t\tb+=t*q\n\tt=min(a//p, (b-a)//(q-p))\n\ta-=t*p\n\tb-=t*q\n\tprint(b)\n", "for i in range(int(input())):\r\n x, y, p, q = map(int, input().split())\r\n print(-(x > 0) if not p else -(y > x) if p == q else max((x - 1) // p, (y - x - 1) // (q - p)) * q + q - y)", "import sys\nt = int(input())\n\ndef ex_gcd(a, b):\n if b == 0: return (a, 1, 0)\n gcd, u, v = ex_gcd(b, a % b)\n return gcd, v, u - (a // b) * v\n\nfor tc in range(t):\n x, y, p, q = map(int, input().split())\n c = y * p - x * q\n gcd, u, v = ex_gcd(q, -p)\n if (p * y == q * x):\n sys.stdout.write('0\\n')\n elif c % gcd != 0 or (p == 0 and x != 0) or (p // q == 1 and x // y != 1):\n sys.stdout.write('-1\\n')\n else:\n u *= c // gcd\n v *= c // gcd\n\n gerak_u = -p // gcd\n gerak_v = q // gcd\n if gerak_u > 0:\n gerak_u, gerak_v = -gerak_u, -gerak_v\n elif gerak_u == 0:\n gerak_v = abs(gerak_v)\n if u != 0:\n jarak = u // gerak_u\n u -= jarak * gerak_u\n v += jarak * gerak_v\n if u < 0:\n u -= gerak_u\n v += gerak_v\n\n\n if u <= v:\n sys.stdout.write('{}\\n'.format(v))\n else:\n # gerak_u negatip\n if -gerak_u >= gerak_v:\n sys.stdout.write('-1\\n')\n else:\n lol = gerak_v + gerak_u\n lil = u - v\n ans = (lil + lol - 1) // (lol)\n b = v + ans * gerak_v\n sys.stdout.write('{}\\n'.format(b))\n", "# (x + a) / (y + a + b) = p / q\r\n# minimize a+b\r\n# (x + a) * q = (y + a + b) * p\r\n# (3 + a) * 2 = (10 + a + b) * 1\r\n# xq + aq = yp +ap +bp\r\n# xq - yp = ap + bp - aq\r\n# xq - yp = (a+b)p -aq\r\n# xq - yp = (p-q)a +bp\r\n# 3*2 - 10*1 = (a+b)1 -2a\r\n\r\n#(p-q)a+bp=left\r\n#b=(left-(p-q)a)/p\r\n# left+aq=(a+b)p\r\n\r\nimport math\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\tx, y, p, q = map(int, input().split())\r\n\r\n\tif p==1 and q==1:\r\n\t\tif x==y:\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\t\tcontinue\r\n\tif p==0 and q==1:\r\n\t\tif x==0:\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\t\tcontinue\r\n\r\n\tlo = 0\r\n\thi = 2**65\r\n\r\n\twhile hi-lo > 1:\r\n\t\t#print(lo,hi)\r\n\t\tmid = (lo+hi)//2\r\n\t\tk = mid\r\n\r\n\t\tif x + k*q - y >= k*p and x <= k*p and k*q >= y:\r\n\t\t\thi = mid\r\n\t\telse:\r\n\t\t\tlo = mid\r\n\r\n\tprint(q*hi-y)", "R = lambda: map(int, input().split())\r\nmx = 10**9 + 7\r\nt = int(input())\r\nfor i in range(t):\r\n a, b, p, q = R()\r\n l, r = 1, mx\r\n while l < r:\r\n k = (l + r) // 2\r\n x, y = k * p - a, k * q - b\r\n if 0 <= x <= y and y >= 0:\r\n r = k\r\n else:\r\n l = k + 1\r\n if r >= mx:\r\n print(\"-1\")\r\n else:\r\n print(r * q - b)", "import math\r\narr=[]\r\nfor _ in range(int(input())):\r\n x,y,p,q=list(map(int,input().split()))\r\n if (p==q and x!=y) or (p==0 and x!=0):\r\n arr.append(-1)\r\n elif (x==p and y==q) or (p==0 and x==0) or (x*q==y*p and x!=0 and p!=0):\r\n arr.append(0)\r\n else:\r\n arr.append(max(math.ceil((x-y)/(p-q)), math.ceil(x/p))*q-y)\r\nprint(*arr,sep=\"\\n\")\r\n", "def egcd(a, b):\r\n\tif b == 0: return (a, 1, 0)\r\n\tq = a // b\r\n\tr = a % b\r\n\tres = egcd(b, r)\r\n\tg = res[0]\r\n\tss = res[1]\r\n\ttt = res[2]\r\n\treturn (g, tt, ss - q * tt)\r\nfor _t in range(int(input())):\r\n\tx, y, p, q = map(int, input().split())\r\n\tif p == 0:\r\n\t\tif x == 0: print(0)\r\n\t\telse: print(-1)\r\n\t\tcontinue\r\n\trght = p * y - x * q\r\n\tres = egcd(q, p)\r\n\tg = res[0]\r\n\ts = res[1]\r\n\tt = res[2]\r\n\tif abs(rght) % g == 0:\r\n\t\ts = rght // g * s\r\n\t\tt = rght // g * t\r\n\t\tif t < 0:\r\n\t\t\ts = s - (-t + q - 1) // q * p\r\n\t\t\tt = t + (-t + q - 1) // q * q\r\n\t\telse:\r\n\t\t\ts = s + t // q * p\r\n\t\t\tt = t - t // q * q\r\n\t\tif s < 0:\r\n\t\t\tt = t - (-s + p - 1) // p * q\r\n\t\t\ts = s + (-s + p - 1) // p * p\r\n\t\tif t + s <= 0: print(-t)\r\n\t\telif q == p: print(-1)\r\n\t\telse:\r\n\t\t\tif (t + s) % (q - p) == 0: t = t - (t + s) // (q - p) * q\r\n\t\t\telse: t = t - ((t + s) // (q - p) + 1) * q\r\n\t\t\tprint(-t)\r\n\telse: print(-1)", "for _ in range(int(input())):\r\n x, y, p, q = list(map(int, input().split()))\r\n if p == q:\r\n if x == y:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n if p == 0:\r\n if x == 0:\r\n print(0)\r\n else:\r\n print(-1)\r\n continue\r\n\r\n if x % p == 0:\r\n k = x // p\r\n else:\r\n k = x // p + 1\r\n if (y - x) % (q - p) == 0:\r\n k = max(k, (y - x) // (q - p))\r\n else:\r\n k = max(k, (y - x) // (q - p) + 1)\r\n print(k * q - y)\r\n" ]

[ "ans=0\r\nfor _ in range(int(input())):\r\n ans^=int((8*int(input())+1)**0.5-1)//2\r\nprint(['YES', 'NO'][ans>0])" ]

[ "import sys\r\nreadline=sys.stdin.readline\r\n\r\ndef Bisect_Float(ok,ng,is_ok,eps=1e-12,cnt=0):\r\n if cnt:\r\n for _ in range(cnt):\r\n mid=(ok+ng)/2\r\n if is_ok(mid):\r\n ok=mid\r\n else:\r\n ng=mid\r\n else:\r\n while abs(ok-ng)/max(ok,ng,1)>eps:\r\n mid=(ok+ng)/2\r\n if is_ok(mid):\r\n ok=mid\r\n else:\r\n ng=mid\r\n return ok\r\n\r\nN,A,B=map(int,readline().split())\r\ninf=4\r\nmaximum_slope=inf\r\nminimum_slope=-inf\r\nP=list(map(float,readline().split()))\r\nU=list(map(float,readline().split()))\r\ndef is_ok(c):\r\n dp=[0]*(A+1)\r\n cnt=[0]*(A+1)\r\n for n in range(1,N+1):\r\n prev_dp,prev_cnt=dp,cnt\r\n dp=[0]*(A+1)\r\n cnt=[0]*(A+1)\r\n dp[0],cnt[0]=max((prev_dp[0],prev_cnt[0]),(prev_dp[0]+U[n-1]-c,prev_cnt[0]+1))\r\n for a in range(1,A+1):\r\n dp[a],cnt[a]=max((prev_dp[a],prev_cnt[a]),(prev_dp[a]+U[n-1]-c,prev_cnt[a]+1),(prev_dp[a-1]+P[n-1],prev_cnt[a-1]),(prev_dp[a-1]+P[n-1]+U[n-1]-P[n-1]*U[n-1]-c,prev_cnt[a-1]+1))\r\n return cnt[A]>=B\r\nc=Bisect_Float(minimum_slope,maximum_slope,is_ok,1e-6)\r\ndp=[0]*(A+1)\r\ncnt=[0]*(A+1)\r\nfor n in range(1,N+1):\r\n prev_dp,prev_cnt=dp,cnt\r\n dp=[0]*(A+1)\r\n cnt=[0]*(A+1)\r\n dp[0],cnt[0]=max((prev_dp[0],prev_cnt[0]),(prev_dp[0]+U[n-1]-c,prev_cnt[0]+1))\r\n for a in range(1,A+1):\r\n dp[a],cnt[a]=max((prev_dp[a],prev_cnt[a]),(prev_dp[a]+U[n-1]-c,prev_cnt[a]+1),(prev_dp[a-1]+P[n-1],prev_cnt[a-1]),(prev_dp[a-1]+P[n-1]+U[n-1]-P[n-1]*U[n-1]-c,prev_cnt[a-1]+1))\r\nans=dp[A]+c*B\r\nprint(ans)" ]

[ "n = int(input())\r\nw = list(map(int, input().split()))\r\nent = input()\r\nmp = {w[i]: i+1 for i in range(n)}\r\nsorted(mp)\r\nw.sort()\r\nptr = 0\r\nstk = []\r\nfor i in range(2 * n):\r\n if ent[i] == \"0\":\r\n print(mp[w[ptr]], end=\" \")\r\n stk.append(mp[w[ptr]])\r\n ptr += 1\r\n else:\r\n print(stk.pop(), end=\" \")\r\n # print(pr.queue)\r\nprint()\r\n", "from collections import deque\r\nc = 0\r\n \r\n \r\ndef lol(x):\r\n global c\r\n c += 1\r\n return int(x), c\r\n \r\n \r\nn = int(input())\r\nw = list(map(lambda x: lol(x), input().split()))\r\nw.sort(key=lambda x: x[0])\r\ns = input()\r\nin_count = 0\r\nex_set = set()\r\nres = []\r\nd = deque()\r\nfor i in range(2 * n):\r\n if s[i] == '0':\r\n res.append(w[in_count][1])\r\n d.append(in_count)\r\n in_count += 1\r\n elif s[i] == '1':\r\n res.append(w[d.pop()][1])\r\nprint(*res)", "from collections import deque\r\nn=int(input())\r\norderedli=list(map(int,input().split(\" \")))\r\n\r\n\r\nindexof={}\r\nfor i,x in enumerate(orderedli):\r\n indexof[x]=i+1\r\n\r\nsortedli=list(sorted(orderedli))\r\ni=0\r\n\r\ns=input()\r\n\r\nst=deque()\r\n\r\nfor x in s:\r\n if x==\"0\":\r\n st.append(sortedli[i])\r\n print(indexof[sortedli[i]],end=\" \")\r\n i += 1\r\n else:#x==1\r\n temp=st.pop()\r\n print(indexof[temp],end=\" \")\r\n", "n = int(input())\nw = list(map(int, input().split()))\nintro = [[v, i] for i, v in enumerate(w, 1)]\nintro.sort(key=lambda x: x[0])\ns = input()\ni = -1\nli = []\nans = []\nfor j in s:\n if j == \"0\":\n i += 1\n ans.append(intro[i][1])\n li.append(intro[i][1])\n else:\n ans.append(li.pop(-1))\nprint(\" \".join(map(str, ans)))\n\n\t\t \t \t \t\t \t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=range(1,n+1)\r\nza=[x for x,y in sorted(zip(a,b))]\r\nzb=[y for x,y in sorted(zip(a,b))]\r\ns=input()\r\na=[]\r\nj=0\r\nfor i in range(2*n):\r\n if(s[i]=='0'):\r\n a.append(zb[j])\r\n print(zb[j],end=' ')\r\n j+=1\r\n \r\n else:\r\n print(a.pop(),end=' ')\r\n", "from collections import deque\nfrom operator import itemgetter\n\n\nclass CodeforcesTask982BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.seats = []\n self.passengers = ''\n\n def read_input(self):\n self.n = int(input())\n self.seats = [int(x) for x in input().split(\" \")]\n self.passengers = input()\n\n def process_task(self):\n results = []\n numbered_seats = [(x + 1, self.seats[x]) for x in range(self.n)]\n numbered_seats.sort(key=itemgetter(1), reverse=True)\n intro = deque()\n for passenger in self.passengers:\n if passenger == \"0\":\n seat = numbered_seats.pop(-1)\n results.append(seat[0])\n intro.append(seat[0])\n else:\n seat = intro.pop()\n results.append(seat)\n self.result = \" \".join([str(x) for x in results])\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask982BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from sys import stdin\ninput = stdin.readline\n\n\ndef answer():\n\n ans , b = [] , []\n\n ind = 0\n for i in range(2 * n):\n\n if(s[i] == '0'):\n ans.append(a[ind][1])\n b.append(a[ind][1])\n ind += 1\n else:\n ans.append(b.pop())\n\n return ans\n \n\nfor T in range(1):\n\n n = int(input())\n\n a = list(map(int,input().split()))\n\n a = [[a[i] , i + 1] for i in range(n)]\n a.sort()\n\n s = input().strip()\n\n print(*answer())\n\n \t\t \t\t\t \t \t \t\t \t \t \t\t \t", "n=int(input())\r\na = [int(a) for a in input().split()]\r\n\r\ncode = []\r\n\r\nfor i in range(1,n+1):\r\n d = dict(x=a[i-1],y=i)\r\n code.append(d)\r\ncode=sorted(code, key = lambda i:i[\"x\"],reverse=True)\r\nintro=[]\r\nextro=[]\r\n\r\nfor i in range(1,n+1):\r\n intro.append(code[i-1]['y'])\r\n\r\ninp=input()\r\n\r\nfor i in inp:\r\n if i=='0':\r\n intro_seat=intro.pop()\r\n print(intro_seat,end=' ')\r\n extro.append(intro_seat)\r\n\r\n else:\r\n print(extro.pop(),end=' ')\r\n\r\nprint()", "n = int(input())\r\nsit_width = input().split()\r\nsits = []\r\nsits_map = {}\r\nfor i in range(n):\r\n sits.append(int(sit_width[i]))\r\n sits_map[int(sit_width[i])] = i\r\npassengers = input()\r\nintrovertIndex = 0\r\nsits.sort()\r\nnew_sits = []\r\noutput = \"\"\r\nfor i in range(len(passengers)):\r\n if passengers[i] == '0':\r\n output += str(sits_map.get(sits[introvertIndex]) + 1) + \" \"\r\n new_sits.append(sits[introvertIndex])\r\n introvertIndex += 1\r\n else:\r\n output += str(sits_map.get(new_sits.pop()) + 1) + \" \"\r\nprint(output)", "\r\ndef main():\r\n t = 1\r\n for _ in range(t):\r\n n = int(input())\r\n \r\n tab = list(map(int,input().split()))\r\n s = input()\r\n for x in range(n):\r\n tab[x] = (tab[x],x+1)\r\n tab.sort()\r\n cur = 0\r\n q = []\r\n for x in range(2*n):\r\n if s[x]==\"0\":\r\n q.append(tab[cur][1])\r\n print(tab[cur][1],end=\" \")\r\n cur += 1\r\n else:\r\n print(q.pop(-1),end=\" \")\r\n\r\n\r\n\r\n \r\nmain()", "from _collections import deque\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\na = []\r\nb = deque()\r\n \r\ni = 1\r\nfor x in m:\r\n a.append((x, i))\r\n i += 1\r\na.sort(key=lambda p: -p[0])\r\n \r\ns = input()\r\nans = []\r\n \r\nfor x in s:\r\n if x == \"1\":\r\n v = b.pop()\r\n ans.append(v[1])\r\n else:\r\n v = a.pop()\r\n ans.append(v[1])\r\n b.append(v)\r\nprint(*ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = input()\r\n\r\nfor i in range(len(a)):\r\n a[i] = [a[i], i+1]\r\na = sorted(a)\r\n\r\ntemp = []\r\n\r\ncount = 0\r\nfor i in s:\r\n if i == '0':\r\n print(a[count][1], end=' ')\r\n temp.append(a[count][1])\r\n count += 1\r\n else:\r\n print(temp.pop(), end=' ')", "from collections import deque\r\n\r\nmy_stack = deque()\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = []\r\nfor i in range(len(w)):\r\n s.append((w[i], i + 1))\r\ns.sort()\r\ni_i = 0\r\nout = []\r\nl = input()\r\nfor el in l:\r\n if el == '0':\r\n out.append(s[i_i][1])\r\n my_stack.append(s[i_i])\r\n i_i += 1\r\n else:\r\n p = my_stack.pop()\r\n out.append(p[1])\r\nprint(' '.join(map(str, out)))\r\n", "n = int(input())\r\nx= [int(i) for i in input().split(\" \")]\r\ns = input()\r\n\r\nstack = []\r\n\r\nele = [i[0]+1 for i in sorted(enumerate(x), key=lambda x:x[1])]\r\nj = 0\r\n\r\nfor c in s:\r\n if c == '0':\r\n print(ele[j], end=\" \")\r\n stack.append(ele[j])\r\n j+=1\r\n else:\r\n print(stack.pop(), end = \" \")", "n = int(input())\n \none_seat = []\n \ntwo_seats = []\n \nj = 1\n \nfor item in input().split():\n two_seats.append((int(item), j))\n j += 1\n \ntwo_seats.sort(key=lambda x: -x[0])\n \nfor person in input():\n if person == '0':\n q = two_seats.pop()\n print(q[1], end=' ')\n one_seat.append(q)\n else:\n print(one_seat.pop()[1], end=' ')\n \t \t \t \t \t\t \t\t\t\t\t \t\t\t \t", "# your code goes here\nn=int(input())\none=[]\ntwo=[]\nc=1\nfor i in input().split():\n\ttwo.append((int(i),c))\n\tc=c+1\ntwo.sort(key=lambda x:-x[0])\nfor j in input():\n\tif j==\"0\":\n\t\tp=two.pop()\n\t\tprint(p[1],end=\" \")\n\t\tone.append(p)\n\telse:\n\t\tprint(one.pop()[1],end=\" \")\n\t\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=[int(i) for i in input().split()]\r\nd={}\r\nfor i in range(n):\r\n\td[a[i]]=i+1\r\na.sort()\r\ns=input()\r\nj=0\r\nx=[]\r\nfor i in s:\r\n\tif(i=='0'):\r\n\t\tprint(d[a[j]],end=\" \")\r\n\t\tx.append(d[a[j]])\r\n\t\tj+=1\r\n\telse:\r\n\t\tprint(x[-1],end=\" \")\r\n\t\tx.pop()\r\n", "n = int(input())\r\nw = list(map(int, input().split()))\r\nhackers = input()\r\nT = [[w[i], i + 1, 0] for i in range(len(w))]\r\nT.sort(reverse = True)\r\nstack = []\r\nfor x in hackers:\r\n if x == '0':\r\n print(T[-1][1], end=' ')\r\n stack.append(T.pop())\r\n else:\r\n print(stack[-1][1], end=' ')\r\n stack.pop()\r\n \r\n ", "def solution(m, ws, s):\n eldian = 0\n extraStack = []\n\n res = []\n for char in s:\n ex = char == '1'\n\n if not ex:\n row = ws[eldian]\n extraStack += [row]\n\n eldian += 1\n else:\n row = extraStack.pop()\n\n res += [row + 1]\n print(*res)\n\n\n#Eldian\n#Marleyan\nif __name__ == \"__main__\":\n m = int(input())\n ws = [(v, i) for i, v in enumerate(map(int, input().split(' ')))]\n # print(ws)\n ws = sorted(ws)\n # print(ws)\n ws = [index for val, index in ws]\n # print(ws)\n s = input()\n\n solution(m, ws, s)\n\n\n \t\t \t \t\t\t \t\t \t \t\t \t\t\t\t", "import sys\r\nfrom math import gcd, sqrt\r\nfrom typing import Deque\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\n\r\n\r\ninf = float(\"inf\")\r\nen = lambda x: list(enumerate(x))\r\n\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\narr = rr()\r\narr = en(arr)\r\n\r\narr.sort(key=lambda x: x[1])\r\n\r\ni = 0\r\nbrr = []\r\n\r\nfor j in input():\r\n if j == \"0\":\r\n brr.append(arr[i])\r\n print(arr[i][0] + 1, end=\" \")\r\n i += 1\r\n else:\r\n x = brr.pop()\r\n print(x[0] + 1, end=\" \")\r\n", "import heapq\r\nrow = int(input())\r\nwidth = [int(x) for x in input().split()]\r\nIntrovert = []\r\nExtrovert = []\r\nfor i in range(row):\r\n heapq.heappush(Introvert,(width[i],i+1))\r\nsequence = input()\r\nAns = []\r\nfor i in sequence:\r\n if(i==\"0\"): #Introvert\r\n x,y = heapq.heappop(Introvert)\r\n heapq.heappush(Extrovert,(-x,y))\r\n Ans.append(y)\r\n else:\r\n x,y = heapq.heappop(Extrovert)\r\n Ans.append(y)\r\nprint(*Ans)\r\n", "n=int(input())\r\na=[]\r\nfor i,w in enumerate(input().split()):\r\n a.append((int(w),i+1))\r\na.sort()\r\ni, ans, pls1 = 0, [], []\r\nfor x in input():\r\n if x=='0':\r\n ans.append(a[i][1])\r\n pls1.append(a[i])\r\n i+=1\r\n else:\r\n ans.append((pls1.pop())[1])\r\nprint(*ans)\r\n\r\n", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n l=sorted(zip(lst(),range(n)))\r\n p=0;ans=[0]*(2*n)\r\n st=[0]*n;ln=0\r\n s=input()\r\n for i in range(2*n):\r\n # print(st)\r\n ch=s[i]\r\n if ch=='0':\r\n st[ln]=p\r\n ans[i]=l[p][1]+1\r\n ln+=1\r\n p+=1\r\n else:\r\n ans[i]=l[st[ln-1]][1]+1\r\n ln-=1\r\n print(*ans)", "n = int(input())\r\nw = list(map(int,input().split()))\r\ns = input()\r\nind = {}\r\nfor i in range(n):\r\n\tind[w[i]] = i + 1\r\nw.sort()\r\nl = 0\r\narr = []\r\nfor i in range(2*n):\r\n\tif s[i] == '0':\r\n\t\tprint(ind[w[l]], end=\" \")\r\n\t\tarr.append(w[l])\r\n\t\tl+=1\r\n\telse:\r\n\t\tprint(ind[arr[-1]], end=\" \")\r\n\t\tarr.pop()\r\n\r\n", "from heapq import heappush, heappop, heapify\r\n\r\nn = int(input())\r\n\r\nW_I = [(int(w), i) for i, w in enumerate(input().split(' '))]\r\nheapify(W_I)\r\n\r\nW_E = []\r\n\r\npassengers = input()\r\nanswer = []\r\n\r\nif __name__ == '__main__':\r\n\r\n for passenger in passengers:\r\n\r\n if passenger == '0':\r\n w, i = heappop(W_I)\r\n heappush(W_E, (-w, i))\r\n answer.append(i+1)\r\n else:\r\n w, i = heappop(W_E)\r\n answer.append(i+1)\r\n\r\n print(' '.join([str(el) for el in answer]))\r\n", "n=int(input())\nw = [(int(x), c+1) for c, x in enumerate(input().split())]\nb=sorted(w,reverse=True) \nf=[]\np=[]\nk=input()\nfor i in k:\n if i==\"0\":\n x=b.pop()\n f.append(x)\n p.append(x[1])\n else:\n y=f.pop()\n p.append(y[1])\nprint(*p) \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\nw = list(map(int, input().split()))\r\ns = input()[:-1]\r\n\r\nw1 = sorted(enumerate(w), key=lambda x:x[1])\r\nj = 0\r\nd = []\r\nfor i in s:\r\n if i == '0':\r\n d.append(w1[j][0] + 1)\r\n print(w1[j][0] + 1, end=' ')\r\n j += 1\r\n else:\r\n print(d[-1], end=' ')\r\n d.pop(-1)", "n = int(input())\ni = iter(sorted(zip(map(int, input().split()), range(1, n + 1))))\ns, o = [], []\nfor c in input():\n if c == '0':\n x = next(i)[1];\n o.append(x);\n s.append(x)\n else:\n o.append(s.pop())\nprint(*o)\n \t\t \t \t \t\t\t\t \t \t\t \t \t\t", "n=int(input())\nli=list(map(int,input().split()))\ns=input()\nl2=[]\nfor i in range(n):\n\tl2.append((li[i],i))\nl2.sort()\nl3=[]\nj=0\nfor i in s:\n\tif i=='0':\n\t\tprint(int(l2[j][1])+1,end=\" \")\n\t\tl3.append(l2[j][1])\n\t\tj+=1\n\telse:\n\t\tx=int(l3.pop())\n\t\tprint(x+1,end=\" \")\n \t\t\t \t\t \t\t \t \t \t\t \t \t \t", "n=int(input())\r\ns=list(map(int,input().split()))\r\nstrr=input()\r\ndic={}\r\nfor i in range(0,n):\r\n dic[s[i]]=i+1 \r\n\r\nlist0=s[::]\r\nlist1=[]\r\nlist2=[]\r\n\r\nm=\"\"\r\nk=0\r\nj=0\r\nlist0.sort()\r\nfor i in strr:\r\n if i=='0':\r\n m+=str(dic[list0[j]])+\" \"\r\n list1+=[list0[j]]\r\n k=k+1\r\n j=j+1\r\n else:\r\n m+=str(dic[list1[k-1]])+\" \"\r\n del(list1[k-1])\r\n k=k-1\r\nprint(m)", "def print_return(func):\n def wrapper(*args, **kwargs):\n retval = func(*args, **kwargs)\n print(retval)\n return retval\n\n return wrapper\n\n\nclass Solve:\n @staticmethod\n @print_return\n def solve_a(lines=None):\n if lines is None:\n n = int(input())\n row = input()\n else:\n lines = lines.split('\\n')\n n = int(lines[0].strip())\n row = lines[1].strip()\n ans = 'Yes'\n\n def neighs(idx):\n ns = []\n\n def get_idxes(idx):\n return idx - 1, idx + 1\n\n for i in get_idxes(idx):\n if i > -1 and i < n:\n ns.append(row[i])\n return ns\n\n for idx in range(n):\n if row[idx] == '0' \\\n and all(x == '0' for x in neighs(idx)):\n ans = 'No'\n break\n elif row[idx] == '1' \\\n and any(x == '1' for x in neighs(idx)):\n ans = 'No'\n break\n return ans\n\n @staticmethod\n @print_return\n def solve_b(lines=None):\n if lines is None:\n n = int(input())\n idx___width = [int(x) for x in input().split()]\n stop_idx___char = input()\n else:\n lines = lines.split('\\n')\n n = int(lines[0])\n idx___width = [int(x) for x in lines[1].split()]\n stop_idx___char = lines[2]\n bus = sorted(enumerate(idx___width), key=lambda x: x[1])\n queue = []\n ans = []\n curr_last = 0\n for person in stop_idx___char:\n if person == '0':\n queue.append(str(bus[curr_last][0] + 1))\n ans.append(queue[-1])\n curr_last += 1\n\n else:\n ans.append(queue.pop())\n ans = ' '.join(ans)\n return ans\n\n @staticmethod\n @print_return\n def solve_c(lines=None):\n pass\n\n @staticmethod\n @print_return\n def solve_d(lines=None):\n pass\n\n @staticmethod\n @print_return\n def solve_e(lines=None):\n pass\n\n @staticmethod\n @print_return\n def solve_f(lines=None):\n pass\n\n\nif __name__ == '__main__':\n Solve.solve_b()\n", "n = int(input())\nseats = [int(i) for i in input().split()] \n\nper = input()\n\nseats_2d = []\n\nfor i in range(n):\n seats_2d.append([seats[i], i+1])\n\nseats_2d.sort(key = lambda x: -x[0] )\ninv_stack = []\nres = []\n\nfor d in per:\n if d == '0':\n _, sit = seats_2d.pop()\n res.append(sit)\n inv_stack.append(sit)\n else:\n ind = inv_stack.pop()\n res.append(ind)\n\nprint(*res)\n\n\n\n\n\t \t\t \t \t \t \t \t \t\t\t\t\t \t", "from heapq import heappop, heappush, heapify \r\nn = int(input())\r\nlis = list(map(int,input().split()))\r\ns = list(input())\r\nlis=[[lis[i],i+1] for i in range(n)]\r\nlis.sort()\r\n#print(lis)\r\nhas=[0]*(n+1)\r\nans=[0]*(2*n)\r\ni=j=0\r\nheap=[]\r\nheapify(heap)\r\nfor _ in range(2*n):\r\n if s[_]=='0':\r\n ans[_]=lis[i][1]\r\n heappush(heap , [-1*lis[i][0],lis[i][1]])\r\n i+=1\r\n else:\r\n a=1\r\n ele = heappop(heap)\r\n ans[_]=ele[1] \r\nprint(*ans) \r\n \r\n\r\n", "from math import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom heapq import *\r\nfrom statistics import *\r\n\r\ninf = float('inf')\r\nninf = -float('inf')\r\nip = input\r\nalphal = \"abcdefghijklmnopqrstuvwxyz\"\r\nalphau = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n\r\n\r\ndef ipl():\r\n return list(map(int, ip().split()))\r\n\r\n\r\ndef ipn():\r\n return int(ip())\r\n\r\n\r\ndef ipf():\r\n return float(ip())\r\n\r\n\r\ndef solve():\r\n n = ipn()\r\n s = [(e, i) for i, e in enumerate(ipl())]\r\n p = ip()\r\n e = []\r\n\r\n heapify(s)\r\n for x in p:\r\n if x == '0':\r\n se, idx = heappop(s)\r\n print(idx+1, end=\" \")\r\n heappush(e, (-se, idx))\r\n else:\r\n se, idx = heappop(e)\r\n print(idx+1, end=\" \")\r\n\r\n\r\nt = 1 # ipn()\r\nfor _ in range(t):\r\n solve()\r\n", "m=int(input())\na=list(map(int,input().split()))\ns=input()\ndd={}\nfor i in range(m):\n dd[a[i]]=i\nasr=sorted(a)\nls=[]\nfor i in asr:\n ls.append(dd[i])\nel,mr=0,0\nans=[]\nst=[]\nfor i in s:\n if i=='0':\n ans.append(ls[el])\n st.append(el)\n el+=1\n else:\n ans.append(ls[st.pop()])\nfor i in ans:\n print(i+1,end=' ')\nprint()\n \n \t \t\t\t \t\t\t\t\t\t \t \t \t\t\t \t\t", "test_case = int(input())\r\n# seats = [int(x) for x in input().split()]\r\nseats = list(map(int,input().split()))\r\nsequence = input()\r\n\r\nseat_map = {}\r\nhalf = []\r\n\r\n# for i, v in enumerate(seats):\r\n# seat_map[v]=i+1\r\n\r\nfor i in range(0,test_case):\r\n seat_map[seats[i]]=i+1 \r\n\r\nseats.sort()\r\nk=j=0\r\n\r\nfor titan in sequence:\r\n if titan == '0':\r\n # seat = seats[j]\r\n # half.append(seat)\r\n half+=[seats[j]]\r\n print(seat_map[seats[j]], end=' ')\r\n k += 1\r\n j += 1\r\n else:\r\n # seat = half.pop() \r\n print(seat_map[half[k-1]], end=' ')\r\n del(half[k-1])\r\n k=k-1\r\n# print()\r\n\r\n\r\n", "n = int(input())\r\nseats = list(map(int, input().split()))\r\nsarr = list(zip(seats, range(1, n+1)))\r\nsarr.sort()\r\nsarr = [i[1] for i in sarr]\r\nans = []\r\nk = 0\r\nfor i in input():\r\n if i == '0': \r\n print(sarr[k], end = \" \")\r\n ans.append(sarr[k])\r\n k+=1\r\n if i == '1':\r\n print(ans[-1], end = \" \")\r\n ans.pop()", "n = int(input())\r\nlst_width = list(map(int,input().split()))\r\nfor i in range(n):\r\n lst_width[i] = [lst_width[i],i+1]\r\nlst_width.sort()\r\nans = [0]* (2*n)\r\nstore = []\r\ni,k = 0,0\r\n\r\nfor s in input():\r\n if s == '0':\r\n ans[k] = lst_width[i][1]\r\n store.append(lst_width[i][1])\r\n i+=1\r\n else:\r\n ans[k] = store[-1]\r\n store.pop()\r\n \r\n k+=1\r\nprint(*ans)", "from heapq import heappop, heappush, heapify\n\n\ndef main():\n n = int(input())\n l = sorted(range(n), key=list(map(int, input().split())).__getitem__)\n i = 0\n cc, res = [], []\n for c in input():\n if c == '0':\n heappush(cc, i)\n res.append(l[-i] + 1)\n i -= 1\n else:\n res.append(l[-heappop(cc)] + 1)\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\ni=iter(sorted(zip(map(int,input().split()),range(1,n+1))))\r\ns,o=[],[]\r\nfor c in input():\r\n if c=='0':\r\n x=next(i)[1];o.append(x);s.append(x)\r\n else:o.append(s.pop())\r\nprint(*o)", "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\nw = list(map(int, input().split()))\r\nh1 = []\r\nfor i in range(n):\r\n heapq.heappush(h1, (w[i], i + 1))\r\ns = list(input().rstrip())\r\nh2 = []\r\nans = []\r\nfor i in s:\r\n if not i & 1:\r\n x, j = heapq.heappop(h1)\r\n heapq.heappush(h2, (-x, j))\r\n else:\r\n _, j = heapq.heappop(h2)\r\n ans.append(j)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\nw = [(int(x), i + 1) for i, x in enumerate(input().split())]\ns = input()\n \nw.sort()\n \nstack = []\nans = []\ncur = 0\nfor c in s:\n if c == '0':\n stack.append(w[cur][1])\n ans.append(w[cur][1])\n cur += 1\n else:\n ans.append(stack.pop())\nprint(\" \".join(map(str, ans)))\n\n \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\ns = input()\r\n\r\na = [(i, x) for i, x in enumerate(a)]\r\na = sorted(a, key=lambda x: x[1], reverse=True)\r\n\r\nstack = []\r\n\r\nans = []\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n el = a.pop()\r\n ans.append(el[0]+1)\r\n stack.append(el[0])\r\n else:\r\n el = stack.pop()\r\n ans.append(el + 1)\r\n \r\nprint(*ans)\r\n ", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_arr(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\nseats = get_arr()\r\naliens = get_string()\r\nseat_map = {}\r\nfor i in range(n):\r\n seat_map[seats[i]] = i\r\n\r\nseats.sort()\r\ninr, ex = 0, 0\r\nans = []\r\nex_seat = []\r\nfor i in range(2 * n):\r\n if aliens[i] == \"0\":\r\n ans.append(seat_map[seats[inr]] + 1)\r\n ex_seat.append(inr)\r\n inr+=1\r\n else:\r\n ans.append(seat_map[seats[ex_seat.pop()]] + 1)\r\n \r\n\r\n \r\n\r\nprint(*ans)\r\n", "#!/usr/bin/env python3\nfrom sys import stdin\nimport heapq\n\ndef solve(tc):\n n = int(stdin.readline())\n w = list(map(int, stdin.readline().split()))\n seq = stdin.readline()\n\n wi = []\n for i in range(n):\n wi.append((w[i], i+1))\n heapq.heapify(wi)\n\n ans = []\n remained = []\n for c in seq:\n if c=='0':\n seat = heapq.heappop(wi)\n heapq.heappush(remained, (-seat[0], seat[1]))\n ans.append(str(seat[1]))\n if c=='1':\n seat = heapq.heappop(remained)\n ans.append(str(seat[1]))\n\n print(' '.join(ans))\n pass\n\n\nLOCAL_TEST = not __debug__\nif LOCAL_TEST:\n infile = __file__.split('.')[0] + \"-test.in\"\n stdin = open(infile, 'r')\n\ntcs = (int(stdin.readline().strip()) if LOCAL_TEST else 1)\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1", "from collections import deque\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\ns = input()\r\nans = [0] * 2 * n\r\nfor i in range(n):\r\n a[i] = (a[i], i + 1)\r\na.sort()\r\nstack = deque()\r\nindex = 0\r\nfor i in range(2 * n):\r\n if s[i] == \"0\":\r\n stack.appendleft((i, a[index][1]))\r\n index += 1\r\n else:\r\n now = stack.popleft()\r\n ans[i] = now[1]\r\n ans[now[0]] = now[1]\r\nprint(*ans)", "def main():\n l = sorted(range(int(input())), key=list(map(int, input().split())).__getitem__)\n i, st, res = 0, [], []\n for c in input():\n if c == '0':\n st.append(i)\n res.append(l[i] + 1)\n i += 1\n else:\n res.append(l[st.pop()] + 1)\n print(' '.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nws = [(v, i) for i, v in enumerate(map(int, input().split(' ')))]\nws = sorted(ws)\nws = [i for v, i in ws]\ns = input()\n\nintroI = 0\nextraStack = []\n\nres = []\nfor c in s:\n ex = c == '1'\n\n if not ex:\n row = ws[introI]\n extraStack += [row]\n\n introI += 1\n else:\n row = extraStack.pop()\n \n res += [row + 1]\n\n#print(extraStack)\nprint(*res)\n", "n = int(input())\r\nu = list(map(int, input().split()))\r\nfor i in range(n):\r\n u[i] = (u[i], i)\r\nh = list(map(int, list(input())))\r\ndef f(t):\r\n return t[0]\r\nk = 2 * n\r\np = [0] * k\r\nex = []\r\nit = u[:]\r\nit.sort(key = f)\r\nind = 0\r\nfor i in range(k):\r\n if not h[i]:\r\n p[i] = it[ind][1] + 1\r\n ex.append(p[i])\r\n ind += 1\r\n else:\r\n p[i] = ex[-1]\r\n ex.pop()\r\nfor i in range(k):\r\n print(p[i], end = ' ')\r\n \r\n", "\"\"\" Prositka\r\n20.09.2022\"\"\"\r\n\r\nn=int(input())\r\ni=iter(sorted(zip(map(int,input().split()),range(1,n+1))))\r\ns,a=[],[]\r\nfor j in input():\r\n if j=='0':\r\n x=next(i)[1];a+=[x];s+=[x]\r\n else:a.append(s.pop())\r\nprint(*a)", "n = int(input())\r\nlst = input().split()\r\ns = input()\r\n\r\ndah = {}\r\nasc = []\r\n\r\nfor i in range(n):\r\n dah[lst[i]] = i\r\n asc.append(int(lst[i]))\r\n\r\nasc.sort()\r\nstk = []\r\n\r\nid0 = 0\r\n\r\nfor x in s:\r\n if x == '0':\r\n print(dah[str(asc[id0])] + 1, end=' ')\r\n stk.append(dah[str(asc[id0])])\r\n id0 += 1\r\n else:\r\n print(stk[-1] + 1, end=' ')\r\n stk.pop()", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n): a[i] = [a[i],i]\r\ns = input()\r\nans = [0]* (2*n)\r\next = []\r\na.sort()\r\ni = 0\r\nfor t in range(2*n):\r\n\tif s[t] == '0':\r\n\t\tans[t] = a[i][1]+1\r\n\t\text.append(a[i][1]+1)\r\n\t\ti += 1\r\n\telse:\r\n\t\tans[t] = ext[-1]\r\n\t\text.pop()\r\nprint(*ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 17 08:26:41 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn = int(input())\r\ni = 1;l = []\r\nfor j in input().split():\r\n l.append((i,int(j)))\r\n i+=1\r\nst = input()\r\nl.sort(key = lambda x:x[1])\r\n\r\nstack = []\r\nk = 0\r\nfor i in range(2*n):\r\n if st[i] == '0':\r\n print(l[k][0],end=' ')\r\n stack.append(l[k][0]);k+=1\r\n else:\r\n a = stack.pop()\r\n print(a,end=' ')\r\n \r\n ", "\r\n# Problem: B. Bus of Characters\r\n# Contest: Codeforces - Codeforces Round #484 (Div. 2)\r\n# URL: https://codeforces.com/contest/982/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\nar = get_ints()\r\n\r\nbus = sorted([ (ar[i], i+1) for i in range(n) ])\r\npa = [int(x) for x in input()]\r\nseq = []\r\n# print(bus)\r\ntail = 0\r\nfor p in pa:\r\n\tif p == 0:\r\n\t\tprint(bus[tail][1], end=\" \")\r\n\t\tseq.append(tail)\r\n\t\ttail+=1\r\n\telse:\r\n\t\tv = seq.pop()\r\n\t\tprint(bus[v][1],end=\" \")\r\n", "import heapq\r\nfrom collections import deque\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\nw=[[w[j], j+1] for j in range(n)]\r\ns=input()\r\na, b=heapq.heapify([]), heapq.heapify([])\r\nw.sort()\r\nc, res=[], []\r\nw=w[::-1]\r\nfor j in s:\r\n if j==\"0\":\r\n c.append(w.pop())\r\n res.append(c[-1][1])\r\n else:\r\n res.append(c.pop()[1])\r\nprint(\" \".join([str(k) for k in res]))", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom sys import stdin\n\ninp = stdin.readline\n\nn = int(inp())\na = [(int(ele), i + 1) for i, ele in enumerate(inp().split())]\ns = inp().strip()\nans = [0] * (2* n)\n\npartially_filled = []\na.sort()\n\nstart = 0\nfor j in range(2*n):\n if s[j] == \"0\":\n partially_filled.append(a[start])\n ans[j] = a[start][1]\n start += 1\n else:\n ans[j] = partially_filled[-1][1]\n partially_filled.pop()\n\nprint(*ans)\n", "n = input()\r\nseat_rows = [int(x) for x in input().strip().split()]\r\naliens = input().strip()\r\n\r\neldian = \"0\"\r\nmarleyan = \"1\"\r\n\r\nempty = sorted(enumerate(seat_rows), key=lambda x: x[1], reverse=True)\r\nnon_empty = []\r\n\r\nresult = []\r\nfor alien in aliens:\r\n if alien == eldian:\r\n row = empty.pop()\r\n non_empty.append(row)\r\n else:\r\n row = non_empty.pop()\r\n\r\n result.append(row[0] + 1)\r\n\r\nprint(' '.join(map(str, result)))", "import math\r\nimport sys\r\nimport queue\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n w = list(map(int, input().split()))\r\n s = str(input())\r\n\r\n row = {w[i]: i + 1 for i in range(n)}\r\n\r\n free_2 = []\r\n for i in range(n):\r\n heappush(free_2, (w[i], w[i]))\r\n\r\n free_1 = []\r\n res = []\r\n for i in range(2 * n):\r\n if s[i] == \"0\":\r\n k = heappop(free_2)\r\n heappush(free_1, (-k[1], k[0]))\r\n else:\r\n k = heappop(free_1)\r\n res += [(row[k[1]])]\r\n\r\n print(*res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nz = list(zip(s, range(1, n+1)))\r\nz.sort()\r\nz = [i[1] for i in z]\r\np = []\r\nk = 0\r\nfor i in input():\r\n if i == '0': \r\n print(z[k])\r\n p.append(z[k])\r\n k+=1\r\n if i == '1':\r\n print(p[-1])\r\n p.pop()\r\n\r\n", "n=int(input())\ni=iter(sorted(zip(map(int,input().split()),range(1,n+1))))\ns,o=[],[]\nfor c in input():\n if c=='0':\n x=next(i)[1];o+=[x];s+=[x]\n else:o.append(s.pop())\nprint(*o)\n\t \t \t\t \t\t\t\t \t \t \t\t\t\t \t \t", "MyDict = {}\r\nN, Ans = int(input()), []\r\nWidth = list(map(int, input().split()))\r\nPassengers = input()\r\nfor i in range(N):\r\n MyDict[Width[i]] = i + 1\r\nKeys = sorted(Width)\r\nNow = []\r\nIndex = 0\r\nfor j in Passengers:\r\n if j == \"0\":\r\n Now.append(Keys[Index])\r\n print(MyDict[Keys[Index]], end=\" \")\r\n Index += 1\r\n else:\r\n print(MyDict[Now.pop()], end=\" \")\r\n\r\n# Hope the best for Ravens member\r\n", "import heapq \r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\npassengers = input()\r\n\r\nmin_heap = []\r\nmax_heap = []\r\n\r\nfor ind, width in enumerate(w):\r\n heapq.heappush(min_heap, (width, ind))\r\n\r\n\r\nres = []\r\n\r\nfor passenger in passengers:\r\n if passenger == '0':\r\n width, ind = heapq.heappop(min_heap)\r\n\r\n res.append(ind + 1)\r\n heapq.heappush(max_heap, (width*-1, ind))\r\n \r\n else:\r\n width, ind = heapq.heappop(max_heap)\r\n res.append(ind + 1)\r\n \r\n\r\nprint(*res)", "# LUOGU_RID: 101739776\nn = int(input())\r\na = iter(sorted(zip(map(int, input().split()), range(n))))\r\ns = []\r\np = []\r\nfor c in input():\r\n if c == '0':\r\n t = next(a)[1]\r\n p += t + 1,\r\n s += t,\r\n else:\r\n p += s.pop() + 1,\r\nprint(*p)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=input()\r\n\r\nc=[[0 for i in range(2)]for j in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(2):\r\n if j==1:\r\n c[i][j]=i+1\r\n else:\r\n c[i][j]=a[i]\r\nc.sort()\r\nresult=[];j=0;temp=[]\r\n\r\nfor i in range(2*n):\r\n if b[i]=='0':\r\n result.append(c[j][1])\r\n temp.append(c[j][1])\r\n j+=1\r\n else:\r\n z=temp.pop()\r\n result.append(z)\r\n \r\nfor x in range(len(result)):\r\n print(result[x],end=' ')\r\n", "from heapq import heappush, heappop, heapify\r\nfrom math import ceil, floor, sqrt\r\nfrom collections import defaultdict, Counter\r\nfrom sys import stdin, stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\n\r\nn = ninput()\r\nw = ainput()\r\np = sinput()\r\ndic = dict()\r\nfor i in range(n): dic[w[i]] = i + 1\r\nocc = []\r\nans = []\r\nheapify(w)\r\nfor i in p:\r\n if i == '0':\r\n t = heappop(w)\r\n heappush(occ, -t)\r\n ans.append(dic[t])\r\n if i == '1':\r\n ans.append(dic[-heappop(occ)])\r\nprintt(*ans)", "from sys import stdin,stdout\r\na=stdin.readline();z1=[];k=\"\";o=-1\r\nz=sorted((j,i) for i,j in enumerate(map(int,input().split())))\r\nfor i in input():\r\n if i=='0':o+=1;k+=str(z[o][1]+1)+' ';z1+=[z[o][1]+1]\r\n else:k+=str(z1.pop())+' '\r\nstdout.write(k)", "from collections import deque\r\nn=int(input())\r\nw=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[w[i]]=i\r\nw.sort()\r\nstack=deque()\r\ns=input()\r\nans=[]\r\nj=0\r\nfor i in range(2*n):\r\n if s[i]=='0':\r\n y=d[w[j]]\r\n stack.append(y)\r\n ans.append(y+1)\r\n j+=1\r\n else:\r\n x=stack.pop()\r\n ans.append(x+1)\r\nprint(*ans)", "n=int(input())\r\narr=sorted([(int(x),i+1) for i,x in enumerate(input().split())])\r\nptr=0\r\nind=0\r\narray=[]\r\nfor i in input():\r\n if i==\"0\":\r\n print(arr[ptr][1],end=\" \")\r\n array.append(arr[ptr][1])\r\n ptr+=1\r\n else:\r\n print(array.pop(),end=\" \")" ]

[ "n, m = map(int, input().split())\r\n\r\nsongs = []\r\nc = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c += a * b\r\n songs.append(c)\r\n\r\nv = list(map(int, input().split()))\r\nsi = 0\r\nfor it in v:\r\n while songs[si] < it:\r\n si += 1\r\n print(si + 1)", "import bisect\r\n\r\nn,m=map(int,input().split())\r\nls=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n c,t=map(int,input().split())\r\n ls[i]=ls[i-1]+c*t\r\n#print(ls)\r\narr=list(map(int,input().split()))\r\nfor i in range(m):\r\n var=bisect.bisect_left(ls,arr[i])\r\n print(var)\r\n\r\n\r\n\r\n", "def bsearch(c,ar):\r\n l=-1\r\n r=len(ar)\r\n while l<r-1:\r\n m=(l+r)//2\r\n if ar[m]>=c:\r\n r=m\r\n else:\r\n l=m\r\n return r+1\r\nimport bisect\r\n\r\n\r\nw=input().split()\r\nn,m=int(w[0]),int(w[1])\r\nsong=[]\r\nfor i in range(n):\r\n l=input().split()\r\n l=[int(i) for i in l]\r\n song.append(l[0]*l[1])\r\n\r\npre=[0]*(len(song))\r\npre[0]=song[0]\r\nfor i in range(1,len(song)):\r\n pre[i]=pre[i-1]+song[i]\r\n\r\nquery=input().split()\r\nquery=[int(i) for i in query]\r\nfor i in query:\r\n ww=bsearch(i,pre)\r\n print(ww)\r\n\r\n", "n,m=map(int,input().split())\r\nkk=[]\r\nd=0\r\nfor i in range(n):\r\n c,t=map(int,input().split())\r\n d+=(c*t)\r\n kk.append(d)\r\nll=list(map(int,input().split()))\r\ni,v=0,0\r\nwhile i<n:\r\n while v<m:\r\n if ll[v]<=kk[i]:\r\n v+=1\r\n print(i+1)\r\n else:break\r\n i+=1\r\n", "from bisect import bisect_left\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n prefix_sum: list[int] = [0]\r\n for i in range(1, n + 1):\r\n c, t = map(int, input().split())\r\n prefix_sum.append(c * t + prefix_sum[i - 1])\r\n moments: list[int] = list(map(int, input().split()))\r\n\r\n for moment in moments:\r\n print(bisect_left(prefix_sum, moment))\r\n\r\n\r\ndef main():\r\n t: int = 1\r\n for _ in range(t):\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import itertools\r\nimport sys\r\n\r\n\r\ndef main() -> int:\r\n reader = (tuple(map(int, line.split())) for line in sys.stdin)\r\n n, _ = next(reader)\r\n songs = [0] * (n+1)\r\n for i, (c, t) in enumerate(itertools.islice(reader, n), 1):\r\n songs[i] = songs[i-1] + c * t\r\n index = 1\r\n for mo in next(reader):\r\n while mo > songs[index]:\r\n index += 1\r\n print(index)\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n raise SystemExit(main())\r\n", "from bisect import bisect_left as bs\r\n\r\nn, m = map(int, input().split())\r\n\r\na = [0]\r\nfor i in range(1, n + 1):\r\n c, t = map(int, input().split())\r\n a.append(c * t + a[i - 1])\r\n \r\nv = map(int, input().split())\r\n\r\nfor i in v:\r\n print(bs(a, i))", "# for i in range(5005):\r\n# \tcount[i]=0\r\n\r\n# for i in range(n):\r\n# \tcount[arr[i]]=count.get(arr[i], 0) + 1\r\n\r\n\r\n\r\nn,m=map(int,input().split())\r\nadd=0\r\na=[]\r\nfor i in range(n):\r\n\tc,t=map(int,input().split())\r\n\tadd=add+c*t\r\n\ta.append(add)\r\n\r\n\r\nv=[int(x) for x in input().split()]\r\n\r\nj=0\r\ni=0\r\nwhile(i<m):\r\n\tif v[i]<=a[j]:\r\n\t\ti+=1\r\n\t\tprint(j+1)\r\n\telse:\r\n\t\tj+=1\r\n\r\n\r\n\r\n\r\n\r\n# print(\"a\",a)\r\n# print(\"v\",v)\r\n\r\n\r\n\r\n\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\nimport string\n\nfrom collections import Counter, defaultdict\nfrom math import fsum, sqrt, gcd, ceil, factorial\nfrom operator import *\nfrom itertools import accumulate\nfrom bisect import *\ninf = float(\"inf\")\n# input = sys.stdin.readline\nflush = lambda: sys.stdout.flush\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\nen = lambda x: list(enumerate(x))\n\n\n# inputs\n# ip = lambda : input().rstrip()\nip = lambda: input()\nii = lambda: int(input())\nr = lambda: map(int, input().split())\nrr = lambda: list(r())\n\n\nn, k = r()\narr = [rr() for _ in range(n)]\nbrr = rr()\ncrr = [0]\n\n\nfor i, j in arr:\n crr += (crr[-1] + i * j,)\n\n\nfor i in brr:\n print(bisect(crr,i-1))", "I=[int(i) for i in input().split()]\r\nn, m, pl, s = I[0], I[1], [], 0\r\nfor i in range(n):\r\n I=[int(i) for i in input().split()]\r\n s+=I[0]*I[1]\r\n pl.append(s)\r\nM=[int(i) for i in input().split()]\r\nindex=0\r\nfor i in M:\r\n for j in range(index,n):\r\n if i<=pl[j]:\r\n print(j+1)\r\n index=j\r\n break\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\nfrom bisect import *\r\nn,m=f()\r\nl=[0]\r\nfor _ in range(n):\r\n c,t=f()\r\n l.append(l[-1]+c*t)\r\nfor i in il():\r\n x=bisect_right(l,i)\r\n print(x-1 if l[x-1]==i else x)", "n, m = list(map(int, input().split()))\ninps = []\n\nfor i in range(n):\n c, t = list(map(int, input().split()))\n inps.append(c*t)\n\np = i = 0\nfor v in list(map(int, input().split())):\n while(p<v):\n p += inps[i]\n i += 1\n print(i)\n\n", "n,m=map(int,input().split())\r\nx=[0]*(n+1)\r\nfor i in range(n):\r\n c,t=map(int,input().split())\r\n x[i]=(x[i-1] if i else 0)+(c*t)\r\nv=list(map(int,input().split()))\r\nc=0\r\nfor k in v:\r\n while k>x[c]:\r\n c+=1\r\n print(str(c+1))", "from sys import stdin\r\nimport math\r\n\r\n\r\ndef binSearch(arr, low, high, x):\r\n if low == high:\r\n return low\r\n mid = (low + high) // 2\r\n if arr[mid] == x:\r\n return mid\r\n if arr[mid] < x:\r\n return binSearch(arr, mid + 1, high, x)\r\n else:\r\n return binSearch(arr, low, mid, x)\r\n\r\nn, m = list(map(int, stdin.readline().rstrip().split(\" \")))\r\nprefixArr = [0]\r\n\r\nfor _ in range(n):\r\n ci, ti = list(map(int, stdin.readline().rstrip().split(\" \")))\r\n prefixArr.append(prefixArr[-1] + (ci * ti))\r\n\r\narr = list(map(int, stdin.readline().rstrip().split(\" \")))\r\n\r\nfor ele in arr:\r\n print(binSearch(prefixArr, 0, len(prefixArr) - 1, ele))\r\n\r\n\r\n", "n, M = map(int, input().split())\r\na = [0 for i in range(n)]\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n if i == 0:\r\n a[i] = c*t\r\n else:\r\n a[i] = a[i-1] + c*t\r\nv = list(map(int, input().split()))\r\nfor i in range(M):\r\n l = -1\r\n r = n-1\r\n while r-l>1:\r\n m = (l + r)//2\r\n if a[m] >= v[i]:\r\n r = m\r\n else:\r\n l = m\r\n print(r+1)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nimport bisect\r\n\r\nn, m = map(int, input().split())\r\nd = []\r\nx = 0\r\nfor _ in range(n):\r\n c, t = map(int, input().split())\r\n x += c*t\r\n d.append(x)\r\n\r\nfor i in map(int, input().split()):\r\n x = bisect.bisect_left(d,i) + 1\r\n print(x)", "n,m=map(int,input().split())\ns=[0]\nk=0\nl=0\nfor i in range(n):\n c,t=map(int,input().split())\n s.append(s[i]+c*t)\n # print(s[i])\nara= [int(x) for x in input().split()]\n\nfor j in range(m):\n while ara[j]>s[l]:\n l+=1\n print(l)\n\n \t \t \t\t\t \t \t \t\t \t \t\t \t", "n,m=map(int,input().split())\r\np=[]\r\nq=[]\r\nfor _ in range(n):\r\n c,t=map(int,input().split())\r\n p.append(c*t)\r\nv=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n p[i]=p[i]+p[i-1]\r\nj=0\r\nfor i in v:\r\n l=j\r\n h=n-1\r\n while l<=h:\r\n mid=(l+h)//2\r\n if mid==0 and i<=p[mid]:\r\n j=mid\r\n print(mid+1)\r\n break\r\n if i>p[mid-1] and i<=p[mid]:\r\n j=mid\r\n print(mid+1)\r\n break\r\n elif i>p[mid]:\r\n l=mid+1\r\n else:\r\n h=mid-1\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 3 20:30:05 2015\r\n\r\n@author: kevin\r\n\"\"\"\r\n\r\ntableautaille=input().split(\" \");\r\n\r\nn=int(tableautaille[0])\r\nm=int(tableautaille[1])\r\ntabfinal=[]\r\nfor i in range(n):\r\n\ttab=input().split(\" \")\r\n\tc=int(tab[0])\r\n\tt=int(tab[1])\r\n\ttabfinal+=[c*t]\r\n\r\ntableau=input().split(\" \");\r\nres=0\r\nindice=0\r\nfor i in range(m):\r\n\tsearch=int(tableau[i])\r\n\twhile(search>res+tabfinal[indice]):\r\n\t\tres+=tabfinal[indice]\r\n\t\tindice+=1\r\n\tprint(indice+1)\r\n\t", "# maa chudaaye duniya\r\nn,m=map(int,input().split())\r\narr=[0]\r\nk, l = 0, 0\r\nfor i in range(n):\r\n\tc,t=map(int,input().split())\r\n\tarr.append(arr[i] + c*t)\r\nara = list(map(int, input().split()))\r\nfor j in range(m):\r\n while ara[j] > arr[l]:\r\n l += 1\r\n print(l)", "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, m = mints()\r\na = [0]\r\ns = 0\r\nfor i in range(n):\r\n\tc,t = mints()\r\n\ts += c*t\r\n\ta.append(s)\r\nj = 0\r\nfor i in mints():\r\n\twhile not (i-1 >= a[j] and i-1 < a[j+1]):\r\n\t\tj += 1\r\n\tprint(j+1)\r\n", "R=lambda:map(int,input().split())\nn,m=R()\nA=[]\nwhile(n>0):\n\tn-=1\n\tc,t=R()\n\tA.append(c*t)\ni=p=0\nfor v in R():\n\twhile(p<v):\n\t\tp+=A[i]\n\t\ti+=1\n\tprint(i)\n\n\t\t \t\t\t\t \t \t\t \t\t\t \t \t \t\t", "n, m = input().split(' ')\nn = int(n)\nm = int(m)\n\nmusicas = []\ni = 0\nwhile i < n:\n ci, ti = input().split(' ')\n musicas.append((int(ci), int(ti)))\n i += 1\n\n\ntempos = input().split(' ')\n\n\ntempo_atual = musicas[0][0]*musicas[0][1]\nmusica_atual = 0\n\ni = 0\nwhile i < m:\n tempo = int(tempos[i])\n \n if int(tempo) <= tempo_atual:\n print(musica_atual + 1)\n else:\n musica_atual += 1\n tempo_atual += musicas[musica_atual][0]*musicas[musica_atual][1]\n i -= 1\n i += 1\n \t \t \t \t \t\t \t\t\t \t \t", "[n, m] = [int(i) for i in input().split()]\n\ntime_listening = []\n\nfor i in range(n):\n [c, t] = [int(i) for i in input().split()]\n time_listening.append(c * t)\n\nmoments = [int(i) for i in input().split()]\n\nsoma = time_listening[0]\natual = 1\n\nfor time in moments:\n while time > soma:\n soma += time_listening[atual]\n atual += 1\n print(atual)\n\t \t\t \t \t \t \t \t \t\t \t\t\t \t\t\t", "n,m = map(int,input().split())\r\ntime = 0\r\nans = 1\r\nl = []\r\nfor i in range(n):\r\n l.append([int(j) for j in input().split()])\r\ncheck = list(map(int,input().split()))\r\nj = 0\r\ni = 0\r\nwhile i < m:\r\n if check[i]-time <= l[j][0]*l[j][1]:\r\n print(j+1)\r\n i+=1\r\n else:\r\n time += l[j][0]*l[j][1]\r\n j+=1", "n,m=map(int,input().split())\r\nA=[]\r\nfor i in range(n):\r\n\tc,t=map(int,input().split())\r\n\tA.append(c*t)\r\ni=p=0\r\nfor v in [int(x) for x in input().split()]:\r\n\twhile(p<v):p,i=p+A[i],i+1\r\n\tprint(i)\r\n", "import bisect as bs\r\n\r\n\r\nn, m = map(int, input(). split())\r\na=[]\r\nz = 0\r\nfor _ in range (n) :\r\n c, k = map(int,input().split())\r\n z += c * k\r\n a.append(z)\r\n\r\nb = list(map(int,input().split()))\r\n\r\nfor _ in range (m) :\r\n print(bs.bisect_left(a,b[_])+ 1)\r\n \r\n", "from bisect import bisect_left as pos\r\nn, m = map(int, input().split())\r\n\r\ntrack = [0]\r\n\r\nfor i in range(1, n + 1):\r\n c, t = map(int, input().split())\r\n track.append(c * t + track[i - 1])\r\n\r\nmom = list(map(int, input().split()))\r\n\r\nprint('\\n'.join([str(pos(track, i)) for i in mom]))", "n, m = [int(p) for p in input().split()]\nsm = []\nfor i in range(n):\n c, t = [int(p) for p in input().split()]\n if not sm:\n sm.append(c*t)\n else:\n sm.append(sm[-1] + c*t)\ntime = [int(p) for p in input().split()]\ni = 0\nj = 0\nwhile j < len(time):\n if sm[i] >= time[j]:\n print(i+1)\n j += 1\n else:\n i += 1", "n,m = [int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n\ta=[int(i) for i in input().split()]\r\n\tif(i==0):\r\n\t\tl.append(a[0]*a[1])\r\n\telse:\r\n\t\tl.append(l[i-1]+a[0]*a[1])\r\nL=[int(i) for i in input().split()]\r\np=0\r\nq=0\r\nwhile(p<len(l) and q<len(L)):\r\n\tif(l[p]>=L[q]):\r\n\t\tq+=1\r\n\t\tprint(p+1)\r\n\telse:\r\n\t\tp+=1\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n# your code goes here# your code goes here", "n, m = map(int, input().split())\r\nsong_end = [None] * n\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n song_end[i] = (song_end[i - 1] if i > 0 else 0) + c * t\r\n\r\nmoments = list(map(int, input().split()))\r\ncurr_song = 0\r\nres = []\r\nfor mom in moments:\r\n while mom > song_end[curr_song]:\r\n curr_song += 1\r\n res.append(str(curr_song + 1))\r\n\r\nprint('\\n'.join(res))\r\n", "from bisect import bisect_left as b\r\n\r\nn, m = map(int, input().split())\r\nlis = [0]\r\ncur = 0\r\n\r\nfor _ in range(n):\r\n c, t = map(int, input().split())\r\n cur += c*t\r\n lis.append(cur)\r\n \r\nv = list(map(int, input().split()))\r\n\r\nfor i in v:\r\n print(b(lis, i))\r\n \r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n#CODE\r\n\r\nn , m = MAP()\r\nlast = -1\r\ny = []\r\nfor i in range(n):\r\n c , t = MAP()\r\n x = c * t\r\n if last == -1:\r\n last = x\r\n y.append(x)\r\n\r\n else:\r\n y.append(x + last)\r\n last = last + x\r\n\r\nq = LIST()\r\n\r\nh = len(y)\r\nans = []\r\nfor i in range(m):\r\n z = q[i]\r\n ans.append(bisect_left(y , z) + 1)\r\n\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\n\nsongs = []\nfor i in range(n):\n c, t = list(map(int, input().split()))\n songs.append(c * t)\n\nbb = list(map(int, input().split()))\nsong = 1\nprev = 0\nfor m in bb:\n while songs[song - 1] + prev < m:\n prev += songs[song - 1]\n song += 1\n print(song)\n\n \n", "from sys import stdin,stdout\r\nimport bisect as bs\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,q=lst()\r\n a=[0]\r\n for i in range(n):\r\n t,d=lst()\r\n a+=[a[-1]+t*d]\r\n for v in lst():\r\n print(bs.bisect_left(a,v))\r\n", "n, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n s.append(a * b)\r\nq = list(map(int, input().split()))\r\na = 0\r\nb = 0\r\nsu = s[0]\r\nwhile b < m:\r\n if q[b] > su:\r\n a += 1\r\n su += s[a]\r\n else:\r\n print(a + 1)\r\n b += 1\r\n", "from sys import stdin,stdout\nn,m = map(int,stdin.readline().split())\nts = []\nts.append(0)\n\nfor i in range(n):\n j,k = map(int,stdin.readline().split())\n ts.append(ts[i] + (j*k))\ni = 0\nj = 1\n\nV = list(map(int,stdin.readline().split()))\n\nfor v in V:\n if ts[i] <= v <= ts[j]:\n print(i+1)\n elif ts[j] < v:\n while ts[j] < v:\n i += 1\n j += 1\n print(i+1)\n", "Homura = [int(i) for i in input().split()]\r\nn = Homura[0]\r\nm = Homura[1]\r\nl_t = []\r\nfor i in range(n):\r\n\tMadoka = [int(i) for i in input().split()]\r\n\tl_t.append(Madoka[0]*Madoka[1])\r\nl_m = [int(i) for i in input().split()]\r\n\r\nsong = 0\r\ntime = 0\r\n\r\nfor i in range(m):\r\n\twhile time < l_m[i]:\r\n\t\ttime += l_t[song]\r\n\t\tsong += 1\r\n\tprint(song)\r\n", "from math import prod\r\nn, m = map(int, input().split())\r\nk = 0\r\na = [k := k + prod(map(int, input().split())) for _ in range(n)]\r\nv = list(map(int, input().split())) \r\n\r\ndef b_search(i, m):\r\n l = -1\r\n r = len(m)\r\n while l < r - 1:\r\n mid = (r+l)//2\r\n if m[mid] < i:\r\n l = mid\r\n else:\r\n r = mid\r\n return r + 1\r\nfor i in v:\r\n print(b_search(i, a))\r\n \r\n \r\n \r\n ", "from collections import deque\r\na,b = map(int,input().split())\r\nlst = []\r\nfor i in range(a+1):\r\n if i==a:\r\n array = list(map(int,input().split()))\r\n continue\r\n l,r = map(int,input().split())\r\n lst.append(l*r)\r\nlst = deque(lst)\r\nfor i in range(1,a):\r\n lst[i]+=lst[i-1]\r\nz = 0\r\ni = 1\r\nwhile lst and z<b:\r\n while z<b and lst[0]>=array[z]:\r\n print(i)\r\n z+=1\r\n else:\r\n i+=1\r\n lst.popleft()", "n,m = map(int,input().split())\r\nlol = []\r\nmem = 0\r\nfor i in range(n):\r\n c,t = map(int,input().split())\r\n mem += c * t\r\n lol.append(mem)\r\nv = list(map(int,input().split()))\r\nfor k in v:\r\n l = 0\r\n r = n - 1\r\n if k <= lol[0]:\r\n print(1)\r\n else:\r\n while l < r - 1:\r\n s = (l + r) // 2\r\n if lol[s] < k:\r\n l = s\r\n else:\r\n r = s\r\n print(r+1)", "z=lambda:map(int,input().split())\r\nn,m=z()\r\nt,c=[],[]\r\nfor _ in range(n):\r\n x,y=z()\r\n t.append(y)\r\n c.append(x)\r\nv=list(z())\r\ni=s=0\r\nfor x in v:\r\n while True:\r\n if x>s:\r\n s+=t[i]*c[i]\r\n i+=1\r\n else:\r\n break\r\n print(i)\r\n \r\n", "def main(n,m,c,t,moments):\r\n\ts = 0\r\n\tanswer = []\r\n\tlast = 0\r\n\r\n\tfor i in range(n):\r\n\t\ts += c[i]*t[i]\r\n\t\twhile last<m:\r\n\t\t\titem = moments[last]\r\n\t\t\tif item<=s:\r\n\t\t\t\tanswer.append(i+1)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\t\tlast+=1\r\n\t\tif last>=m:\r\n\t\t\tbreak\r\n\r\n\ts = ''\r\n\tfor a in answer:\r\n\t\ts+=str(a)+'\\n'\r\n\treturn s[:-1]\r\n\r\ndef init():\r\n\tn,m = list(map(int, input().split()))\r\n\tc = []\r\n\tt = []\r\n\r\n\tfor i in range(n):\r\n\t\tq,w = list(map(int, input().split()))\r\n\t\tc.append(q)\r\n\t\tt.append(w)\r\n\r\n\tmoments = list(map(int, input().split()))\r\n\r\n\tprint(main(n,m,c,t,moments))\r\n\r\ninit()", "n, m = [int(i) for i in input().split()]\r\nc = []; t = []\r\nfor i in range(n):\r\n\tsong = input().split()\r\n\tc.append(int(song[0]))\r\n\tt.append(int(song[1]))\r\nreq = [int(i) for i in input().split()]\r\n\r\nreq_index = total_length = 0\r\nfor i in range(len(c)):\r\n\ttotal_length += c[i] * t[i]\r\n\twhile(req_index < len(req)):\r\n\t\tif(req[req_index] <= total_length):\r\n\t\t\tprint(i + 1)\r\n\t\t\treq_index += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif req_index == len(req): break", "a1,b1 = map(int,input().split())\r\nsongs = []\r\nfor i in range(a1):\r\n songs.append(list(map(int,input().split())))\r\nli = list(map(int,input().split()))\r\nz,i,b = 0,-1,0\r\nwhile i<a1 and b<b1:\r\n if li[b]>z:\r\n i+=1\r\n z+=songs[i][1]*songs[i][0]\r\n else:\r\n print(i+1)\r\n b+=1\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\ndef bins(l,low,high,k):\r\n while low<=high:\r\n mid = low+(high-low)//2\r\n if l[mid]==k:\r\n return mid\r\n elif l[mid]<k:\r\n low=mid+1\r\n else:\r\n high = mid-1\r\n return high+1\r\n \r\n\r\nn,m = amap()\r\na=0\r\nl=[]\r\nfor i in range(n):\r\n c,t = amap()\r\n a+=c*t\r\n l.append(a)\r\nv = alist()\r\nfor i in v:\r\n print(bins(l,0,n-1,i)+1)", "n, m = [int(i) for i in input().split()]\nc = []\nt = []\n\nfor i in range(n):\n ci, ti = [int(i) for i in input().split()]\n c.append(ci)\n t.append(ti)\n\nv = [int(i) for i in input().split()] \n\ntimes = [c[0] * t[0]]\n\nfor i in range(1, n):\n song_duration = c[i] * t[i]\n times.append(times[-1]+song_duration)\n\nmoment = 0\nsong = 0\nwhile moment < m:\n if v[moment] <= times[song]:\n print(song + 1)\n moment += 1\n else:\n song += 1\n\t \t \t\t\t \t\t\t \t\t \t\t \t \t \t\t\t\t", "s = input()\r\n\r\nn, m = map(int, s.split(' '))\r\n\r\nl = [0]\r\n\r\nfor i in range(n):\r\n s = input()\r\n t1, t2 = map(int, s.split(' '))\r\n l.append(l[-1] + t1*t2)\r\n\r\nxs = list(map(int, input().split(' ')))\r\n\r\nj = 0\r\ni = 0\r\nwhile i < m:\r\n if xs[i] <= l[j]:\r\n print(j)\r\n i += 1\r\n else:\r\n j += 1\r\n", "n, m = map(int, input().split())\r\n\r\ntimes = [0]\r\n\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n times.append(times[-1] + c * t)\r\n\r\nv = list(map(int, input().split()))\r\n\r\nl = 0\r\nfor i in v:\r\n while times[l] < i:\r\n l += 1\r\n print(l)\r\n", "from bisect import bisect_left\r\n\r\nI = lambda: map(int,input().split())\r\n\r\nn, _ = I()\r\nT = [0]\r\n\r\nfor _ in range(n):\r\n c, t = I()\r\n T.append(T[-1]+c*t)\r\n\r\nfor t in I():\r\n print(bisect_left(T, t))", "\n\n\ndef main():\n primeira_linha = input()\n primeira_linha = primeira_linha.split()\n n_musicas = int(primeira_linha[0])\n n_anotacoes = int(primeira_linha[1])\n repeticao_musica = []\n tempo_musica = []\n for i in range(n_musicas):\n entrada = input()\n entrada = entrada.split()\n repeticao_musica.append(int(entrada[0]))\n tempo_musica.append(int(entrada[1]))\n #anotacoes do menino\n entrada = input()\n entrada = entrada.split()\n anotacoes = list(map(lambda x: int(x),entrada))\n j = 0\n tempo = 0\n lista_tempo = [0]\n for i in range(n_musicas):\n tempo+=repeticao_musica[i]*tempo_musica[i]\n lista_tempo.append(tempo)\n i = 1\n while i<=n_musicas:\n if (anotacoes[j]<=lista_tempo[i] and anotacoes[j]>=lista_tempo[i-1]):\n print(i)\n j+=1\n else:\n i+=1\n if(j==n_anotacoes):\n break\n \nmain()\n\t\t \t\t\t\t\t\t\t \t\t \t\t\t \t \t \t\t\t\t", "def check(pref, k, x):\r\n summ = pref[x]\r\n return summ < k\r\n\r\n\r\nn, m = map(int, input().split())\r\nc = []\r\nt = []\r\npref = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n ci, ti = map(int, input().split())\r\n pref[i] = pref[i - 1] + ci * ti\r\nv = list(map(int, input().split()))\r\nfor k in v:\r\n l = 0\r\n r = n\r\n while r - l > 1:\r\n mid = (r + l) // 2\r\n if check(pref, k, mid):\r\n l = mid\r\n else:\r\n r = mid\r\n print(r)", "def bs(x):\r\n l = 0\r\n r = n\r\n\r\n while l + 1 < r:\r\n m = (l+r)//2\r\n\r\n if x <= p[m]:\r\n r = m\r\n else:\r\n l = m\r\n\r\n if x <= p[l]:\r\n return l\r\n return r\r\n\r\n\r\nn, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n a.append(c*t)\r\n\r\np = [a[0]]\r\nfor i in range(1, n):\r\n p.append(p[i-1] + a[i])\r\n\r\nfor i in map(int, input().split()):\r\n print(bs(i)+1)\r\n\r\n#print(*p)", "import math\r\ndef prsum(a):\r\n p = [0]\r\n for t in range(len(a)):\r\n p.append(int(a[t])+p[-1])\r\n return(p)\r\n\r\n\r\ndef sufsum(a):\r\n pr = [0]\r\n for t in range(1,len(a)+1):\r\n pr.append(int(a[-t])+pr[-1])\r\n return(pr)\r\n\r\n\r\ndef bl(x):\r\n L = 0\r\n R = x+1\r\n while R-L > 1:\r\n m = (L + R)//2\r\n if m**3 <= x:\r\n L = m\r\n else:\r\n R = m\r\n return L\r\n\r\ndef bll(a,b):\r\n L = 0\r\n R = len(a)+1\r\n while R-L>1:\r\n M = (R+L)//2\r\n if a[M]<b:\r\n L = M\r\n else:\r\n R = M\r\n return(R)\r\n\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n c, d = map(int, input().split())\r\n a.append(c*d)\r\nb = [int(__) for __ in input().split()]\r\na = prsum(a)\r\nfor elem in b:\r\n print(bll(a,elem))", "from bisect import bisect_left\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\nc = []\r\nt = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n c.append(a)\r\n t.append(b)\r\nmins = list(map(int,input().split()))\r\nplaytime = []\r\ntotalTime = 0\r\nfor i in range(n):\r\n playtime.append(totalTime)\r\n totalTime+=c[i]*t[i]\r\n# print(*playtime)\r\nfor i in range(m):\r\n print(bisect_left(playtime,mins[i]))\r\n", "n,m = map(int, input().split())\nnmus = []\ntmus = []\nultimo = 0\nfor i in range(n):\n c,t = map(int, input().split())\n nmus.append(i)\n if i == 0:\n tmus.append(c*t)\n else:\n tmus.append(c*t + tmus[i-1])\nmomentos = input().split()\nfor i in range(m):\n for j in range(ultimo, n+1):\n if(int(momentos[i]) <= int(tmus[j])):\n print(j+1)\n ultimo = j\n break\n\t\t \t\t\t\t\t \t \t \t \t \t \t \t \t\t", "import io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# input = io.StringIO(os.read(0, os.fstat(0).st_size).decode()).readline\r\nii=lambda:int(input())\r\nkk=lambda:map(int,input().split())\r\nll=lambda:list(kk())\r\n\r\nn,m=kk()\r\nls=[0]*n\r\nfor i in range(n):\r\n\ta,b=kk()\r\n\tls[i]=a*b\r\ni=ct = 0\r\nar=[]\r\nfor t in kk():\r\n\twhile t > ct:\r\n\t\tct+=ls[i]\r\n\t\ti+=1\r\n\tar.append(i)\r\nprint(\"\\n\".join(map(str,ar)))\r\n", "n, m = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d.append(a * b)\r\nx = list(map(int, input().split()))\r\na, b = 0, 0\r\ns = 0\r\nwhile b != len(x):\r\n if s + d[a] >= x[b]:\r\n print(a + 1)\r\n b += 1\r\n else:\r\n s += d[a]\r\n a += 1", "def busca(lista, ind , valor, soma):\n verdade = True\n while verdade:\n\n if soma >= valor:\n return [ind, soma]\n \n soma += lista[ind]\n ind += 1\n\ndef main():\n n, m = [int(i) for i in input().split(' ')]\n out = []\n for i in range(n):\n c, t = [int(i) for i in input().split(' ')]\n out.append((c * t))\n \n soma = 0\n ind = 0 \n\n for i in input().split(' '):\n ind, soma = busca(out, ind, int(i), soma)\n print(abs(ind))\n \n\nif __name__ == '__main__':\n main()\n\t \t\t \t \t\t\t\t \t \t\t \t \t\t\t\t", "import bisect\n\nn, m = map(int,input().split())\n\ncfs = [0 for i in range(n)]\n\nfor i,val in enumerate(range(n)):\n c,t = map(int,input().split())\n dur = c*t\n if i==0:\n cfs[0] = dur\n continue\n cfs[i] = cfs[i-1]+dur\n\n\n\nstamps = map(int,input().split())\nfor s in stamps:\n print(bisect.bisect_left(cfs, s)+1)\n\n \t\t \t \t \t\t\t \t\t\t\t \t \t\t", "n, m = (int(x) for x in input().split(' '))\n\nmusic = []\nfor _ in range(n):\n x, y = (int(x) for x in input().split(' '))\n music.append(x * y)\n\nmoments = [int(x) for x in input().split(' ')]\n\ndormpointer = 0\nroompointer = 0\ntotalsum = 0\n\nfor l in moments:\n \n while l - totalsum > music[dormpointer]:\n totalsum += music[dormpointer]\n dormpointer += 1\n\n print(dormpointer + 1)\n \n # dormpointer = 2\n # roompointer = 5\n # dorms[2] = 15\n # diff = 16\n \n", "n,m=map(int,input().split())\r\nd=[]\r\npre=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n u=pre+1\r\n v=x*y+u-1\r\n d.append((u,v,i+1))\r\n pre=v\r\n#print(d)\r\nv=list(map(int,input().split()))\r\nj=0\r\nfor i in range(m):\r\n while d[j][1]<v[i]:\r\n j+=1\r\n print(d[j][2])\r\n ", "# n = int(input())\r\nn, m = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n l.append(list(map(int, input().split())))\r\nb = list(map(int, input().split()))\r\na = [0] * n\r\na[0] = l[0][0] * l[0][1]\r\nfor i in range(1, n):\r\n a[i] = a[i - 1] + l[i][0] * l[i][1]\r\n\r\na = [0] + a\r\nindex = 0\r\nfor i in range(m):\r\n x = b[i]\r\n while x > a[index]:\r\n index += 1\r\n print(index)\r\n", "if __name__ == '__main__':\n n, m = input().split(' ')\n n, m = int(n), int(m)\n x = [[int(i) for i in input().split(' ')] for j in range(n)]\n y = [int(i) for i in input().split(' ')]\n y.sort()\n\n t = 0\n index = 0\n r = []\n for i in range(len(x)):\n t += x[i][0] * x[i][1]\n while index < len(y) and t >= y[index]:\n r.append(i + 1)\n index += 1\n\n if index >= len(y):\n break\n\n print('\\n'.join([str(i) for i in r]))\n\t \t\t \t\t \t \t \t \t \t \t\t\t\t \t", "n, m = map(int, input().split())\r\n\r\ntrack = []\r\n\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n track.append (c * t)\r\n \r\nmoment = [int(i) for i in input().split()]\r\ni, j = 0, 0\r\ns = 0\r\n\r\nwhile i < n and j < m:\r\n if moment[j] <= s + track[i]:\r\n print(i + 1)\r\n j += 1\r\n else:\r\n s += track[i]\r\n i += 1\r\n ", "from sys import stdin\r\ndef get_closest_binary(num,l):\r\n\r\n if num > l[-1]:\r\n return len(l)\r\n elif num < l[0]:\r\n return 0\r\n else:\r\n m = 0\r\n ma = len(l)-1\r\n while ma - m > 1:\r\n\r\n if num > l[m+((ma-m)//2)]:\r\n m += ((ma-m)//2)\r\n else:\r\n ma -= ((ma-m)//2)+1\r\n if num > l[ma]:\r\n return ma\r\n else:\r\n return m\r\n\r\n\r\nn, m = map(int, stdin.readline().rstrip().split(\" \"))\r\n\r\ns = [0]*(n+1)\r\n\r\nfor i in range(n):\r\n x, y = map(int, stdin.readline().rstrip().split(\" \"))\r\n s[i+1] = s[i] + x * y\r\nl = list(map(int, stdin.readline().rstrip().split(\" \")))\r\nfor i in l:\r\n print(get_closest_binary(i,s)+1)", "n, m = map(int, input().split())\nv = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n c, t = map(int, input().split())\n v[i] = c*t+v[i-1]\nmi = [int(i) for i in input().split()]\n# print(v)\nfor i in mi:\n l = 1\n r = n+1\n while l < r:\n mid = (l+r)//2;\n # print(mid, l, r)\n if i > v[mid]:\n l = mid+1\n else:\n r = mid\n print(l)\n", "n,m=map(int,input().split())\r\nv=[0]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n v.append(a*b+v[i])\r\na=list(map(int,input().split()))\r\ndel v[0]\r\nfor i in range(m):\r\n l=0\r\n r=len(v)-1\r\n while r-l>1:\r\n x=(r+l)//2\r\n if v[x]<a[i]:\r\n l=x\r\n else:\r\n r=x\r\n if (a[i]>v[l] and a[i]<v[r]) or a[i]==v[r]:\r\n print(r+1)\r\n else:\r\n print(l+1)", "n,m = map(int,input().split())\r\narr = [0]\r\na = 0\r\nfor _ in range(0,n):\r\n c,t = map(int,input().split())\r\n a += c*t\r\n arr.append(a)\r\nmin = list(map(int,input().split()))[:m]\r\ni = 0\r\nans = []\r\nfor j in range(m):\r\n while(min[j]>arr[i]):\r\n i+=1\r\n print(i)", "def main():\n\n music_times = []\n\n n, m = map(int, input().split())\n\n for i in range(n):\n\n c, t = map(int, input().split())\n if i == 0:\n music_times.append(c * t)\n else:\n music_times.append((c * t) + music_times[i-1])\n\n fav_moments = [int(i) for i in input().split(\" \")]\n\n i, j = 0, 0\n\n while j < m and i < n:\n\n if fav_moments[j] <= music_times[i]:\n j += 1\n print(i + 1)\n\n else:\n i += 1\n\n\nmain()\n \t \t \t \t\t \t \t \t \t\t\t\t\t", "n,m=map(int,input().split())\r\na={}\r\nl=0\r\no=[]\r\nfor i in range(n) :\r\n pro,profi=map(int,input().split())\r\n a[l+1]=i+1\r\n o.append(l+1)\r\n l=pro*profi+l\r\newgeniq=list(map(int,input().split()))\r\nl=0\r\nfor i in range(m) :\r\n while l<len(o) and ewgeniq[i]>=o[l] :\r\n l+=1\r\n print(a[o[l-1]])", "from bisect import bisect_left as bs\r\n\r\nn, m = map(int, input().split())\r\n\r\na = [0]\r\nfor i in range(1, n + 1):\r\n c, t = map(int, input().split())\r\n a.append(c * t + a[i - 1])\r\n \r\nv = list(map(int, input().split()))\r\n\r\nprint('\\n'.join([str(bs(a, v[i])) for i in range(m)]))", "from sys import stdin, stdout\r\n\r\ndef c_r(arr, target):\r\n l, r = -1, len(arr)\r\n while l+1 < r:\r\n m = (l+r) // 2\r\n if arr[m] >= target:\r\n r = m\r\n else:\r\n l = m\r\n return r\r\n\r\ndef main():\r\n n, m = map(int, stdin.readline().strip().split())\r\n p_s = []\r\n for i in range(n):\r\n c, t = map(int, stdin.readline().strip().split())\r\n if p_s:\r\n p_s.append(p_s[-1]+c*t)\r\n else:\r\n p_s.append(c*t)\r\n Q = list(map(int, stdin.readline().strip().split()))\r\n outputs = []\r\n for i in Q:\r\n outputs.append(c_r(p_s, i)+1)\r\n for output in outputs:\r\n print(output)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "import bisect as bic\nn, m = map(int, input().split())\nk = [0]\nfor i in range(n):\n c, t = map(int, input().split())\n k.append(c * t + k[-1])\nlm = list(map(int, input().split()))\nfor i in lm:\n print(bic.bisect_left(k, i))\n", "import io\r\nimport math\r\n\r\nnancy, mike = list(map(int, input().split()))\r\narray = []\r\nfor i in range(nancy):\r\n red, blue = list(map(int, input().split()))\r\n array.append(red*blue)\r\ncounter = i = 0\r\nfor j in list(map(int, input().split())):\r\n while(counter<j):\r\n counter += array[i]\r\n i += 1\r\n print(i)", "def search(arr,x,n):\r\n low,high = 0,n-1\r\n if x<=arr[low]:\r\n return 1\r\n while low<high:\r\n mid = (low+high)//2\r\n if x==arr[mid]:\r\n return mid+1\r\n elif abs(low-high)==1:\r\n return high+1\r\n elif x>arr[mid]:\r\n low = mid\r\n elif x<arr[mid]:\r\n high = mid\r\nn,m = list(map(int,input().split()))\r\ntemp = []\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if i==0:\r\n temp.append(a*b)\r\n else:\r\n temp.append(temp[-1]+a*b)\r\nquery = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in query:\r\n find = i\r\n while temp[cnt]<find:\r\n cnt+=1\r\n print(cnt+1)", "def solve(c,k):\r\n x=0\r\n y=len(c)-1\r\n while x<=y:\r\n m=(x+y)//2\r\n if c[m]<k: x=m+1\r\n elif c[m]>k: y=m-1\r\n else: y=m-1\r\n # print(c[m],x,y,k)\r\n return x\r\n\r\na,b=map(int,input().split())\r\nc=[0]\r\nf=0\r\nfor k in range(1,a+1):\r\n d,e=map(int,input().split())\r\n f+=d*e\r\n c+=[f]\r\n# print(c)\r\nd=list(map(int,input().split()))\r\nfor k in d:\r\n print(solve(c,k))", "import bisect\nn,m = map(int,input().split())\ns = [0]\nfor _ in range(n):\n c1,c2 = map(int,input().split())\n s.append(s[-1]+c1*c2)\n#print(s)\np = list(map(int,input().split()))\n#print(p)\nfor i in p:\n print(bisect.bisect_left(s,i))", "n,m=map(int,input().split())\r\nb=[0]\r\nfor i in range(n):\r\n\tci,ti=map(int,input().split())\r\n\tb.append(b[i]+(ci*ti))\r\nq=list(map(int,input().split()))\r\nfor i in range(m):\r\n\tp=q[i]\r\n\tl=0\r\n\tr=n+1\r\n\twhile r-l>1:\r\n\t\td=(r+l)//2\r\n\t\tif b[d]<=p:\r\n\t\t\tl=d\r\n\t\telse:\r\n\t\t\tr=d\r\n\tif b[l]==p:\r\n\t\tprint(l)\r\n\telse:\r\n\t\tprint(l+1)", "n, m = map(int, input().split())\r\nA = []\r\n\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n A.append(c * t)\r\ni = p = 0\r\nfor v in [int(x) for x in input().split()]:\r\n while p < v:\r\n p, i = p + A[i], i + 1\r\n print(i)\r\n", "from bisect import insort, bisect_left\r\nnm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\nr=0\r\nl=[]\r\nli=[]\r\nfor i in range(n):\r\n ct=input().split()\r\n c=int(ct[0])\r\n t=int(ct[1])\r\n l.append(r+c*t)\r\n r=r+c*t\r\nli=list(map(int,input().split()))\r\nfor i in range(len(li)):\r\n k=bisect_left(l,li[i])\r\n print(k+1)\r\n ", "n,l = map(int,input().split())\r\nsongs = []\r\nfor i in range(n+1):\r\n if i==n:\r\n lst = list(map(int,input().split()))\r\n else:\r\n songs.append(list(map(int,input().split())))\r\nz = 0\r\ni = -1\r\nb = 0\r\nwhile i<n and b<l:\r\n if lst[b]>z:\r\n i+=1\r\n z+=songs[i][1]*songs[i][0]\r\n elif lst[b]<=z:\r\n print(i+1)\r\n b+=1", "def read_int():\r\n return int(input())\r\ndef read_ints():\r\n return [int(x) for x in input().split()]\r\n\r\nn, m = read_ints()\r\na = []\r\nlast = 0\r\nfor _ in range(n):\r\n c, t = read_ints()\r\n last += c * t\r\n a.append(last)\r\n\r\ni = 0\r\nfor v in read_ints():\r\n while a[i] < v:\r\n i += 1\r\n print(i + 1)\r\n", "from bisect import bisect_left as pos\r\n\r\nn, m = map(int, input().split())\r\n\r\ntrack = [0]\r\n\r\nfor i in range(1, n + 1):\r\n c, t = map(int, input().split())\r\n track.append(c * t + track[i - 1])\r\n \r\nmoment = map(int, input().split())\r\n\r\nfor i in moment:\r\n print(pos(track, i))\r\n", "n, m = map(int, input().split())\r\nx = list()\r\nx.append(0)\r\nsu = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n y = a * b\r\n su += y\r\n x.append(su)\r\np = list(map(int, input().split()))\r\nfor i in p:\r\n from bisect import bisect_left\r\n print(bisect_left(x, i))\r\n", "import sys\n\ndef dist(x1, y1, x2, y2):\n return abs(x2 - x1) + abs(y2 - y1)\n\n\nn, m = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\nsongs = []\n\nfor i in range(n):\n cur = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\n songs.append(cur)\n\nqueries = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\n \nstart_time = 0 # could be 1 kek\n\nintervals = []\ncur_time = start_time\nfor i in range(0, len(songs)):\n song = songs[i] # times, duration\n times = song[0]\n dur = song[1]\n new_time = cur_time + (times * dur)\n intervals.append(new_time)\n cur_time = new_time\n\n\nqueries = sorted(queries)\n\nidx = 0\nfor q in queries:\n while(q > intervals[idx]):\n idx += 1\n print(idx + 1)", "n,m = map(int,input().split())\r\nS = 0\r\nA = [0]\r\nfor i in range(n):\r\n c,t = map(int,input().split())\r\n S += c*t\r\n A.append(S)\r\n\r\ndef search_index(x, A):\r\n ''' ищет правый индекс максимально близкого и большего числу x'''\r\n l = -1\r\n r = len(A)\r\n while r - l > 1:\r\n m = int((l + r) / 2)\r\n if A[m] < x:\r\n l = m\r\n else:\r\n r = m\r\n if r == len(A):\r\n return False\r\n return r\r\n\r\nB = list(map(int,input().split()))\r\nC = []\r\nfor i in range(len(B)):\r\n C.append(search_index(B[i],A))\r\n\r\nfor i in range(len(C)):\r\n print(C[i])", "n, m = map(int, input().split())\np = []\nfor i in range(n):\n c, t = map(int, input().split())\n p.append(c * t)\nv = list(map(int, input().split()))\no = p[0]\nj = 0\nans = 1\nfor i in range(m):\n while v[i] > o:\n j += 1\n o += p[j]\n ans += 1\n print(ans)", "import bisect\r\nfrom itertools import accumulate\r\nn, m = map(int, input().split())\r\nans = []\r\nfor i in range(n):\r\n c, t = map(int, input().split())\r\n ans.append(c*t)\r\np = []\r\np = list(accumulate(ans))\r\nm = list(map(int, input().split()))\r\nfor i in range(0, len(m)):\r\n print(bisect.bisect_left(p, m[i])+1)\r\n", "n, _ = input().split()\nn = int(n)\n\nsongs = []\nfor i in range(n):\n c, t = input().split()\n songs.append((int(c), int(t)))\n\nmoments = list(map(lambda x: int(x), input().split()))\ni = 1\nnow = songs[i - 1][0] * songs[i - 1][1]\nfor m in moments:\n while(now < m):\n i += 1\n now += (songs[i - 1][0] * songs[i - 1][1])\n print(i)\n \t\t \t\t \t\t\t\t\t\t\t \t \t \t \t\t\t\t\t", "import operator as op\r\nimport itertools as it\r\nimport bisect as bs\r\n\r\n\r\nn, m = map(int, input().split())\r\na = list(it.accumulate([op.mul(*map(int, input().split())) for _ in range(n)]))\r\n\r\nans = []\r\nfor t in map(int, input().split()):\r\n ans.append(str(bs.bisect_left(a, t) + 1))\r\n\r\nprint('\\n'.join(ans))\r\n\r\n\r\n", "n, j = map(int, input().split())\n\nsongs = []\nfor i in range(n):\n c, t = map(int, input().split())\n songs.append(c*t)\n\n\nmoments = map(int, input().split())\n\n\ntime = 0\nsong = 0\nfor m in moments:\n while time < m:\n time += songs[song]\n song += 1\n print(song)\n \n \n \n\n \t \t\t \t\t\t \t \t\t \t", "def f():\r\n n, m = map(int, input().split())\r\n d = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n a, b = map(int, input().split())\r\n d[i] = d[i - 1] + a * b\r\n \r\n t = list(map(int, input().split()))\r\n j = 0\r\n for i in range(1, n + 1):\r\n while t[j] <= d[i]:\r\n t[j] = i\r\n j += 1\r\n if j == m:\r\n print('\\n'.join(str(k) for k in t))\r\n return\r\nf()", "# from dust i have come, dust i will be\r\n\r\nimport bisect\r\n\r\nn, m = map(int, input().split())\r\n\r\nT = [0] * n\r\nfor i in range(n):\r\n t, c = map(int, input().split())\r\n T[i] = t * c\r\n\r\nm = list(map(int, input().split()))\r\n\r\nfor i in range(1, n):\r\n T[i] += T[i - 1]\r\n\r\nfor i in range(len(m)):\r\n i = bisect.bisect_left(T, m[i], 0, n)\r\n print(i+1)", "# list input\ndef linp(): return list(map(int, input().split()))\n\n\n# map input\ndef minp(): return map(int, input().split())\n\n\n# int input\ndef iinp(): return int(input())\n\n\n# no of testcase\ndef test(): return int(input())\n\n\n# normal input\ndef inp(): return input()\n\n\ndef solve():\n # write your solution for one testcase\n n, m = minp()\n time_track = [0]*n\n temp = 0\n for i in range(n):\n c, t = minp()\n temp += c*t\n time_track[i] = temp\n v = linp()\n k = 0\n for i in v:\n while time_track and i > time_track[0]:\n time_track.pop(0)\n k+=1\n print(k+1)\ndef main():\n # for _ in range(test()):\n solve()\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if i == 0:\r\n arr.append([x*y, i+1])\r\n continue\r\n arr.append([arr[-1][0] + x*y, i+1])\r\n \r\nfor i in input().split():\r\n i = int(i)\r\n l, r = 0, len(arr)-1\r\n flag = True\r\n while l <= r:\r\n m = (l + r) // 2\r\n if arr[m][0] == i:\r\n print(arr[m][1])\r\n flag = False\r\n break \r\n if arr[m][0] < i:\r\n l = m + 1 \r\n else:\r\n r = m - 1 \r\n if flag:\r\n print(arr[l][1])", "song = [0]\nn,m = input().split()\nn,m = int(n), int(m)\nfor i in range(1,n+1):\n x,y = input().split()\n x,y = int(x),int(y)\n song.append(song[i-1]+(x*y))\ncount = 0\nx = list(map(int,input().split()))\nfor i in range (m):\n while x[i]>song[count]:\n count = count+1\n count = count-1\n print(count+1)\n\t \t \t \t\t \t \t\t \t\t \t \t\t \t \t", "n,m = map(int,input().split())\r\nsong_change = [0]\r\nfor i in range(n):\r\n prod = 1\r\n for x in map(int,input().split()):\r\n prod*=x\r\n song_change.append(song_change[-1] + prod)\r\nquerry = list(map(int,input().split()))\r\nfor i in range(m):\r\n l = 1\r\n r = n\r\n ans = -1\r\n while l<=r:\r\n mid = l + (r-l)//2\r\n if song_change[mid] < querry[i]:\r\n ans = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n if ans==-1:\r\n print(1)\r\n else:\r\n print(ans+1)", "from bisect import bisect_left\nn, m = map(int, input().split(\" \"))\nans = [0]\nfor i in range(1, n + 1):\n c, t = map(int, input().split(\" \"))\n ans.append(ans[-1] + c * t)\nmom = map(int, input().split(\" \"))\nfor i in mom:\n print(bisect_left(ans, i))", "n, m = map(int, input().split())\r\nslo = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n slo.append(a * b)\r\nspi = list(map(int, input().split()))\r\nans = []\r\ncount = 0\r\ns = 0\r\nfor elem in slo:\r\n if len(spi) == 0:\r\n break\r\n s += elem\r\n count += 1\r\n a = spi[0]\r\n while True:\r\n if s < a:\r\n break\r\n ans.append(str(count))\r\n spi.pop(0)\r\n if len(spi) == 0:\r\n break\r\n a = spi[0]\r\nprint('\\n'.join(ans))\r\n" ]

[ "s = input()\r\nop = '{[(<'\r\ncl = {'{':'}', '[':']', '(':')', '<':'>'}\r\n\r\ncnt = 0\r\nflag = False\r\nfor elem in s:\r\n\r\n if elem in op:\r\n cnt += 1\r\n else:\r\n cnt -= 1\r\n if cnt < 0:\r\n flag = True\r\n break\r\nif cnt != 0 or flag:\r\n print('Impossible')\r\nelse:\r\n last = []\r\n cnt = 0\r\n for elem in s:\r\n if elem in op:\r\n last.append(elem)\r\n else:\r\n curr = last.pop()\r\n if cl[curr] != elem:\r\n cnt += 1\r\n print(cnt)\r\n", "s = input()\r\n\r\nstack = []\r\nanswer = 0\r\ncorrects = ('[]', '{}', '<>', '()')\r\nfor i in s:\r\n if i == '[' or i == '{' or i == '<' or i == '(':\r\n stack.append(i)\r\n else:\r\n if len(stack) == 0:\r\n print('Impossible')\r\n exit()\r\n else:\r\n top = stack.pop()\r\n if top + i not in corrects:\r\n answer += 1\r\n\r\nprint(answer if len(stack) == 0 else 'Impossible')\r\n", "# -*- coding: utf-8 -*-\r\nimport sys\r\n\r\ndef fun():\r\n try:\r\n str = input()\r\n except ValueError:\r\n print('Invalid number')\r\n return\r\n S = {\"}\": \"{\",\")\": \"(\",\">\": \"<\",\"]\":\"[\"}\r\n L = []\r\n ans = 0\r\n for c in str:\r\n if c in S.values():\r\n L.append(c)\r\n pass\r\n else:\r\n if(len(L) >0 ):\r\n ans += 0 if S[c] == L.pop() else 1\r\n else:\r\n ans = -1\r\n break\r\n pass\r\n if( len(L)> 0 or ans <0):\r\n print('Impossible')\r\n else:\r\n print(ans)\r\n pass\r\n\r\nif __name__ == \"__main__\":\r\n fun()\r\n '''\r\n for i,v in enumerate(map(int,input().split())):\r\n print(i,v)\r\n '''", "s = input()\r\nres = 0\r\nc = '<{[('\r\nd = '>}])'\r\ne = []\r\nval = True\r\nfor i in s:\r\n if i in c:\r\n e.append(i)\r\n else:\r\n if not e:\r\n val = False\r\n break\r\n if d.index(i) != c.index(e[-1]):\r\n res += 1\r\n e.pop()\r\nif e:\r\n val = False\r\nif not val:\r\n print(\"Impossible\")\r\nelse:\r\n print(res)\r\n", "s = input()\r\nopen = \"({<[\"\r\nclose = \")}>]\"\r\nclopen = {']': '[', '}': '{', '>': '<', ')': '('}\r\nir2 = 0\r\nir = 0\r\nif len(s) % 2 == 1:\r\n print(\"Impossible\")\r\n exit()\r\nelse:\r\n l = []\r\n for i in range(len(s)):\r\n if s[i] in open:\r\n ir += 1\r\n l.append(s[i])\r\n else:\r\n ir -= 1\r\n if ir == -1:\r\n print(\"Impossible\")\r\n exit()\r\n p = l.pop()\r\n if clopen[s[i]] != p:\r\n ir2 += 1\r\nif ir != 0:\r\n print(\"Impossible\")\r\n exit()\r\nelse:\r\n print(ir2)\r\n", "def check(s):\r\n c=[]\r\n a=0\r\n for i in s:\r\n if i in '([{<':\r\n c.append(i)\r\n else:\r\n if len(c)==0:\r\n return 'Impossible' \r\n if c[-1]=='(' and i==')':\r\n c.pop()\r\n elif c[-1]=='[' and i==']':\r\n c.pop()\r\n elif c[-1]=='{' and i=='}':\r\n c.pop()\r\n elif c[-1]=='<' and i=='>':\r\n c.pop()\r\n else:\r\n a+=1\r\n c.pop()\r\n if len(c)==0:\r\n return a\r\n if len(c)!=0:\r\n return \"Impossible\"\r\n \r\ns=input()\r\nprint(check(s))", "def main():\n s = input()\n open_paren = \"<([{\"\n close = {']': '[', '>': '<', ')': '(', '}': '{'}\n\n stack = []\n ans = 0\n imp = False\n for c in s:\n if c in open_paren:\n stack.append(c)\n else:\n if not stack:\n imp = True\n break\n if close[c] != stack[-1]:\n ans += 1\n\n stack.pop()\n\n imp = imp or len(stack) != 0\n\n print(\"Impossible\" if imp else ans)\n\n\nmain()\n", "s = input()\nopen = {'(', '{', '[', '<'}\nres = 0\nour = []\nfor elem in s:\n if elem in open:\n our.append(elem)\n else:\n if our:\n res += (abs(ord(elem) - ord(our[-1])) > 2)\n our.pop()\n else:\n print('Impossible')\n exit()\nif our:\n print('Impossible')\nelse:\n print(res)", "s = {'}':'{',')':'(',']':'[','>':'<'}\nl = []\nc = 0\nq = input()\nf = 0\nfor i in q:\n if i in '[<{(':\n l.append(i)\n elif len(l)>0:\n if l.pop() != s[i]:\n c += 1\n else:\n f = 1\n break\nif f==1 or len(l)>0:\n print('Impossible')\nelse:\n print(c)\n\t \t \t\t\t \t\t\t\t \t\t\t \t\t \t \t\t\t\t", "import sys\r\n\r\ns = input()\r\n\r\nopens = set(\"([<{\")\r\ncloses = {\"(\": \")\", \"[\": \"]\", \"<\": \">\", \"{\": \"}\"}\r\ncounter = 0\r\nfor c in s:\r\n if c in opens:\r\n counter += 1\r\n else:\r\n counter -= 1\r\n if counter < 0:\r\n print(\"Impossible\")\r\n sys.exit(0)\r\nif counter != 0:\r\n print(\"Impossible\")\r\n sys.exit(0)\r\n\r\nlatest_unmatched = []\r\nmoves = 0\r\nfor c in s:\r\n if c in opens:\r\n latest_unmatched.append(c)\r\n else:\r\n other = latest_unmatched.pop()\r\n if c != closes[other]:\r\n moves += 1\r\nprint(moves)\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ns=input()\r\nn=len(s)\r\nc=0\r\nc1=1\r\nfor i in range(n):\r\n if(s[i] in ['(','<','{','[']):\r\n c+=1\r\n else:\r\n c-=1\r\n if(c<0):\r\n c1=0\r\n break\r\nif(c1==0 or c!=0):\r\n print(\"Impossible\")\r\nelse:\r\n l=[]\r\n c1=1\r\n d={'<':'>','[':']','{':'}','(':')'}\r\n c=0\r\n for i in range(n):\r\n if(s[i] in ['(','<','{','[']):\r\n l.append(s[i])\r\n else:\r\n if(l==[]):\r\n c1=0\r\n break\r\n elif(d[l[-1]]==s[i]):\r\n l.pop()\r\n else:\r\n l.pop()\r\n c+=1\r\n if(c1==0):\r\n print(\"Impossible\")\r\n else:\r\n print(c)", "s=input();c=0;st=[]\r\nfor i in s:\r\n if i in '({[<':st.append(i)\r\n else:\r\n if len(st)==0:\r\n print('Impossible')\r\n exit()\r\n t=st.pop()\r\n if t+i not in '()[]{}<>':c+=1\r\nif len(st)==0:print(c)\r\nelse:print('Impossible')\r\n", "s = input()\r\nstack = []\r\nopen = ['<', '{', '(', '[']\r\nclose = ['>', '}', ')', ']']\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] in open:\r\n stack.append(s[i])\r\n else:\r\n if len(stack) == 0:\r\n print('Impossible')\r\n exit()\r\n head = stack.pop()\r\n k = close.index(s[i])\r\n if head != open[k]:\r\n ans += 1\r\nif len(stack) > 0:\r\n print('Impossible')\r\n exit()\r\nprint(ans)\r\n\r\n", "from collections import deque\n\ns = list(input())\nd = deque()\nr = 0\nfor i in range(len(s)):\n if s[i] in {\"<\",\"{\",\"[\",\"(\"}:\n d.appendleft(s[i])\n else:\n if (len(d)==0):\n print(\"Impossible\")\n exit()\n v=d.popleft()\n if (v==\"[\" and s[i]!=\"]\") or (v==\"{\" and s[i]!=\"}\") or (v==\"<\" and s[i]!=\">\") or (v==\"(\" and s[i]!=\")\"):\n r+=1\nif len(d)==0:\n print(r)\nelse:\n print(\"Impossible\")", "# import math\nfrom collections import Counter, deque, defaultdict\n# from math import *\n\nfrom bisect import bisect_right\n\nMOD = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\ndef is_open(x):\n return x == '<' or x == '{' or x == '[' or x == '('\n\n\ndef is_match(x, y):\n if x == '<':\n return y == '>'\n elif x == '{':\n return y == '}'\n elif x == '[':\n return y == ']'\n else:\n return y == ')'\n\ndef solve():\n S=input()\n change_count = 0\n\n stack = []\n for s in S:\n if not is_open(s) and len(stack) > 0 and is_open(stack[-1]):\n if not is_match(stack[-1], s):\n change_count += 1\n stack.pop()\n else:\n stack.append(s)\n\n # print(stack)\n\n if len(stack) != 0:\n print('Impossible')\n else:\n print(change_count)\n\n\n\n\n\n\n# t = int(input())\nte= 1\nfor num in range(te):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n\n \t \t\t\t\t\t\t\t\t \t \t\t\t\t \t \t\t", "BRACKETS = \"{ }, [ ], < >, ( )\"\r\nopeners = dict()\r\nclosers = dict()\r\nfor opener, closer in map(lambda x: x.split(), BRACKETS.split(\",\")):\r\n openers[opener] = closer\r\n closers[closer] = opener\r\nstack = list()\r\nimpossible = False\r\nres = 0\r\nfor char in input():\r\n if char in openers:\r\n stack.append(char)\r\n else:\r\n if not stack:\r\n impossible = True\r\n break\r\n elif stack[-1] != closers[char]:\r\n res += 1\r\n stack.pop()\r\nimpossible |= len(stack) > 0\r\nif impossible:\r\n print(\"Impossible\")\r\nelse:\r\n print(res)\r\n", "s = list(input())\r\nd = {'(': ')', '[': ']', '<': '>', '{': '}'}\r\nstack = []\r\nans = 0\r\nc = 0\r\nfor i in s:\r\n if i in d.keys():\r\n stack.append(i)\r\n c += 1\r\n else:\r\n c -= 1\r\n if c < 0:\r\n print('Impossible')\r\n exit()\r\n b = stack.pop()\r\n if i != d[b]:\r\n ans += 1\r\nif c==0:\r\n print(ans)\r\nelse:\r\n print(\"Impossible\")", "def opposto(s):\r\n if s == \")\":\r\n return \"(\"\r\n elif s == \"]\":\r\n return \"[\"\r\n elif s == \"}\":\r\n return \"{\"\r\n else:\r\n return \"<\"\r\n\r\ndef f(s):\r\n n = [0] * 10**6\r\n checker = 0\r\n cont = 0\r\n pos = 0\r\n for c in s:\r\n if c in ['(', '[', '{', '<']:\r\n n[checker] = c\r\n checker += 1\r\n pos += 1\r\n else:\r\n if checker == 0:\r\n return \"Impossible\"\r\n elif n[checker - 1] == opposto(c):\r\n checker -= 1\r\n else:\r\n checker -= 1\r\n cont += 1\r\n if pos == len(s) - pos:\r\n return cont\r\n else:\r\n return \"Impossible\"\r\ns = str(input())\r\nprint(f(s))", "a=input()\r\ns=[]\r\nreplacements=0\r\nflag=0\r\nfor i in range(len(a)):\r\n if a[i] in '({[<':\r\n s.append(a[i])\r\n else:\r\n if len(s)==0 :\r\n flag=1\r\n break\r\n top=s.pop()\r\n if a[i]=='>' and top!='<':\r\n replacements+=1\r\n if a[i]==')' and top!='(':\r\n replacements+=1\r\n if a[i]==']' and top!='[':\r\n replacements+=1\r\n if a[i]=='}' and top!='{':\r\n replacements+=1\r\nif len(s)>0 or flag==1:\r\n print(\"Impossible\")\r\nelse:\r\n print(replacements)", "stack = []\r\n\r\ns = input()\r\n\r\nans = 0\r\nfor c in s:\r\n if c in \"({[<\":\r\n stack.append(c)\r\n else:\r\n if not stack:\r\n print(\"Impossible\")\r\n break\r\n p = stack.pop()\r\n if p == '(' and c == ')' or \\\r\n p == '{' and c == '}' or \\\r\n p == '[' and c == ']' or \\\r\n p == '<' and c == '>':\r\n continue\r\n ans += 1\r\nelse:\r\n if stack:\r\n print(\"Impossible\")\r\n else:\r\n print(ans)\r\n \r\n \r\n", "import sys\r\ns1=input()\r\ndef ty(s):\r\n if(s=='{' or s=='[' or s=='<' or s=='('):\r\n return 0\r\n else:\r\n return 1\r\ndef cmo(s,ss):\r\n if((s=='{'and ss=='}') or (s=='('and ss==')') or (s=='['and ss==']') or (s=='<'and ss=='>')):\r\n return 0\r\n else:\r\n return 1\r\n \r\nst=[]\r\nrep=0\r\nfor i in range(len(s1)):\r\n if(len(st)==0 or ty(s1[i])==0):\r\n st.append(s1[i])\r\n elif(ty(st[len(st)-1])==0):\r\n if(cmo(st[len(st)-1],s1[i])==1):\r\n rep+=1\r\n st.pop()\r\n else:\r\n break\r\nif(len(st)==0):\r\n print(rep)\r\nelse:\r\n print(\"Impossible\")", "s = input()\r\nstk = []\r\nans = 0\r\nfor c in s:\r\n if c in ['(' , '{' , '<' , '[']:\r\n stk.append(c)\r\n else:\r\n if not stk:\r\n print('Impossible')\r\n exit(0)\r\n if c == ']':\r\n if stk[-1] != '[':\r\n ans += 1 \r\n stk.pop()\r\n elif c == '>':\r\n if stk[-1] != '<':\r\n ans += 1\r\n stk.pop()\r\n elif c == '}':\r\n if stk[-1] != '{':\r\n ans += 1\r\n stk.pop()\r\n else:\r\n if stk[-1] != '(':\r\n ans += 1\r\n stk.pop()\r\nif stk:\r\n print('Impossible')\r\nelse:\r\n print(ans)\r\n \r\n", "def p1(s):\n stack=[]\n n=len(s)\n dic = {')': '(', '}': '{', ']': '[', '>': '<'}\n cnt=0\n for x in s:\n if x not in dic:\n stack.append(x)\n else:\n if not stack:\n return 'Impossible'\n elif dic[x]!=stack.pop():\n cnt+=1\n else:\n pass\n if not stack:\n return cnt\n else:\n return 'Impossible'\n\nif __name__ == '__main__':\n s = list(input())\n print(p1(s))\n\n\n\n\n\n \t\t\t\t \t \t \t \t \t \t\t \t", "k, s = 0, []\r\nfor q in input():\r\n i = '[{<(]}>)'.find(q)\r\n if i > 3:\r\n if not s:\r\n s = 1\r\n break\r\n if s.pop() != i - 4: k += 1\r\n else: s += [i]\r\nprint('Impossible' if s else k)", "import sys\r\ns = input()\r\nstack = []\r\npiar = {'{' : '}', '(' : ')', '<' : '>', '[':']'}\r\nans = 0\r\nfor ch in s:\r\n if ch in piar.keys():\r\n stack.append(ch)\r\n else:\r\n if len(stack) == 0:\r\n print(\"Impossible\")\r\n sys.exit()\r\n if piar[stack.pop()] != ch:\r\n ans+=1\r\nif len(stack) != 0:\r\n print(\"Impossible\")\r\n sys.exit() \r\nprint(ans)\r\n", "BRACKETS = {\"<\": \">\", \"{\": \"}\", \"[\": \"]\", \"(\": \")\"}\ntotal = 0\nstack = []\nfor x in input():\n if x in BRACKETS:\n stack.append(x)\n elif not stack:\n print(\"Impossible\")\n exit()\n elif x != BRACKETS[stack.pop()]:\n total += 1\nprint(total if not stack else \"Impossible\")\n", "stack = []\r\ncount = 0\r\na = input()\r\nslovar = {'}': '{', ')':'(', ']':'[', '>':'<'}\r\nfor i in a:\r\n if i in '[({<':\r\n stack.append(i)\r\n else:\r\n if not stack:\r\n print(\"Impossible\")\r\n exit()\r\n else:\r\n if slovar.get(i) != stack.pop():\r\n count += 1\r\nif stack:\r\n print(\"Impossible\")\r\nelse:\r\n print(count)\r\n ", "s = input()\r\ns1 = []\r\n\r\nfor i in s:\r\n if i == \"(\":\r\n s1.append(1)\r\n elif i == \"[\":\r\n s1.append(2)\r\n elif i == \"{\":\r\n s1.append(3)\r\n elif i == \"<\":\r\n s1.append(4)\r\n\r\n elif i == \")\":\r\n s1.append(-1)\r\n elif i == \"]\":\r\n s1.append(-2)\r\n elif i == \"}\":\r\n s1.append(-3)\r\n else:\r\n s1.append(-4)\r\n\r\n\r\nm = []\r\nc =0\r\nfor char in s1:\r\n if len(m)>0:\r\n if m[-1]>0:\r\n if m[-1]==-char:\r\n m.pop()\r\n elif char<0 :\r\n m.pop()\r\n c+=1\r\n else:\r\n m.append(char)\r\n else:\r\n m.append(char)\r\n else:\r\n m.append(char)\r\n\r\nif len(m)>0:\r\n print(\"Impossible\")\r\nelse:\r\n print(c)", "s = list(input())\r\ndef isopen(c):\r\n return c == \"<\" or c == \"{\" or c == \"[\" or c == \"(\";\r\ndef match(a, b):\r\n return a == \"<\" and b == \">\" or a == \"{\" and b == \"}\" or a == \"[\" and b == \"]\" or a == \"(\" and b == \")\"\r\ndef isRbs():\r\n br = []\r\n if isopen(s[0]) == False:\r\n print(\"Impossible\")\r\n return False\r\n count = 0\r\n for c in s:\r\n open = isopen(c)\r\n if open == True:\r\n br.append(c)\r\n elif len(br) > 0 and open == False:\r\n b = br.pop()\r\n if match(b, c) == False:\r\n count += 1\r\n if len(br) == 0:\r\n print(count)\r\n else:\r\n print(\"Impossible\")\r\n\r\nif len(s) % 2 != 0:\r\n print(\"Impossible\")\r\nelse:\r\n isRbs()", "def solution(s):\r\n st = []\r\n ans = 0\r\n for i, j in enumerate(s):\r\n if j in open:\r\n st.append((i,j))\r\n if j in close:\r\n if not st:\r\n return (\"Impossible\")\r\n q,w = st.pop()\r\n if close.index(j) != open.index(w):\r\n ans += 1\r\n if st:\r\n return (\"Impossible\")\r\n return ans\r\ns=str(input())\r\nopen = ['(', '{', '<', '[']\r\nclose = [')', '}', '>', ']']\r\nprint(solution(s))", "s = input()\r\n\r\nstack = []\r\nres = 0\r\nfor c in s:\r\n if c in '(<[{':\r\n stack.append(c)\r\n else:\r\n if not stack:\r\n print('Impossible')\r\n break\r\n last = stack.pop()\r\n if last + c not in ('[]', '()', '<>', '{}'):\r\n res += 1\r\nelse:\r\n if stack:\r\n print('Impossible')\r\n else:\r\n print(res)\r\n", "S = input()\r\n\r\ndef is_open(x):\r\n return x == '<' or x == '{' or x == '[' or x == '('\r\n\r\ndef is_match(x, y):\r\n if x == '<':\r\n return y == '>'\r\n elif x == '{':\r\n return y == '}'\r\n elif x == '[':\r\n return y == ']'\r\n else:\r\n return y == ')'\r\n \r\n\r\nchange_count = 0\r\n \r\nstack = []\r\nfor s in S:\r\n if not is_open(s) and len(stack) > 0 and is_open(stack[-1]):\r\n if not is_match(stack[-1], s):\r\n change_count+= 1\r\n stack.pop()\r\n else:\r\n stack.append(s)\r\n\r\n # print(stack)\r\n\r\nif len(stack) != 0:\r\n print('Impossible')\r\nelse:\r\n print(change_count)", "s = input()\nstk = list()\nop = ['<','{','(','[']\ncl = ['>','}',')',']']\npair = {'<':'>','[':']','{':'}','(':')'}\n\ncount = 0\nfor i in s:\n if i in op:\n stk.append(i)\n \n elif i in cl:\n if stk:\n a = stk[-1]\n if i==pair[a]:\n stk.pop()\n else:\n count+=1\n #print(stk,count)\n #count+=1\n stk.pop()\n else:\n stk.append(i)\n break\n#print(stk,len(stk))\nif len(stk)!=0:\n print('Impossible')\nelse:\n print(count)\n \n \t \t\t\t\t \t\t \t \t \t", "string = input()\r\n\r\nop = \"([{<\"\r\ncl = \")]}>\"\r\n\r\nopened = []\r\nret = 0\r\n\r\nfor char in string:\r\n if char in op:\r\n opened.append(char)\r\n else:\r\n if len(opened) == 0:\r\n print(\"Impossible\")\r\n exit(0)\r\n if cl.find(char) != op.find(opened[-1]):\r\n ret += 1\r\n opened.pop()\r\n \r\nif len(opened) > 0:\r\n print(\"Impossible\")\r\nelse:\r\n print(ret)\r\n", "s=input()\r\nst=[]\r\nop='{[(<'\r\ncl=['{}', '[]', '()', '<>']\r\nimp = 'Impossible'\r\nans=0\r\nfor i in s:\r\n if i in op:\r\n st.append(i)\r\n else:\r\n if not st:\r\n print(imp)\r\n exit()\r\n else:\r\n if st[-1]+i not in cl:\r\n ans += 1\r\n st.pop()\r\nif not st:\r\n print(ans)\r\nelse:\r\n print(imp)", "\r\ndi = {')':'(', '>':'<', ']':'[', '}':'{'}\r\nstack = []\r\ns = list(input())\r\nflag = 0\r\nc = 0\r\nfor i in s: \r\n if i in ['(','<','[','{']: \r\n stack.append(i)\r\n elif len(stack)!= 0 :\r\n x = stack.pop()\r\n if x != di[i]:\r\n c+=1\r\n else :\r\n stack = [0]\r\n break\r\nif len(stack)==0:\r\n print(c)\r\nelse:\r\n print(\"Impossible\")", "st = input()\ncnt = 0 \na=[]\ndi = {')':'(', '>':'<', ']':'[', '}':'{'}\nfor i in st:\n if i in ['(','<','[','{']:\n a.append(i)\n elif a!=[]:\n x=a.pop()\n if x != di[i]:\n cnt+=1\n else:\n a=[-1]\n break\nif a==[]:\n print(cnt)\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 \t", "a=input()\r\nb=0\r\nc='([{<'\r\nd=')]}>'\r\ne=[]\r\nf=False\r\nfor i in a:\r\n if i in c:e+=[i]\r\n else:\r\n if not e:\r\n print('Impossible')\r\n f=True\r\n break\r\n if d.index(i)!=c.index(e[-1]):b+=1\r\n e.pop()\r\nif e:print('Impossible')\r\nelif not f:print(b)\r\n", "try:\r\n def ad(expr): \r\n stack = [] \r\n l=0\r\n for char in expr: \r\n if char in [\"(\", \"{\", \"[\",\"<\"]: \r\n stack.append(char) \r\n else: \r\n if not stack: \r\n return 'Impossible'\r\n current_char = stack.pop() \r\n if current_char == '(': \r\n if char != \")\" and char=='}' or char==']' or char=='>': \r\n l+=1\r\n if current_char == '{': \r\n if char != \"}\" and char==')' or char==']' or char=='>': \r\n l+=1\r\n if current_char == '[': \r\n if char != \"]\" and char=='}' or char==')' or char=='>': \r\n l+=1\r\n if current_char == '<': \r\n if char != \">\" and char=='}' or char==')' or char==']': \r\n l+=1\r\n \r\n \r\n if stack: \r\n return 'Impossible'\r\n return l\r\n \r\n \r\n s=input()\r\n print(ad(s))\r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "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\nn=input()\r\na=['[','<','{','(',']','>','}',')']\r\nk=0\r\ns=[]\r\nfor i in range(len(n)):\r\n\tif a.index(n[i])> 3:\r\n\t\tif not s:\r\n\t\t\ts=1\r\n\t\t\tbreak\r\n\t\tif s.pop()!= a.index(n[i]) -4:\r\n\t\t\tk+=1\r\n\telse:\r\n\t\ts+=[a.index(n[i])]\r\n\r\nif s:\r\n\tprint('Impossible')\r\nelse:\r\n\tprint(k)\r\n", "def solve():\n S = input()\n\n P = {\n '>': '<',\n ']': '[',\n ')': '(',\n '}': '{',\n }\n\n stack = []\n n = 0\n ans = 0\n for i, c in enumerate(S):\n if c in '<[{(':\n n += 1\n stack.append(c)\n else:\n n -= 1\n if len(stack) == 0:\n print('Impossible')\n return\n x = stack.pop()\n if x != P[c]:\n ans += 1\n\n if n != 0:\n print('Impossible')\n return\n\n print(ans)\n\n\nif __name__ == '__main__':\n solve()\n", "st = input()\r\ncnt = 0 \r\na=[]\r\ndi = {')':'(', '>':'<', ']':'[', '}':'{'}\r\nfor i in st:\r\n if i in ['(','<','[','{']:\r\n a.append(i)\r\n elif a!=[]:\r\n x=a.pop()\r\n if x != di[i]:\r\n cnt+=1\r\n else:\r\n a=[-1]\r\n break\r\nif a==[]:\r\n print(cnt)\r\nelse:\r\n print(\"Impossible\")", "import sys\n\nINF = 10 ** 18 + 3\n\n\ndef main():\n opening = \"<{[(\"\n closing = \">}])\"\n s = input()\n stack = []\n res = 0\n for i, sym in enumerate(s):\n if sym in opening:\n kind = opening.find(sym)\n stack.append(kind)\n else:\n kind = closing.find(sym)\n if not stack:\n res = -1\n break\n if stack[-1] != kind:\n res += 1\n del stack[-1]\n\n print(\"Impossible\" if res == -1 or stack else res)\n\n\ndef set_input(file):\n global input\n input = lambda: file.readline().rstrip()\n\n\ndef set_output(file):\n global print\n lprint = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return lprint(*args, **kwargs)\n\n\nif __name__ == '__main__':\n is_mine = \"MINE\" in sys.argv\n set_input(open(\"input.txt\", \"r\") if is_mine else sys.stdin)\n set_output(sys.stdout if is_mine else sys.stdout)\n main()\n", "s=input()\r\ndef count_replacements(s):\r\n stack = []\r\n replacements = 0\r\n for c in s:\r\n if c in \"<{[(\":\r\n stack.append(c)\r\n elif c in \">}])\":\r\n if not stack:\r\n return \"Impossible\"\r\n opening = stack.pop()\r\n if c == \">\" and opening == \"<\" or c == \"}\" and opening == \"{\" or c == \"]\" and opening == \"[\" or c == \")\" and opening == \"(\":\r\n pass\r\n else:\r\n replacements += 1\r\n if stack:\r\n return \"Impossible\"\r\n return replacements\r\nprint(count_replacements(s))", "s = input()\r\nflag = 0\r\nstack = []\r\nop = [\"<\",\"{\",\"[\",\"(\"]\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i] in op:\r\n flag+=1\r\n else:\r\n flag-=1\r\n if flag<0:\r\n print(\"Impossible\")\r\n break\r\n if s[i] in op:\r\n stack.append(s[i])\r\n elif s[i]==\">\" and stack.pop()!=\"<\":\r\n ans += 1\r\n elif s[i]==\"}\" and stack.pop()!=\"{\":\r\n ans += 1\r\n elif s[i]==\"]\" and stack.pop()!=\"[\":\r\n ans += 1\r\n elif s[i]==\")\" and stack.pop()!=\"(\":\r\n ans += 1\r\nelse:\r\n if flag!=0:\r\n print('Impossible')\r\n else:\r\n print(ans)", "s = input().strip()\nbraces = {'<' : '>',\n '>' : '<',\n '{' : '}',\n '}' : '{',\n '[' : ']',\n ']' : '[',\n '(' : ')',\n ')' : '('}\n\nstack = []\nanswer = 0\n\nfor char in s:\n if char in \"(<{[\":\n stack.append(char)\n elif char in \")>}]\":\n if not stack:\n print('Impossible')\n exit()\n lastBrace = stack.pop()\n if char != braces[lastBrace]:\n answer += 1\n\nif not stack:\n print(answer)\nelse:\n print(\"Impossible\")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound)\r\n\r\nfor _ in range(1):#int(input())):\r\n s = input().strip()\r\n l = []\r\n ans, flag = 0, 0\r\n for i in s:\r\n if (i == \"(\" or i == \"{\" or i == \"[\" or i == \"<\"):\r\n l.append(i)\r\n else:\r\n if (len(l) == 0):\r\n print(\"Impossible\")\r\n flag = 1\r\n break\r\n else:\r\n x = l.pop()\r\n if ((i == \")\" and x != \"(\") or (i == \"]\" and x != \"[\") or (i == \"}\" and x != \"{\") or (i == \">\" and x != \"<\")):\r\n ans += 1\r\n if (len(l) == 0 and flag == 0):\r\n print(ans)\r\n elif(flag != 1):\r\n print(\"Impossible\")", "#!/usr/bin/env python3\n\nimport sys\n\ns = input()\nOPENING = ('<', '{', '[', '(')\nCLOSING = ('>', '}', ']', ')')\nresult = 0\nstack = []\n\nfor c in s:\n if c in OPENING:\n stack.append(c)\n else:\n if stack:\n last_br = stack.pop()\n if c != CLOSING[OPENING.index(last_br)]:\n result += 1\n else:\n print(\"Impossible\")\n sys.exit(0)\nprint(\"Impossible\" if stack else result)\n", "d = {\"]\":\"[\",\")\":\"(\",\"}\":\"{\",\">\":\"<\"}\r\nstack = []\r\ns = input()\r\nx = 0\r\nfor c in s:\r\n if c in \"[{(<\":\r\n stack.append(c)\r\n else:\r\n try:\r\n if stack[-1] != d[c]:\r\n x+=1\r\n stack.pop()\r\n except:\r\n print(\"Impossible\")\r\n quit()\r\nif len(stack) == 0:\r\n print(x)\r\nelse:\r\n print(\"Impossible\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nc = 0\r\nd = []\r\nx = 0\r\nq = {'[':']', '{':'}', '<':'>', '(':')'}\r\nfor i in s:\r\n if i in ['[', '{', '<', '(']:\r\n c += 1\r\n d.append(i)\r\n else:\r\n c -= 1\r\n if c >= 0:\r\n a = d.pop()\r\n if i == q[a]:\r\n x += 1\r\n if c < 0:\r\n print('Impossible')\r\n exit(0)\r\nif c > 0:\r\n print('Impossible')\r\n exit(0)\r\n\r\nprint(len(s)//2 - x)", "s = input()\r\na = []\r\nmp = {\"}\":\"{\",\r\n \"]\":\"[\",\r\n \")\":\"(\",\r\n \">\":\"<\"}\r\ndiff=0\r\nfor i in s:\r\n if i in \"{<[(\":\r\n a.append(i)\r\n else:\r\n if a==[]:\r\n a=1\r\n break\r\n else:\r\n diff+=(mp[i]!=a.pop())\r\nprint(\"Impossible\" if a else diff)", "word = input()\n\nBRACKETS = [\n ('<', '>'),\n ('{', '}'),\n ('[', ']'),\n ('(', ')'),\n]\n\nOPENING = [b[0] for b in BRACKETS]\n\nMATCH = dict(BRACKETS)\n\nIMPOSSIBLE = 'Impossible'\n\ndef is_opening(w):\n return w in OPENING\n\ndef same_kind(wo, wc):\n return MATCH[wo] == wc\n\ndef solve(word):\n temp = []\n result = 0\n for w in word:\n if is_opening(w):\n temp.append(w)\n else:\n if len(temp) == 0:\n return IMPOSSIBLE\n wo = temp.pop()\n if not is_opening(wo):\n return IMPOSSIBLE\n if not same_kind(wo, w):\n result += 1\n if len(temp) != 0:\n return IMPOSSIBLE\n return result\n \nprint(solve(word))\n", "s = list(input())\r\nd = {'(': ')', '[': ']', '<': '>', '{': '}'}\r\nstack = []\r\ncnt = 0\r\nc = 0\r\nfor elem in s:\r\n if elem in d.keys():\r\n stack.append(elem)\r\n c = c + 1\r\n else:\r\n c = c-1\r\n if c<0:\r\n print('Impossible')\r\n exit()\r\n lb = stack.pop()\r\n if elem != d[lb]:\r\n cnt += 1\r\nif c==0:\r\n print(cnt)\r\nelse:\r\n print(\"Impossible\")", "S = input()\r\nN = len(S)\r\n\r\nlt = {'[', '(', '{', '<'}\r\nrt = {']', ')', '}', '>'}\r\n\r\nstack = []\r\nres = 0\r\n\r\nfor i in range(N):\r\n if S[i] in lt:\r\n stack.append(i)\r\n else:\r\n if not stack:\r\n print('Impossible')\r\n break\r\n else:\r\n c = stack.pop()\r\n if S[c] + S[i] not in {'[]', '()', '{}', '<>'}:\r\n res += 1\r\nelse:\r\n if not stack:\r\n print(res)\r\n else:\r\n print('Impossible')", "def regBracket(brackets):\n b_dict = {'[':']', '(':')', '<':'>', '{':'}'}\n b_stack = list()\n changes = 0\n for i in range(len(brackets)):\n curr = brackets[i]\n if curr in b_dict:\n b_stack.append(curr)\n elif len(b_stack) == 0:\n return \"Impossible\"\n elif b_dict[b_stack[-1]] == curr:\n b_stack.pop()\n else:\n b_stack.pop()\n changes += 1\n if len(b_stack) == 0:\n return changes\n return \"Impossible\"\nbrackets = input()\nprint(regBracket(brackets))\n \t\t \t\t \t\t\t\t \t \t \t \t \t\t\t", "s = input()\nn = len(s)\nop = {'<': 0, '{': 1, '[': 2, '(': 3}\ncl = {'>': 0, '}': 1, ']': 2, ')': 3}\n\nstack = []\nflag = True\nswaps = 0\nfor i in range(n):\n if s[i] in op:\n stack.append(s[i])\n else:\n if stack:\n if op[stack.pop()] != cl[s[i]]:\n swaps += 1\n else:\n flag = False\n break\n\nif len(stack) != 0:\n flag = False\n\nprint(swaps) if flag else print('Impossible')\n", "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\ndef solve(s):\r\n mp=dict('<> {} [] ()'.split())\r\n ans=0\r\n stk=[]\r\n for c in s:\r\n if c in mp:\r\n stk.append(mp[c])\r\n else:\r\n if not stk:\r\n return -1\r\n if stk[-1]!=c:\r\n ans+=1\r\n stk.pop()\r\n if stk:\r\n return -1\r\n return ans\r\n\r\ns=rl()\r\nans=solve(s)\r\nif ans==-1:\r\n print('Impossible')\r\nelse:\r\n print(ans)\r\n", "s = list(input())\r\nx = list(\"<>{}[]()\")\r\nl = [0] * 4\r\nd = {}\r\nk = 0\r\no, c = 0, 0\r\nf = 1\r\nans = 0\r\nfor t in s:\r\n y = x.index(t)\r\n yy = y // 2\r\n if y % 2 == 0:\r\n if f:\r\n k += 1\r\n o += 1\r\n d[k] = yy\r\n f = 1\r\n else:\r\n if not f:\r\n k -= 1\r\n if k <= 0:\r\n print(\"Impossible\")\r\n exit()\r\n c += 1\r\n f = 0\r\n if not d[k] == yy:\r\n ans += 1\r\nprint(ans if o == c else \"Impossible\")", "\n\ndef stacks(brackets):\n opening = ['[', '{', '(', '<']\n closing = ['}', '{', '(', '<']\n stack = []\n changes = 0\n for b in brackets:\n if b in opening:\n stack.append(b)\n else:\n if len(stack) == 0:\n return -1\n last_brackets = stack.pop()\n if b == ']':\n if last_brackets != '[':\n changes += 1\n elif b == '}':\n if last_brackets != '{':\n changes += 1\n elif b == ')':\n if last_brackets != '(':\n changes += 1\n elif b == '>':\n if last_brackets != '<':\n changes += 1\n else:\n return -1\n if stack:\n return -1\n else:\n return changes\n\n\nif __name__ == \"__main__\":\n _in = input()\n brackets = []\n for b in _in:\n brackets.append(str(b))\n v = stacks(brackets)\n if v == -1:\n print(\"Impossible\")\n else:\n print(v)\n\n", "b = input()\r\na = []\r\n\r\nidx=0\r\nflag = 0\r\nfor char in b:\r\n if char in ['{','(','[','<']:\r\n a.append(char)\r\n elif (len(a)!=0) and ((char==']' and a[-1]=='[') or (char=='}' and a[-1]=='{') or (char==')' and a[-1]=='(') or (char=='>' and a[-1]=='<')):\r\n s = a.pop()\r\n elif len(a)!=0 and char in ['}',')',']','>']:\r\n idx+=1\r\n a.pop()\r\n else:\r\n flag = 1\r\n break\r\nif len(a)==0 and flag==0:\r\n print(idx)\r\nelse:\r\n print('Impossible')", "d = {\r\n '(': ')',\r\n '[': ']',\r\n '{': '}',\r\n '<': '>'\r\n}\r\nst, k = [], 0\r\nfor i in input():\r\n if i in d:\r\n st.append(i)\r\n elif st:\r\n if d[st[-1]] != i:\r\n k += 1\r\n st.pop()\r\n else:\r\n print('Impossible')\r\n exit()\r\nif st:\r\n print('Impossible')\r\n exit()\r\nprint(k)\r\n", "s = input()\nleft, ans = list(), 0\ndef type(ch):\n if ch in \"<>\": return 0\n if ch in \"{}\": return 1\n if ch in \"[]\": return 2\n if ch in \"()\": return 3\nfor ch in s:\n if ch in \"<{[(\": left.append(ch)\n else:\n if len(left) == 0:\n print('Impossible')\n exit(0)\n ch_left = left.pop()\n if type(ch) != type(ch_left):\n ans += 1\nprint(ans if len(left) == 0 else \"Impossible\")\n", "s = input()\nn = len(s)\nbr = {'<': '>', '{': '}', '[': ']', '(': ')'}\n\nstack = []\nflag = True\nswaps = 0\nfor i in range(n):\n if s[i] in br:\n stack.append(s[i])\n else:\n if stack:\n if br[stack.pop()] != s[i]:\n swaps += 1\n else:\n flag = False\n break\n\nif len(stack) != 0:\n flag = False\n\nprint(swaps) if flag else print('Impossible')\n", "bracket = input()\r\nstack = []\r\nbracketType = {\r\n\t'[': (0, ']'),\r\n\t'(': (0, ')'),\r\n\t'<': (0, '>'),\r\n\t'{': (0, '}'),\r\n\t']': (1,),\r\n\t')': (1,),\r\n\t'>': (1,),\r\n\t'}': (1,)\r\n}\r\nres = 0\r\n\r\nfor b in bracket:\r\n\tif bracketType.get(b) == None:\r\n\t break\r\n\telif bracketType.get(b)[0] == 0:\r\n\t\tstack.append(b)\r\n\telif bracketType.get(b)[0] == 1:\r\n\t\tif len(stack) == 0:\r\n\t\t\tres = 'Impossible'\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif b != bracketType[stack.pop()][1]:\r\n\t\t\t\tres += 1\r\n\r\nif len(stack):\r\n\tprint('Impossible')\r\nelse:\r\n\tprint(res)", "s=input()\r\nrem=[]\r\nans=0\r\nfor i in s:\r\n if i in '[({<':\r\n rem.append(i)\r\n else:\r\n if rem:\r\n j=rem.pop()\r\n if j+i in ['[]','{}','()','<>']:\r\n pass\r\n else:\r\n ans+=1\r\n else:\r\n print('Impossible')\r\n exit()\r\nif rem:\r\n print('Impossible')\r\nelse:\r\n print(ans)", "s = [i for i in input().rstrip()]\r\nd = {\"{\": \"}\", \"[\": \"]\", \"<\": \">\", \"(\": \")\"}\r\n\r\ndef solve(s):\r\n ans, stack = 0, []\r\n for x in s:\r\n if x in d:\r\n stack += [x]\r\n else:\r\n if not stack or stack[-1] not in d: return \"Impossible\"\r\n if d[stack[-1]] != x:\r\n ans += 1\r\n stack.pop()\r\n return ans if not stack else \"Impossible\"\r\n\r\nprint(solve(s))", "s = input()\r\nopen = '<', '(', '[', '{'\r\nclose = '>', ')', ']', '}'\r\nresp = {close[i]: open[i] for i in (0, 1, 2, 3)}\r\ncnt = 0\r\nst = []\r\nflag = True\r\nfor c in s:\r\n if c in open:\r\n st.append(c)\r\n elif st and st[-1] == resp[c]:\r\n st.pop()\r\n elif st:\r\n st.pop()\r\n cnt += 1\r\n else:\r\n flag = False\r\n break\r\nif st: flag = False\r\nprint(cnt if flag else 'Impossible')\r\n \r\n\r\n", "import io, os\r\ninput = io.StringIO(os.read(0, os.fstat(0).st_size).decode()).readline\r\n\r\nstack = []\r\nc=0\r\nopts = {'(':0,')':1,'<':2,'>':3,'[':4,']':5,'{':6,'}':7}\r\nfor s in input():\r\n\tif s not in opts:break\r\n\tv = opts[s]\r\n\tif v&1:\r\n\t\tif not stack:\r\n\t\t\tprint(\"Impossible\")\r\n\t\t\texit()\r\n\t\tx = stack.pop()\r\n\t\tif x != v: c+=1\r\n\telse:\r\n\t\tstack.append(v+1)\r\nif stack:\r\n\tprint(\"Impossible\")\r\n\texit()\r\nprint(c)\r\n", "l=[]\nc = 0\nfor i in input():\n if i in \"[<{(\":\n l.append(i)\n elif len(l) > 0:\n if l.pop() != {'}':'{', ')':'(', ']':'[', '>':'<'}[i]:\n c += 1\n else:\n print(\"Impossible\")\n break\nelse:\n if (len(l) > 0):\n print(\"Impossible\")\n else:\n print(c)\n\t \t\t \t\t \t \t \t\t\t\t \t\t\t\t\t \t\t\t\t\t", "n=input()\r\nres=[]\r\ncnt=0\r\nfor i in n:\r\n if i in '(<[{':res.append(i)\r\n else:\r\n if not res:print('Impossible');break\r\n l=res.pop()\r\n if l+i not in ('[]', '()', '<>', '{}'):cnt+=1\r\nelse:\r\n if res:print('Impossible')\r\n else:print(cnt)\r\n\r\n\r\n# a = input()\r\n# l = []\r\n# output = 0\r\n# sl = ('[]', '{}', '<>', '()')\r\n# for i in a:\r\n# \tif i == '[' or i == '{' or i == '<' or i == '(':l.append(i)\r\n# \telse:\r\n# \t\tif len(l) == 0:\r\n# \t\t\tprint(\"Impossible\")\r\n# \t\t\texit()\r\n# \t\telse:\r\n# \t\t\ttop = l.pop()\r\n# \t\t\tif top + i not in sl:\r\n# \t\t\t\toutput += 1\r\n# if len(l) == 0:print(output)\r\n# else:print(\"Impossible\")\r\n\r\n", "s = input()\r\narr = []\r\nl = len(s)\r\nflag = False\r\ncnt = 0\r\nopen = ['{','[','<','(']\r\nclose = ['}',']','>',')']\r\ndic = {'{':'}','[':']','<':'>','(':')'}\r\nfor i in range(l):\r\n if s[i] in open:\r\n arr.append(s[i])\r\n else:\r\n if arr==[]:\r\n flag = True\r\n break\r\n if dic[arr[-1]]!=s[i]:\r\n cnt += 1\r\n del arr[-1]\r\nif flag or arr!=[]:\r\n print(\"Impossible\")\r\nelse:\r\n print(cnt) \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Jun 22 13:09:30 2020\n\n@author: shailesh\n\"\"\"\ndef check_open(char):\n if char in '<{[(':\n return 1\n return 0\n\ndef find_type(char):\n if char in '()':\n return 0\n elif char in '[]':\n return 1\n elif char in '{}':\n return 2\n else:\n return 3\n\ns = input()\n\nstack = []\nimpossible = 0\ncount = 0\n\n#if not check_open(s[0]):\n# impossible = 1\n#else:\n# stack.append(s[0])\n\nfor char in s:\n if check_open(char):\n stack.append(char)\n else:\n if len(stack) == 0:\n impossible = True\n break\n if check_open(stack[-1]):\n if find_type(char) != find_type(stack[-1]):\n count +=1\n stack.pop()\n else:\n impossible = True\n break\nif len(stack) != 0:\n impossible = True\n\n\nif impossible:\n print('Impossible')\nelse:\n print(count)", "import sys\n\ndef rbs(mystr):\n\n stack = []\n kuohao = {'<':'>','{':'}','[':']','(':')'}\n count = 0\n\n for x in mystr:\n if x in kuohao:\n stack.append(x)\n else:\n if len(stack)==0:\n return 'Impossible'\n elif kuohao[stack.pop()] != x:\n count += 1\n else:\n pass\n\n if len(stack)==0:\n return count\n else:\n return 'Impossible'\n\nmystr = input()\nprint(rbs(mystr))\n \t \t\t \t\t\t \t\t \t \t\t \t\t \t\t" ]

[ "n, V = list(map(float, input().split(\" \")))\na = list(map(int, input().split(\" \")))\nb = list(map(float, input().split(\" \")))\nminB = min(b)\nif minB == 0:\n print(0)\nelse:\n x = b[0]/a[0]\n for i, j in enumerate(a):\n if x > b[i]/a[i]:\n x = b[i]/a[i]\n output = sum(a)*x\n print(min(output, V))\n\t \t\t \t \t \t \t\t\t \t\t \t\t \t\t \t", "'''\r\n\r\n\n\n15.07.2021\n\r\n\r\n\nCF 041 A\r\n\r\n\n\n'''\r\n\r\n\n\ns = (input ()).split ()\r\n\nn = int (s [0])\n\r\nv = int (s [1])\r\n\r\n\n\ns = (input ()).split ()\r\n\na = [0]*n\n\r\nsa = 0\n\r\nfor i in range (n) :\r\n\n a [i] = int (s [i])\r\n\n sa += a [i]\n\n\r\n\r\ns = (input ()).split ()\r\n\nb = [0]*n\n\r\nok = 1\r\n\nfor i in range (n) :\r\n\n b [i] = int (s [i])\r\n\n if b [i] == 0 :\n\r\n ok = 0\r\n\r\n\n\n#print (a)\r\n\n#print (b)\r\n\r\n\n\nx = [0]*n\n\r\nif ok == 0 :\r\n\n print (0)\r\n\nelse :\n\r\n for i in range (n) :\r\n\n x [i] = a [i] * v / sa\r\n\n kmin = b [0] / x [0]\n\r\n for i in range (1, n) :\r\n\n if x [i] > b [i] :\n\r\n if b [i] / x [i] < kmin :\r\n\n kmin = b [i] / x [i]\n\r\n sum = 0\r\n\n for i in range (n) :\r\n\n x [i] *= kmin\n\r\n sum += x [i]\n\r\n\n if sum > v :\n\r\n sum = v\n\n\r\n print (sum)\r\n\r\n\n\n# print (' '.join (str (s) for s in x))\r\n\n# print (x)\n", "n,v=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nr=min(b[i]/a[i]*sum(a) for i in range(n))\nprint(min(r,v))", "n,v=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx=10**10\r\nfor i in range(n): x=min(x, b[i]/a[i])\r\nans=0\r\nfor i in range(n): ans+=x*a[i]\r\nprint(min(ans,v))\r\n", "a=[int(x) for x in input().split()]\r\nn=a[0]\r\nai=[int(x) for x in input().split()]\r\ns=sum(ai)\r\nbi=[int(x) for x in input().split()]\r\nc=[]\r\nfor p in range(n) :\r\n ele=bi[p]/ai[p]\r\n c.append(ele)\r\nx=min(c)\r\nfinalv=x*s\r\nif finalv>a[1] :\r\n print(a[1])\r\nelse :\r\n print(finalv)", "n,V=map(int, input().strip().split(' '))\r\na=list(map(int, input().strip().split(' ')))\r\nb=list(map(int, input().strip().split(' ')))\r\nl=[]\r\nfor i in range(n):\r\n l.append(b[i]/a[i])\r\nm=min(l)\r\ns=sum(a)\r\nprint(min((m*s),V))", "n, V = map(int, input().split())\n\na = list(map(int, input().split()))\n\nb = list(map(int, input().split()))\n\nd = min(b[i] / a[i] for i in range(n))\n\nprint(min(V, d * sum(a)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, v = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = min(b[i]/a[i] for i in range(n))\r\nprint(min(v, sum(x*i for i in a)))", "n,v=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nbr=list(map(int,input().split()))\r\nx=min([br[i]/ar[i] for i in range(n)])\r\nsm=min(v,sum(ar)*x)\r\nprint(sm)\r\n", "import sys\n\ninput = sys.stdin.readline\n\ndef solver(n, v, a, b):\n\n minNeeded = 10000\n for i in range(n):\n t = b[i]/a[i]\n if t<minNeeded:\n minNeeded=t\n result = 0\n for i in range(n):\n result+=a[i]*minNeeded\n \n return(min(v,result))\n\nfor _ in range(1):\n n, v = map(int,input().split())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n print(solver(n, v, a, b))\n\t\t \t \t\t\t \t \t \t\t \t\t \t\t \t\t \t\t\t", "n, V = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nx = []\nsumm = 0\nfor i in range(0, n):\n x.append(b[i]/a[i])\nh = min(x)\nfor j in range(len(a)):\n summ += h*a[j]\nprint(float(min(summ, V)))\n", "n,V = list(map(int, input().split(\" \")))\nratios = list(map(int, input().split(\" \")))\navailable = list(map(int, input().split(\" \")))\nresulting = min([available[i]/ratios[i] for i in range(n)])\nvolume = sum([resulting*ratio for ratio in ratios])\nprint(min(volume, V))", "n, V = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nanswer = [V]\nsum_of_proportions = sum(a)\n\nfor i in range(n):\n answer.append((b[i] / a[i]) * sum_of_proportions)\n\nprint(min(answer))\n", "n, V = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nr = min(bi/ai for ai, bi in zip(a, b))\r\nprint(min(r * sum(a), V))", "\r\nn,v=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\ne = sum(a)\r\n\r\nl = 0;r = v\r\neps = 10**(-9)\r\n\r\nwhile r-l>eps:\r\n m=(r+l)/2\r\n\r\n for i in range(n):\r\n if a[i]*m/e>b[i]:\r\n r=m\r\n break\r\n else:\r\n l=m\r\n\r\nprint(\"%.8f\"%r)", "I = input().split()\r\nn = int(I[0])\r\nV = int(I[1])\r\n\r\na = input().split()\r\nb = input().split()\r\n\r\ns = 0\r\nfor i in a:\r\n s += int(i)\r\n\r\nxmax = V/s\r\n\r\nmi = 101\r\nfor i in range(n):\r\n if int(b[i])/int(a[i]) < mi:\r\n mi = int(b[i])/int(a[i])\r\n\r\nif mi >= xmax:\r\n x = xmax\r\nelse:\r\n x = mi\r\n\r\nprint(format(x*s, \".6f\"))", "from fractions import gcd\n\ndef Simplify(A):\n n=len(A)\n x=A[0]\n for i in range(1,n):\n x=gcd(x,A[i])\n for i in range(n):\n A[i]//=x\n return A\n\n\nn,V=map(int,input().split())\n\nA=list(map(int,input().split()))\n\nB=list(map(int,input().split()))\n\nA=Simplify(A)\n\nVoll=[]\n\n\nfor i in range(n):\n Voll.append(B[i]/A[i])\n\nM=min(Voll)\n\nVol=0\nfor i in range(n):\n Vol+=(M*A[i])\n\nprint(min(V*1.0,Vol))\n", "n,v=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nmini=10**9 \r\nfor i in range(n):\r\n mini=min(mini,b[i]/a[i])\r\nsm=0 \r\nfor i in range(n):\r\n sm=sm+mini*a[i]\r\nprint(min(sm,v))", "n, V = map(int, input().split())\r\na, b = list(map(int, input().split())), list(map(int, input().split()))\r\n\r\nx = b[0] / a[0]\r\nfor i in range(1, n):\r\n x = min(x, b[i] / a[i])\r\n\r\nans = 0\r\nfor i in a:\r\n ans += i * x\r\n\r\nprint(min(ans, V))\r\n", "line = input()\nlis = line.split()\nn = int(lis[0])\nv = int(lis[1])\nline = input()\npro = line.split()\npro = [int(i) for i in pro]\nline = input()\ninc = line.split()\ninc = [int(i) for i in inc]\nx = None\nfor i in range(n) :\n r = inc[i]/pro[i]\n if x is None or r < x :\n x = r\ntot = 0\nfor i in pro :\n tot = tot + i*x \nprint(min(tot, v))\n\t\t \t\t\t \t\t \t \t\t\t", "n, V = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\narr = min([b[i]/a[i] for i in range(n)])\r\nprint(\"%.5f\"%min(V, arr*sum(a)))", "n,v = map(int,input().split())\r\nl1 = list(map(float,input().split()))\r\nl2 = list(map(float,input().split()))\r\nmn = 100000.0\r\nfor i in range(n):\r\n mn = min(mn,l2[i]/l1[i])\r\nout = 0.0\r\nfor i in range(n):\r\n out += mn*l1[i]\r\nif out > v :\r\n print(float(v))\r\nelse :\r\n print(out)", "while True:\r\n try:\r\n n, v = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n sa = sum(a)\r\n x = v / sa\r\n b_values = list(map(int, input().split()))\r\n for i in range(n):\r\n x = min(x, b_values[i] / a[i])\r\n result = x * sa\r\n print(\"{:.7f}\".format(result))\r\n except (EOFError, ValueError):\r\n break# 1698155165.1383812", "n, v = [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\nx = 100000\r\nfor i in range(n):\r\n\tb[i] /= a[i]\r\n\tx = min(b[i], x)\r\nprint(min(v, sum(a) * x))", "n , v = map(int,input().split())\narr = list(map(int,input().strip().split()))[:n]\nbrr = list(map(int,input().strip().split()))[:n]\nmn = 10000000000000\nfor i in range(n):\n mn = min(mn,brr[i]/arr[i])\nsum = 0\nfor i in range(n):\n sum = sum + arr[i] * mn\n\nif sum > v:\n print(v)\nelse:\n print(sum)\n\t\t\t\t\t\t \t \t\t \t \t\t \t \t\t", "n, v = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nx = 100000\nfor i in range(n):\n\tb[i] /= a[i]\n\tx = min(b[i], x)\nprint(min(v, sum(a) * x))\n", "n, V = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nSa=sum(a)\r\nm = min(b)\r\nres = 0\r\nfor i in range(n):\r\n cur_r = 0\r\n for j in range(n):\r\n if(b[j]>=a[j]*b[i]/a[i]):\r\n cur_r += a[j]*b[i]/a[i]\r\n else:\r\n break\r\n else:\r\n res = max(cur_r, res)\r\nprint(min(res, float(V)))", "n , v = map(int,input().split())\r\narr = list(map(int,input().strip().split()))[:n]\r\nbrr = list(map(int,input().strip().split()))[:n]\r\nmn = 10000000000000\r\nfor i in range(n):\r\n mn = min(mn,brr[i]/arr[i])\r\nsum = 0\r\nfor i in range(n):\r\n sum = sum + arr[i] * mn\r\n\r\nif sum > v:\r\n print(v)\r\nelse:\r\n print(sum)", "n,V = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nans = b[0]/a[0]\ntots = a[0]\nfor i in range(1,n):\n ans = min(ans,b[i]/a[i])\n tots += a[i]\nprint(min(V,tots*ans))\n", "n, v = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nr = min(bi / ai for ai, bi in zip(a, b))\nprint(min(v, r * sum(a)))\n", "n,V=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\n\r\nx=1<<60\r\n\r\nfor i in range(n):\r\n x=min(x,B[i]/A[i])\r\n\r\nANS=0\r\nfor a in A:\r\n ANS+=a*x\r\n\r\nprint(min(V,ANS))\r\n", "n, v = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nminm = b[0] / a[0]\nfor i in range(1, n):\n minm = min(minm, b[i] / a[i])\ns = sum(a)\nprint(min(v, s * minm))", "# LUOGU_RID: 127230403\na,b=map(int,input().split());a=list(map(int,input().split()));c=list(map(int,input().split()));print(min(b,sum(a)*min(c[i]/a[i]for i in range(len(a)))))", "import math\r\nn,v=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ngcd1=a[0]\r\nfor i in range(n):\r\n gcd1=math.gcd(a[i],gcd1)\r\nfor i in range(n):\r\n a[i]/=gcd1\r\nmini=1000000\r\nfor i in range(n):\r\n mini=min(b[i]/a[i],mini)\r\nvol=0\r\nfor i in range(n):\r\n vol+=mini*(a[i]/1)\r\nprint(min(vol,v))", "n,v=list(map(int,input().split()))\r\na1=list(map(int,input().split()))\r\nb1=list(map(int,input().split()))\r\ns=sum(a1)\r\nmini=(b1[0]*s)/a1[0]\r\nfor i in range(n):\r\n a=(b1[i]*s)/a1[i]\r\n if a<mini:\r\n mini=a\r\nif mini>v:\r\n mini=v\r\nprint(mini)\r\n \r\n \r\n", "n, capacity = map(int, input().split())\nproportions = list(map(int, input().split()))\ningredients = list(map(int, input().split()))\n\nbest_volume = 0\n\nfor i, ingredientA in enumerate(ingredients):\n proportionA = proportions[i]\n volume = 0\n feasible = True\n #print('ingredientA = %d' % ingredientA)\n for j, ingredientB in enumerate(ingredients):\n proportionB = proportions[j]\n amount = ingredientA / proportionA * proportionB\n #print('amount = %f, ingredientB = %d' % (amount, ingredientB))\n if amount > ingredientB + 1e-9:\n #print('*** delta = %f' % (amount - ingredientB))\n feasible = False\n break\n #print('ingredient %d: %f' % (j, amount))\n volume += amount\n if not feasible:\n #print('not feasible')\n continue\n volume = min(capacity, volume)\n best_volume = max(best_volume, volume)\n\nprint(best_volume)\n", "n, v = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = []\r\n\r\nfor i in range(n):\r\n c.append(b[i] / a[i])\r\n\r\nk = min(c)\r\nup = sum(a) * k\r\n\r\nif up < v:\r\n print(up)\r\n\r\nelse:\r\n print(v)\r\n", "def mi():\r\n\treturn map(int, input().split())\r\n\r\nn,v = mi()\r\na = list(mi())\r\nb = list(mi())\r\nx = 100000\r\n\r\nfor i in range(n):\r\n\tx = min(x,b[i]/a[i])\r\nprint (min(sum(a)*x,v))", "n,v=map(int,input().split())\r\na=[*map(float,input().split())]\r\nb=[*map(float,input().split())]\r\nitem=1000000000000000000000000.0\r\nfor x,y in zip(a,b):\r\n item=min(item,y/x)\r\nres=0\r\nsumma=sum(a)\r\nelem=v/summa\r\nprint(min(item,elem)*summa)", "n,V=map(int,input().split(\" \"))\nalist=[int(x) for x in input().split(\" \")]\nblist=[int(x) for x in input().split(\" \")]\n#empty one item from blist\nans=0\nminrate=100000\nfor i in range(n):\n #empty ith item from blist,see if it works\n rate=blist[i]/alist[i] # how many food should cook\n minrate=min(minrate,rate)\ntotal=0\nfor i in range(n):\n total+=alist[i]*minrate\nprint(min(V,total))\n \t \t\t \t \t \t \t \t \t\t", "n,v = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nl=0.0\r\nr=1e8\r\nans=0.0\r\nfor it in range(100):\r\n m=l+(r-l)/2;\r\n f=1\r\n sum = 0.0\r\n for i in range(n):\r\n sum+=a[i]*m;\r\n if(a[i]*m>b[i]):\r\n f=0\r\n break\r\n if(sum>v):\r\n f=0\r\n if(f):\r\n ans = m\r\n l = m\r\n else:\r\n r = m\r\nfans = 0.0\r\nfor i in range(n):\r\n fans+=ans*a[i];\r\nprint(fans)", "def borsch(n, v, a, b):\r\n big = 10 ** 6\r\n ingridients = 0\r\n for i in range(n):\r\n big = min(big, b[i] / a[i])\r\n for i in range(n):\r\n ingridients += big * a[i]\r\n return min(ingridients, float(v))\r\n\r\n\r\nN, V = [int(i) for i in input().split()]\r\nlst1 = [int(x) for x in input().split()]\r\nlst2 = [int(y) for y in input().split()]\r\nprint(borsch(N, V, lst1, lst2))\r\n ", "n , v = map(int,input().split())\r\nratio = list(map(int,input().split()))\r\nlis = list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n a = lis[i]/ratio[i]\r\n ans.append(a)\r\nx = min(ans)\r\nss=0\r\n#print(ans)\r\nfor i in ratio:\r\n ss+=(i*x)\r\nprint(min(v,ss)) " ]

[ "inp=lambda:map(int,input().split())\r\nn=int(input())\r\n\r\nl=list(inp())\r\n\r\nm=[1000000]*(10**6+1)\r\n\r\n\r\nfor i in range(n-1,-1,-1):\r\n m[i]=min(m[i+1],i-l[i])\r\n\r\ncnt=0\r\nfor i in range(0,n):\r\n if(m[i+1]>i) :\r\n cnt+=1\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nd = n-1-w[-1]\r\nc = 1\r\nfor i in range(n-2, -1, -1):\r\n if i < d:\r\n c += 1\r\n d1 = i-w[i]\r\n d = min(d, d1)\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\ny=n-1\r\nans=0\r\nfor i in range(n-1,-1,-1):\r\n q=i-a[i]-1\r\n if i<=y:\r\n ans+=1\r\n if q<0:\r\n break\r\n if q<y:\r\n y=q\r\nprint(ans)\r\n \r\n \r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncount_=1\r\nj=n-2\r\nseggs=l[-1]\r\nwhile j>=0:\r\n if seggs>0:\r\n seggs-=1\r\n if l[j]>seggs:\r\n seggs=l[j]\r\n else:\r\n count_+=1\r\n seggs=l[j]\r\n j-=1\r\nprint(count_)", "n = int(input())\r\nl = [0] + list(map(int, input().strip().split()))\r\n\r\n\r\ntotalDead = 0\r\ncurrentLow = n + 1\r\ncurrentHigh = n + 1\r\nfor i in range(n, 0, -1):\r\n low = max(1, i - l[i])\r\n high = i - 1\r\n\r\n # valid\r\n if (low <= high):\r\n if (low <= currentLow and high >= currentLow):\r\n currentLow = low\r\n elif (high < currentLow):\r\n totalDead += currentHigh - currentLow + 1\r\n currentLow = low\r\n currentHigh = high\r\n \r\n\r\ntotalDead += currentHigh - currentLow + 1\r\nprint(n - totalDead + 1)", "n = int(input())\r\na = list(map(int, input().split()))[::-1]\r\n\r\nl, r = -1, -1\r\nans = 0\r\nwhile l < n - 1:\r\n l += 1\r\n if l > r:\r\n ans += 1\r\n r = max(r, l + a[l])\r\n\r\n if r > n - 1:\r\n break\r\n\r\nprint(ans)\r\n", "def read_input():\r\n n = int(input())\r\n arr = input()\r\n arr = arr.split(\" \")\r\n for i in range(0, n):\r\n arr[i] = int(arr[i])\r\n \r\n return n, arr\r\n\r\ndef solve(n, arr):\r\n alive = []\r\n for i in range(0, n):\r\n alive.append(0)\r\n\r\n count = 0\r\n\r\n for i in range(n-1, -1,-1):\r\n if count > 0:\r\n alive[i]=1\r\n count-=1\r\n count = max(count, arr[i])\r\n\r\n if count == 0:\r\n count+= arr[i]\r\n\r\n result = 0\r\n\r\n for i in range(0, n):\r\n if alive[i] == 0:\r\n result+=1\r\n \r\n\r\n \r\n print(result)\r\n\r\n \r\nif __name__ == \"__main__\":\r\n n, arr = read_input()\r\n solve(n, arr)\r\n\r\n", "ii=lambda:int(input())\r\nkk=lambda:map(int, input().split())\r\nll=lambda:list(kk())\r\n\r\nn,ls=ii(),ll()\r\nl=n+1\r\nc=0\r\nfor r in range(n-1,-1,-1):\r\n\tif l > r:c+=1\r\n\tl=min(l,r-ls[r])\r\nprint(c)", "n=int(input())\nl=list(map(int,input().split()))\nres=0\nx=n\nfor i in range(n-1,-1,-1):\n if(i<x):\n res+=1\n x=min(x,i-l[i])\nprint(res)\n\t \t \t \t \t \t \t\t\t \t\t \t\t\t \t", "n = int(input())\nx = list(map(int, input().split()))\nans = n\ncur = 0\nfor i in range(n - 1, -1, -1):\n if x[i] >= cur:\n if cur > 0:\n ans -= 1\n cur = x[i] + 1\n else:\n ans -= 1\n cur -= 1\nprint(ans)\n\n", "n = int(input())\r\n\r\nlist = list(map(int, input().split()))\r\nlength = len(list)\r\ndead_number = 0\r\nlast_killed_index = length - 1\r\nfor i in reversed(range(length)):\r\n temp = max(0, i - list[i])\r\n killed = i - temp - max(0, i - last_killed_index)\r\n if killed > 0:\r\n last_killed_index = temp\r\n dead_number += killed\r\n \r\n\r\nans = length - dead_number\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = set()\r\ni = len(l)-1\r\nj = len(l)-2\r\nwhile(i > -1):\r\n while(j > -1 and i > j):\r\n if (j+1) >= ((i+1)-l[i]):\r\n #print(i,j)\r\n s.add(j)\r\n j = j-1\r\n \r\n else:\r\n break\r\n \r\n if i == j:\r\n j = j-1\r\n \r\n else:\r\n i = i-1\r\n \r\nprint(len(l)-len(s))", "n = int(input())\r\nL = list(map(int, input().split()))\r\nkill = 0\r\ndead = []\r\nf = [0] * n\r\nfor i in range(n):\r\n dead.insert(i, False)\r\n\r\nf[n - 1] = (n - 1) - L[n - 1]\r\nfor i in range(n - 2, -1, -1):\r\n f[i] = min(f[i + 1], i - L[i])\r\n#dead = [False] * n\r\nfor i in range(n - 1):\r\n if i >= f[i + 1]:\r\n kill += 1\r\n # for j in range(0, i):\r\n # if j >= i - L[i] and dead[j] == False:\r\n # kill += 1\r\n # dead[j] = True\r\nprint(n - kill)", "#!/usr/bin/env pypy3\r\n\r\ndef ans(L):\r\n kills = []\r\n\r\n for i, e in enumerate(L):\r\n start = max(0, i - e)\r\n end = i\r\n kills += [(start, -1)]\r\n kills += [(i, 1)]\r\n \r\n kills = sorted(kills)\r\n\r\n # print(\"kills=\", kills)\r\n\r\n prev_i = None\r\n kill_count = 0\r\n ret = 0\r\n\r\n for i, d in kills:\r\n if i != prev_i and prev_i is not None:\r\n # print(f\"checking if {i-1} is alive\")\r\n if kill_count >= 0:\r\n ret += 1\r\n # print(\"yes\")\r\n # print(\"no\")\r\n kill_count += d\r\n prev_i = i\r\n\r\n return ret+1\r\n\r\n\r\ninput()\r\nL = input().split(' ')\r\nL = list(map(int, L))\r\n\r\nprint(ans(L))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n L = [int(x) for x in input().split()]\r\n\r\n to_kill = 0\r\n killed = 0\r\n for i in range(n-1,-1,-1):\r\n if to_kill > 0:\r\n killed+=1\r\n to_kill-=1\r\n\r\n to_kill = max(to_kill, L[i])\r\n print(n-killed)\r\n", "n = int(input())\r\nclaws = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\nminimum = 0\r\nmaximum = -1\r\nfor i in range(n-1,-1,-1):\r\n if minimum > maximum or i < minimum:\r\n count += 1\r\n if claws[i] >= 1:\r\n s = max(i-claws[i],0)\r\n e = i - 1\r\n if minimum > maximum:\r\n minimum = s\r\n maximum = e\r\n else:\r\n if i < minimum:\r\n minimum = s\r\n maximum = e\r\n else:\r\n minimum = min(s, minimum)\r\n\r\nprint(count)", "n = int(input())\r\na = [int(s) for s in input().split()]\r\nlast_killed = len(a)\r\nans = 0\r\nfor i in range(len(a) - 1, -1, -1):\r\n if i < last_killed:\r\n ans += 1\r\n last_killed = min(i - a[i], last_killed)\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(n-1,-1,-1):\r\n if n>i:\r\n cnt+=1\r\n n=min(n,i-a[i])\r\nprint(cnt)", "n = int(input())\nd = [int(f) for f in input().split(' ') if f]\np = n + 1\nresult = 0\nfor i in reversed(range(n)):\n if i < p:\n result += 1\n p = min(p, max(i - d[i], 0))\nprint(result)\n", "n=int(input())\r\ndead=0\r\ncur=0\r\nfor x in [*map(int,input().split())][::-1]:\r\n if cur>0:dead+=1\r\n cur=max(cur-1,x)\r\nprint(n-dead)", "n=int(input())\r\na=list(map(int,input().split()))\r\nj=n-a[-1]\r\nk=1\r\nfor i in range(2,n+1):\r\n if j>n-i+1 and a[-i+1]==0:\r\n k+=1\r\n j=min(n-i+1-a[-i],j)\r\nprint(k)", "n = int(input())\nL = [int(i) for i in input().split()]\n\nj = n - 1\nx = j - L[j]\ni = j\nvivos = n\nwhile i>0:\n i -= 1\n if x > j - L[j]: x = j - L[j]\n if x <= i: vivos -= 1\n j-=1\n\nprint(vivos)\n", "q=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nt=q\r\nfor i in range(q-1,-1,-1):\r\n if t>i:\r\n ans+=1\r\n t=min(t,i-a[i])\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * 1000005\r\nans = 0\r\nfor i in range(n):\r\n b[max(1, i - a[i] + 1)] += 1\r\n b[i + 1] -= 1\r\nfor i in range(1, n + 1):\r\n b[i] += b[i - 1]\r\nfor i in range(1, n + 1):\r\n if b[i] == 0:\r\n ans += 1\r\nprint(ans)", "q=int(input())\r\na=list(map(int,input().split()))\r\nalive = 0\r\nt = q\r\nfor i in range(q-1, -1, -1):\r\n if t > i:\r\n alive += 1\r\n t=min(t, i-a[i])\r\nprint(alive)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\npath = 0\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n path -= 1\r\n if path < 0:\r\n ans += 1\r\n path = max(path, a[i])\r\nprint(ans)", "# LUOGU_RID: 104703379\na=int(input())\r\nb=input().split()\r\nfor i in range(0,len(b)):\r\n\tb[i]=int(b[i])\r\nans=0\r\ndis=1000000000000000000000\r\nfor i in range(len(b)-1,-1,-1):\r\n\tnow=i+1\r\n\tif(dis>now):\r\n\t\tans+=1\r\n\tdis=min(dis,now-b[i])\r\nprint(ans)", "R = lambda: list(map(int, input().split(' ')))\r\nn = int(input())\r\nL = R()\r\nbeaten = 10**7\r\ncnt = 0\r\nfor i in range(n, 0, -1):\r\n if (i >= beaten):\r\n cnt += 1\r\n beaten = min(beaten, i - L[i - 1])\r\nprint(n - cnt)", "#Wrath\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ni = n - 1\r\nj = n - 1\r\ncount = 0\r\nwhile j >= 0 and i >= 0:\r\n if j >= i:\r\n count += 1\r\n j = i - l[i] - 1\r\n if i - l[i] <= j:\r\n j = i - l[i] - 1\r\n i -= 1\r\n\r\nprint(count)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncarry = l[-1]\r\nl = l[:-1]\r\nkilled = 0\r\nfor i in range(len(l) - 1, -1, -1):\r\n if i + 1 <= carry:\r\n killed = killed + i + 1\r\n break\r\n else:\r\n if carry != 0: \r\n killed = killed + 1\r\n carry = carry - 1\r\n carry = max(l[i], carry)\r\nprint(n - killed, end = \"\")", "#https://codeforces.com/problemset/problem/892/B\r\n'''\r\nComment\r\n- The person at the last index of the array is certainly alive because there aren't any person's positions who\r\nis behind him.\r\n- So the answer of this problem is always greater or equal to 1.\r\n- At current position of a person (called is I), he can kill the people who are in front of him (called is J) if J >= I - L[I],\r\nso to solve this problem, we just count the number of position which J < I and J < I - L[I] is the number of people are still alive.\r\n'''\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input());\r\n pp = list(map(int, input().split()))\r\n res = 0;\r\n behind = int(1e9 + 100)\r\n\r\n for i in range(n - 1, -1, -1):\r\n # else with the case j >= i - L[i]\r\n if i < behind:\r\n res += 1 \r\n\r\n # update behind for next loop\r\n if behind > i - pp[i]: \r\n behind = i - pp[i]\r\n\r\n '''\r\n if behind is small, we will have many chance to kill as many people as possible, so if \r\n behind > i - pp[i] of current person, we will update the variable behind (value behind of current person, called is J), \r\n from here to the next time which the variable was updated, the number of people which their index >= behind \r\n is the number of people was killed by the person J\r\n\r\n '''\r\n\r\n print(res)", "n = int(input())\nline = [int(x) for x in input().split()]\nans = 0\ntemp = n\n\n# Iterate through the list of people in reverse order\nfor i in range(n-1, -1, -1):\n # Check if the current person (i-th person) can kill at least one person\n if (i < temp):\n ans += 1\n # Update temp with the minimum value of itself and (i - Li),\n # where Li is the length of the claw held by the current person\n temp = min(temp, i - line[i])\nprint(ans)\n\n\t \t \t\t \t \t\t\t\t\t\t\t\t \t \t\t", "def main():\r\n n = int(input())\r\n L = list(map(int, input().split()))\r\n a = set()\r\n t = 0\r\n k = 0\r\n for i in range(n-1, 0, -1):\r\n j = i - L[i]\r\n if j < 0:\r\n j = 0\r\n if (i - j) != 0 and i > j:\r\n t = max(t, i - j)\r\n if t > 0:\r\n t -= 1\r\n k += 1\r\n print(n - k)\r\nmain()", "ignore=input()\r\narr=list(map(int,input().split()))\r\narr=arr[::-1]\r\n\r\nans=0\r\ni=0\r\ncurrent=-1\r\nwhile current<len(arr)-1:\r\n if current<i:\r\n ans+=1\r\n current=max(current,arr[i]+i)\r\n i+=1\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nDP = [0] * (n + 10)\r\nfor i in range(n):\r\n DP[max(0, i - L[i])] += 1\r\n DP[i] -= 1\r\nresult = n\r\nfor i in range(n):\r\n DP[i] += DP[i - 1]\r\n if DP[i] > 0:\r\n result -= 1\r\nprint(result)", "n = int(input())\r\narr = [0]+list(map(int,input().split()))\r\ncount = 0\r\nmini = n-arr[-1]\r\nfor i in range(n-1,0,-1):\r\n if i>=mini:\r\n count += 1\r\n if mini>i-arr[i]:\r\n mini = i-arr[i]\r\nprint(n-count)\r\n ", "n = int(input())\r\ns = input()\r\na = list(map(int, s.split()))\r\npos = n + 1\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n\tif pos > i:\r\n\t\tans += 1\r\n\tpos = min(pos, i - a[i]);\r\nprint(ans)\r\n\r\n", "n = int(input())\r\na = [i - int(x) + 1 for i, x in enumerate(input().split())]\r\n\r\na.insert(0, 0)\r\n\r\nmin_a = a[-1]\r\nres = n\r\n\r\nfor i in range(n - 1, 0, -1):\r\n\tif i >= min_a: \r\n\t\tres -= 1 \r\n\tmin_a = min(min_a, a[i])\r\nprint(res)", "def alive_people(n, L):\r\n x = n # minimum of j - Lj for all j > i\r\n alive = 0 # the number of people who are still alive\r\n for i in range(n - 1, -1, -1):\r\n # if x > i, the i-th person will be alive\r\n if x > i:\r\n alive += 1\r\n # update x\r\n x = min(x, i - L[i])\r\n return alive\r\n\r\n\r\nn = int(input())\r\ng = [int(x) for x in input().split()]\r\n\r\nprint(alive_people(n, g))", "n = int(input())\nkillers = list(map(int, input().split()))\n\ncount = 0\ndone = n\nfor i in range(n - 1, -1, -1):\n if done > i:\n count += 1\n done = min(i - killers[i], done)\nprint(count)\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\nm=n-v[n-1]\r\nc=0\r\ni=n-2\r\nwhile i>=0:\r\n if(i+1>=m):\r\n c+=1\r\n m=min(m,i+1-v[i])\r\n i-=1\r\n\r\nprint(n-c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncnt=0\r\nj=l[n-1]-1\r\nfor i in range(n-2,-1,-1):\r\n j=max(j,l[i])\r\n l[i]=j\r\n j-=1\r\nfor i in range(1,n):\r\n if l[i]==0:\r\n cnt+=1\r\nprint(cnt+1)", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n cnt = 1\r\n minIdx = len(arr) - 1\r\n\r\n for curIdx in range(len(arr) - 1, -1, -1):\r\n\r\n if curIdx < minIdx:\r\n cnt += 1\r\n\r\n minIdx = min(minIdx, curIdx - arr[curIdx])\r\n\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n while (len(a) != 0 ) and (a[-1] >= i - l[i]):\r\n a.pop()\r\n a.append(i)\r\n\r\nans = len(a)\r\nprint(ans)\r\n", "z,x=1,0\r\nfor i,j in zip(range(int(input())),map(int,input().split()[::-1])):z+=x<i;x=max(x,i+j)\r\nprint(z)", "\r\nn = int(input())\r\nkogti = [int(i) for i in input().split()]\r\nj = n\r\nalive = 0\r\nfor i in range(n-1,-1,-1):\r\n if j > i:\r\n alive+=1 \r\n j = min(j, i - kogti[i])\r\n# print(j)\r\nprint(alive)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=1\r\nm=n-a[n-1]\r\nfor i in range(n-2,-1,-1):\r\n if i+1<m:\r\n b+=1\r\n m=min(i+1-a[i],m)\r\nprint(b)", "n = int(input())\ns = list(map(int,input().split()))\npromezutok = n\nansw = 0\nfor i in range(n - 1, -1 , -1):\n\tif i < promezutok:\n\t\tansw += 1\n\tif promezutok > i - s[i]:\n\t\tpromezutok = i - s[i]\nprint(answ)\n", "n = int(input())\nL = list(map(int,input().split()))\nanswer = 0\nk = n-1\nfor i in range(n-1,-1,-1):\n if k>=i:\n answer += 1\n k = min(k,i-L[i]-1)\nprint(answer)", "\r\n\r\nN = int(input())\t\r\n\r\ns = input()\r\nx = 0\r\nz = 0\r\nS = [int(m) for m in s.split()]\r\n\r\nfor i in S[::-1]:\r\n\tif x == 0:\r\n\r\n\t\tz+=1\r\n\tx = max(x-1,i)\r\n\r\nprint(z)\r\n\r\n\r\n", "n = int(input())\r\n\r\nmen = list(map(int, input().split()))\r\n\r\nalive, kill = n, 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if kill > 0:\r\n alive -= 1\r\n kill -= 1\r\n kill = max(kill, men[i])\r\n\r\nprint(alive)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nr = n\r\ncounter = 0\r\nfor i in reversed(l):\r\n if counter > 0:\r\n r -= 1\r\n counter = max(counter-1, i)\r\nprint(r)\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\ncnt = 1\r\ni,j = n-1,n-1\r\n\r\nwhile i >= 0 and j >= 0:\r\n # print('i,j', i, j)\r\n if i < j: \r\n cnt += 1\r\n if i - a[i] < j:\r\n j = i - a[i]\r\n if j <= 0: break\r\n i -= 1\r\n\r\nprint(cnt)\r\n", "book = [0 for i in range(0,1000005)]\r\nn = input(\"\")\r\nn = int(n)\r\nstr = input(\"\")\r\nL = str.split(\" \")\r\nL = [int(L[i]) for i in range(0,n)]\r\ncnt = 0\r\nans = 0\r\nfor i in range(0,n):\r\n if i - L[i] >= 0:\r\n book[i - L[i]] = book[i - L[i]] + 1\r\n else:\r\n book[0] = book[0] + 1\r\nfor i in range(0,n):\r\n cnt = cnt - 1\r\n cnt = cnt + book[i]\r\n if cnt == 0:\r\n ans = ans +1\r\nprint(ans)", "n = int(input())\r\nclaw = [int(i) for i in input().split()]\r\n\r\nalive = 0\r\nfor i in range(n-1, -1, -1):\r\n\tif n > i:\r\n\t\talive+=1\r\n\tn = min(n, i - claw[i])\r\nprint(alive)", "n = int(input())\nL = list(map(int, input().split()))\n\nnumber_of_death = -1\nfurthest = n - 1\n\nfor i in range(n - 1, -1, -1):\n # print(i)\n if i >= furthest:\n number_of_death += 1\n furthest = min(furthest, i - L[i])\n\nprint(n - number_of_death)\n", "n=input()\r\nl=list(map(int,input().split()))\r\ni,j,c=len(l)-1,len(l),1\r\nwhile i>=0 and j>=0:\r\n c+=int(i==j)\r\n j=min(i-l[i]-1,j)\r\n i-=1\r\nprint(c)", "n=int(input())\r\nc=0\r\na=list(map(int,input().split()))\r\nfor i in range(n-1,-1,-1):\r\n if(n>i):\r\n c+=1\r\n n=min(n,i-a[i])\r\nprint(c)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndead = {}\r\nc = 0\r\nfor i in range(n):\r\n l[i]=i-l[i]\r\nj = n-1\r\nmi = n-1\r\nleast = j\r\ncount = 0\r\nwhile j>0:\r\n if l[j]<mi:\r\n if l[j]<0:\r\n if mi<j:\r\n count+=abs(0-mi)\r\n else:\r\n count+=abs(0-j)\r\n #print(j,0,mi,\"->\",count)\r\n break\r\n if mi<j:\r\n count+=abs(l[j]-mi)\r\n else:\r\n count+=abs(l[j]-j)\r\n #print(j,l[j],mi,\"->\",count)\r\n mi=l[j]\r\n\r\n \r\n j-=1\r\nalive = n - count\r\nprint(alive)", "n=int(input())\r\na=list(map(int, input().split()))\r\nans=0\r\nj=n-1\r\nfor i in range (n-1,-1,-1):\r\n if i<=j:\r\n ans+=1\r\n j=min(j,i-a[i]-1)\r\n if j<0:\r\n break\r\nprint(ans)", "n = int(input())\r\nl = [int(t) for t in input().split()]\r\ncnt = [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n cnt[max(0, i - l[i])] += 1\r\n cnt[i] -= 1\r\nopen = 0\r\nans = 0\r\nfor t in cnt:\r\n open += t\r\n if open == 0:\r\n ans += 1\r\nprint(ans)", "s = int(input())\nx = input().split()\nans = 0\npos1 = s\npos2 = s - 1\nwhile pos2 > -1:\n if pos2 < pos1:\n ans += 1\n if pos2 - int(x[pos2]) < pos1:\n pos1 = pos2 - int(x[pos2])\n pos2 -= 1\nprint(ans)\n", "numGuilty = int(input())\r\nclawLengths = tuple(map(int, input().split()))\r\n\r\nalive = 1\r\nlongClaw = numGuilty - 1 - clawLengths[numGuilty - 1]\r\nfor i in range(numGuilty - 2, -1, -1):\r\n if i < longClaw:\r\n alive += 1\r\n if i - clawLengths[i] < longClaw:\r\n longClaw = i - clawLengths[i]\r\n\r\nprint(alive)", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\nlast = n\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if i < last:\r\n ans += 1\r\n if last > max(0, i - list1[i]):\r\n last = i - list1[i]\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na.reverse()\r\nk = 0\r\nans = n\r\nfor i in range(n):\r\n if k > 0:\r\n ans -= 1\r\n k -= 1\r\n k = max(k, a[i])\r\nprint(ans)", "n = int(input())\r\n\r\nar = list(map(int, input().split()))\r\nlo = float('Inf')\r\nc = 1\r\nfor i in range(n-1, -1,-1):\r\n\tr= ar[i]\r\n#\tprint(i,lo)\r\n\tif i < n-1:\r\n\t\tif i >=lo:\r\n\t\t\tc += 0\r\n\t\telse:\r\n\t\t\tc += 1\r\n\tif i-r >=0:\r\n\t\tlo = min(lo, i-r)\r\n\telse:\r\n\t\tlo =0\r\nprint(c)\r\n", "input()\r\n#n, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\n\r\nb = 0\r\nif len(a) == 1:\r\n print(1)\r\nelse:\r\n \r\n total = 0\r\n for i in range(len(a)-1, -1, -1):\r\n if b == 0:\r\n total += 1\r\n \r\n \r\n b = max(b-1, a[i], 0)\r\n print(total)", "inp = lambda: map(int, input().rstrip().split())\nn = int(input())\nL = list(inp())\ndp = []\nfor i in range(n):\n dp.append(i - L[i])\nt = 1\nsmall = [0] * n\nsmall[n - 1] = dp[n - 1]\nfor i in range(n - 2, -1, -1):\n small[i] = min(small[i + 1], dp[i])\nt = 1\n# print(dp)\n# print(small)\nfor i in range(n - 1):\n if i < small[i+1]:\n t += 1\nprint(t)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nleft = n - 1\r\nright = n - 1\r\nans = 0\r\nfor i in range(n-1, -1, -1):\r\n \r\n right = i\r\n if left == right:\r\n ans += 1\r\n left = min(left, right - l[i] - 1)\r\n \r\n \r\n\r\nprint(ans)", "n = int(input())\r\nA = input().split()\r\nA = [int(i) for i in A]\r\nA.reverse()\r\nalive = n\r\nkill = -1\r\nfor i in range (0,n):\r\n if i <= kill:\r\n alive -= 1\r\n else:\r\n g=0\r\n kill = max(kill, i+A[i])\r\nprint (alive)", "n = int(input())\nL = list(map(int, input().split()))\n\nimos = [0]*(n+1)\nfor i, l in enumerate(L):\n imos[max(i-l, 0)] += 1\n imos[i] -= 1\nfrom itertools import accumulate\nimos = list(accumulate(imos))\n#print(imos)\ncnt = 0\nfor i in range(n):\n if imos[i] > 0:\n cnt += 1\nprint(n-cnt)\n", "a=int(input())\r\nz=list(map(int,input().split()))\r\nz=z[::-1]\r\nl=0\r\nr=0\r\ncount=0\r\n\r\nwhile(l<=r and r<len(z)):\r\n \r\n if(l==r):\r\n \r\n if(r+z[l]+1<len(z)):\r\n count+=z[l]\r\n r+=z[l]+1\r\n else:\r\n count+=len(z)-r-1\r\n r=len(z)\r\n l+=1\r\n else:\r\n if(z[l]<r-l):\r\n l+=1\r\n else:\r\n if(r+(z[l]-(r-l-1))<len(z)):\r\n \r\n count+=z[l]-(r-l-1)\r\n r+=z[l]-(r-l-1)\r\n else:\r\n count+=len(z)-r\r\n r=len(z)\r\n l+=1\r\nprint(len(z)-count)\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\ncnt, j = 0, n\r\nfor i in range(n - 1, -1, -1):\r\n if j > i:\r\n cnt += 1\r\n j = min(j, i - a[i])\r\nprint(cnt)", "from sys import stdin\ninput = stdin.readline\n\ndef answer():\n\n killed = [0] * (n + 1)\n for i in range(n):\n\n killed[i] += 1\n killed[max(0 , i - a[i])] -= 1\n\n for i in range(n - 1 , -1 , -1):\n killed[i] += killed[i + 1]\n\n ans = 0\n for i in range(n):\n\n if(killed[i] == 0):ans += 1\n \n return ans\n\n \nfor T in range(1):\n\n n = int(input())\n a = list(map(int,input().split()))\n\n\n print(answer())\n\n\n\n \n\n \t\t \t\t\t\t\t \t\t \t\t \t", "if __name__ == \"__main__\":\n n = int(input())\n l = list(map(int, input().split()))\n\n j = n - 1\n soma_total = 0\n\n for i in range(n - 1, -1, -1):\n soma_atual = max(min(0, max(0, i - j) - l[i]), -j, -i)\n j = min(j + soma_atual, i + soma_atual)\n soma_total += abs(soma_atual)\n print(n - soma_total)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx,ans=n,0\r\nfor i in range(n-1,-1,-1):\r\n if x >i:\r\n ans += 1\r\n x = min(x,i-a[i])\r\nprint(ans)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ncnt=0 \r\neff=n \r\nfor i in range(n-1,-1,-1):\r\n # print(eff)\r\n if i<eff:\r\n # print(i)\r\n cnt+=1 \r\n eff=min(eff,i-a[i])\r\nprint(cnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*(n+3)\r\nd=0\r\n\r\nfor i in range(1,n):\r\n if a[i]==0:\r\n continue\r\n b[max(0,i-a[i])]+=1\r\n b[i]-=1\r\nfor i in range(0,n):\r\n b[i]=b[i-1]+b[i]\r\n if b[i]>0:\r\n d+=1\r\nprint(n-d)", "def main():\n\tN = int(input())\n\tR = [int(i) for i in input().split()]\n\tR.reverse()\n\tclaw = 0\n\talive = N\n\tfor i in range(N):\n\t\tif claw != 0:\n\t\t\talive -= 1\n\t\tclaw = max(claw - 1, R[i])\n\tprint(alive)\n\n\nmain()\n\n# 1511542721870\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 4 13:41:35 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = [0]*n\r\n\r\nfor i in range(n):\r\n a = l[i]\r\n if i -l[i] <0:\r\n d[0] += 1\r\n else:\r\n d[i-l[i]] += 1\r\n d[i]-=1\r\narr = [d[0]]\r\nfor j in range(1,n):\r\n arr.append(arr[j-1]+d[j])\r\nans = 0\r\nfor i in range(n):\r\n if arr[i] ==0:\r\n ans+=1\r\nprint(ans)", "n = int(input())\nx = list(map(int, input().split()))\npointer = 1\nans = n\nfor i in range(1, n + 1):\n if x[-i] + i >= pointer:\n if i < pointer:\n ans -= 1\n pointer = x[-i] + i + 1\n else:\n ans -= 1\nprint(ans)\n", "n = int(input())\nclaws = list(map(int, input().split()))\nc = 0\nr = n\nfor claw in reversed(claws):\n if c > 0:\n r -= 1\n c = max(c - 1, claw)\nprint(r)\n", "s = int(input())\r\nx = input().split()\r\nans = 0\r\npos1 = s\r\npos2 = s - 1\r\nwhile pos2 > -1:\r\n if pos2 < pos1:\r\n ans += 1\r\n if pos2 - int(x[pos2]) < pos1:\r\n pos1 = pos2 - int(x[pos2])\r\n pos2 -= 1\r\nprint(ans)\r\n", "#892B\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nt = n\r\nans = 0\r\nfor i in range(n-1,-1,-1):\r\n if t >i:\r\n ans += 1\r\n t = min(t,i-a[i])\r\nprint(ans)\r\n", "def main():\r\n\tn = int(input())\r\n\tL = [int(y) for y in input().split()]\r\n\tsolver(n, L)\r\n\r\ndef solver(n, L):\r\n\tL.reverse()\r\n\tresult = 0\r\n\tj = 0\r\n\tfor i in range(n):\r\n\t\tif j == i:\r\n\t\t\tresult += 1\r\n\t\tj = max(j, i + L[i] + 1)\r\n\t\tif j >= n:\r\n\t\t\tbreak\r\n\tprint(result)\r\n\r\nmain()\r\n# solver(4, [0, 1, 0, 10])\r\n# solver(2, [0, 0])", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nalive = 1\r\nlastKill = n\r\ni = n\r\n\r\nwhile i > 0:\r\n if i < lastKill:\r\n alive+=1\r\n \r\n if lastKill > 0 and l[i-1] > 0 and lastKill > i - l[i-1]:\r\n lastKill = i - l[i-1]\r\n\r\n i-=1\r\n\r\nprint(alive)\r\n", "n = int(input())\r\nL = [int(i) for i in input().split()]\r\npomoika = 0\r\nl = n\r\nfor i in range(n - 1, 0, -1):\r\n nl = max(i - L[i], 0)\r\n if l > nl:\r\n if i < l:\r\n pomoika += i - nl\r\n else:\r\n pomoika += l - nl\r\n l = nl\r\n if l <= 0:\r\n break\r\nprint(n - pomoika)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nlast = float(\"inf\")\r\nans = 0\r\nfor i in range(n-1,-1,-1):\r\n if i<last:\r\n ans +=1\r\n last = i-arr[i]\r\n else:\r\n last = min(i-arr[i],last)\r\nprint(ans)", "n=int(input())\na=list(map(int,input().split()))\nb=0\nif n==1:\n print(1)\nelse:\n ans=0\n for i in range(n-1,-1,-1):\n if b==0:\n ans+=1\n #print(b,'b',b-1,'b-1',a[i],'a[i]',i,'i')\n b=max(b-1,a[i],0)\n #print('b',b)\n print(ans)\n\n\t \t \t\t \t\t \t \t \t\t \t\t \t\t\t \t\t\t\t", "input()\narr = list(map(int, input().split()))[::-1] \nn=0\na=0\nfor i in arr:\n #print(a, end=' ')\n if a == 0:\n n+=1\n #print('!', end=' ')\n if i == a == 0:\n a=0\n elif i >= a:\n #print(i, end=' ')\n a = i\n else:\n a-=1\n #print('\\n')\nprint(n)", "n = int(input())\r\npeoples = [int(i) for i in input().split()]\r\ntotal = n\r\nmax_len = 0\r\nfor i in range(1,n+1):\r\n if(max_len != 0):\r\n max_len -= 1\r\n total -= 1\r\n if(peoples[-i] != 0 and peoples[-i] > max_len):\r\n max_len = peoples[-i]\r\n \r\n\r\nprint(total)", "n = int(input())\r\na = list(map(int, input().split()))\r\nj = n - 1\r\ncount = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n j = min(i, j)\r\n last_pos_kill = max(0, i - a[i])\r\n\r\n if j > last_pos_kill:\r\n count += (j - last_pos_kill)\r\n j = last_pos_kill\r\n\r\nprint(n - count)", "input()\na = list(map(int, input().split()))\nb = 0\nif len(a) == 1:\n print(1)\nelse:\n total = 0\n for i in range(len(a)-1, -1, -1):\n if b == 0:\n total += 1\n b = max(b-1, a[i], 0)\n print(total)\n\t\t \t \t\t\t \t\t \t \t \t\t \t", "x=int(input())\r\ny=list(map(int,input().split()))\r\ny.reverse()\r\nalive=0\r\nclaw=0\r\nfor i in range (x):\r\n if claw == 0 :\r\n alive=alive+1\r\n claw=y[i]\r\n\r\n\r\n\r\n elif claw != 0 :\r\n claw=claw-1\r\n if y[i] > claw :\r\n \r\n claw=y[i]\r\nprint(alive)\r\n\r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nj = n - 1\r\n\r\nfor i in range(n - 1, -1, -1):\r\n j = min(j, i)\r\n last_kill_pos = max(0, i - a[i])\r\n\r\n if j > last_kill_pos:\r\n count += (j - last_kill_pos)\r\n j = last_kill_pos\r\n \r\nprint(n - count)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nv=[True]*n\r\ncnt=arr[-1]\r\nfor i in range(n-2,-1,-1):\r\n if cnt>=1:\r\n v[i]=False\r\n cnt-=1\r\n cnt=max(cnt,arr[i])\r\nprint(v.count(True))", "n = int(input())\r\narr = [int(l) for l in input(\"\").split()]\r\n\r\n# n = 10\r\n# arr = [1, 1, 3, 0, 0, 0, 2, 1, 0, 3]\r\n\r\n# n = 2\r\n# arr = [0, 0]\r\n\r\n# n = 4\r\n# arr = [0, 1, 0, 10]\r\n\r\n# n = 8\r\n# arr = [0,0,0,1,0,0,1,2]\r\n\r\nans = 1\r\n\r\nfor i in reversed(range(1, n)):\r\n arr[i - 1] = max(arr[i] - 1, arr[i - 1])\r\n\r\n# print(arr)\r\nfor i in range(n - 1):\r\n if arr[i + 1] == 0:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = n\r\nfor i in range(n - 1, -1, -1):\r\n if a <= i:\r\n n -= 1\r\n a = min(a, i - l[i])\r\nprint(n)", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nl1=[-1 for _ in range(n)]\r\nfor i in range(0,n):\r\n\tif ((i-l[i])<0):\r\n\t\tl1[0]=l1[0]+1\r\n\telse:\r\n\t\tl1[i-l[i]]=l1[i-l[i]]+1\r\nl2=[0 for o in range(n)]\r\nl2[0]=l1[0]\r\nfor j in range(1,n):\r\n\tl2[j]=l2[j-1]+l1[j]\r\ncount=0\r\nfor j in range(n):\r\n\tif (l2[j]==0):\r\n\t\tcount=count+1\r\nprint (count)\r\n\r\n", "def minSubSeq(seq, n):\r\n left = right = n - 1\r\n count = 0\r\n while left >= 0:\r\n if right == left:\r\n count += 1\r\n if right - left <= seq[right]:\r\n left = right - seq[right] - 1\r\n right -= 1\r\n return count\r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n print(minSubSeq(l, n))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nL = [int(i) for i in input().split()]\r\n\r\nj = n - 1\r\nx = j - L[j]\r\ni = j\r\nvivos = n\r\nwhile i>0:\r\n i -= 1\r\n if x > j - L[j]: x = j - L[j]\r\n if x <= i: vivos -= 1\r\n j-=1\r\n\r\nprint(vivos)\r\n", "N =int(input())\r\nL = [int (x) for x in input().split()]\r\n\r\nsurvivors = [1]*len(L)\r\nfor i in range(len(L)-1,-1,-1):\r\n length = L[i]\r\n if i-length<=0:\r\n for j in range(0,i):\r\n survivors[j]=-1\r\n break\r\n else:\r\n for j in range(i-length,i):\r\n if survivors[j]==-1:break\r\n survivors[j]=-1\r\ncnt = 0\r\nfor i in survivors:\r\n if i==1:\r\n cnt+=1\r\nprint(cnt)\r\n\r\n", "n = int(input())\na = [int(x) for x in input().split()]\na.reverse()\nk = 0\nans = n\nfor i in range(n):\n if k > 0:\n ans -= 1\n k -= 1\n k = max(k, a[i])\nprint(ans)\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\nt,=[1]\r\nfor _ in range(t):\r\n\tn, = I()\r\n\tan = 0\r\n\tl = I();reach = n\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tif i<reach:\r\n\t\t\tan+=1\r\n\t\treach = min(reach,i-l[i])\r\n\tprint(an)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nalive = 0\r\nfarthest = n\r\nfor i in range(n - 1, -1, -1):\r\n if i < farthest:\r\n alive += 1\r\n farthest = min(i - arr[i], farthest)\r\n\r\nprint(alive)", "n = int(input())\r\n*L, = map(int, input().split())\r\ncount = 0\r\nx = n\r\nfor i in range(n-1, -1, -1):\r\n if i < x:\r\n count += 1\r\n x = min(x, i-L[i])\r\nprint(count)\r\n'''\r\n10\r\n\r\n1 2 3 4 5 6 7 8 9 10\r\n1 1 3 0 0 0 2 1 0 3\r\n\r\n\r\n\r\n'''\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nstartPos = lastPos = n\r\nkilledPeople = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if L[i] >= i:\r\n if i >= lastPos and i <= startPos:\r\n killedPeople += lastPos\r\n else:\r\n killedPeople += i\r\n break\r\n if i >= lastPos and i <= startPos and i - L[i] < lastPos:\r\n killedPeople += lastPos - (i - L[i])\r\n lastPos = i - L[i]\r\n startPos = i\r\n elif i < lastPos:\r\n if L[i] != 0:\r\n killedPeople += L[i]\r\n startPos = i - 1\r\n lastPos = i - L[i]\r\n\r\nprint(n - killedPeople)", "n = int(input())\r\np = [int(i) for i in input().split()][::-1]\r\na = {}\r\ni = 0\r\nwhile i < n-1:\r\n next_i = i+1\r\n coverage = i+p[i]\r\n if p[i] > 0:\r\n for j in range(i+1, min(n, i+1+p[i])):\r\n if j+p[j] >= coverage:\r\n coverage =j+p[j]\r\n next_i = j\r\n a[j] = 1\r\n i = next_i\r\nprint(n - len(a.keys()))", "def solve(L, n):\r\n check = []\r\n for i in range(n):\r\n L[i] = int(L[i])\r\n check.append(-1)\r\n for i in range(n):\r\n check[max(0, i - L[i])] += 1\r\n for i in range(1, n):\r\n check[i] += check[i - 1]\r\n\r\n count = 0\r\n for i in range(n):\r\n if (check[i] == 0):\r\n count += 1\r\n return count\r\n \r\nn = int(input())\r\nL = input()\r\nL = L.split(\" \")\r\nprint(solve(L, n))", "n=int(input())\r\ns=[int(c) for c in input().split()]\r\ns.reverse()\r\nsums=[0]*n\r\nans=1\r\nfor i in range(n-1):\r\n sums[i+1]+=1\r\n if i+1+s[i]<n:\r\n sums[i+s[i]+1]-=1\r\nfor i in range(1,n):\r\n sums[i]+=sums[i-1]\r\n if sums[i]<=0:\r\n ans+=1\r\nprint(ans)", "n = int( input() )\r\n\r\na = list( map( int, input().split() ) )\r\n#print( a )\r\n\r\nans = 0\r\nlast = n+1\r\n\r\nfor i in range( n-1, -1, -1 ):\r\n\r\n if i < last:\r\n ans += 1\r\n last = min( last, i-a[i] )\r\n #print( last )\r\n\r\nprint( ans )\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc = []\r\n\r\nc.append(0)\r\nfor i in range(1, n):\r\n while len(c) != 0 and c[-1] >= i - l[i]:\r\n c.pop(-1)\r\n c.append(i)\r\n\r\nprint(len(c))\r\n", "n = int(input())\r\n\r\nl1 = list( map(int, input().split()))\r\n\r\nans = n\r\nleft = n-1\r\nright = n-1\r\n\r\nfor i in range(n-1, -1, -1):\r\n\r\n right = min(left, i)\r\n left = min( left, max(0, i-l1[i]))\r\n ans = ans - (right - left)\r\n\r\nprint(ans)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n t = list(map(int, input().split()))\r\n a = [0] * n\r\n for i in range(n):\r\n a[max(0, i - t[i])] += 1\r\n a[i] -= 1\r\n \r\n res = 0\r\n for i in range(n):\r\n if i > 0:\r\n a[i] += a[i - 1]\r\n if a[i] == 0:\r\n res += 1\r\n \r\n print(res)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nl = 100000000000\r\n\r\nans = n\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if i >= l:\r\n ans -= 1\r\n l = min(l, i - a[i])\r\n\r\nprint(ans)", "n = int(input())\r\nL = list(map(int, input().split()))\r\nN = 10 ** 6 + 5\r\nrec = [0] * N\r\nL = L[::-1]\r\nfor i in range(n):\r\n if L[i] != 0:\r\n rec[i + 1] += 1\r\n rec[min(i + L[i] + 1, N - 1)] -= 1\r\n\r\nfor i in range(1, n):\r\n rec[i] = rec[i] + rec[i - 1]\r\n\r\nnum = 0\r\nfor i in range(n):\r\n if rec[i] == 0:\r\n num += 1\r\n\r\nprint(num)\r\n\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\nmax_claw = 0\r\nalive_count = 1\r\n\r\nfor i in range(n-1, -1, -1):\r\n max_claw = max(max_claw, l[i])\r\n if max_claw == 0 and i > 0:\r\n alive_count += 1\r\n else:\r\n max_claw -= 1\r\n\r\nprint(alive_count)", "n = int(input())\nl = list(map(int, input().split()))\nl.reverse()\n\nalives = 0\npointer = 0\n\nfor i in range(n):\n\tif pointer >= i :\n\t\tpointer = max(pointer,min(i+l[i],n-1))\n\telse :\n\t\talives += 1\n\t\tpointer = i+l[i]\n\nprint(alives+1)\n#1 1 3 0 0 0 2 1 0 3\n#3 0 1 2 0 0 0 3 1 1\n#1 *\n\n \n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nm.reverse()\r\nx=0\r\nk=0\r\nfor i in range(n):\r\n if x>0:\r\n k+=1\r\n x-=1\r\n x = max(x, m[i])\r\nprint(n-k)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\nalive = 0\r\nss = n-1\r\n\r\nfor i in range(n-1, -1, -1):\r\n if i == ss:\r\n alive += 1\r\n ss = min(ss, i-l[i]-1) if l[i] != 0 else min(ss, i-1)\r\nprint(alive)", "n = int(input())\r\nL = list(map(int,input().split()))\r\n\r\nalive = [1] * n\r\nmark = n - 1\r\nkills = min(L[mark],n-1)\r\n\r\nwhile mark>=0:\r\n if mark - mark + 1<=kills:\r\n alive[mark-1] = 0\r\n mark -= 1\r\n kills -= 1\r\n kills = max(kills,min(mark,L[mark]))\r\n\r\nprint(alive.count(1))", "n = int(input())\r\na = list(map(int, input().split()))\r\nkill = 0\r\nminus = 0\r\ns = []\r\nfor i in range(n - 1, -1, -1):\r\n if kill > 0:\r\n kill -= 1;\r\n minus += 1;\r\n kill = max(kill, a[i])\r\nprint(n - minus)", "n = int(input())\nR = lambda:map(int , input().split())\n\np = list(R())[::-1]\nalive = 0 \ndie = 0 \n\nfor i in p :\n if die == 0 :\n alive+=1\n \n if i >= die:\n die = i \n else:\n die-=1\n \nprint(alive)", "def main():\n n, l, r = int(input()), list(map(int, input().split())), 0\n for i in range(n - 1, -1, -1):\n if i < n:\n r += 1\n j = i - l[i]\n if n > j:\n n = j\n print(r)\n\n\nif __name__ == '__main__':\n main()\n", "def solve():\r\n a=int(input())\r\n b=list(map(int,input().split()))\r\n \r\n k=a+15\r\n survive=0\r\n for i in range(a-1,-1,-1):\r\n if i<k:\r\n survive+=1\r\n k=min(k,i-b[i])\r\n print(survive)\r\nsolve()", "# PRE-TEST\nn = int (input())\nlst = list (map (int, input().split()))\n\nsafe = n - 1 # index of last soldier whose living status is unknown\nalive = 0 # number of confirmed living soldiers\n\n# process in reverse order\nfor i in range (n - 1, -1, -1):\n if (i == safe): # if we reach a safe person, they were not killed by those behind\n alive += 1\n safe -= 1\n \n # soldier i kills up to i - lst[i], so i - lst[i] - 1 is not stabbed by i and may be safe\n safe = min (safe, i - lst[i] - 1)\n\nprint (alive)\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\n\r\nv = []\r\nfor i in range(n):\r\n while (len(v) != 0) and (v[-1] >= i - a[i]):\r\n v.pop()\r\n v.append(i)\r\nans = len(v)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nm = 10000000000\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if m <= i: ans += 1\r\n m = min(m, i - L[i])\r\nprint(n - ans)", "n = int(input())\nlst = list(map(int,input().split()))\nalive = 0\nk = n-1\nfor i in range(n-1, -1, -1):\n if k >= i:\n alive += 1\n k = min(k, i - lst[i] - 1)\nprint(alive)\n \t\t \t \t\t\t \t\t\t\t \t \t\t \t \t\t", "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nres = 1\r\nL = l[-1]\r\n\r\nfor i in range(n-2, -1, -1):\r\n if L <= 0:\r\n res+=1\r\n\r\n L = max(L - 1, l[i])\r\n\r\nprint(res)", "def solve():\r\n from array import array\r\n n=int(input())\r\n L=array('L',map(int,input().split()))\r\n \r\n kill=n+15\r\n survive=0\r\n for i in range(n-1,-1,-1):\r\n if i<kill:\r\n survive+=1\r\n if i-L[i]<kill:\r\n kill=i-L[i]\r\n print(survive)\r\nsolve()\r\n", "def list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\nL = list_input()\r\n\r\ns = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n j = i-L[i] # j >= i-L[i] and j < i \r\n j = max(0, j)\r\n if j < i:\r\n s[j] -= 1\r\n s[i] += 1\r\nt = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n t[i+1] = t[i]+s[i]\r\nres = 0\r\nfor i in range(1, n+1):\r\n if t[i] == 0:\r\n res += 1\r\n#print(t)\r\nprint(res)", "N = int(input())\r\nnums = list(map(int, input().split()))\r\nclaw = 0\r\nans = 0\r\nfor n in nums[::-1]:\r\n if claw == 0:\r\n ans += 1\r\n claw = n\r\n else:\r\n claw = max(claw - 1, n)\r\nprint(ans)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nnos=2390482034234\r\nans=1\r\nfor i in range(n-1,-1,-1):\r\n if(i<nos and nos!=2390482034234):\r\n ans+=1\r\n nos=min(nos,i-l[i])\r\nprint(ans)", "# -*- 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/17 22:40\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nC = [int(x) for x in input().split()]\r\n\r\n# N = 10**6\r\n# C = [random.randint(1, 10**9) for _ in range(N)]\r\n#\r\n# t0 = time.time()\r\n\r\n\r\nans = 0\r\np = N\r\nfor i in range(N-1, -1, -1):\r\n # i-C[i], i-1\r\n if C[i] > 0 and p >= i-C[i]:\r\n # dead.append([max(i-C[i], 0), i-1])\r\n l, r = max(i-C[i], 0), i-1\r\n p = min(p, r)\r\n ans += max(p+1-l, 0)\r\n p = min(l-1, p)\r\n\r\n if l == 0:\r\n break\r\n\r\nprint(N - ans)\r\n\r\n\r\n#\r\n# print(time.time() - t0)\r\n\r\n\r\n\r\n\r\n", "test = 1\r\n#test = int(input())\r\nfor _ in range(test):\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n x = 1\r\n k = n-1 - l[n-1]\r\n ind = n-2\r\n while ind >= 0:\r\n if k > ind:\r\n x+=1\r\n k = min(k,ind-l[ind])\r\n ind-=1\r\n print(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 ", "n=int(input())\r\narr= list(map(int, input().rstrip().split()))\r\nbrr=[0]*n \r\n\r\nfor i in range(n-2,-1,-1):\r\n brr[i]=max(brr[i+1]-1,arr[i+1])\r\nprint(brr.count(0))", "#!/usr/bin/env python3\n\nn = int(input())\nL = list(map(int,input().split()))\ncpt = 0\na = n-1\nfor i in range(n-1,-1,-1):\n if a>=i:\n cpt += 1\n a = min(a,i-L[i]-1)\nprint(cpt)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nstart = (n-1)-a[n-1]\r\nl = 1\r\nfor i in range(n-2,-1,-1):\r\n if start>i:\r\n l+=1\r\n start = i-a[i]\r\n else:\r\n if start>i-a[i]:\r\n start = i-a[i]\r\nprint(l)", "#! /usr/bin/env python3\n'''\nAuthor: krishna\nCreated: Mon Jan 8 21:43:50 2018 IST\nFile Name: 892b.py\nUSAGE:\n 892b.py\nDescription:\n\n'''\nimport sys, os\n\n\ndef main():\n '''\n The Main\n '''\n n = sys.stdin.readline()\n arr = list(reversed(list((map(int, sys.stdin.readline().split())))))\n\n sol = [1] * len(arr)\n ptr = 1\n\n for i in range(len(arr)):\n for j in range(max(i+1, ptr), min(len(arr), 1+i+arr[i])):\n sol[j] = 0\n ptr += 1\n\n print(sum(sol))\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nkill_pos_min = []\r\nfor i in range(n):\r\n kill_pos_min.append(i-l[i])\r\n\r\ncnt=1\r\nmin_pos = 999999999999\r\nfor i in range(n-1,-1,-1):\r\n if (kill_pos_min[i]<min_pos):\r\n min_pos = kill_pos_min[i]\r\n else: \r\n kill_pos_min[i] = min_pos\r\n\r\nfor i in range(n-1):\r\n if (i<kill_pos_min[i+1]):\r\n cnt+=1 \r\n#print(kill_pos_min)\r\nprint(cnt)", "n = int(input())\r\nlinha = list(map(int, input().split()))\r\nvivos = 0\r\nvivo = n-1\r\nfor i in range(n-1,-1,-1):\r\n garra = linha[i]\r\n if i<=vivo:\r\n vivos+=1\r\n if garra>0:\r\n if i-garra-1<vivo:\r\n vivo = i-garra-1\r\n\r\n\r\nprint(vivos)", "n = int(input())\r\nL = input()\r\nL = L.split(' ')\r\n\r\ncount = 1\r\nkill = 0\r\ni = n-1\r\nwhile i > 0:\r\n if int(L[i]) > kill:\r\n kill = int(L[i])\r\n if kill == 0:\r\n count += 1\r\n kill -= 1\r\n i -= 1\r\n\r\nprint(count)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if n>i:\r\n ans += 1\r\n n = min(n, i - l[i])\r\nprint(ans)\r\n ", "import io\r\n\r\nnancy = int(input())\r\nlima = list(map(int, input().split()))\r\ncounter = 0\r\nlast = 0\r\nfor i in range(len(lima)-1, -1, -1):\r\n if(last == 0):\r\n counter += 1\r\n lima[i] = max(lima[i], last-1)\r\n last = lima[i]\r\n \r\nprint(counter)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmark = [0] * (10**6 + 1)\r\n\r\nfor i in range(n):\r\n left = max(0, i + 1 - a[i])\r\n mark[left] += 1\r\n mark[i + 1] -= 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n mark[i + 1] += mark[i]\r\n res += (mark[i + 1] == 0)\r\n\r\nprint(res)", "n=int(input())\r\nll=list(map(int,input().split()))\r\nif n==1:\r\n print(1)\r\nelse:\r\n i=n-1\r\n k=0\r\n r=0\r\n while i>0:\r\n k=max(k,ll[i])\r\n if k>0:\r\n r+=1\r\n k-=1\r\n i-=1\r\n print(n-r)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nl = n - 1\r\nres = n + 1\r\nfor i in range(n- 1, -1, -1):\r\n if i >= l : res -= 1\r\n l = min(l, i - a[i])\r\n\r\nprint(res)", "input()\r\nalive = danger = 0\r\n\r\nfor L in reversed(list(map(int, input().split()))):\r\n alive += danger==0\r\n danger = max(danger-1, L)\r\n\r\nprint(alive)", "\r\n\r\nwhile True:\r\n try:\r\n n = int(input());\r\n except:\r\n break;\r\n\r\n a = [int(x) for x in input().split()];\r\n lenth = len(a);\r\n ans = 0;\r\n res = 0;\r\n for i in range(lenth-1,-1,-1):\r\n if res<=0:\r\n ans+=1;\r\n res=a[i];\r\n else:\r\n res-=1;\r\n if res<a[i]:\r\n res = a[i];\r\n print(ans);", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nkilled=n\r\nnot_killed=0\r\nfor i in range(n-1,-1,-1):\r\n if i<killed:\r\n not_killed+=1\r\n killed=min(killed,i-arr[i])\r\nprint(not_killed)", "def main():\r\n n = get_int()\r\n claws = get_list_int()\r\n\r\n alive_mark = n - 1\r\n alive = 0\r\n\r\n for i in range(n - 1, -1, -1):\r\n if i == alive_mark:\r\n alive += 1\r\n\r\n claw = claws[i]\r\n alive_mark = min(alive_mark, i - claw - 1)\r\n\r\n print(alive)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ncur = 0\r\na = [int(i) for i in input().split()]\r\ntokill = 0\r\nfor i in range(n-1, -1, -1):\r\n\tif tokill>0:\r\n\t\tn-=1\r\n\t\ttokill-=1\r\n\ttokill=max(tokill, a[i])\r\nprint(n)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmn = float(\"inf\")\r\ni = len(a)-1\r\nans = 0\r\nwhile i >= 0:\r\n if i < mn:\r\n ans += 1\r\n mn = min(i-a[i], mn)\r\n i -= 1\r\nprint(ans)\r\n", "input()\nm=list(map(int, input().split()))\nn=0\nif len(m)==1:\n print(1)\nelse:\n t=0\n for i in range(len(m)-1, -1, -1):\n if n==0:\n t+=1\n n=max(n-1, m[i], 0)\n print(t)\n\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\nanswer = 0\r\ncurrent_person = n - 1\r\nlast_person_alive = n - 1\r\nwhile last_person_alive >= 0 and current_person >= 0:\r\n if current_person <= last_person_alive:\r\n answer += 1\r\n last_person_alive = min(current_person - L[current_person] - 1, last_person_alive)\r\n current_person -= 1\r\nprint(answer)", "from collections import deque\r\n\r\na = input('')\r\nb = list(map(int, input('').strip().split()))\r\n\r\ndp = dict()\r\nfor i in range(len(b)):\r\n dp[i] = 1\r\nanswer = len(b)\r\nfor i in range(len(b) - 1, -1, -1):\r\n for j in range(max(0, i - b[i]), i):\r\n if j in dp:\r\n dp.pop(j)\r\n else:\r\n break\r\nprint(len(dp))", "n = int(input())\r\nlength = list(map(int, input().split()))\r\ni = n - 1\r\nj = n - 1\r\niter = 0\r\n\r\nwhile i >= 0 <= j:\r\n if i <= j:\r\n iter += 1\r\n j = i - 1 - length[i]\r\n if i - length[i] <= j:\r\n j = i - 1 - length[i]\r\n i -= 1\r\n\r\nprint(iter)\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nwill_die = 0\r\ni = n-1\r\nj = n-1\r\n\r\nwhile j > 0:\r\n while L[i] == 0 and i > 0:\r\n i -= 1\r\n j = i\r\n will_die = max(will_die, L[i])\r\n while will_die > 0 and j > 0:\r\n j -= 1\r\n n -= 1\r\n will_die = max(will_die-1, L[j])\r\n if will_die == 0: i = j\r\nprint(n)\r\n", "n = int(input())\r\nclaws = list(map(int, input().split()))\r\nmin_index = n\r\ncount = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if i < min_index:\r\n count += 1 # alive\r\n min_index = min(min_index, i - claws[i])\r\n\r\n\r\nprint(count)", "def solve(n,seq) :\r\n alive = n\r\n pointer = n-1\r\n alivePointer = n-2\r\n \r\n while pointer > 0 and alivePointer >= 0 :\r\n value = (pointer+1) - seq[pointer]\r\n \r\n if value <= 0 :\r\n value = 1\r\n \r\n value -= 1\r\n if alivePointer == pointer :\r\n alivePointer -= 1\r\n \r\n if alivePointer >= value :\r\n diff = alivePointer - value + 1\r\n alivePointer = value - 1\r\n alive -= diff\r\n \r\n pointer -= 1\r\n \r\n return alive\r\n \r\n \r\nn = int(input())\r\nseq = list(map(int,input().split()))\r\nprint (solve(n,seq))\r\n \r\n ", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans=0\r\nx = n\r\nfor i in range(n-1,-1,-1):\r\n if(i < x):\r\n ans+=1\r\n x = min(x,i-l[i])\r\nprint(ans)", "n = int(input())\r\nL = list(map(int , input().split()))\r\nmin_val = n + 1\r\nans = n\r\nfor i in range(n - 1 , -1 , -1):\r\n if i >= min_val:\r\n ans -= 1\r\n min_val = min(min_val , i - L[i])\r\nprint(ans)", "#!/bin/python3\r\nn = int(input())\r\nL = list(map(int, input().split()))\r\nL.reverse()\r\ncount, dead = 0, -1\r\nfor lol in range(n):\r\n\tif lol > dead:\r\n\t\tcount += 1\r\n\tif not (dead > (lol + L[lol])):\r\n\t\tdead = (lol + L[lol])\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n-1, -1, -1):\r\n if n > i:\r\n cnt += 1\r\n n = min(n, i-a[i])\r\nprint(cnt)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncnt = 0\r\nx = n\r\nfor i in range(n - 1, -1, -1):\r\n if i < x:\r\n cnt += 1\r\n x = min(x,i-l[i])\r\nprint(cnt)", "n = int(input())\r\nL = [int(i) for i in input().split()]\r\nallive = n - 1\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if allive == i:\r\n ans += 1\r\n allive = min(allive, i - L[i] - 1)\r\n # print(allive)\r\nprint(ans)", "def getCountPeopleLive(lstWrath,n):\r\n count = 0\r\n j = n - 1\r\n i = n - 1\r\n while i >= 0:\r\n j = min(j,i)\r\n lastKillPos = max(0,i - lstWrath[i])\r\n if j > lastKillPos:\r\n count += (j-lastKillPos)\r\n j = lastKillPos\r\n i -= 1\r\n return n - count\r\n\r\n \r\nn = int(input())\r\nlstWrath = list(map(int,input().split()))\r\nprint(getCountPeopleLive(lstWrath,n))", "input()\r\nx = z = 0\r\nfor i in [int(x) for x in input().split()][::-1]:\r\n z += x == 0\r\n x = max(x - 1, i)\r\nprint(z)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nx = [0] * n\r\nfor i in range(n):\r\n x[max(0, i - l[i])] += 1\r\n x[i] -= 1\r\nfor i in range(1, n):\r\n x[i] += x[i - 1]\r\nans = 0\r\nfor i in x:\r\n ans += min(i, 1) ^ 1\r\nprint(ans)", "n = int(input())\r\n# n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncurr = 0\r\nalive = 0\r\nfor i in range(len(l) - 1, -1, -1):\r\n x = l[i]\r\n if curr == 0:\r\n alive += 1\r\n else:\r\n curr -= 1\r\n curr = max(curr, x)\r\nprint(alive)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.reverse()\r\n\r\ndead = 0\r\nalive = 0\r\n\r\nfor p in l:\r\n if dead == 0:\r\n alive += 1\r\n dead = p\r\n else:\r\n dead = max(dead-1,p)\r\n \r\nprint(alive)\r\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\nL = list(map(int, stdin.readline().split()))\r\nwill_die = 0\r\ni = n-1\r\n\r\nwhile i > 0:\r\n while L[i] == 0 and i > 0:\r\n i -= 1\r\n\r\n will_die = max(will_die, L[i])\r\n while will_die > 0 and i > 0:\r\n i -= 1\r\n n -= 1\r\n will_die = max(will_die-1, L[i])\r\nstdout.write(str(n) + '\\n')\r\n", "n = int(input())\r\na = list(map(int, input().split(' '))) \r\n\r\nj = n - 2\r\ni = n - 1\r\nkilled = 0\r\nwhile i >= 0:\r\n\tif j > i - 1:\r\n\t\tj = i - 1\r\n\twhile j >= 0 and j >= i - a[i]:\r\n\t\tkilled += 1\r\n\t\tj -= 1\r\n\ti -= 1\r\nprint(n - killed)", "# -*-coding:utf-8-*-\n\nif __name__ == \"__main__\":\n n = int(input())\n a = list(map(int, input().split()))\n s = []\n for i, v in enumerate(a):\n if s:\n pre = i - v\n while s and s[-1] >= pre:\n s.pop()\n s.append(i)\n print(len(s))\n\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\nalive = n-1\r\nans = 0\r\n\r\nfor i in range(n-1, -1, -1):\r\n if (i <= alive):\r\n ans +=1\r\n alive = min(alive, i - a[i]-1)\r\nprint(ans)\r\n\r\n", "int(input())\npeople = [int(x) for x in input().split(' ')]\n\nalive = 0\nkill = 0\nfor i in people[::-1]:\n if kill == 0:\n alive += 1\n kill -= 1\n kill = max(i, kill)\n\nprint(alive)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nk=1;\r\nj=n-l[-1]\r\nfor i in range(2, n+1):\r\n\tif j>n-i+1 and l[-i+1]==0:\r\n\t\tk+=1\r\n\tj=min(j, n-i+1-l[-i])\r\nprint(k)", "n = int(input())\ns = list(map(int, input().split()))\nr = n\na = 0\nfor i in range(n-1,-1,-1):\n #print(i,r)\n if i<r:\n a+=1\n r = min(r,i-s[i])\n #print(a)\nprint(a)\n\n", "class CodeforcesTask892BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.claws = []\n\n def read_input(self):\n self.n = int(input())\n self.claws = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n kill = False\n living = 0\n kill_range = self.n + 1\n for x in range(self.n, 0, -1):\n if x < kill_range:\n kill = False\n if not kill:\n living += 1\n if self.claws[x - 1]:\n kill = True\n kill_range = min(kill_range, x - self.claws[x - 1])\n self.result = str(living)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask892BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\n\r\nclaws = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nj = n - 1\r\n\r\nfor i in range(n - 1, -1, -1):\r\n j = min(i, j)\r\n last_kill_pos = max(0, i-claws[i])\r\n\r\n if j > last_kill_pos:\r\n count += (j - last_kill_pos)\r\n j = last_kill_pos\r\nprint(n - count)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(n - 1, -1, -1):\r\n if i < n: k += 1\r\n n = min(n, i - l[i])\r\nprint(k)", "#Two Pointers\r\nn = int(input())\r\npeople = list(map(int, input().split()))\r\nalive = 1\r\nj = n\r\nfor i in range (n - 1, -1, -1):\r\n if (i == j):\r\n alive += 1\r\n j = min(j, i - people[i] - 1)\r\n if (j < 0):\r\n break\r\n\r\n\r\nprint (alive)\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nkilled = 0\r\nlast_killed = n\r\n\r\nfor i in range(n-1,-1,-1):\r\n cur_kill = max(0,i-l[i])\r\n if cur_kill >= last_killed:\r\n continue\r\n if i < last_killed:\r\n killed += i - cur_kill\r\n else:\r\n killed += last_killed - cur_kill\r\n if cur_kill == 0:\r\n break\r\n last_killed = min(last_killed,cur_kill)\r\n \r\nprint(n - killed)", "n=l=int(input())\r\na=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(n-1,-1,-1):\r\n if l>i: cnt+=1\r\n l=min(l,i-a[i])\r\nprint(cnt)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Dec 30 17:28:38 2017\n\n@author: apple\n\"\"\"\n\nn = int(input())\nL = [int(i) for i in input().split()]\n\nremaining_claw=0\ncount=0\nfor j in range(n):\n i=n-1-j\n if remaining_claw==0:\n count+=1\n remaining_claw-=1\n remaining_claw = max([ remaining_claw,L[i]] )\n\nprint(count)", "n = int(input())\r\n\r\na = list(map(int , input().split()))\r\n\r\nb = [0]*(n+1)\r\n\r\nfor i in range(n):\r\n b[i+1] = min(i+1 , a[i] + 1)\r\n\r\nans = 0\r\ncount = n\r\n\r\nfor i in range(n,0,-1):\r\n if count>=i:\r\n ans+=1\r\n\r\n count = min(count , i - b[i])\r\n\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.reverse()\r\nans = 0\r\nma = 0\r\nfor i in a:\r\n if ma == 0:\r\n ans += 1\r\n ma = max(i, ma - 1)\r\nprint(ans)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nans = 0\r\nm = n\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if i < m:\r\n ans += 1\r\n m = min(m, i - l[i])\r\nprint(ans)\r\n", "n=int(input())\na=list(map(int,input().split()))\nk=int(n-1)\nans=int(0)\nfor i in range(n-1,-1,-1):\n if i<=k:\n ans+=1\n if a[i]!=0:\n k=min(k,i-a[i]-1)\nprint(ans)\n\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\ncount=0\r\nfor i in range(n-1,-1,-1):\r\n count-=1\r\n if L[i]>count:\r\n if L[i]>i:\r\n n-=i\r\n break\r\n else:\r\n count = L[i]\r\n if count>0:\r\n n-=1\r\nprint(n)\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nalive = 1\r\nkIndex = n - 1\r\n\r\nfor i in range(n - 1, -1, -1):\r\n val = i - L[i]\r\n if i < kIndex:\r\n alive += 1\r\n if val < kIndex:\r\n kIndex = val\r\n\r\nprint(alive)\r\n", "#!/bin/python3\n\nimport random, math, sys, os, re\n\nif __name__ == '__main__':\n\tn = int(input())\n\tL = [2]\n\tans = 1\n\tfor index, element in enumerate(map(int, input().split()), 1):\n\t\twhile ans and L[-1] >= index - element:\n\t\t\tL.pop()\n\t\t\tans -= 1\n\t\tL.append(index)\n\t\tans += 1\n\tprint(ans)", "n = int(input())\nl = list(map(int, input().split()))\n\ncount = 0\nprev = 0\nfor i in range(len(l)-1, -1, -1):\n if(prev == 0):\n count += 1\n l[i] = max(l[i], prev-1)\n prev = l[i]\n\nprint(count)\n\n", "def func(l):\r\n l = list(map(int,l.split()))\r\n cover = [0 for i in range(len(l))]\r\n for idx,val in enumerate(l):\r\n start = max(idx-val,0)\r\n cover[start] += 1\r\n cover[idx] -= 1\r\n cumul = 0\r\n for i in range(len(cover)):\r\n cover[i] += cumul\r\n cumul = cover[i]\r\n return len([i for i in cover if i == 0])\r\n\r\ndef main():\r\n input()\r\n print(func(input()))\r\n\r\nmain()", "input()\r\n \r\nx=z=0\r\n \r\nfor i in[int(x)for x in input().split()][::-1]:\r\n \r\n z+=x==0\r\n \r\n x=max(x-1,i)\r\n \r\nprint(z)", "def read():\r\n\treturn list(map(int, input().split()))\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tl = read()\r\n\tlast = n\r\n\talive = 0\r\n\tfor i in range(n - 1, -1, -1):\r\n\t\tif l[i] > 0:\r\n\t\t\tif last <= 0:\r\n\t\t\t\tbreak\r\n\t\t\tif last <= i - l[i]:\r\n\t\t\t\tcontinue\r\n\t\t\telif last <= i:\r\n\t\t\t\tlast = i - l[i]\r\n\t\t\telse:\r\n\t\t\t\talive += last - i\r\n\t\t\t\tlast = i - l[i]\r\n\tif last > 0:\r\n\t\talive += last\r\n\treturn alive\r\n\r\n\r\nprint(main())", "n = int(input())\r\ns = input().split()\r\nL = []\r\nv = []\r\nfor x in s:\r\n L.append(int(x))\r\n v.append(0)\r\nm = 1e10\r\nfor i in range(n - 1, 0, -1):\r\n m = min(m, i - L[i])\r\n v[i] = m\r\nans = 1\r\nfor i in range(n - 1):\r\n if v[i + 1] > i:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\ncount=0\r\nc.append(1)\r\nfor i in range(1,n+1):\r\n b.append(i-a[i-1])\r\nm=b[-1]\r\nfor i in range(n-1,0,-1):\r\n c.append(m)\r\n if b[i-1]<m:\r\n m=b[i-1]\r\nd=c[::-1]\r\nfor i in range(n-2,-1,-1):\r\n if i+1>=d[i]:\r\n count+=1\r\nprint(n-count)\r\n \r\n \r\n ", "n = int(input())\r\nclaw = [int(i) for i in input().split()]\r\n\r\nalive = x = 0\r\nfor i in claw[::-1]:\r\n\talive+=x==0\r\n\tx = max(x-1, i)\r\nprint(alive)", "n = int(input())\r\narr = [0]+list(map(int,input().split()))\r\ncount = 0\r\nmini = n-arr[-1]\r\nfor i in range(-2,-n-1,-1):\r\n if n+1+i>=mini:\r\n count += 1\r\n if mini>n+1+i-arr[i]:\r\n mini = n+1+i-arr[i]\r\nprint(n-count)\r\n ", "import sys\r\nsys.setrecursionlimit(100000000)\r\n# def input(): return sys.stdin.readline()[:-1]\r\ndef iin(): return int(input())\r\ndef impin(): return map(int, input().split())\r\ndef irrin(): return [int(x) for x in input().split()]\r\ndef imrin(n): return [int(input()) for _ in range(n)]\r\n\r\n\r\nn = iin()\r\narr = irrin()\r\np = n\r\nc = 0\r\nfor i in range(n-1, -1, -1):\r\n if i<p:\r\n c += 1\r\n p = min(p, i-arr[i])\r\nprint(c)\r\n", "n = int(input())\narr = list(map(int, input().split(' ')))\n\ncurr_index = -1\nsaved = 0\nfor i in range(n-1, -1, -1):\n if curr_index == -1:\n saved += 1\n \n if (curr_index == -1 and arr[i] > 0) or i-arr[i] < curr_index:\n curr_index = max(i-arr[i], 0) # 1 1 3 can set curr_index = -1\n \n if curr_index == i:\n curr_index = -1\n\nprint(saved)\n", "n = int(input())\r\nl= list(map(int,input().split()))\r\ncount = 0\r\nmi =n-1 -l[n-1]\r\nfor i in range(n-1):\r\n\tif n-i-2 >= mi:\r\n\t\tcount+=1\r\n\tmi = min(mi, n-i -2 -l[n-i -2])\r\n#print(l)\r\nprint(n -count)", "n = int(input())\r\nL = [int(i) for i in input().split()]\r\nx = n-1-L[n-1]\r\ntotal = 1\r\nfor i in range(n-2, -1, -1):\r\n total += (x > i)\r\n x = min(x, i-L[i])\r\nprint(total)\r\n \r\n", "n = int(input()); l = [*map(int,input().split())]\r\nm = 10**10; cnt = 0\r\nfor i in range(len(l)-1,0,-1):\r\n m = min(i-l[i],m)\r\n if(i-1>=m): cnt += 1\r\nprint(n-cnt)" ]

[ "import fileinput\r\n\r\ns = ''\r\nfor line in fileinput.input():\r\n s += line.strip()\r\n\r\n#print(s)\r\n\r\nif s[0] == '<':\r\n s = s[1:]\r\nif s[-1] == '>':\r\n s = s[:-1]\r\n#print(s)\r\na = s.split('><')\r\n#print(a)\r\nans = []\r\nb = []\r\nfor i in a:\r\n if i == 'table':\r\n b.append(0)\r\n elif i == '/table':\r\n u = 0\r\n ans.append(b[-1])\r\n b.pop()\r\n elif i == 'td':\r\n b[-1] += 1\r\nans.sort()\r\nprint(*ans)", "import sys\r\nR=str.replace\r\ns=R(R(R(R(R(''.join(sys.stdin.readlines()),'\\n',''),'</tr>',''),'<tr>',''),'><',' '),'>','').split()[1:]\r\ndef f(k):\r\n\tr=0;a=[]\r\n\twhile s[0]!='/table':\r\n\t\tif s[0]=='table':\r\n\t\t\ts.pop(0);a+=f(k+1)\r\n\t\telse:r+=s[0]=='td';s.pop(0)\r\n\ts.pop(0)\r\n\treturn[r]+a\r\nprint(' '.join(map(str,sorted(f(1)))))", "import re\n\nlines = []\nwhile True:\n try:\n line = input()\n except EOFError:\n break\n lines.append(line.strip())\ntext = ''.join(lines)\n\ntext = re.sub('<table>', '(', text)\ntext = re.sub('</table>', ')', text)\ntext = re.sub('<td>', '.', text)\ntext = re.sub('[^().]', '', text)\n\nsizes = []\n\ndef parse(pos):\n count = 0\n while pos < len(text):\n ch = text[pos]\n if ch == '(':\n pos = parse(pos + 1)\n continue\n if ch == ')':\n sizes.append(count)\n return pos + 1\n count += 1\n pos += 1\n\nparse(0)\n\nprint(' '.join(map(str, sorted(sizes))))\n", "import sys\r\n\r\ndef solve():\r\n r = str(input())\r\n\r\n while r.count(\"<table>\") > r.count(\"</table>\") or r.count(\"<table>\") == 0:\r\n r += str(input())\r\n\r\n s = list(map(str, r.split(\"<\")))\r\n\r\n res = []\r\n stack = []\r\n\r\n for i in range(1, len(s)):\r\n if s[i] == \"table>\":\r\n stack += [0]\r\n elif s[i] == \"td>\":\r\n stack[-1] += 1\r\n elif s[i] == \"/table>\":\r\n res += [stack[-1]]\r\n del (stack[-1])\r\n\r\n res.sort()\r\n print(\" \".join(map(str, 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", "import re\r\n\r\nt,a=\"\",[]\r\n\r\ndef z(ind):\r\n c=0\r\n while ind<len(t):\r\n if t[ind]==\"(\":\r\n ind=z(ind+1)\r\n elif t[ind]==\")\":\r\n a.append(c)\r\n return ind+1\r\n else:\r\n ind+=1\r\n c+=1\r\n\r\nwhile True:\r\n try:\r\n s=input()\r\n except EOFError:\r\n break\r\n t+=s\r\nt=re.sub(\"<table>\",\"(\",t)\r\nt=re.sub(\"</table>\",\")\",t)\r\nt=re.sub(\"<td>\",\".\",t)\r\nt=re.sub(\"[^().]\",\"\",t)\r\n\r\nz(0)\r\na.sort()\r\nprint(*a)\r\n\r\n", "input_str = str(input())\r\n\r\nwhile input_str.count(\"<table>\") > input_str.count(\"</table>\") or input_str.count(\"<table>\") == 0:\r\n input_str += str(input())\r\n\r\nsplit_list = list(map(str, input_str.split(\"<\")))\r\n\r\nresult = []\r\nstack = []\r\n\r\nfor i in range(1, len(split_list)):\r\n if split_list[i] == \"table>\":\r\n stack += [0]\r\n elif split_list[i] == \"td>\":\r\n stack[-1] += 1\r\n elif split_list[i] == \"/table>\":\r\n result += [stack[-1]]\r\n del stack[-1]\r\n\r\nresult.sort()\r\nprint(\" \".join(map(str, result)))# 1689673002.1702056", "import sys\n\nhtml = ''.join([s.rstrip() for s in sys.stdin.readlines()])\n\nhtml = html.split('<')\ncurStack = []\nans = []\n\nfor token in html:\n if token == \"table>\":\n curStack.append(0)\n elif token == \"/table>\":\n ans.append(curStack.pop())\n elif token == \"/td>\":\n curStack[-1] += 1\n\nprint(*sorted(ans))\n\n" ]

[ "n, m = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\n\nA.sort()\n\nresult = []\n\ndef bb(A, num):\n ini = 0\n final = len(A) - 1\n \n while ini <= final:\n mid = (ini + final) // 2\n if A[mid] <= num:\n ini = mid + 1\n else:\n final = mid - 1\n return ini\n\nfor i in range(len(B)):\n count = bb(A, B[i])\n result.append(count)\n print(count, end=' ')\n\n \t\t \t \t\t\t \t\t\t \t\t \t\t", "l1, l2 = [int(x) for x in input().split(' ')]\na = [int(x) for x in input().split(' ')]\nb = [int(x) for x in input().split(' ')]\n\na = sorted(a)\n\ncounts = []\n\nfor el in b:\n left = -1\n right = len(a)\n while right-left > 1:\n middle = left + (right - left) // 2\n if a[middle] > el:\n right = middle\n else:\n left = middle\n counts.append(str(left+1))\n\nprint(' '.join(counts))\n\t \t \t \t \t \t\t\t \t\t \t\t\t", "from bisect import *\r\nI=lambda:map(int,input().split())\r\nI()\r\nl=sorted(I())\r\nfor e in I():print(bisect_right(l,e),end=' ')", "def lower_bound_binary_search(arr, x):\r\n l, r = 0, len(arr) - 1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if arr[mid] <= x:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n return r\r\n\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 a.sort()\r\n\r\n for element in b:\r\n index = lower_bound_binary_search(a, element)\r\n print(index + 1, end=\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import bisect\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na.sort()\r\nfor i in b:\r\n print(bisect.bisect(a,i),end=\" \")", "def lastidx(ar,k):\n l=0\n r=len(ar)-1\n ans=-1\n while(l<=r):\n m=l+(r-l)//2\n if( ar[m] == k):\n ans=m\n l=m+1\n elif(ar[m]<k):\n l=m+1\n ans=r\n else:\n r=m-1 \n ans=r\n return ans \n\n\n\n\nal,bl=map(int , input().split())\na=list(map(int , input().split()))\nb=list(map(int , input().split()))\na.sort()\nfor i in b:\n print(lastidx(a,i)+1, end=\" \")\n\n\t\t\t\t\t \t\t\t \t\t \t\t\t\t\t\t \t \t\t \t", "import bisect\r\n[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\na.sort()\r\nfor ele in b:\r\n i = bisect.bisect_right(a, ele)\r\n print(i, end = \" \")", "len_a, len_b = map(int, input().split(\" \"))\narr_a = sorted(list(map(int, input().split(\" \"))))\narr_b = list(map(int, input().split(\" \")))\n\ndef binary_search(array, number, left, right):\n mid = (left + right) // 2\n\n if array[mid] <= number:\n if array[mid + 1] > number:\n return mid + 1\n return binary_search(array, number, mid, right)\n else:\n if array[mid - 1] < number:\n return mid\n return binary_search(array, number, left, mid)\n\narr_a.sort()\nfor number in arr_b:\n if number < arr_a[0]:\n answer = 0\n elif number >= arr_a[-1]:\n answer = len_a\n else:\n answer = binary_search(arr_a, number, 0, len_a)\n\n print(answer, end=' ')\n \n", "def upper_bound(lista, x):\r\n l = 0\r\n r = len(lista) - 1\r\n m = 0\r\n\r\n while l <= r:\r\n m = (l + r) // 2\r\n if lista[m] > x:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n return l\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.sort()\r\n\r\nfor i in range(m):\r\n print(upper_bound(a, b[i])) \r\n\r\n", "def b_search(key, a, n):\n\tl, r = 0, n-1\n\twhile l<=r:\n\t\tm = int((l+r)/2)\n\t\tif key>=a[m]:\n\t\t\tl = m+1\n\t\telse:\n\t\t\tr = m-1\n\treturn r+1\n\t\t\t\n\t\t\t\n\nn, m = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\na.sort()\nl = []\nfor i in range(m):\n\tl.append(b_search(b[i], a, n))\n\t\nfor i in l:\n\tprint(i,end = \" \")\nprint()\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\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\nclass BIT1:\r\n \"\"\"单点修改,区间和查询\"\"\"\r\n\r\n __slots__ = \"size\", \"bit\", \"tree\"\r\n\r\n def __init__(self, n: int):\r\n self.size = n\r\n self.bit = n.bit_length()\r\n self.tree = dict()\r\n\r\n def add(self, index: int, delta: int) -> None:\r\n # index 必须大于0\r\n while index <= self.size:\r\n self.tree[index] = self.tree.get(index, 0) + delta\r\n index += index & -index\r\n\r\n def _query(self, index: int) -> int: \r\n #外部不要调用，这个不是单点值，是前缀和，查单点值还是用queryRange\r\n if index > self.size:\r\n index = self.size\r\n res = 0\r\n while index > 0:\r\n res += self.tree.get(index, 0)\r\n index -= index & -index\r\n return res\r\n\r\n def queryRange(self, left: int, right: int) -> int:\r\n return self._query(right) - self._query(left - 1)\r\n\r\n\r\nn,m=li()\r\narr=li()\r\nbrr=li()\r\narr.sort(reverse=True)\r\nres=[0]*m\r\nfor i,b in sorted(enumerate(brr),key=lambda x:x[1]):\r\n while arr and arr[-1]<=b:\r\n arr.pop()\r\n res[i]=n-len(arr)\r\nprint(\" \".join([str(i) for i in res]))\r\n ", "def binary_search(arr, target):\r\n left, right = 0, len(arr) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arr[mid] <= target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return left\r\n\r\ndef count_elements_less_or_equal(arr_a, arr_b):\r\n arr_a.sort() # Sort array a in non-decreasing order\r\n result = []\r\n\r\n for b in arr_b:\r\n count = binary_search(arr_a, b)\r\n result.append(count)\r\n\r\n return result\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\narr_a = list(map(int, input().split()))\r\narr_b = list(map(int, input().split()))\r\n\r\n# Calculate and print the result\r\nresult = count_elements_less_or_equal(arr_a, arr_b)\r\nprint(*result)\r\n", "import bisect\r\na,b = map(int,input().split())\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\narr1.sort()\r\n\r\nfor i in arr2:\r\n count=bisect.bisect_right(arr1,i)\r\n print(count,end=\" \")\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nlst = []\r\nfor i in range(m):\r\n lst.append([b[i], i, 0])\r\nlst.sort()\r\ni = 0\r\nj = 0\r\nwhile i < m:\r\n if a[j] <= lst[i][0]:\r\n lst[i][2] += 1\r\n j += 1\r\n if j >= n:\r\n for k in range(i+1, m):\r\n lst[k][2] = lst[i][2]\r\n break\r\n else:\r\n i += 1\r\n if i == m:\r\n break\r\n lst[i][2] = lst[i-1][2]\r\nfor i in range(m):\r\n lst[i][0] = lst[i][1]\r\nlst.sort()\r\nfor i in range(m):\r\n print(lst[i][2], end = ' ')", "from bisect import bisect_right\ninput()\nl = sorted(map(int, input().split()))\n[print(bisect_right(l, x),end=' ') for x in map(int, input().split())]\nprint()\n\t \t \t \t \t\t\t \t\t\t \t \t\t\t\t \t\t", "import bisect as bi\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\na.sort()\nres=[]\nfor i in b:\n\tres.append(bi.bisect(a,i))\n \nprint(*res) \n\t\t\t \t \t\t\t\t \t\t \t \t \t\t\t \t\t\t \t", "import bisect as b\nx,y=map(int,input().split())\nl1=list(map(int,input().split()))\nl1.sort()\nl2=list(map(int,input().split()))\nfor i in l2:\n print((b.bisect(l1,i)),end=\" \")\n \n \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\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\ndef b_search(arr,size,x):\r\n p=size\r\n low=0\r\n high=size-1\r\n while(low<=high):\r\n mid=low+(high-low)//2\r\n if arr[mid]<=x:\r\n low=mid+1\r\n else:\r\n p=mid\r\n high=mid-1\r\n return p\r\n\r\na.sort()\r\nfor i in b:\r\n r=b_search(a,n,i)\r\n print(r,end=\" \")\r\n", "from functools import lru_cache\r\nfrom collections import defaultdict, deque, Counter\r\nimport sys, bisect\r\n\r\ndef QueriesaboutLess(a, b):\r\n # TODO write an algorithm here\r\n a.sort()\r\n\r\n res = []\r\n for num in b:\r\n curr = bisect.bisect_right(a, num)\r\n res.append(curr)\r\n \r\n return res\r\n\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nprint(*QueriesaboutLess(a, b))\r\n", "import bisect as bi\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ncount=0 \r\na.sort()\r\nfor i in b:\r\n print(bi.bisect(a,i),end=\" \")", "def bins(arr,l,r,t):\r\n while l<=r:\r\n m=l+(r-l)//2\r\n if arr[m]>t:\r\n r=m-1\r\n else:\r\n l=m+1\r\n return r\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n print(bins(a,0,n-1,i)+1,end=' ')", "def search(arr, n, x):\n\tq = 0\n\th = n - 1\n\twhile(q <= h):\n\t\tmid = int((q + h) / 2)\n\t\tif(arr[mid] <= x):\n\t\t\tq = mid + 1\n\t\telse:\n\t\t\th = mid - 1\n\treturn h\nn,m=map(int,input().split())\nk=[int(x) for x in input().split()]\np=[int(x) for x in input().split()]\nk.sort()\nfor i in range(m):\n\ti=search(k,n,p[i])\n\tprint(i+1,end=\" \")\n\t\t\t\t\t \t\t\t \t\t\t\t\t\t \t \t\t \t \t\t", "from 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\na.sort()\r\n\r\npositions = list()\r\nfor x in b:\r\n pos = bisect_right(a, x)\r\n positions.append(pos)\r\nprint(*positions)\r\n", "import bisect\n\nnm = input().split()\nn, m = int(nm[0]), int(nm[1])\na = [int(x) for x in input().split()]\nb = [int(y) for y in input().split()]\na.sort()\nfor h in b:\n print(bisect.bisect(a,h))\n \t\t \t\t \t \t\t \t \t\t\t \t\t \t\t\t", "import bisect\r\nI = lambda:map(int,input().split())\r\nI()\r\na = sorted(I())\r\nfor h in map(int,input().split()):\r\n print(bisect.bisect(a,h))", "_ = input()\n\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\na.sort()\nres = []\n\nfor i in b:\n l, r = -1, len(a)\n while r - l > 1:\n m = (l + r) // 2\n if a[m] <= i:\n l = m\n else:\n r = m\n \n res.append(l + 1)\n \nprint(' '.join([str(x) for x in res]))\n \t\t\t\t\t \t\t\t \t \t\t \t \t \t\t \t\t", "from bisect import *\r\nx,y=input().split()\r\ny=int(y)\r\nl=list(map(int,input().split()))[:]\r\nm=list(map(int,input().split()))[:]\r\nl.sort()\r\nfor i in(m):\r\n print(bisect(l,i),end=' ')", "def busca_binaria(elemento, lista):\n i = 0\n f = len(lista) - 1\n while i <= f:\n m = (i + f) // 2\n if lista[m] <= elemento:\n melhor_resposta = m\n i = m + 1\n else:\n f = m - 1\n try:\n return melhor_resposta + 1\n except:\n return 0\n\n\ntam_a, tam_b = [int(n) for n in input().split()]\na = [int(n) for n in input().split()]\nb = [int(n) for n in input().split()]\n\na.sort()\n\noutput = ''\nfor e in b:\n output += str(busca_binaria(e, a))\n output += ' '\n\nprint(output)\n\n\t\t\t \t \t\t\t\t\t \t \t \t\t \t \t \t\t\t", "from bisect import bisect\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn, m = gets(int)\na = sorted(gets(int))\nfor b in gets(int):\n print(bisect(a, b), end=' ')\n", "import sys\r\ndef prin(a):\r\n sys.stdout.write(str(a)+' ')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\ndef insertPos(a,l,r,k):\r\n while l<=r:\r\n m=l+(r-l)//2\r\n if a[m]==k:\r\n l=m+1\r\n elif a[m]>k:\r\n r=m-1\r\n else:\r\n l=m+1\r\n return l\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=list(map(int,input().split()))\r\nfor i in k:\r\n prin(insertPos(l,0,n-1,i))", "def binary_search(list1,list2):\r\n list1.sort()\r\n for i in list2:\r\n left=0\r\n right=len(list1)-1\r\n ans=-1\r\n while left<=right:\r\n mid=int((left+right)/2)\r\n if list1[mid]<=i:\r\n left=mid+1\r\n ans=mid\r\n else:\r\n right=mid-1\r\n print(ans+1,end=\" \")\r\n\r\nn,m=list(map(int,input().split()))\r\nbinary_search(list(map(int, input().split())),list(map(int, input().split())))", "import bisect\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nn, 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\na.sort()\r\nans = []\r\nfor i in range(m):\r\n ans.append(bisect.bisect_right(a,b[i],lo=0,hi=len(a)))\r\nprint(*ans)\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Jul 12 23:21:08 2021\n\n@author: lcarv\n\"\"\"\n\nimport bisect\n\n \n \n \na = list(map(int,input().strip().split()))[:2]\n\nn = a[0]\nm = a[1]\n\nseq1 = list(map(int,input().strip().split()))[:n]\nseq2 = list(map(int,input().strip().split()))[:m]\n\nseq1.sort()\nretorno = \"\"\nfor e in seq2:\n #retorno += str((processo(e, seq1, 0, n))) + \" \"\n r = bisect.bisect_right(seq1, e, 0, n)\n retorno += str(r) + \" \"\n \n \n\nprint(retorno)\n\n\n\n\n\n\n\n\n\t\t\t \t \t\t \t\t\t \t \t\t\t\t\t", "def binsearch(a,n,l,r):\n\n while(l<=r):\n m=(l+r)//2\n\n if a[m]>n:\n r=m-1\n else:\n l=m+1\n return l\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=0\na.sort()\nfor i in b:\n print(binsearch(a,i,0,n-1),end=\" \")\n\n \t\t\t\t \t \t\t \t\t \t \t \t \t \t\t \t", "# import sys\n# sys.stdin = open('input.txt','r')\n# sys.stdout = open('output.txt','w')\n# #-----------------------CODE BELOW-----------------------------#\n\n\ndef value(arr, val):\n\tleft = 0\n\tright = len(arr) - 1\n\tans = -1\n\twhile left<=right:\n\t\tmid = left + (right-left) //2 \n\t\tif arr[mid] <= val:\n\t\t\tans = mid\n\t\t\tleft = mid + 1\n\t\telse:\n\t\t\tright = mid - 1\n\treturn ans + 1\ndef find(first, second):\n\tfirst.sort()\n\tans = []\n\tfor i in second:\n\t\tans.append(str(value(first, i)))\n\tprint(\" \".join(ans))\ndef main():\n f, s = map(int,input().split())\n first = list(map(int,input().split()))\n second = list(map(int,input().split()))\n find(first,second)\nmain()\n", "input()\nnlist,mlist = sorted(list(map(int,input().split()))),list(map(int,input().split()))\nref = mlist.copy()\nmlist = sorted(list(set(mlist)))\ndic = {}\nco,n,m = 0,len(nlist),len(mlist)\nfor x in range(m):\n while co != n:\n if nlist[co] > mlist[x]:\n dic[mlist[x]] = co\n break\n elif nlist[co] == mlist[x]:\n if co+1 != n:\n if nlist[co+1] != mlist[x]:\n dic[mlist[x]] = co+1\n break\n co += 1\n else:\n dic[mlist[x]] = co\nfor x in ref:\n print(dic[x],end=' ')\nprint()\n \t \t \t\t\t \t \t\t\t \t\t", "from bisect import bisect_left,bisect_right\r\n\r\ndef solve(n,m,a,b):\r\n a.sort()\r\n for x in b:\r\n print(bisect_right(a,x),end=\" \")\r\n\r\n\r\n\r\n\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)", "import sys\r\nimport bisect\r\n\r\ninput()\r\na = sorted([int(i) for i in sys.stdin.readline().rstrip().split()])\r\nb = [int(i) for i in sys.stdin.readline().rstrip().split()]\r\nfor e in b:\r\n print(bisect.bisect(a, e), end=' ')\r\n\"hi\"", "N, K=map(int, input().split())\nsearchArray = input().split()\nnumArray = input().split()\n\nfor i in range(N):\n searchArray[i]=int(searchArray[i])\nfor i in range(K):\n numArray[i]=int(numArray[i])\n\nsearchArray.sort()\nfor num in numArray:\n l = -1\n r = len(searchArray)\n while r - l > 1:\n m = (r + l) // 2\n if searchArray[m] > num:\n r = m\n else:\n l = m\n print(r, end=\" \")\n", "from bisect import bisect_right\n\na, b = map(int, input().split())\n\nv1 = list(map(int, input().split()))\nv2 = list(map(int, input().split()))\n\nv1.sort()\n\nfor x in v2:\n upper = bisect_right(v1, x)\n index = upper\n print(index)\n\n \t \t\t\t \t\t \t \t\t \t\t \t\t\t", "n,m = list(map(int,input().split()))\r\na = sorted(list(map(int,input().split())))\r\nrB = list(map(int,input().split()))\r\nb = sorted(rB)\r\nc = 0\r\nf = dict()\r\nfor num in b:\r\n try:\r\n if f[num] > -1:\r\n continue\r\n except KeyError:\r\n while c < n:\r\n if a[c] <= num:\r\n c += 1\r\n else:\r\n break\r\n f[num] = c\r\nfor num in rB:\r\n print(f[num],end = ' ')", "def b(a,l,h,t):\r\n if l<=h:\r\n m=(l+h)//2\r\n if a[m]>t:\r\n if m==0 or a[m-1]<=t:return m\r\n else:return b(a,l,m-1,t)\r\n else:return b(a,m+1,h,t)\r\n else:return -1\r\nx,y=list(map(int,input().split()))\r\nx_,y_=sorted(list(map(int,input().split()))),list(map(int,input().split()))\r\nfor i in y_:\r\n s=b(x_,0,x-1,i)\r\n if s!=-1:print(s)\r\n else:print(x)", "def lastoccur(a,k):\n l=0\n ans=-1\n r=len(a)-1 \n while(l<=r):\n m=l+(r-l)//2 \n if a[m]==k:\n ans=m \n l=m+1 \n elif a[m]>k:\n r=m-1 \n else:\n l=m+1 \n return ans \ndef binary(a,k,l,r):\n while(l<=r):\n m=l+(r-l)//2\n if a[m]==k:\n return m \n elif a[m]>k:\n r=m-1 \n else:\n l=m+1 \n return r\nn,n1=map(int,input().split())\na=[int(x) for x in input().split()]\na.sort()\nb=[int(x) for x in input().split()]\nfor i in range(len(b)):\n k=b[i]\n z=binary(a,k,0,n-1)\n if(z!=-1):\n print(lastoccur(a,a[z])+1,end=\" \")\n else:\n print(\"0\",end=\" \")\n \n\t \t\t\t\t \t \t\t\t\t\t\t \t \t \t\t \t", "import bisect\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na.sort()\r\nans = []\r\nfor i in range(len(b)):\r\n index = bisect.bisect(a,b[i])\r\n\r\n if i != len(b) - 1:\r\n print(index,end=\" \")\r\n else:\r\n print(index)\r\n", "n, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = map(int, input().split())\n\ndef solve(a, n, i):\n l, r = 0, n-1 \n while l <= r:\n mid = (l+r)//2\n if a[mid] > i:\n r = mid - 1\n else:\n l = mid + 1\n return l\n\nres = []\nfor i in b:\n res.append(solve(a, n, i))\n \nprint(*res)\n \t \t \t\t \t\t\t \t \t\t\t \t \t\t", "import sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n #n=int(input())\r\n n,m=list(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 for i in range(m):\r\n # p=bisect.bisect_left(a,b[i])\r\n q=bisect.bisect_right(a,b[i])\r\n print(q,end=\" \")\r\n #print(bisect.bisect_left(a,b[i]),end=\" \") \r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n main()\r\n", "from bisect import bisect\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nres=[0 for i in range(m)]\r\nfor i in range(m):\r\n res[i]=bisect(a,b[i])\r\nprint(*res)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nfor i in range(m):\r\n count = 0\r\n left, right = 0, n - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if a[mid] <= b[i]:\r\n count = mid + 1\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n print(count, end=\" \")\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\nfrom bisect import bisect_right as bl\r\n\r\nn,m = amap()\r\na = alist()\r\nb = alist()\r\nd = []\r\nfor i in range(m):\r\n d.append((b[i], i))\r\n\r\na.sort()\r\nans = [None]*m\r\nd.sort(key = lambda x:x[0])\r\nfor i in range(m):\r\n ans[d[i][1]] = bl(a,d[i][0])\r\nprint(*ans)", "n, m = map(int, input().split(\" \"))\na = sorted(list(map(int, input().split(\" \"))))\nb = list(map(int, input().split(\" \")))\n\ndef search(array, num, l, r):\n mid = (l + r) // 2\n if array[mid] <= num:\n if array[mid + 1] > num:\n return mid + 1\n return search(array, num, mid, r)\n else:\n if array[mid - 1] < num:\n return mid\n return search(array, num, l, mid)\n\n\nfor num in b:\n if num < a[0]: print(0, end=' ')\n elif num >= a[-1]: print(n, end=' ')\n else: print(search(a, num, 0, n), end=' ')\n\t \t\t\t\t \t\t \t \t\t \t \t\t\t\t\t\t \t\t", "import bisect\n\na, b = [int(x) for x in input().split()]\n\narrayUm = [int(x) for x in input().split()]\narrayDois = [int(x) for x in input().split()]\narrayUm.sort()\nfor i in range(b):\n print(bisect.bisect(arrayUm, arrayDois[i]))\n\t\t\t \t \t \t \t \t \t \t\t \t", "n,m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na.append(1000000000+5)\na.sort()\n#print(a)\nfor x in b:\n #binary search for the lowest number \n #greater than x in a\n l = 0\n r = len(a)-1\n while l <= r:\n mid = (l+r)//2\n #print(x,l,r,mid)\n if a[mid] > x:\n r = mid-1\n elif a[mid] <= x:\n l = mid+1\n if a[mid] > x and a[mid-1] <= x:\n break;\n print(mid)\n", "n,m=map(int,input().split())\nlst1=[int(x) for x in input().split()]\nlst2=[int(x) for x in input().split()]\nlst1.sort()\nfor i in lst2:\n l=0;r=n-1;\n while l<=r:\n m=l+(r-l)//2\n if lst1[m]<=i:\n l=m+1\n else:\n r=m-1\n print(r+1,end=' ')\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()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\na.sort()\n\ndef findCount(b):\n global a\n l = -1\n r = len(a)\n while r - l > 1:\n mid = (l + r) // 2\n if a[mid] > b:\n r = mid\n else:\n l = mid\n return l + 1\n \nfor i in b:\n print(findCount(i), end = ' ')\n \t\t \t \t\t \t\t \t \t \t\t \t \t\t\t", "\r\nimport bisect\r\n \r\nR = lambda: list(map(int, input().split()))\r\nn, m = R()\r\na = sorted(R())\r\nb = R()\r\nfor x in b:\r\n print(f'{bisect.bisect(a, x)} ', end='')", "import math\nimport bisect\nn,m=map(int,input().split())\na=sorted(list(map(int,input().split())))\nb=list(map(int,input().split()))\nfor i in b:\n ans=bisect.bisect_right(a,i,0,n)\n print(ans,end=' ')\n\n\n\t \t \t \t\t \t\t\t \t \t\t\t\t", "n,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\na = sorted(a)\r\n# b = sorted(b)\r\n\r\nans = []\r\ndef binary(target):\r\n i=-1\r\n j=len(a)\r\n while i+1<j:\r\n mid = (i+j)//2\r\n if a[mid]>target:\r\n j = mid \r\n else:\r\n i = mid\r\n ans.append(i+1)\r\n # print(a)\r\nfor i in b:\r\n binary(i)\r\n \r\nprint(*ans)", "import collections\r\nimport math\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\nc = []\r\na.sort()\r\n\r\n\r\nfor i in range(m):\r\n ans = 0\r\n start = 0\r\n end = n - 1\r\n \r\n while start <= end:\r\n mid = (start + end) // 2\r\n \r\n if a[mid] > b[i]:\r\n end = mid - 1\r\n else:\r\n start = mid + 1\r\n \r\n \r\n c.append(start)\r\n\r\nprint(*c)\r\n ", "from sys import stdin, stdout\ndef b_s(arr, l, r, target):\n while l+1 < r:\n m = int((l+r)/2)\n if arr[m] > target:\n r = m\n else:\n l = m\n return r\n \ndef main():\n outputs = []\n n, m = map(int, input().split())\n A = list(map(int, input().split()))\n A.sort()\n B = list(map(int, input().split()))\n for element in B:\n outputs.append(b_s(A, -1, n, element))\n for output in outputs:\n print(output)\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 math\r\nimport sys\r\nfrom collections import deque,OrderedDict,defaultdict\r\nfrom bisect import bisect_left as bsleft,bisect_right as bsright\r\nimport heapq\r\nfrom collections import Counter \r\ndef inp(): return sys.stdin.readline().rstrip()\r\ndef mpp(): return map(int,inp().split())\r\ndef lis(): return list(mpp())\r\ndef yn(n):\r\n if n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ndef fn(arr,brr):\r\n arr.sort()\r\n for i in brr:\r\n ind=bsright(arr,i)\r\n print(ind,end=\" \")\r\n print()\r\n \r\ndef main():\r\n for _ in range(1):\r\n n,m=mpp()\r\n arr=lis()\r\n brr=lis()\r\n (fn(arr,brr))\r\n \r\n \r\n \r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "import bisect\n\nx = input().split\n\nl1 = [int(e) for e in input().split()] \nl2 = [int(el) for el in input().split()] \n\nl1.sort()\n\ny = []\n\nfor ele in l2:\n y.append(bisect.bisect_right(l1,ele))\n\nprint(*y)\n\n\n\n\t \t \t\t \t \t \t \t\t \t \t\t \t \t \t", "n,m=list(map(int,input().split(\" \")))\r\na=list(map(int,input().split(\" \")))\r\nb=list(map(int,input().split(\" \")))\r\nsa=sorted(a)\r\nsb=sorted(b)\r\ni=0\r\nj=0\r\ncount=0\r\ndic={}\r\nwhile i<len(a) and j<len(b):\r\n\r\n if sa[i]>sb[j]:\r\n dic[str(sb[j])]=count\r\n j+=1\r\n elif sa[i]<sb[j]:\r\n count+=1\r\n i+=1\r\n elif sa[i]==sb[j]:\r\n count+=1\r\n i+=1\r\n\r\n\r\nwhile j<len(sb):\r\n dic[str(sb[j])] = count\r\n j+=1\r\n\r\n\r\n\r\nfor x in b:\r\n print(dic[str(x)],end=\" \")", "import sys\r\nimport re\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = list(map(int, input().split()))\r\n\r\nfor e in b:\r\n l, r = 0, n\r\n\r\n while l < r:\r\n mid = (l+r) // 2\r\n if a[mid] > e:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n\r\n print(l, end=' ')\r\n\r\n\r\n", "a,b=map(int,input().split())\nli=list(map(int,input().split()))\nli.sort()\nl1=list(map(int,input().split()))\nx=[]\nfor i in l1:\n l,r=0,a-1 \n ans=-1\n while(l<=r):\n mid=(r-l)//2+l\n if(li[mid]>i):\n r=mid-1 \n elif(li[mid]<=i):\n l=mid+1 \n ans=mid\n x.append(ans+1)\nprint(*x)\n\n\n\n \t \t \t\t \t\t \t \t\t \t\t\t \t \t\t", "def count_le(x, arr):\n '''\n return amount of elements in arr that are less or equal to x\n '''\n l, r = -1, len(arr)\n while r - l > 1:\n mid = (r + l) // 2\n if arr[mid] <= x:\n l = mid\n else:\n r = mid\n return l + 1\n\n\n\nn, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = map(int, input().split())\n\nfor el in b:\n print(count_le(el, a), end=' ')\n\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\na = sorted(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n_b = sorted(b)\r\nd = {}\r\n\r\ni = j = 0\r\nwhile i < n and j < m:\r\n if a[i] <= _b[j]:\r\n i += 1\r\n else:\r\n if _b[j] not in d:\r\n d[_b[j]] = i\r\n j += 1\r\n\r\nfor e in b:\r\n if e in d:\r\n print(d[e], end=' ')\r\n else:\r\n print(n, end=' ')\r\n", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn, m = [int(x) for x in input().split()]\r\na, b = [int(x) for x in input().split()], [int(x) for x in input().split()]\r\n\r\na.sort()\r\nans = 0\r\nfor x in b:\r\n print(bisect.bisect_right(a, x), end=' ')", "def firstindexgreater(List,n):\r\n i=0\r\n j=len(List)-1\r\n while i<j:\r\n mid=(i+j)//2\r\n if List[mid]<=n:\r\n i=mid+1\r\n else:\r\n j=mid\r\n else:\r\n return i\r\nnm=list(map(int, input().rstrip().split()))\r\nn=nm[0]\r\nm=nm[1]\r\narray1=list(map(int, input().rstrip().split()))\r\narray1.sort()\r\narray2=list(map(int, input().rstrip().split()))\r\narray=[]\r\nfor item in array2:\r\n if item>=array1[-1]:\r\n array.append(n)\r\n else:\r\n t=firstindexgreater(array1,item)\r\n array.append(t)\r\nprint(\" \".join(map(str,array)))", "from bisect import bisect_right\r\n\r\n\r\ndef solve():\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 a.sort()\r\n\r\n for el in b:\r\n print(bisect_right(a, el), end=\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "input()\n\na = sorted(list(map(int, input().split())))\nb = list(map(int, input().split()))\n\nfor number in b:\n l = 0\n r = len(a) - 1\n\n while l < r:\n mid = (l + r) // 2\n\n if a[mid] > number:\n r = mid\n else:\n l = mid + 1\n\n print(l + 1 if a[l] <= number else l)\n\t \t\t \t \t \t\t \t\t \t \t\t", "from bisect import bisect_right\nn, m = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\na.sort()\nfor x in b:\n print(bisect_right(a, x), end=' ')\n", "#!/usr/bin/env python3\r\nimport sys\r\nimport math\r\nimport bisect\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_ls(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n a = get_ls()\r\n b = get_ls()\r\n a = sorted(a)\r\n for e in b:\r\n # Bisect - to find a position in list where an element\r\n # needs to be inserted to keep the list sorted.\r\n print(bisect.bisect(a, e), end=' ')\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "from bisect import bisect_right\r\nn,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nb=list(map(int,input().split()))\r\nc=[0]*m\r\nfor i in range(m):\r\n x=bisect_right(a,b[i])\r\n c[i]=x\r\nprint(*c)", "import bisect\r\nn, m = map(int, input().split())\r\n\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\na.sort()\r\n\r\nfor i in b:\r\n\tprint(bisect.bisect(a, i))", "sizes = input().split()\nn = int(sizes[0])\nm = int(sizes[1])\nA = [int(e) for e in input().split()]\nB = [int(e) for e in input().split()]\n\nA.sort()\nB = sorted(enumerate(B), key = lambda item: item[1])\n\ni = 0\nr = [0] * m\nfor j, b in B:\n while i < len(A) and A[i] <= b:\n i += 1\n r[j] = str(i)\nprint(' '.join(r))\n", "\ntmp = input().split()\nn, m = int(tmp[0]), int(tmp[1])\na = sorted(list(map(int, input().split())))\nb = list(map(int, input().split()))\n\n\nresult = []\nfor i in range(m):\n l, r = -1, n\n while r - l > 1:\n m = (r + l) // 2\n if a[m] > b[i]:\n r = m\n else:\n l = m\n result.append(r)\n\nprint(*result)\n\n\t \t \t\t \t \t\t \t \t\t \t\t \t\t\t", "def rech(a,x):\r\n l= 0\r\n r=len(a)-1\r\n result=-1\r\n while l<=r:\r\n mid=l+(r-l)//2\r\n if a[mid]<=x:\r\n result=mid\r\n l=mid+1\r\n else:\r\n r=mid-1\r\n return result+1\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ncounts=[]\r\na.sort()\r\nfor x in b:\r\n count =rech(a,x)\r\n counts.append(count)\r\nprint(*counts)", "#https://codeforces.com/problemset/problem/600/B\r\n\r\n# n=input()\r\n# a=list(map(int, input().split()))\r\n# b=list(map(int, input().split()))\r\n# a.sort()\r\n# for i in b:\r\n# t=0\r\n# for j in a:\r\n# if j<=i:\r\n# t+=1\r\n# else:break\r\n# print(t,end=' ')\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nfor x in b:\r\n l, r = 0, n-1\r\n while l <= r:\r\n mid = ( r-l) // 2+l\r\n if a[mid] <= x:\r\n l = mid + 1\r\n else:\r\n r = mid-1\r\n print (l,end=' ')\r\n", "n,m = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\nb = list(map(int, input().split(\" \")))\r\nc = []\r\n\r\na.sort()\r\nfor i in b:\r\n\tlow = 0\r\n\thigh = len(a)-1\r\n\tv = True\r\n\twhile low <= high:\r\n\t\tmid = (low+high)//2\r\n\t\tif i == a[mid]:\r\n\t\t\tlow = mid+1\r\n\t\t\tv = True\r\n\t\telif i < a[mid]:\r\n\t\t\thigh = mid-1\r\n\t\t\tv = False\r\n\t\telif i > a[mid]:\r\n\t\t\tlow = mid+1\r\n\t\t\tv = True\r\n\tif high < low and not v: c.append(mid)\r\n\telse: c.append(mid+1)\r\n\r\nprint(*c, sep=' ')", "import sys\nimport bisect\n\ninput()\na = sorted([int(i) for i in sys.stdin.readline().rstrip().split()])\nb = [int(i) for i in sys.stdin.readline().rstrip().split()]\nfor e in b:\n print(bisect.bisect(a, e), end=' ')\n\n\t \t\t\t \t \t \t\t\t \t\t\t \t", "from bisect import bisect_right\r\nn, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nans = []\r\nfor i in map(int, input().split()):\r\n ans.append(bisect_right(a, i))\r\n\r\nprint(*ans)", "from bisect import bisect_left as bl\r\nn,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nfor i in b:\r\n print(bl(a,i+1),end=\" \")", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nfor x in b:\r\n l, r = 0, n-1\r\n ans = 0\r\n while l <= r:\r\n mid = (l+r) // 2\r\n if a[mid] <= x:\r\n ans = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n print(0, end= \" \")if x < a[0] else print(ans+1, end=\" \")", "import bisect\r\nn,m=map(int,input().split())\r\na=list (map(int,input().split()))\r\nb=list (map(int,input().split()))\r\na.sort()\r\nfor i in range(m):\r\n n=bisect.bisect_right(a,b[i])\r\n print(n,end=\" \")\r\n", "import bisect\r\ninput()\r\na, b = [[int(j) for j in input().split()] for _ in range(2)]\r\na = sorted(a)\r\nprint(' '.join([str(bisect.bisect(a, j)) for j in b]))", "n, m = map(int, input().split())\na = sorted(list(map(int, input().split())))\nb = list(map(int, input().split()))\nfor i in range(m):\n l = 0\n r = n-1\n while l <= r:\n mid = (l + r) // 2\n if a[mid] <= b[i]:\n l = mid + 1\n else:\n r = mid - 1\n print(r+1)\n\n\t \t \t \t \t\t\t \t \t \t \t \t", "import bisect\nw,q = str(input()).split()\nsaida = \"\"\na = str(input()).split()\nb = str(input()).split()\na1 = [int(i) for i in a]\na1 = sorted(a1)\nc = \"\"\n\nfor x in range(int(q)):\n ru = int(b[x])\n c += (str(bisect.bisect_right(a1, ru, hi=len(a1)) ) + \" \")\n \nprint(c[:len(c) - 1])\n\t \t\t \t\t\t\t\t\t \t\t\t\t\t\t \t \t", "from collections import defaultdict, deque\r\nfrom math import gcd,ceil,sqrt,factorial\r\nimport sys\r\nimport heapq\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom functools import reduce\r\nimport operator as op\r\n\r\n\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\ndef ncr(n,r):\r\n\tr=min(n,n-r)\r\n\tnmtr = reduce(op.mul,range(n,n-r,-1),1)\r\n\tdnmtr = reduce(op.mul,range(1,r+1),1)\r\n\treturn nmtr//dnmtr\r\n\r\n\r\ndef fact(n):\r\n\treturn factorial(n)\r\n\r\n\r\ndef myyy__answer():\r\n\tn,m=map(int,input().strip().split())\r\n\ta=list(map(int,input().strip().split()))\r\n\tb=list(map(int,input().strip().split()))\r\n\r\n\ta.sort()\r\n\r\n\tfor i in b:\r\n\t\tprint(b_r(a,i),end=\" \")\r\n\t\r\n\tprint()\r\n\r\n\r\n\t\r\n\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tinput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\t# for _ in range(int(input())):\r\n\t\t# print(myyy__answer())\r\n\tmyyy__answer()\r\n", "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\nresb = dict()\r\nsa = sorted(a)\r\nsb = sorted(b)\r\ni = 0\r\nj = 0\r\nwhile j < len(sb):\r\n\twhile i < len(sa) and sa[i] <= sb[j]:\r\n\t\ti += 1\r\n\tresb[sb[j]] = i\r\n\tj += 1\r\nfor i in b:\r\n\tprint(resb[i], end=' ')\r\n", "import bisect as bi\r\nn,m = list(map(int,input().split()))\r\nA = sorted(list(map(int, input().split())))\r\nB = list(map(int, input().split()))\r\nC = []\r\nfor i in B:\r\n\tC.append(bi.bisect(A,i))\r\n\t\r\nprint(*C)\r\n\t", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #a,b,c = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n n,m = map(int,input().split())\r\n ai = list(map(int,input().split()))\r\n bi = list(map(int,input().split()))\r\n bi = [[bi[i],i]for i in range(m)]\r\n ans = [0] * m\r\n bi.sort()\r\n ai.sort()\r\n j = 0\r\n for i in range(m):\r\n while j < n and ai[j] <= bi[i][0]:\r\n j += 1\r\n ans[bi[i][1]] = j\r\n print(*ans)\r\nmain()\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na.sort()\r\nans = []\r\nfor i in range(m):\r\n t = bisect_right(a, b[i])\r\n ans.append(t)\r\n\r\nprint(*ans)", "def bsearch(x, lst):\n count = 0\n l = 0\n r = len(lst) - 1\n while l <= r:\n m = (r + l) // 2\n if lst[m] <= x:\n count = m + 1\n l = m + 1\n else:\n r = m - 1\n return count\n\n\nn, n1 = map(int, input().split())\nlst = list(map(int, input().split()))\nlst1 = list(map(int, input().split()))\nlst.sort()\nfor i in lst1:\n print(bsearch(i, lst), end = \" \")\n \n \t\t\t \t\t \t\t \t \t \t \t\t\t \t", "def s(a,k):\n l,r=0,len(a)-1\n while l<=r:\n m=(l+r)//2\n if a[m]==k:\n l=m+1\n elif a[m]>k:\n r=m-1\n else:\n l=m+1\n return l\n\n\nn,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\na.sort()\nfor i in b:\n y=s(a,i)\n print(y,end=' ')\n \t \t\t\t\t\t \t\t\t\t\t \t \t\t \t", "\nfrom bisect import bisect_left, bisect_right\n\ndef check_min(a, b, n, m):\n a = sorted(a)\n res = []\n for num in b:\n res.append(bisect_right(a, num))\n \n return res \n\nif __name__ == \"__main__\":\n n, m = map(int, input().strip().split(' '))\n a = list(map(int, input().strip().split(' ')))\n b = list(map(int, input().strip().split(' ')))\n res = check_min(a, b, n, m)\n for num in res:\n print(num, end=' ')\n\t\t\t \t\t \t \t\t \t\t\t \t \t \t \t", "# Sort them both\r\n# Find for the first element using binary search\r\n# Save the index\r\n# Set start low to old mid\r\n\r\ndef BinarySearch(arr, v):\r\n low, high = 0, len(arr) - 1\r\n result = -1 # Initialize result to -1, indicating no valid result found yet\r\n\r\n while low <= high:\r\n mid = (low + high) // 2\r\n # If arr[mid] is greater than or equal to v, update result and search in the left half\r\n if arr[mid] > v:\r\n result = mid\r\n high = mid - 1\r\n else:\r\n # If arr[mid] is less than v, search in the right half\r\n low = mid + 1\r\n\r\n return result\r\n\r\nsize1, size2 = map(int, input().split())\r\narr1 = sorted(list(map(int, input().split())))\r\narr2 = list(map(int, input().split()))\r\narr1.append(float(\"inf\"))\r\noldMid = 0\r\nfinalString = \"\"\r\nfor i in arr2:\r\n HighIndex = BinarySearch(arr1, i)\r\n if HighIndex >= 0:\r\n oldMid = HighIndex -1\r\n finalString += f\"{str(HighIndex)} \"\r\n else:\r\n finalString += \"0 \"\r\nfinalString = finalString.lstrip()\r\nprint(finalString)", "n,m=map(int,input().split())\narr=[int(x) for x in input().split()]\nl=[int(x) for x in input().split()]\narr.sort()\ndef solve(k):\n l=0\n r=len(arr)-1 \n while l<=r:\n m=(r-l)//2 + l \n if arr[m]<=k:\n l=m+1\n else:\n r=m-1\n return r+1 \nfor x in l:\n print(solve(x),end=\" \")\n\t\t \t\t\t \t\t \t\t\t \t \t\t\t\t \t\t\t\t\t \t\t", "import bisect\n\nn, m = map(int, input().split())\na = sorted(list(map(int, input().split())))\nb = list(map(int, input().split()))\n\nd = dict()\nfor num in b:\n if num in d:\n print(d[num])\n else:\n i = bisect.bisect_right(a, num)\n d[num] = i\n print(d[num])", "\r\n\r\nfrom bisect import bisect_right\r\n\r\n\r\na,b=map(int,input().split())\r\n\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\n\r\nl.sort()\r\n\r\nans=[]\r\n \r\nfor i in range(b):\r\n pos=bisect_right(l, m[i])\r\n ans.append(pos)\r\n\r\nfor i in range(b):\r\n print(ans[i],end=\" \")\r\n \r\n", "# your code goes here\ndef bin_search(arr, n, x):\n\tl = 0\n\th = n - 1\n\twhile(l <= h):\n\t\tmid = int((l + h) / 2)\n\t\tif(arr[mid] <= x):\n\t\t\tl = mid + 1\n\t\telse:\n\t\t\th = mid - 1\n\treturn h\nn,m=map(int,input().split())\na=[int(x) for x in input().split()]\nb=[int(x) for x in input().split()]\na.sort()\nfor i in range(m):\n\ti=bin_search(a,n,b[i])\n\tprint(i+1,end=\" \")\n\n\t \t \t \t \t \t \t\t\t\t \t \t", "def bin_search_count(lst: list, target: int) -> int:\n l, r = -1, len(lst)\n while r > (l+1):\n mid = (l + r) // 2\n elem = lst[mid]\n if elem <= target:\n l = mid\n else:\n r = mid\n if l == -1:\n return 0\n elif l == len(lst):\n return len(lst)\n return l+1\n \n\nn, m = map(int, input().split())\na = sorted(list(map(int, input().split())))\nb = list(map(int, input().split()))\nfor i, elem in enumerate(b):\n if i == m-1:\n print(bin_search_count(a, elem), end=\"\\n\")\n else:\n print(bin_search_count(a, elem), end=\" \")\n\t \t \t \t\t \t\t \t \t\t", "n, m = map(int, input().split())\r\nA = [int(a) for a in input().split()]\r\nB = [int(b) for b in input().split()]\r\nC = []\r\n\r\nfor i in range(m):\r\n C.append((B[i], i))\r\n\r\n# O(NlogN)\r\nA.sort()\r\n\r\n# O(MlogM)\r\nC.sort(key=(lambda l: l[0]))\r\n\r\nc = 0\r\nd = dict()\r\n\r\n# O(m)\r\nj = 0\r\nfor i in range(m):\r\n b, k = C[i]\r\n if j < n:\r\n while b >= A[j]:\r\n c += 1\r\n j += 1\r\n if j == n:\r\n break\r\n d[k] = c\r\n\r\nfor k in range(m):\r\n print(d[k], end=' ')", "import sys\n\nn, m = [int(i) for i in input().split()]\na = list(map(int, sys.stdin.readline().split()))\nb = list(map(int, sys.stdin.readline().split()))\n\na.sort()\n\ndef find_less_than_x_qty(arr, x):\n l = -1\n r = len(arr)\n\n while r - l > 1:\n m = (r + l) // 2\n if a[m] <= x:\n l = m\n else:\n r = m\n\n return l + 1\n\n\nfor x in b:\n qty_less_and_equal = find_less_than_x_qty(a, x)\n print(qty_less_and_equal, end=\" \")\n\n \t \t \t \t \t \t\t\t \t \t \t \t\t\t\t", "def count_elements(n, m, a, b):\n a.sort()\n result = []\n for i in b:\n left, right = 0, n - 1\n while left <= right:\n mid = (left + right) // 2\n if a[mid] <= i:\n left = mid + 1\n else:\n right = mid - 1\n result.append(left)\n return result\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nprint(*count_elements(n, m, a, b))\n\n\t \t\t\t \t \t \t\t \t \t\t \t \t\t \t", "import bisect\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nfor i in range(k):\r\n it=bisect.bisect_right(a,b[i],0,n)\r\n if(it==n):\r\n print(n ,end=\" \")\r\n continue\r\n ind=it-0\r\n print(ind,end=\" \")", "n, m = map(int, input().split())\r\nx = sorted(list((map(int, input().split()))))\r\ny = (list((map(int, input().split()))))\r\nfor a in y:\r\n from bisect import *\r\n print(bisect_right(x, a))\r\n", "import bisect\r\ndef solve():\r\n n1,n2=[int(x) for x in input().split()]\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n a.sort()\r\n \r\n for i in range(n2):\r\n pos=bisect.bisect_right(a,b[i])\r\n print(pos,end=\" \")\r\n print()\r\nsolve()", "\nn, m = input().split()\nn, m = int(n), int(m)\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na = sorted(a)\n\ndef binarySearchCount(arr, n, key):\n l = 0\n r = n - 1\n count = 0 \n while (l <= r):\n mid = int((r + l) / 2)\n if (arr[mid] <= key):\n count = mid + 1\n l = mid + 1\n else:\n r = mid - 1 \n return count\n\nfor i in b:\n print(binarySearchCount(a,n,i), end=' ')", "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\n\r\na = [a[i] for i in range(n)]\r\nb = [[b[i], i, 0] for i in range(m)]\r\n\r\na.sort()\r\nb.sort()\r\np = 0\r\n\r\nfor i in b:\r\n while p < n and i[0] >= a[p]:\r\n p += 1\r\n i[2] = p\r\nb.sort(key=lambda x: x[1])\r\nfor i in b:\r\n print(i[2], end=' ')\r\n", "from bisect import bisect_right\r\ntem = input().split()\r\nn ,m=int(tem[0]) , int(tem[1])\r\na = sorted([int(num) for num in input().split()])\r\nb = [int(num) for num in input().split()]\r\nfor bj in b :\r\n print(bisect_right(a,bj))", "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()]\n\na.sort()\n\n\ndef binary_search(arr, x):\n l = -1\n r = len(arr)\n\n while r - l > 1:\n m = (l + r) // 2\n\n if a[m] <= x:\n l = m\n else:\n r = m\n\n return r\n\n\ndef get_less_or_equal_numbers_quantity(a, b):\n result = []\n\n for x in b:\n r = binary_search(a, x)\n result.append(r)\n\n return \" \".join([str(i) for i in result])\n\n\nresult = get_less_or_equal_numbers_quantity(a, b)\nprint(result)\n\n\t \t \t\t \t \t\t \t \t\t \t\t\t \t", "# With my own sorting: merge sort\ndef count_le(x, arr):\n '''\n return amount of elements in arr that are less or equal to x\n '''\n l, r = -1, len(arr)\n while r - l > 1:\n mid = (r + l) // 2\n if arr[mid] <= x:\n l = mid\n else:\n r = mid\n return l + 1\n\n\ndef merge(a, b):\n res = []\n j = 0\n for i in range(len(b)):\n while j < len(a) and a[j] < b[i]:\n res.append(a[j])\n j += 1\n res.append(b[i])\n res += a[j:]\n return res\n\n\ndef merge_sort(arr):\n n = len(arr)\n if n <= 1:\n return arr.copy()\n mid = n // 2\n l = merge_sort(arr[:mid])\n r = merge_sort(arr[mid:])\n return merge(l, r)\n\n\nn, m = map(int, input().split())\na = merge_sort(list(map(int, input().split())))\nb = map(int, input().split())\n\nfor el in b:\n print(count_le(el, a), end=' ')\n\n\n\n\t\t\t \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\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\na.sort()\r\ndef bs_first_greater(arr,start,end,val):\r\n if start>end:\r\n return -1\r\n mid=(start+end)//2\r\n if arr[mid]>val:\r\n if mid==start:\r\n return mid\r\n elif arr[mid-1]<=val:\r\n return mid\r\n else:\r\n return bs_first_greater(arr,start,mid-1,val)\r\n\r\n else:\r\n return bs_first_greater(arr,mid+1,end,val)\r\nans=[]\r\nfor i in range(m):\r\n val=b[i]\r\n temp=bs_first_greater(a,0,n-1,val)\r\n if temp==-1:\r\n ans.append(n)\r\n else:\r\n ans.append(temp)\r\nprint(*ans)\r\n", "def f(a, b):\n a.sort()\n results = []\n\n for bj in b:\n left, right = 0, len(a)\n while left < right:\n mid = (left + right) // 2\n if a[mid] <= bj:\n left = mid + 1\n else:\n right = mid\n results.append(left)\n\n return results\n\nt = 1\nfor _ in range(t):\n matriza, matrizb = map(int, input().split())\n arrayA = list(map(int, input().split()))\n arrayB = list(map(int, input().split()))\n results1 = f(arrayA, arrayB)\n results2 = f(arrayA, arrayB)\n print(*results1)\n \t \t\t \t\t \t\t\t\t\t \t \t\t", "input()\r\na=sorted([int(p) for p in input().split()])\r\nv=[]\r\nfor b in [int(pp) for pp in input().split()]:\r\n l,r=-1,len(a)\r\n while l+1<r: \r\n m=(l+r)//2\r\n if b>=a[m]:\r\n l=m\r\n else:\r\n r=m\r\n v.append(l+1)\r\nprint(*v)", "n, m = map(int, input().split())\na = sorted(list(map(int, input().split())))\nb = list(map(int, input().split()))\n\ndef binary_search(arr, x):\n left, right = 0, len(arr)-1\n while left <= right:\n mid = (left+right)//2\n if arr[mid] <= x:\n left = mid+1\n else:\n right = mid-1\n return left\n\nfor bj in b:\n k = binary_search(a, bj)\n print(k, end=\" \")\n\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\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\nans = []\r\nfor x in b:\r\n l, r = -1, n\r\n while r - l > 1:\r\n i = (l+r)//2\r\n if a[i] <= x:\r\n l = i\r\n else:\r\n r = i\r\n ans.append(r)\r\nprint(*ans)", "import bisect\nr=lambda: map(int,input().split())\nn,m=r()\na=sorted(list(r()))\nb=list(r())\nfor i in b:\n print(bisect.bisect_right(a,i),end=' ')\nprint()\n\n \t \t \t\t \t\t \t \t\t \t\t\t\t \t", "\r\n\r\na,b=list(map(int,input().split()))\r\nnums1=list(map(int,input().split()))\r\nnums2=list(map(int,input().split()))\r\nsave=list(nums2)\r\nnums1=sorted(nums1)\r\nnums2=sorted(nums2)\r\ni=0\r\nans=[]\r\ng={}\r\nfor j in range(b):\r\n while i<a and nums1[i]<=nums2[j] :\r\n # print(nums1[i],nums2[j])\r\n i=i+1\r\n g[nums2[j]]=i\r\n # print(i,j)\r\n j=j+1\r\nans=[]\r\n# print(g)\r\nfor i in save:\r\n ans.append(g[i])\r\nprint(*ans)", "from bisect import bisect_left,bisect\r\nfrom collections import Counter\r\npyin=lambda:map(int,input().split())\r\nn,m=pyin();a,b=sorted(list(pyin())),list(pyin())\r\n\r\nfor i in b:\r\n w=bisect(a,i)\r\n print(w,end=' ')\r\n \r\n", "import bisect\r\nan,bn=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nl=[]\r\nfor i in b:\r\n l.append(bisect.bisect(a,i))\r\nprint(*l)", "def bs(array, x, length):\r\n lower = 0\r\n upper = length - 1\r\n count = 0\r\n while lower <= upper:\r\n mid = (upper + lower) // 2\r\n if array[mid] <= x:\r\n count = mid + 1\r\n lower = mid + 1\r\n else:\r\n upper = mid - 1\r\n return count\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\na = sorted(a)\r\nl_a = len(a)\r\nfor x in b:\r\n res = bs(a, x, l_a)\r\n print(res, end=' ')\r\nprint()\r\n", "n, m = map(int, input().strip().split())\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\n\na.sort()\n\nfor b_j in b:\n left = 0\n right = n\n\n while left < right:\n mid = (left + right) // 2\n\n if b_j >= a[mid]:\n left = mid + 1\n else:\n right = mid\n\n print(left, end=\" \")\n\t\t \t \t \t\t\t \t \t \t \t\t", "a,b=map(int,input().split())\r\nli1=sorted(list(map(int,input().split())))\r\nli2=list(map(int,input().split()))\r\nli=[]\r\nfor i in li2:\r\n r, l = a - 1 , 0\r\n c=0\r\n while l <= r:\r\n mid = (r + l) // 2\r\n if li1[mid] <= i:\r\n l = mid + 1 \r\n c=mid+1\r\n else: r = mid - 1\r\n li.append(c)\r\nprint(*li)", "import bisect as h\nn,m=map(int,input().split())\na=list(map(int,input().split()))\na.sort()\nb=list(map(int,input().split()))\nfor i in b:\n print((h.bisect(a,i)),end=\" \")\n\t \t\t \t\t \t\t\t \t \t\t \t\t \t", "'''input\n'''\nimport sys\nimport math\nimport bisect\nimport heapq\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\nfrom functools import cmp_to_key\n\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))\nsort = lambda x,compare: sorted(x, key=cmp_to_key(compare))\n\nmod=1000000007\n\ndef sumMod(a, b):\n return (a % mod + b % mod) % mod\n\n#main code\ndef bin_search(arr, target):\n\tl, r = 0, len(arr) - 1\n\tans = 0\n\twhile l <= r:\n\t\tmid = l + (r - l) // 2\n\t\tif arr[mid] <= target:\n\t\t\tans = mid + 1\n\t\t\tl = mid + 1\n\t\telse:\n\t\t\tr = mid - 1\n\treturn ans\n\t\t\nn, m = mul()\narr1 = sorted(seq())\narr2 = seq()\nfor i in range(m):\n\tprint(bin_search(arr1, arr2[i]), end = \" \")\n\t\n\t\n\n\n\n \t \t \t\t\t\t \t\t \t \t\t \t \t\t\t \t", "def binsrch(k,li):\n low = 0\n high = len(li)-1\n f = 0\n while high>=low:\n mid = (low + high)//2\n #print(mid,li[mid])\n if li[mid]==k:\n ans = mid\n f = 1\n low = mid+1\n elif li[mid]>k:\n high = mid-1\n else:\n low = mid+1\n if f==1:\n return ans+1\n else:\n return low\n\n\nn,m = map(int,input().split())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\na.sort()\nres = list()\nfor i in range(m):\n ans = binsrch(b[i],a)\n print(ans,end=\" \")\n \n \t\t \t \t \t \t \t \t\t\t \t", "#from math import ceil, sqrt\r\n#from collections import defaultdict\r\n#from heapq import heapify, heappush, heappop\r\n#from collections import deque\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #input().decode().rstrip('\\r\\n')\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n#mod = 10**9 + 7\r\n\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\nn, m = MII()\r\na = SLMII()\r\nb = LMII()\r\nans = []\r\n\r\nfor i in range(m):\r\n start = -1\r\n step = n\r\n while step >= 1:\r\n while start+step < n and a[start+step] <= b[i]:\r\n start += step\r\n step //= 2\r\n ans.append(start+1)\r\n \r\nprint(*ans)\r\n\r\n\r\n\r\n", "\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\nf= list(map(int,input().split()))\r\n\r\nt.sort()\r\n\r\nfrom bisect import *\r\n\r\n\r\nfor j in f:\r\n print( bisect_right(t,j),end=' ' )\r\n", "def greaterElements(arr1, m, arr2, n):\r\n idx = 0\r\n temp = arr2[:]\r\n dic = dict()\r\n arr1.sort()\r\n arr2.sort()\r\n for num in arr2:\r\n while idx < m and num >= arr1[idx]:\r\n idx += 1\r\n dic[num] = idx\r\n for i in range(n):\r\n temp[i] = dic.get(temp[i])\r\n return temp\r\n\r\n\r\nm, n = list(map(int, input().split(\" \")))\r\narr1 = list(map(int, input().split(\" \")))\r\narr2 = list(map(int, input().split(\" \")))\r\nprint(*greaterElements(arr1, len(arr1), arr2, len(arr2)))", "import random \n\n#Быстрая сортировка для первого массива\ndef quick_sort(mass: list):\n n = len(mass)\n if n <= 1:\n return mass\n \n x = mass[random.randint(0, n-1)]\n \n left = quick_sort([el for el in mass if el < x])\n middle = [el for el in mass if el == x]\n right = quick_sort([el for el in mass if el > x])\n \n return left + middle + right\n\n#Бин поиск по массиву a\ndef binnary_search(arr: list, b: int):\n n = len(arr)\n l = -1\n r = n\n while r-l > 1:\n m = (r+l)//2\n if arr[m] > b:\n r = m\n else:\n l = m\n return r\n\nif __name__ == '__main__':\n n, m = map(int, input().strip().split())\n arr = list(map(int, input().strip().split()))\n arr = quick_sort(arr)\n mass = list(map(int, input().strip().split())) \n ans = []\n for b in mass:\n ans.append(binnary_search(arr, b))\n print(*ans)\n \n\t \t \t \t \t\t \t\t \t\t \t \t \t\t", "def bin_num(arr, x):\n l = -1 # arr[l] <= x \n r = len(arr) # arr[r] > x\n while r - l > 1:\n m = (l + r)//2\n if arr[m] <= x:\n l = m\n else:\n r = m\n return l + 1\n\nn, m = map(int, input().split())\na = sorted([int(x) for x in input().split()])\nb = [int(x) for x in input().split()]\n\nfor i in range(m):\n print(bin_num(a, b[i]), end=' ')\n \n \t \t\t \t\t \t \t\t \t \t\t \t \t\t \t \t", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn, m = iis()\r\na = sorted(iis())\r\nb = iis()\r\n\r\n\r\ndef bs(val):\r\n low = 0\r\n high = n - 1\r\n while low <= high:\r\n mid = low + (high - low) // 2\r\n if a[mid] > val:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return low\r\n\r\n\r\nprint(*[bs(el) for el in b])\r\n", "arr_0 = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\n\r\nn = arr_0[0]\r\nm = arr_0[1]\r\n\r\na.sort()\r\n\r\nans = list()\r\n\r\nfor i in range(m):\r\n l = 0\r\n r = n\r\n num = b[i]\r\n while r != l:\r\n mid = int((r + l) / 2)\r\n if a[mid] <= num:\r\n l = mid + 1\r\n else:\r\n r = mid\r\n ans.append(str(l))\r\n \r\nprint(' '.join(ans))", "n, m = map(int, input().split())\nA = sorted(list(map(int, input().split())))\nB = list(map(int, input().split()))\n\n# A is sorted\ndef countLessThan(b,A,n):\n #print(\"countLessThan\")\n #print(b,A)\n if A[n-1] <= b:\n return n\n if A[0] > b:\n return 0\n l = 0 \n r = n-1\n count = 0 \n while l < r:\n if (l+r) % 2 == 0:\n m = (l+r)//2\n else:\n m = (l+r)//2 + 1\n #print(l,m,r)\n #print(A[l:r+1])\n #print(A[m])\n if A[m] > b:\n r = m-1\n else:\n l = m\n if A[m] <= b:\n count = m + 1\n else:\n count = m\n return count\n\n\ndef solve(A,B,n):\n ans = []\n for b in B:\n ans.append(countLessThan(b,A,n))\n print(*ans)\n \nsolve(A,B,n)\n#print(countLessThan(6,A,n))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\na = sorted(a)\nfor num in b:\n l, r = 0, n\n while r != l:\n mid = (l + r + 1) // 2\n if a[mid - 1] > num:\n r = mid - 1\n else:\n l = mid\n print(l, end=\" \")\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\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=[]\r\nans=[0]*m\r\nfor i in range(m):\r\n c.append((b[i], i))\r\na=sorted(a)\r\nc=sorted(c)\r\na1=0\r\nb1=0\r\nwhile b1<m:\r\n if a1 < n and a[a1]<=c[b1][0]:\r\n a1=a1+1\r\n else:\r\n ans[c[b1][1]]=a1\r\n b1=b1+1\r\nprint(*ans)", "aLength,bLength=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\na.sort()\nres=[]\nfor num in b:\n lp=0\n rp=aLength-1\n ans=-1\n while lp<=rp:\n mid=(lp+rp)//2\n if a[mid]<=num:\n lp=mid+1\n ans=mid\n else:\n rp=mid-1\n res.append(ans+1)\nprint(*res)\n \t \t\t\t \t \t \t\t\t\t\t \t \t \t", "a = []\r\n\r\ndef f(x):\r\n l = 0\r\n r = len(a) - 1\r\n ans = 0\r\n while l <= r:\r\n m = (l + r) // 2\r\n if a[m] <= x:\r\n l = m + 1\r\n ans = m + 1\r\n else:\r\n r=m-1\r\n return ans\r\n\r\nn, k = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nb = list(map(int,input().split()))\r\nfor i in range(0,len(b)):\r\n print(f(b[i]))", "import bisect\r\nn,m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nA.sort()\r\n\r\nans = []\r\nfor b in B:\r\n idx = bisect.bisect_right(A, b)\r\n ans.append(idx)\r\n\r\nprint(*ans)", "from bisect import bisect_right\r\n\r\nn, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in b:\r\n print(bisect_right(a, i), end=\" \")\r\n", "a,b=map(int,input().split())\narr=list(map(int,input().split()))\narr1=list(map(int,input().split()))\nx=[0]*b\narr.sort()\nfor i in range(b):\n l=-1\n r=a\n while((r-l)>1):\n m=(l+r)//2\n if arr[m]<=arr1[i]:\n l=m\n else:\n r=m\n x[i]=l+1\nprint(*x)\n \t\t \t\t\t \t\t \t \t\t \t\t\t \t\t", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append((a[i],-1))\r\nfor i in range(m):\r\n c.append((b[i],i))\r\n\r\nans=[0]*m\r\nc.sort()\r\ncnt=0\r\nfor _,i in c:\r\n if i==-1:\r\n cnt+=1\r\n else:\r\n ans[i]=cnt\r\n\r\nprint(*ans)", "from bisect import bisect_right as br\na,b=map(int,input().split())\nl1 =list(map(int,input().split()))\nl2= list(map(int,input().split()))\nl1.sort()\nfor i in l2:\n print(br(l1,i),end=' ')\nprint()\n\t \t\t\t\t\t\t\t \t\t\t \t \t \t \t\t\t \t\t", "import sys\r\nimport bisect\r\nt,r=map(int,sys.stdin.readline().split())\r\na,b=sorted([int(x) for x in sys.stdin.readline().split()]),[int(x) for x in sys.stdin.readline().split()]\r\nR=sorted(a)\r\nout=[]\r\nfor x in b:\r\n out.append(bisect.bisect(R,x))\r\nprint(*out)", "input()\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndistintos_b = list(set(num for num in b))\r\nc = (a + list(set(num for num in b)))\r\nc.sort()\r\n\r\ndistintos_b.sort()\r\ndistintos_b_menores = {}\r\nfor i in range(len(distintos_b)):\r\n distintos_b_menores[distintos_b[i]] = i\r\n\r\nnumeros_menores = {}\r\nfor indice, num in enumerate(c):\r\n if num in numeros_menores:\r\n numeros_menores[num] += 1\r\n else:\r\n numeros_menores[num] = indice\r\n\r\nresultado = []\r\nfor indice, num in enumerate(b):\r\n resultado.append(numeros_menores[num] - distintos_b_menores[num])\r\n\r\nprint(\" \".join(map(str, resultado)))\r\n\r\n", "n, m = map(int, input().split())\narr1 = list(map(int, input().split()))\narr2 = list(map(int, input().split()))\narr1.sort()\nfor x in arr2:\n l = -1\n r = n\n while r - l > 1:\n i = (r + l) // 2\n if arr1[i] <= x:\n l = i\n else:\n r = i \n\n print(l+1, end=' ')\n\n\t \t\t \t \t\t\t\t \t \t \t\t \t", "import math\r\n\r\n\r\ndef binary_search(l, target_val, s, e):\r\n if l[0] > target_val:\r\n return 0\r\n elif l[-1] <= target_val:\r\n return len(l)\r\n else:\r\n mid = (s + e) // 2\r\n if l[mid] <= target_val and l[mid + 1] > target_val:\r\n return mid + 1\r\n else:\r\n if l[mid] <= target_val:\r\n return binary_search(l, target_val, mid + 1, e)\r\n else:\r\n return binary_search(l, target_val, s, mid)\r\n\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = sorted([int(i) for i in input().split(\" \")])\r\n b = [int(i) for i in input().split(\" \")]\r\n collector = []\r\n for i in b:\r\n collector.append(str(binary_search(a, i, 0, len(a))))\r\n print(\" \".join(collector))\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "def bin_search(array: list, target):\r\n l = -1\r\n r = len(array)\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if array[mid]<=target:\r\n l = mid\r\n else:\r\n r = mid\r\n return r\r\n \r\nn,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nb = [int(x) for x in input().split()]\r\n\r\nfor i in b: \r\n print(bin_search(a,i), end = \" \")", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# For fast IO use sys.stdout.write(str(x) + \"\\n\") instead of print\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nfor t in range(1):\r\n n, m = get_ints()\r\n a = get_list()\r\n btemp = get_list()\r\n b = []\r\n \r\n for i in range(m):\r\n b.append([i, btemp[i]])\r\n \r\n a.sort()\r\n b.sort(key = lambda x: x[1])\r\n ptra, ptrb = 0, 0\r\n ans = {}\r\n strs = []\r\n \r\n while ptrb < m:\r\n while ptra < n and a[ptra] <= b[ptrb][1]:\r\n ptra += 1\r\n ans[b[ptrb][0]] = ptra\r\n ptrb += 1\r\n \r\n for i in range(m):\r\n strs.append(str(ans[i]))\r\n print(\" \".join(strs))", "from operator import le\n\n\ndef Sol(a, b):\n a_size = len(a)\n b_size = len(b)\n a.sort()\n b_with_inds = [(b[i], i) for i in range(b_size)]\n b_with_inds.sort(key=lambda x: x[0])\n\n end_ind = 0\n\n answers = [0 for i in range(b_size)]\n for i in range(b_size):\n while end_ind < a_size and a[end_ind] <= b_with_inds[i][0]:\n end_ind += 1\n answers[b_with_inds[i][1]] = end_ind\n\n return answers\n\ndef GetInput():\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n return a, b\n\n\n\na, b = GetInput()\nanswers = Sol(a, b)\nb_size = len(b)\nfor i in range(b_size):\n if i == b_size - 1:\n print(answers[i])\n else:\n print(answers[i], end=' ')\n", "import math\r\nfrom collections import defaultdict\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\na.sort()\r\nc=[]\r\nfor i in range(m):\r\n c.append([b[i],i,0])\r\n\r\nc.sort()\r\n\r\ni = 0\r\nj = 0\r\n\r\nwhile j < m :\r\n if i < n:\r\n while a[i] <= c[j][0]:\r\n i+=1\r\n if i == n:\r\n break\r\n c[j][2] = i\r\n j+=1\r\n\r\nc.sort(key = lambda x:x[1])\r\nfor i in c:\r\n print(i[2], end=' ')\r\nprint()\r\n\r\n\r\n", "from bisect import bisect_right\n\ninput()\na = sorted(map(int, input().split()))\nprint(*[bisect_right(a, int(n)) for n in input().split()])\n", "import bisect\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\r\n a.sort()\r\n\r\n for i in b:\r\n result = bisect.bisect_right(a, i)\r\n print(result, end=' ')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import bisect\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nlist_ans=[]\r\nfor x in b:\r\n list_ans.append(bisect.bisect_right(a,x))\r\nprint(*list_ans)", "def ttt(a,x,n):\r\n l,r=0,n-1\r\n res=0\r\n while r>=l:\r\n m=(r+l)//2\r\n if a[m]>x:\r\n r=m-1\r\n else:\r\n res=m+1\r\n l=m+1\r\n return res\r\n\r\nn,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nb=list(map(int,input().split()))\r\nres=[]\r\nfor i in range(m):\r\n res.append(ttt(a,b[i],n))\r\nprint(*res)\r\n", "from os import environ\nfrom bisect import bisect_left, bisect_right\nimport logging\n\nif __name__ == \"__main__\":\n debug_logs = environ.get(\"COMP_DEBUG\", False)\n logging.basicConfig(level=(logging.DEBUG if debug_logs else logging.WARNING))\n\n n, m = [int(i) for i in input().split()]\n arr1 = [int(i) for i in input().split()]\n arr2 = [int(i) for i in input().split()]\n logging.debug(f\"Input :: {n=} {m=}\")\n logging.debug(f\"Input :: {arr1=}\")\n logging.debug(f\"Input :: {arr2=}\")\n arr1.sort()\n ans = [bisect_right(arr1, i) for i in arr2]\n print(\" \".join([str(i) for i in ans]))\n # diffs = sorted([i - j for i, j in zip(teacher_interest, student_interest)])\n # logging.debug(f\" {diffs=}\")\n # ans = 0\n # for i, diff in enumerate(diffs):\n # lower_bound = -diff + 1\n # j = bisect_left(diffs, lower_bound, lo=i + 1)\n # logging.debug(f\"found pairs :: {(len(diffs) - j)} at {i=}\")\n # ans += len(diffs) - j\n # print(ans)\n", "def bs(arr,x):\r\n lo=0\r\n hi=len(arr)-1\r\n while lo<hi:\r\n mid=(lo+hi+1)//2\r\n if arr[mid]>x:\r\n hi=mid-1\r\n else:\r\n lo=mid\r\n if arr[lo]<=x:\r\n return lo\r\n return -1\r\n\r\nn,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\na.sort()\r\nfor i in b:\r\n print(1+bs(a,i),end=\" \")", "n, m = map(int, input().split())\nn_list, m_list = sorted(list(map(int, input().split()))), list(map(int, input().split()))\nunique_m_values = sorted(list(set(m_list)))\n \nvalue_index_map = {}\nn_index = 0\nfor m_value in unique_m_values:\n while n_index < len(n_list) and n_list[n_index] <= m_value:\n n_index += 1\n value_index_map[m_value] = n_index\n \nprint(*[value_index_map[value] for value in m_list])\n \t \t\t\t \t \t \t\t \t \t \t\t\t \t\t", "arr_size, _ = map(int, input().split())\r\narr = sorted(list(map(int, input().split()))) # sorted\r\nqueries = map(int, input().split())\r\n\r\nfor query in queries:\r\n\tleft = 0\r\n\tright = arr_size - 1\r\n\tans = -1\r\n\twhile left <= right:\r\n\t\tmid = (left + right) // 2\r\n\t\tif arr[mid] <= query:\r\n\t\t\tans = mid\r\n\t\t\tleft = mid + 1\r\n\t\telse:\r\n\t\t\tright = mid - 1\r\n\tprint(ans + 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\na.sort()\r\nfor i in range(m):\r\n l=-1\r\n r=n\r\n while l+1!=r:\r\n s=(l+r)//2\r\n if a[s]>b[i]:\r\n r=s\r\n else:\r\n l=s\r\n print(r, end=' ')\r\n", "n,q = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nfor i in range(q):\r\n m = b[i]\r\n ans = -1\r\n l = 0\r\n r = n - 1\r\n while(l <= r):\r\n c = (l + r)//2\r\n if(a[c] <= m):\r\n ans = c\r\n l = c + 1\r\n else:\r\n r = c - 1\r\n print(ans + 1, end = ' ')\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\na.sort()\r\nres = []\r\nfor i in range(m):\r\n t = b[i]\r\n lo,hi = 0,n-1\r\n while lo <= hi:\r\n mid = (lo + hi)//2\r\n if a[mid] <= t:\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\n\r\n res.append(str(hi+1))\r\n\r\nprint(' '.join(res))", "import bisect\nn, m = map(int,input().split())\nara1 = [int(x) for x in input().split()]\nara2 = [int(x) for x in input().split()]\nara1.sort()\nfor i in range(m):\n print(bisect.bisect(ara1,ara2[i]))\n\t\t\t \t \t \t \t \t\t \t \t \t \t\t\t\t \t", "from bisect import bisect_right\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nb = list(map(int, input().split()))\r\nfor i in b:\r\n print(bisect_right(arr, i), end=\" \")", "import bisect\n\ndef solve():\n n, q = map(int, input().split())\n\n #[1,1,2,2,5]\n arr = list(map(int, input().split()))\n arr2 = list(map(int, input().split()))\n arr.sort()\n for i in arr2:\n ind = bisect.bisect_right(arr, i)\n print(ind, end=' ')\n\nif __name__ == '__main__':\n solve()\n \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\ndef prit(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\n\n\ndef BST(i,j,k):\n while(i<=j):\n m=i+(j-i)//2\n if l[m]<=k:\n i=m+1\n elif l[m]>k:\n j=m-1\n #print(i,j)\n return i\n\na,b=map(int,input().split())\nl=list(map(int,input().split()))\nm=list(map(int,input().split()))\nl.sort()\n#print(l)\nfor i in m:\n print(BST(0,a-1,i),end=' ')\nprint()\n \t \t \t \t\t \t\t\t \t\t \t \t \t \t", "import bisect \n\nn = input()\n\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\na.sort()\n\nout = []\nfor i in b: \n out.append(bisect.bisect(a,i)) \n\nprint(*out)\n\t \t \t \t\t \t\t\t \t\t\t\t \t\t\t \t", "from bisect import bisect_right\r\nn,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n print(bisect_right(a,i),end=' ')", "def binarysearch(a, b, c):\r\n left = a\r\n right = b\r\n res = -1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if arraya[mid] <= c:\r\n res = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n \r\n \r\n return res+1\r\n\r\nn, m = map(int,input().split())\r\narraya = list(map(int,input().split()))\r\narrayb = list(map(int,input().split()))\r\narraya.sort()\r\n#arrayb.sort()\r\nans = []\r\n#pointer = 0\r\n\r\nfor i in range(m):\r\n #pointer = binarysearch(pointer, n - 1, arrayb[i])\r\n ans.append(binarysearch(0, n - 1, arrayb[i]))\r\n #pointer -= 1\r\n\r\nfor i in ans:\r\n print(i, end = \" \")\r\nprint(\" \")", "from collections import deque\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\nimport copy\n\nfrom collections import deque\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\nimport copy\n\na,b = map(int,input().split())\naa = list(map(int,input().split()))\nbb = list(map(int,input().split()))\naa.sort()\nans = []\nfor i in bb:\n ans.append(bisect_right(aa,i))\nprint(*ans)\n", "# https://codeforces.com/problemset/problem/600/B\n\nimport bisect\n\ndef handle() -> str:\n input()\n\n a = sorted(int(s) for s in input().split(\" \"))\n b = [int(s) for s in input().split(\" \")]\n result = []\n\n for value in b:\n right_index = bisect.bisect_right(a, value)\n result.append(str(right_index))\n\n return \" \".join(result)\n\nprint(handle())", "from bisect import bisect\nm,n = map(int,input().split())\na = [int(x) for x in input().split()]\na.sort()\ndef search(x):\n lo = 0\n hi = m-1\n ans = -1\n while lo<=hi:\n mid = (lo+hi)//2\n if a[mid]<=x:\n ans=mid\n lo=mid+1\n else:\n hi = mid-1\n return ans+1\nb = [int(x) for x in input().split()]\nprint(*(search(i) for i in b))\n \t\t \t\t\t \t \t \t\t \t\t \t \t\t\t\t \t\t", "from bisect import bisect_right\n_ = input()\n\na = sorted(map(int, input().split()))\n\nfor i in map(int, input().split()):\n print(bisect_right(a, i), end=' ')\n\n \t\t\t \t\t \t\t \t \t \t\t\t\t \t", "n, m = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\nres = [None for x in range(m)]\nixb = sorted(range(m), key=lambda k: b[k])\na.sort(reverse=False)\nia, ib = 0, 0\n# print([b[i] for i in ixb])\n# print(a)\nwhile ia < n and ib < m:\n # print(\"{} {} {}\".format(ia, ib, res))\n if a[ia] <= b[ixb[ib]]:\n ia += 1\n else:\n res[ixb[ib]] = ia\n ib += 1\nwhile ib < m:\n res[ixb[ib]] = ia\n ib += 1\nprint(\" \".join(str(x) for x in res))\n", "from bisect import bisect_right\r\n\r\nn, m = map(int, input().split())\r\nnum = sorted([int(i) for i in input().split()])\r\nneed = [int(i) for i in input().split()]\r\nfor i in need:\r\n print(bisect_right(num, i), end=' ')\r\n", "def binarySearch(arr, x):\n # Binary search implementation\n left, right = 0, len(arr) - 1\n while left <= right:\n mid = (left + right) // 2\n if arr[mid] <= x:\n left = mid + 1\n else:\n right = mid - 1\n return left\n\n# Reading input data\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n# Sorting array A\na.sort()\n\n# Finding the number of elements in A that are <= than each element in B\nfor j in range(m):\n count = binarySearch(a, b[j])\n print(count, end=' ')\n \t \t \t \t \t\t\t \t\t\t \t \t \t", "\ndef count_elements_less_or_equal(a, b):\n a.sort()\n result = []\n for num in b:\n count = 0\n left, right = 0, len(a) - 1\n while left <= right:\n mid = (left + right) // 2\n if a[mid] <= num:\n count = mid + 1\n left = mid + 1\n else:\n right = mid - 1\n result.append(count)\n return result\n\nif __name__ == \"__main__\":\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n\n result = count_elements_less_or_equal(a, b)\n print(*result)\n \t \t\t \t\t\t\t\t \t\t\t \t\t \t \t\t", "def last(num,key):\n l = 0\n r = len(num)-1\n ans = -1\n while(l<=r):\n mid = l + (r-l)//2\n if(num[mid] <= key):\n ans = mid\n l = mid+1\n elif(num[mid]>key):\n r = mid-1\n else:\n l = mid+1\n return ans\n \nn,m = map(int,input().split())\nnum = list(map(int,input().split()))\nnum = sorted(num)\ntest = list(map(int,input().split()))\nfor i in range(m):\n key = test[i]\n ref = last(num,key)\n print(ref+1,end=\" \")\n \n\n\t\t \t \t \t \t \t\t\t\t \t \t \t\t \t\t", "nums = [int(x) for x in input().split()]\nlist1 = [int(x) for x in input().split()]\nlist2 = [int(x) for x in input().split()]\n\nnum1 = nums[0]\n\nlist1.sort()\n\ndef binary_search(num):\n left = 0\n right = num1 - 1\n\n while left <= right:\n mid = (left + right) // 2\n\n if list1[mid] <= num:\n left = mid + 1\n else:\n right = mid - 1\n\n return left\n\nfor x in list2:\n index = binary_search(x)\n print(index, end=' ')\n \t \t\t \t \t \t\t \t\t\t \t\t", "n , m = list(map(int , input().split()))\r\na = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\na = sorted(a)\r\nres = []\r\nr = 0\r\nlast = 0\r\n\r\nfor el in b: \r\n l = 0 \r\n r = n-1\r\n mid = 0 \r\n while r >= l : \r\n mid = (l+r)//2 \r\n if(a[mid] > el):\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n res.append(l)\r\n\r\nprint(*res)", "def buscaBinaria(vetor, tamanho, x):\n\tinicio = 0\n\tfim = tamanho - 1\n\twhile(inicio <= fim):\n\t\tmetade = int((inicio + fim) // 2)\n\t\tif(vetor[metade] <= x):\n\t\t\tinicio = metade + 1;\n\t\telse:\n\t\t\tfim = metade - 1\n\treturn fim\n\t\t\nm, n = list(map(int, input().split()))\narr1 = list(map(int, input().split()))\narr2 = list(map(int, input().split()))\narr1.sort()\nfor i in range(n): \n\tindex = buscaBinaria(arr1, m, arr2[i])\n\tprint(index + 1,end=\" \")\n \t\t \t \t \t\t \t \t\t \t \t \t\t\t\t", "n1, n2 = map(int, input().split())\narr1 = sorted(list(map(int, input().split())))\narr2 = list(map(int, input().split()))\nresult = []\nfor i in range(n2):\n l = -1\n r = n1\n while r - l > 1:\n mean = (r + l) // 2\n if arr1[mean] <= arr2[i]:\n l = mean\n else:\n r = mean\n result.append(l + 1)\nprint(*result)\n \t\t\t\t\t\t \t \t\t\t\t \t \t\t\t\t \t\t", "def Bs(arr,h,l,x):\n ans = -1\n while(l<=h):\n mid = l +(h-l)//2\n if(arr[mid] <= x):\n ans = mid\n l = mid+1\n elif(arr[mid]>x):\n h = mid-1\n else:\n l = mid+1\n return ans\n\na,b = map(int,input().split())\narr = list(map(int,input().split()))\narr = sorted(arr)\nll = list(map(int,input().split()))\nlll = []\nfor i in ll:\n h = len(arr)-1\n l = 0\n x = i\n lll.append(Bs(arr,h,l,x)+1)\nprint(*lll,sep = \" \")\n \t \t\t \t\t\t\t\t \t \t\t\t\t \t \t", "from sys import stdin\nfrom bisect import bisect\n\nstdin.readline()\narr1 = sorted(map(int, stdin.readline().strip().split()))\narr2 = list(map(int, stdin.readline().strip().split()))\n\nfor i in arr2:\n\tprint(bisect(arr1, i), end=' ')\n\n \t \t \t \t \t\t\t \t\t \t \t \t", "input()\nnlist,mlist = sorted(list(map(int,input().split()))),list(map(int,input().split()))\nref = mlist.copy()\nmlist = sorted(list(set(mlist)))\ndic = {}\nco,n = 0,len(nlist)\nfor x in mlist:\n while co != n:\n if nlist[co] > x:\n dic[x] = co\n break\n elif nlist[co] == x:\n if co+1 != n and nlist[co+1] != x:\n dic[x] = co+1\n break\n co += 1\n else:\n dic[x] = co\n[print(dic[x],end=' ') for x in ref]\nprint()\n \t \t \t\t \t\t \t\t \t \t\t \t \t\t\t", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\na.sort()\n\nfor bj in b:\n left, right = 0, n - 1\n while left <= right:\n mid = (left + right) // 2\n if a[mid] <= bj:\n left = mid + 1\n else:\n right = mid - 1\n print(left, end=\" \")\n\n \t\t \t \t \t \t \t \t\t \t\t \t", "def ind(x,e):\r\n a=-1\r\n l=0\r\n r=len(x)-1\r\n f=False\r\n while l<=r:\r\n m=l+(r-l)//2\r\n if x[m]==e: \r\n a=m\r\n l=m+1\r\n elif x[m]>e:\r\n r=m-1\r\n else:\r\n l=m+1\r\n #print(a)\r\n if a!=-1:\r\n return a+1\r\n return l\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.sort()\r\n#print(a)\r\nfor i in b:\r\n print(ind(a,i),end=' ')\r\n", "n, m = map(int, input().split())\nl = sorted(map(int, input().split()))\n\ndef binary_search_right(arr, x):\n left = 0\n right = len(arr)\n\n while left < right:\n mid = (left + right) // 2\n if arr[mid] <= x:\n left = mid + 1\n else:\n right = mid\n\n return left\n\nfor x in map(int, input().split()):\n print(binary_search_right(l, x))\n\n\t \t \t \t\t \t\t \t\t\t\t\t \t\t\t\t \t", "import bisect\r\ninput()\r\n\r\na = sorted(list(map(int, input().split(' '))))\r\nb = list(map(int, input().split(' ')))\r\n\r\nfor elt in b:\r\n print(bisect.bisect(a, elt), end=\" \")\r\nprint()", "import sys\nimport bisect\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nA = sorted(map(int, input().split()))\nB = list(map(int, input().split()))\n\nrs = []\nfor q in B :\n rs.append(str( bisect.bisect_right(A, q) ))\nprint(\" \".join(rs))\n", "from bisect import *\n\n\ndef I(): return map(int, input().split())\n\n\nI()\n\nl = sorted(I())\nfor e in I():\n print(bisect_right(l, e), end=' ')\n\n\t\t \t\t\t\t \t\t\t \t\t \t\t\t \t \t\t \t\t", "input()\nn_values, m_values = sorted(list(map(int, input().split()))), list(map(int, input().split()))\nunique_m_values = sorted(list(set(m_values)))\n\nvalue_index_map = {}\nn_index = 0\nfor m_value in unique_m_values:\n while n_index < len(n_values) and n_values[n_index] <= m_value:\n n_index += 1\n value_index_map[m_value] = n_index\n\nprint(*[value_index_map[value] for value in m_values])\n\n\t\t \t\t \t \t \t \t \t \t\t\t \t", "def binarysearch(lst, l, r, key):\n result = -1\n while l <= r:\n mid = l + (r - l) // 2\n if lst[mid] <= key:\n result = mid\n l = mid + 1\n else:\n r = mid - 1\n return result+1\n\n\nn, m = map(int, input().split())\narr = list(map(int, input().split()))\nlst = sorted(arr)\nbrr = list(map(int, input().split()))\nfor i in brr:\n answer = binarysearch(lst, 0, len(arr)-1, i)\n print(str(answer),end = \" \")\n \t \t \t \t \t\t \t \t\t \t \t\t \t\t", "n, m = [int(x) for x in input().split()]\na, b = [] * n, [] * m \na, b = [int(x) for x in input().split()], [int(x) for x in input().split()]\na.sort()\nanswer = []\ndef f(a, bj):\n l = -1\n r = len(a)\n while r - l > 1:\n i = (r + l) // 2\n if a[i] <= bj:\n l = i\n else:\n r = i\n return r\n\nfor x in b:\n answer.append(f(a, x))\n \nprint(*answer)\n \t \t \t \t \t\t\t \t\t \t\t\t\t", "import bisect\n\n_ = str(input())\narr1 = sorted([int(i) for i in str(input()).split()])\narr2 = [int(i) for i in str(input()).split()]\n\nsms = [str(bisect.bisect_right(arr1, el)) for el in arr2]\nprint(\" \".join(sms))\n", "import sys\nfrom itertools import accumulate as acm\nfrom collections import Counter as dic\nmo=1000000007\ndef modProduct(a,b):\n return (( a%mo )*( b%mo )) %mo\ndef modSum(a,b):\n return (( a%mo )+( b%mo )) %mo\ndef modDiff(a,b):\n return (( a%mo )-( b%mo ) + mo) %mo\ndef presum(l):\n return list(acm(l))\ndef prin(a):\n sys.stdout.write(str(a)+' ')\ndef input():\n return sys.stdin.readline().strip()\ndef checkbit(n,k):\n return (n&(1<<k))!=0\ndef countSetBit(n):\n c=0\n while n!=0:\n n=n&(n-1)\n c+=1\n return c\ndef power(a,b):\n x=a\n ans=1\n while b!=0:\n if b&1==1:\n ans=modProduct(ans,x)\n x=modProduct(x,x)\n b>>=1\n return(ans)\ndef setBit(a,b):\n return (a|(1<<b))\ndef countBit(a):\n c=0\n while a!=0:\n a>>=1\n c+=1\n return c\ndef cuberoot(n):\n l=0\n r=n\n m=0\n while l<=r:\n m=l+(r-l)//2\n x=m*m*m\n if x==n:\n return m\n if x>n:\n r=m-1\n else:\n l=m+1 \ndef sol(d,s):\n for i in d:\n if k-i in s:\n for j in s[k-i]:\n for z in d[i]:\n if z not in j:\n return 'true'\n return 'false'\ndef makePlaindrome(s):\n d=dic(s)\n odd=False\n x=False\n for i in d:\n if d[i]%2==1:\n if odd:\n return 'NO SOLUTION'\n odd=True\n x=[i,d[i]]\n ans=''\n if x:\n d.pop(x[0])\n for i in d:\n ans+=i*(d[i]//2)\n return(ans+x[0]*x[1]+ans[::-1])\n for i in d:\n ans+=i*(d[i]//2)\n return(ans+ans[::-1])\ndef canPile(a,b):\n x=min(a,b)\n y=max(a,b)\n if 2*x<y:\n return False\n if (2*x-y)%3==0:\n return True\n return False\ndef zeroes(a):\n c=0\n while a>=5:\n c+=a//5\n a=a//5\n return c\ndef twoSets(n):\n x=(n*(n+1))//2\n if x&1==1:\n prin('NO')\n return False\n x=[]\n xs=0\n ys=0\n y=[]\n for i in range(n,0,-1):\n if xs>ys:\n y.append(i)\n ys+=i\n else:\n xs+=i\n x.append(i)\n prin('YES')\n print(len(x))\n print(*x)\n prin(len(y))\n print(*y)\ndef bins(a,n,k):\n l=0\n r=n-1\n found=False\n while l<=r:\n m=l+(r-l)//2\n if a[m]==k:\n ans=m\n found=True\n l=m+1\n elif a[m]<k:\n l=m+1\n else:\n r=m-1\n if found:\n return ans+1\n return l\n \nn,k=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort()\n# print(l)\nk=list(map(int,input().split()))\nfor i in k:\n prin(bins(l,n,i))\n\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\nvi=list(map(int, input().split()))\r\nvi.sort()\r\nx=list(map(int, input().split()))\r\nfor i in range(m):\r\n\tstart, finish=-1, n\r\n\twhile start+1<finish:\r\n\t\tmid=(start+finish)//2\r\n\t\tif vi[mid]<=x[i]:\r\n\t\t\tstart=mid\r\n\t\telse:\r\n\t\t\tfinish=mid\r\n\tprint(finish, end=\" \")", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nresp = list()\na.sort()\nfor e in b:\n l = 0\n r = len(a)-1\n temp = -1\n while l <= r:\n m = (l+r)//2\n if a[m] > e:\n r = m - 1\n else:\n temp = m\n l = m + 1\n resp.append(str(temp + 1))\nprint(' '.join(resp))\n \t \t\t\t \t \t \t \t\t \t \t \t\t \t\t", "import sys\r\n\r\ndef bs(l, h, x):\r\n while l < h:\r\n m = (l + h + 1) // 2\r\n if a[m] <= x:\r\n l = m\r\n else:\r\n h = m - 1\r\n return l\r\n\r\n\r\nn, m = map(int, input().split())\r\na = [-sys.maxsize] + sorted((map(int, input().split())))\r\nb = map(int, input().split())\r\nfor i in b:\r\n print(bs(0, n, i), end = ' ')", "def rng(a,b):\n n = len(a)\n m = len(b)\n lst=[0]*m\n a.sort()\n for j in range(m):\n l = -1 \n r = n \n while r - l > 1:\n med = (l+r)//2\n if a[med] <= b[j]:\n l = med\n else:\n r = med\n lst[j] = l + 1\n return lst\n\nn, m = map(int, input().split())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nprint(*rng(a,b))\n\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\nsorted_b = b[:]\r\nsorted_b.sort()\r\na.sort()\r\n\t\r\nanswers = {}\r\n\r\ncontador = 0\r\ni = 0\r\nj = 0\r\nwhile i < len(a) and j < len(b):\r\n\tif a[i] <= sorted_b[j]:\r\n\t\tcontador += 1\r\n\t\tanswers[sorted_b[j]] = contador\r\n\t\r\n\t\ti += 1\r\n\t\r\n\telse:\r\n\t\tanswers[sorted_b[j]] = contador\r\n\t\tj += 1\r\n\t\r\nif j < len(b):\r\n\tfor i in range(j, m):\r\n\t\tanswers[sorted_b[i]] = contador\r\n\r\nfor i in range(m):\r\n\tif i == m-1:\t\r\n\t\tprint(answers[b[i]])\r\n\t\r\n\telse:\r\n\t\tprint(answers[b[i]], end=' ')\r\n\t\r\n", "from bisect import *\nn,m=map(int,input().split())\nl = sorted(map(int,input().split()))\nfor x in list(map(int,input().split())):\n print(bisect_right(l,x))\n\t \t \t \t \t\t\t\t\t \t \t \t \t\t \t", "import os\r\nimport sys\r\nimport time\r\nimport math as mt\r\nimport pprint\r\nimport itertools as it\r\nimport operator as op\r\nimport bisect as bs\r\nimport functools as fn\r\nimport queue\r\nfrom collections import deque, defaultdict , OrderedDict, Counter, ChainMap\r\nmaxx, localsys, mod = 1 << 60, 0, int(1e9 + 7)\r\ndef nCr(n, r): return reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)\r\n\r\n\r\ndef ceil(n, x): return (n + x - 1) // x\r\n\r\n\r\nosi, oso = '/home/priyanshu/Documents/cp/input.txt', '/home/priyanshu/Documents/cp/output.txt'\r\nif os.path.exists(osi):\r\n\tsys.stdin = open(osi, 'r')\r\n\tsys.stdout = open(oso, 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef maps(): return map(int, input().split())\r\n\r\n# THINK ABOUT THE EDGE CASES ..........\r\n\r\n# DON'T SUBMIT UNLESS YOU ARE ABSOLUTELY SURE !!!!!\r\n\r\ndef Kth_beautiful_string():\r\n\tfor _ in range(int(input())):\r\n\t\tn , k = maps() ; arr = ['a']*n\r\n\t\tfor i in range(n-1 , -1 , -1):\r\n\t\t\tif n-i-1 >= k:\r\n\t\t\t\tarr[i]= arr[i + (n-i-1) - (k-1)] ='b'\r\n\t\t\t\tprint(''.join(arr)) ; break\r\n\t\t\tk-=n-i-1\r\n\t#constantly decrease the number of string whose left most position is at i,because at every ith position (n-i-1) strings exists whose right most position is at i\r\ndef subhate():\r\n\tfor _ in range(*maps()):\r\n\t\ts = input().rstrip('\\n')\r\n\t\ts1 , s0 = 0 , 0\r\n\t\tfor i in s:\r\n\t\t\ts1 += (i == '1') ; s0 += (i == '0')\r\n\t\tp1 , p0 = 0,0\r\n\t\tans = maxx\r\n\t\tfor i in s:\r\n\t\t\tp1 += (i == '1') ;p0 += (i == '0') ;s1 -= (i == '1') ; s0 -= (i == '0')\r\n\t\t\tans = min(ans , (p1+s0) , (p0 + s1))\r\n\t\tprint(ans)\r\n\t\t#convert the string into 0000....1111 or 11111....00000\r\ndef pair_of_topics():\r\n\tn, = maps()\r\n\ta ,b = [*maps()] , [*maps()]\r\n\tans =0\r\n\tc = sorted(a[i]-b[i] for i in range(n))\r\n\tfor i in range(n):\r\n\t\tans += max(i - bs.bisect_right(c , -c[i]),0)\r\n\tprint(ans)\r\n\t#the i <j is given , so you don't count (1 , 2) and (2 ,1 ) as different pairs\r\n\r\ndef zero_remainder_array():\r\n\tfor _ in range(*maps()):\r\n\t\tn , k = maps()\r\n\t\ta = [*maps()]\r\n\t\tans , cnt = 0 , defaultdict(int)\r\n\t\tfor i in a:\r\n\t\t\tif i % k :\r\n\t\t\t\tcnt[i%k]+=1\r\n\t\t\t\tans = max(ans , k*cnt[i%k] - i%k + 1)\r\n\t\tprint(ans)\r\n\r\ndef s1(arr , key):\r\n\tl , h = 0 , len(arr) - 1\r\n\tidx = -1\r\n\twhile l<= h:\r\n\t\tm = (l+h) >> 1\r\n\t\tif arr[m] <= key:\r\n\t\t\tidx = m\r\n\t\t\tl = m + 1\r\n\t\telse:\r\n\t\t\th = m - 1\r\n\treturn idx\r\n\r\ndef queries():\r\n\tn, m = maps()\r\n\ta = sorted([*maps()])\r\n\tb = [*maps()]\r\n\tans = []\r\n\tfor i in range(m):\r\n\t\tans.append(s1(a , b[i]) + 1)\r\n\tprint(*ans)\r\n\t\t\r\nqueries()\r\n\r\n\r\n\r\n", "from bisect import bisect_right\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = []\r\na.sort()\r\nfor i in b:\r\n ans.append(bisect_right(a, i))\r\n \r\nfor i in ans:\r\n print(i, end=\" \")", "n = [int(m) for m in input().split()]\r\na = [int(m) for m in input().split()]\r\nb = [int(m) for m in input().split()]\r\na.sort()\r\nh = len(a)-1\r\nmid = len(a)//2\r\nl = 0\r\nan = \"\"\r\nans = \"\"\r\ndef bs(i,h,mid,l,a,ans):\r\n while l<=h:\r\n mid = (l+h)//2\r\n if a[mid] <= i:\r\n l = mid+1\r\n else:\r\n h = mid-1\r\n an = str(h+1)\r\n return an\r\n\r\nfor i in b:\r\n ans += bs(i,h,mid,l,a,ans) + \" \"\r\nprint(ans)", "import sys\r\nreadline=sys.stdin.readline\r\nimport bisect\r\n\r\nN,M=map(int,readline().split())\r\nA=sorted(list(map(int,readline().split())))\r\nans_lst=[]\r\nfor b in map(int,readline().split()):\r\n ans=bisect.bisect_right(A,b)\r\n ans_lst.append(ans)\r\nprint(*ans_lst)", "def f(x):\n global array1\n return array1[x]\n\n\ndef binarySearchLowerBound(k):\n global array1\n l = -1\n r = len(array1)\n while r - l > 1:\n mid = (r + l) // 2\n if f(mid) <= k:\n l = mid\n else:\n r = mid\n return l\n\n\na, b = input().split()\narray1 = list(map(int, input().split()))\narray1.sort()\narray2 = list(map(int, input().split()))\nfor i in array2:\n print(binarySearchLowerBound(i) + 1, end=' ')\n", "import bisect\na,b=map(int,input().split())\nl1=[int(i) for i in input().split()]\nl2=[int(i) for i in input().split()]\nl1.sort()\nf=0\nans=[]\nlow=0\nhigh=a-1\nmid=(low+high)//2\nfor i in l2:\n print(bisect.bisect_right(l1,i,0,a),end=\" \")\n \t \t\t\t \t\t \t\t \t\t \t", "# your code goes here\ndef lower(lis,k):\n\tl = 0\n\tr = len(lis)-1\n\twhile l <= r:\n\t\tm = l + ((r-l)//2)\n\t\tif k >= lis[m]:\n\t\t\tl = m + 1\n\t\telse:\n\t\t\tr = m - 1\n\treturn l\nn, k = map(int,input().split())\nl = list(map(int,input().split()))\nq = list(map(int,input().split()))\nl.sort()\nfor i in q:\n\tprint(lower(l, i), end = \" \")\nprint()\n \t \t \t\t \t \t\t \t\t \t\t\t \t\t", "def bs(e,arr):\r\n l=0;r=n-1;ans=-1\r\n while l<=r:\r\n mid=(l+r)//2\r\n if arr[mid]<=e:ans=mid;l=mid+1\r\n else:r=mid-1\r\n if ans==-1:return 0\r\n return ans+1\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na=sorted(a);ans=[]\r\nfor i in range(m):\r\n e=b[i]\r\n k=bs(e,a)\r\n ans.append(k)\r\nprint(*ans)\r\n \r\n \r\n", "def main():\r\n n, m = read_ints()\r\n aseq = read_ints()\r\n bseq = read_ints()\r\n\r\n aseq.sort()\r\n\r\n ans = []\r\n for bi in bseq:\r\n lo = 0\r\n hi = n\r\n while lo < hi:\r\n mid = lo + (hi - lo) // 2\r\n if aseq[mid] <= bi:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n \r\n ans.append(lo)\r\n\r\n print(*ans)\r\n\r\n \r\n\r\n\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n import sys\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n main()\r\n", "from bisect import bisect_right\ninput()\nl = sorted(map(int, input().split()))\nm = list(map(int, input().split()))\nd = {x:bisect_right(l, x) for x in set(m)}\nprint(*[d[x] for x in m])\n\t \t \t\t\t\t\t \t \t\t\t \t\t \t \t \t\t", "if __name__ == '__main__':\r\n n, m = list(map(int, input().strip().split()))\r\n a = list(map(int, input().strip().split()))\r\n b = list(map(int, input().strip().split()))\r\n c = []\r\n for i in range(m):\r\n c.append([b[i], i])\r\n a.sort()\r\n c = sorted(c, key=lambda k: k[0])\r\n\r\n left = 0\r\n res = [0] * m\r\n for right in range(m):\r\n while left < n and a[left] <= c[right][0]:\r\n left += 1\r\n res[c[right][1]] = left\r\n for i in range(m):\r\n print(res[i], end=\" \")", "def binsearch(x):\r\n l, r = 0, n\r\n while l<r:\r\n m = (l+r)//2\r\n if a[m] <= x:\r\n l = m+1\r\n else:\r\n r = m\r\n \r\n return l\r\n\r\nn, m = map(int, input().split())\r\na = sorted([int(i) for i in input().split()])\r\nb = [int(i) for i in input().split()]\r\n\r\nfor i in range(m):\r\n print(binsearch(b[i]), end = ' ')\r\n \r\n\r\n", "def binary(e,n,arr) :\r\n if arr[-1] <= e : return n \r\n l=0 ; r=n-1 ; res=0\r\n while l < r : \r\n mid=(l+r)//2\r\n if arr[mid] > e : r= mid\r\n else : l= mid+1 \r\n return l\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split())) ; l.sort()\r\narr=list(map(int,input().split()))\r\nfor x in arr: print(binary(x,n,l),end=' ')\r\n ", "import sys\ndef prin(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\ndef binarysearch(a,l,r,k):\n while(l<=r):\n mid=((r-l)//2)+l \n if(a[mid]<=k):\n l=mid+1 \n else:\n r=mid-1 \n return r+1\nn,m=map(int,input().split())\nl1=[int(x) for x in input().split()]\nl2=[int(x) for x in input().split()]\nl1.sort()\nfor x in l2:\n print(binarysearch(l1,0,n-1,x),end=\" \")\n \t\t \t\t \t\t\t\t \t\t \t\t\t\t\t", "def finds_number_less_equal(arr, num):\n L = -1\n R = len(arr)\n\n while L < R -1:\n ind = L + (R - L)//2\n if arr[ind] > num:\n R = ind\n else:\n L = ind\n return R\n\nn_m = input().split()\nn = int(n_m[0])\nm = int(n_m[1])\n\na = input().split()\na = [int(a[i]) for i in range(n)]\na.sort()\nb = input().split()\nans = ''\nfor k in range(m):\n if k < m-1:\n ans += str(finds_number_less_equal(a, int(b[k]))) + ' '\n else:\n ans += str(finds_number_less_equal(a, int(b[k])))\n\nprint(ans)\n\t \t \t\t\t \t \t\t \t \t\t\t\t\t\t\t\t", "from sys import stdin, stdout\r\nfrom bisect import bisect_right\r\ninput = stdin.buffer.readline\r\n\r\nn, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns.sort()\r\nq = list(map(int, input().split()))\r\nans = [0] * m\r\nfor i in range(m):\r\n ans[i] = bisect_right(s, q[i])\r\n\r\nstdout.write(\" \".join(map(str, ans)))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb1 = b[::]\r\na.sort()\r\nb1.sort()\r\nd = {}\r\ni, j = 0, 0 \r\nwhile(j < m):\r\n c = 0\r\n while(i < n):\r\n if(a[i] <= b1[j]):\r\n c += 1 \r\n else:\r\n break\r\n i += 1 \r\n if(b1[j] not in d.keys()):\r\n if(j > 0):\r\n d[b1[j]] = d[b1[j - 1]]\r\n else:\r\n d[b1[j]] = 0\r\n d[b1[j]] += c \r\n j += 1 \r\nfor i in range(m):\r\n print(d[b[i]], end = ' ')\r\nprint()", "from bisect import bisect_right\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\na.sort()\n\nfor bj in b:\n index = bisect_right(a, bj)\n print(index, end=' ')\nprint()\n \t\t \t \t\t \t\t\t \t", "def fun(arr,n,k):\n\tl=0\n\th=n-1\n\twhile(l<=h):\n\t\tm=int((l+h)/2)\n\t\tif(arr[m]<=k):\n\t\t\tl=m+1\n\t\telse:\n\t\t\th=m-1\n\treturn h\nn,m=map(int,input().split())\na=[int(x) for x in input().split()]\nb=[int(x) for x in input().split()]\na.sort()\nfor i in range(m):\n\ti=fun(a,n,b[i])\n\tprint(i+1,end=\" \")\n \t \t\t\t\t \t\t \t \t\t \t\t\t \t", "import bisect\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\ncounts = [\"0\" for i in range(m)]\r\nfor i in range(m):\r\n lo = bisect.bisect_left(a, b[i])\r\n hi = bisect.bisect_right(a, b[i])\r\n count = hi - lo\r\n counts[i] = str(lo + count)\r\nprint(' '.join(counts))", "n, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = list(map(int, input().split()))\r\nfor i in b:\r\n l, r = -1, n\r\n while l + 1 < r:\r\n mid = l + r >> 1\r\n if a[mid] <= i: l = mid \r\n else: r = mid \r\n print(l + 1, end = ' ')", "import sys\r\n\r\ndef prit(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef BST(i,j,k):\r\n while(i<=j):\r\n m=i+(j-i)//2\r\n if l[m]<=k:\r\n i=m+1\r\n elif l[m]>k:\r\n j=m-1\r\n #print(i,j)\r\n return i\r\n\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nl.sort()\r\n#print(l)\r\nfor i in m:\r\n print(BST(0,a-1,i),end=' ')\r\nprint()", "\r\nfrom bisect import bisect\r\nI = lambda: [int(x) for x in input().split()]\r\n\r\nm, n = I()\r\nA = sorted(I())\r\nB = I()\r\nans = [bisect(A, b) for b in B]\r\nprint(\" \".join(map(str, ans)) + \"\\n\")", "def bs(lista,num):\n l = -1\n r = len(lista)\n\n while r > l +1:\n m = (l + r)//2\n if lista[m] <= num:\n l = m\n else:\n r = m\n return l + 1\n\ninpA,inpB = [int(x) for x in input().split()]\nlistaA = listaB = []\n\nlistaA = [int(x) for x in input().split()]\nlistaB = [int(x) for x in input().split()]\nlistaA = sorted(listaA)\n\nfor i in listaB:\n print(bs(listaA,i),end=\" \")\n \t\t \t\t \t\t \t \t\t \t\t", "from __future__ import print_function\nal,bl=[int(i) for i in input().split(\" \")]\na=[int(i) for i in input().split(\" \")]\nb=[int(i) for i in input().split(\" \")]\na.sort()\ndef bs(v,al):\n l=0\n r=al-1\n while l<=r and r<al:\n mid=(l+r)//2\n if a[mid]>v:\n r=mid-1\n else:\n l=mid+1\n return l\nprint(*[bs(v,al) for v in b], sep=\" \")\n\n\t\t \t\t\t \t \t \t \t\t\t\t \t \t\t\t\t \t", "def takesecond(listx):\r\n return(listx[1])\r\nlist_ans=[]\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nlist3=[]\r\na.sort()\r\na.append(2e9)\r\nfor i in range(m):\r\n list3.append([b[i],i])\r\nlist3.sort()\r\ns=0\r\nfor x in list3:\r\n while a[s]<=x[0] and s<=n:\r\n s+=1\r\n list_ans.append([s,x[1]])\r\nlist_ans.sort(key=takesecond)\r\nfor item in list_ans:\r\n print(item[0],end=' ')", "# cook your dish here\nm,n=[int(x) for x in input().split(\" \")]\na=list(map(int,input().split(\" \")))\nb=list(map(int,input().split(\" \")))\nimport bisect\nans=\"\"\na.sort()\nfor i in b:\n ans+=str(bisect.bisect_right(a,i))+\" \"\nprint(ans)", "'''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\nfrom functools import cmp_to_key\n\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))\nsort = lambda x,compare: sorted(x, key=cmp_to_key(compare))\n\nmod=1000000007\n\ndef isKthBitSet(num, pos):\n return num & (1 << pos)\n\ndef setKthBit(num, pos):\n return num | (1 << pos)\n\n\ndef bs(arr, target):\n\tleft = 0\n\tright = len(arr) - 1\n\tans = 0\n\twhile(left <= right):\n\t\tmid = left + (right - left) // 2\n\t\t\n\t\tif(arr[mid] <= target):\n\t\t\tans = mid + 1\n\t\t\tleft = mid + 1\n\t\telse:\n\t\t\tright = mid - 1\n\t\t\t\n\treturn ans\n\t\n\n#main code\nm, n = mul()\narr1 = sorted(seq())\narr2 = seq()\nfor num in arr2:\n\tprint(bs(arr1, num), end=\" \")\n\n\n\n\t \t \t \t \t \t \t\t \t \t \t\t", "def binary_search(a, x):\n left, right = 0, len(a) - 1\n while left <= right:\n mid = (left + right) // 2\n if a[mid] <= x:\n left = mid + 1\n else:\n right = mid - 1\n return right\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\na.sort()\n\nfor i in range(m):\n k = binary_search(a, b[i])\n print(k + 1, end=' ')\n \t \t \t \t\t\t \t \t \t\t", "import sys\r\nfrom math import gcd, sqrt\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\n\r\n\r\ninf = float(\"inf\")\r\nen = lambda x: list(enumerate(x))\r\n\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\na, b = r()\r\narr = rr()\r\narr.sort()\r\nbrr = rr()\r\nbrr = en(brr)\r\nbrr.sort(key=lambda x: x[1])\r\n\r\n\r\nans = [0] * b\r\nx = 0\r\nfor i, j in brr:\r\n while x < a and arr[x] <= j:\r\n x += 1\r\n ans[i] = x\r\n\r\nprint(*ans)", "# Python 3\r\n# Author: Danh Ta Chi Thanh\r\n\r\nimport bisect\r\n\r\nn, m = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nb = list(map(int,input().split()))\r\nfor x in b:\r\n\tprint(bisect.bisect_right(a, x, 0, n),end=' ')\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\n\r\nfor i in b:\r\n left = 0\r\n right = n - 1\r\n\r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n\r\n if a[mid] <= i:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n \r\n \r\n print(left, end=' ')", "from bisect import bisect_right\r\n\r\nn, m = map(int, input().split())\r\n\r\na_n = sorted(list(map(int, input().split())))\r\na_m = list(map(int, input().split()))\r\n\r\n\r\nfor i in a_m:\r\n print(bisect_right(a_n, i), end=' ')\r\n", "import bisect\r\n\r\nx,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\n\r\nfor i in range(len(b)):\r\n print(bisect.bisect_right(a,b[i]),end=' ') \r\n", "n, m = map(int,input().rstrip().rsplit())\na = list(map(int,input().rstrip().rsplit()))\nb = list(map(int,input().rstrip().rsplit()))\n\ndic = dict((i,b[i]) for i in range(m))\nsort_dic = sorted(dic.items(), key = lambda kv: (kv[1],kv[0]))\n\nsort_a = sorted(a)\nsort_b = sorted(b)\ng_list = []\n\ni, j = 0, 0\n\nwhile (i<n and j<m):\n if sort_a[i]<=sort_b[j]:\n i+=1\n else:\n g_list.append(i)\n j+=1\n\nwhile (j<m):\n g_list.append(i)\n j+=1\n\nans_list = [-1]*m\n\ncount = 0\nfor k in range(len(sort_dic)):\n ans_list[sort_dic[k][0]] = g_list[count]\n count+=1\n\nprint(*ans_list)\n", "controles = list(map(int, input().split()))\nmodelo = list(map(int, input().split()))\nparametro = list(map(int, input().split()))\nmodelo.sort()\nfinal = []\n\nfor a in range(controles[1]):\n contador = 0\n esquerda = 0\n direita = controles[0]\n atual = 0\n b = 0\n \n while esquerda < direita:\n meio = int((esquerda + direita) // 2)\n \n \n \n if modelo[meio] <= parametro[a]:\n atual = meio + 1\n \n esquerda = meio \n else: # A[meio] < item\n direita = meio \n \n if b == meio: break\n b = meio\n \n \n \n final.append(atual)\n \nprint(*final)\n \t \t\t \t\t\t \t\t\t \t\t \t\t\t \t \t\t", "import bisect\r\nm,n=map(int,input().split())\r\nA=sorted(list(map(int,input().split())))\r\nt=''\r\nfor x in map(int,input().split()):\r\n t+=str(bisect.bisect(A,x))+' '\r\nprint(t)", "# With my own sorting: quick sort\nfrom random import *\n\n\ndef count_le(x, arr):\n '''\n return amount of elements in arr that are less or equal to x\n '''\n l, r = -1, len(arr)\n while r - l > 1:\n mid = (r + l) // 2\n if arr[mid] <= x:\n l = mid\n else:\n r = mid\n return l + 1\n\n\ndef quick_sort(arr):\n if len(arr) <= 1:\n return arr.copy()\n x = arr[randint(0, len(arr) - 1)]\n l, mid, r = [], [], []\n for a in arr:\n if a < x:\n l.append(a)\n elif a == x:\n mid.append(a)\n else:\n r.append(a)\n return quick_sort(l) + mid + quick_sort(r)\n\n\nn, m = map(int, input().split())\na = quick_sort(list(map(int, input().split())))\nb = map(int, input().split())\n\nfor el in b:\n print(count_le(el, a), end=' ')\n\n\n \t \t \t \t\t\t \t \t \t\t\t\t \t\t\t" ]

[ "a1, b1, c1 = list(map(int, input().split()))\na2, b2, c2 = list(map(int, input().split()))\n\nif(b1 != 0 and b2 != 0):\n if(a1*b2 == a2*b1):\n if(c1*b2 == c2*b1):\n print(-1) \n else:\n print(0) \n\n else:\n print(1)\n\nelif(b1 == 0 and b2 == 0):\n if(a1 != 0):\n if(a2 != 0):\n if(c1*a2 == c2*a1):\n print(-1)\n else:\n print(0)\n\n else:\n if(c2 == 0):\n print(-1)\n else:\n print(0)\n\n if(a2 != 0 and a1 == 0):\n if(c1 == 0):\n print(-1)\n else:\n print(0)\n\n if(a1 == 0 and a2 == 0):\n if(c1 == 0 and c2 == 0):\n print(-1)\n else:\n print(0)\n\nelif(b1 == 0 and b2 != 0):\n\n if(a1 != 0 and a2 != 0):\n print(1)\n \n elif(a1 == 0 and a2 != 0):\n if(c1 == 0):\n print(-1)\n else:\n print(0)\n \n elif(a1 != 0 and a2 == 0):\n print(1)\n \n elif(a1 == 0 and a2 == 0):\n if(c1 == 0):\n print(-1)\n else:\n print(0) \n\nelif( b2 == 0 and b1 != 0):\n \n if(a1 != 0 and a2 != 0):\n print(1)\n \n elif(a1 != 0 and a2 == 0):\n if(c2 == 0):\n print(-1)\n else:\n print(0)\n \n elif(a1 == 0 and a2 != 0):\n print(1)\n \n elif(a1 == 0 and a2 == 0):\n if(c2 == 0):\n print(-1)\n else:\n print(0) \n \nelse:\n print(1)\n\n\t\t \t \t\t \t\t\t \t\t \t \t \t \t\t\t", "import sys\nfrom math import gcd\n\ndef readnums()->list:\n return list(map(int, sys.stdin.readline().split()))\n\ndef unify(a, b, c:int) -> tuple:\n if a < 0:\n a, b, c = -a, -b, -c\n elif a == 0 and b < 0:\n b, c = -b, -c\n elif a == 0 and b == 0:\n c = abs(c)\n g = gcd(a, b, c)\n if g > 0:\n return a//g, b//g, c//g\n return a, b, c\n\na1, b1, c1 = unify(*readnums())\na2, b2, c2 = unify(*readnums())\n\n\nif a1 == b1 == 0 or a2 == b2 == 0:\n if a1 == b1 == 0 and c1 != 0:\n print(0)\n elif a2 == b2 == 0 and c2 != 0:\n print(0)\n else:\n print(-1)\nelif a1 * b2 == b1 * a2:\n if a1 == a2 == 0:\n if b1 * c2 == b2 * c1:\n print(-1)\n else:\n print(0)\n elif b1 == b2 == 0:\n if a1 * c2 == a2 * c1:\n print( - 1)\n else:\n print(0)\n elif c1 * (abs(a2) + abs(b2))== c2 * (abs(a1) + abs(b1)):\n print(-1)\n else:\n print(0)\nelse:\n print(1)\n", "def R():\r\n return map(int, input().split())\r\n\r\n\r\na1, b1, c1 = R()\r\na2, b2, c2 = R()\r\n\r\n\r\ndef Z(x, y, z):\r\n return not x and not y and z\r\n\r\n\r\nprint(\"1\") if (a1*b2-a2*b1) else print(\"0\") if Z(a1, b1, c1) or Z(a2,\r\n b2, c2) or (c1*b2-c2*b1) or (a1*c2-a2*c1) else print(\"-1\")\r\n", "A1,B1,C1=map(int,input().split())\r\nA2,B2,C2=map(int,input().split())\r\nif (A1==0 and B1==0 and C1!=0) or (A2==0 and B2==0 and C2!=0):\r\n print(0)\r\nelif (A1==0 and B1==0 and C1==0) or (A2==0 and B2==0 and C2==0):\r\n print(-1)\r\nelif A1==0:\r\n if A2==0:\r\n if C1*B2==C2*B1:\r\n print(-1)\r\n else:\r\n print(0)\r\n else:\r\n print(1)\r\nelif B1==0:\r\n if B2==0:\r\n if C1*A2==C2*A1:\r\n print(-1)\r\n else:\r\n print(0)\r\n else:\r\n print(1)\r\nelif A1*B2==A2*B1:\r\n print(-1 if C1*A2==C2*A1 else 0)\r\nelse:\r\n print(1)", "a1, b1, c1 = [int(i) for i in input().split()]\na2, b2, c2 = [int(i) for i in input().split()]\n\nif(c1 != c2 and (a1 == 0 and b1 == 0) and (a2 == 0 and b2 == 0)):\n print(0)\nelif((a1 == 0 and b1 == 0 and c1 == 0) or (a2 == 0 and b2 == 0 and c2 == 0)):\n print(-1)\nelif((c1 == c2) and (a1 == 0 and b1 == 0 and c1 != 0) or (a2 == 0 and b2 == 0 and c2 != 0)):\n print(0)\nelif(a1 * b2 == b1 * a2 and b2 * c1 == c2 * b1 and c1 * a2 == c2 * a1):\n print(-1)\nelif(((a1 * b2) - (a2 * b1)) == 0):\n print(0)\nelse:\n print(1)\n\n \n\t\t \t\t\t \t \t \t \t\t\t\t\t\t\t\t\t \t \t", "\n'''\ninválida: 0\nplano: 1\nreta com 0º (horizontal): 2\nreta com 90º (vertical): 3\nreta com qualquer ângulo: 4\n'''\n\ndef tipo (a, b, c):\n if a == 0 and b == 0:\n if c == 0:\n return 1\n else:\n return 0\n elif a == 0:\n return 2\n elif b == 0:\n return 3\n else:\n return 4\n\nentrada1 = (input())\nvet=entrada1.split(\" \")\na1 = int(vet[0])\nb1 = int(vet[1])\nc1 = int(vet[2])\n\nentrada2 = (input())\nvet=entrada2.split(\" \")\na2 = int(vet[0])\nb2 = int(vet[1])\nc2 = int(vet[2])\n\n\ntipo1 = tipo(a1, b1, c1)\ntipo2 = tipo(a2, b2, c2)\n\nif tipo1 == 0 or tipo2 == 0:\n print(0)\n\nelif tipo1 == 1 or tipo2 == 1:\n print(-1)\n\nelif tipo1 == 4:\n if tipo2 == 2 or tipo2 == 3:\n print(1)\n elif tipo2 == 4:\n if b1*a2 == b2*a1:\n if c1*b2 == c2*b1:\n print(-1)\n else:\n print(0)\n else:\n print(1)\n\nelif tipo1 == 2:\n if tipo2 == 2:\n if c1*b2 == c2*b1:\n print(-1)\n else:\n print(0)\n elif tipo2 == 3 or tipo2 == 4:\n print(1)\n\nelif tipo1 == 3:\n if tipo2 == 3:\n if c1*a2 == c2*a1:\n print(-1)\n else:\n print(0)\n elif tipo2 == 2 or tipo2 == 4:\n print(1)\n\n \t \t \t \t \t \t \t \t \t\t\t", "#codeforces 21b intersection, math\r\n\r\ndef readGen(transform):\r\n\twhile (True):\r\n\t\tn=0\r\n\t\ttmp=input().split()\r\n\t\tm=len(tmp)\r\n\t\twhile (n<m):\r\n\t\t\tyield(transform(tmp[n]))\r\n\t\t\tn+=1\r\n\r\nreadint=readGen(int)\r\nA1,B1,C1=next(readint),next(readint),next(readint)\r\nA2,B2,C2=next(readint),next(readint),next(readint)\r\n\r\ndef cross(a,b,c,d): return a*d-b*c\r\n\r\ndef zero(A1,B1): return A1**2 + B1**2 == 0\r\n\r\ndef lineIntersect(A1,B1,C1,A2,B2,C2):\r\n\tif (cross(A1,B1,A2,B2)==0):\r\n\t\tif (cross(A1,C1,A2,C2)==0 and cross(B1,C1,B2,C2)==0):\r\n\t\t\t# same line\r\n\t\t\treturn -1\r\n\t\telse:\r\n\t\t\t# parallel\r\n\t\t\treturn 0\r\n\telse:\r\n\t\t# cross\r\n\t\treturn 1\r\n\t\r\ndef judge(A1,B1,C1,A2,B2,C2):\r\n\tif (zero(A1,B1) and C1!=0): return 0\r\n\tif (zero(A2,B2) and C2!=0): return 0\r\n\t\r\n\tif (not zero(A1,B1) and not zero(A2,B2)):\r\n\t\t# line and line\r\n\t\treturn lineIntersect(A1,B1,C1,A2,B2,C2)\r\n\telse:\r\n\t\treturn -1\r\n\t\r\nprint(judge(A1,B1,C1,A2,B2,C2))", "row1 = input().split()\r\nrow2 = input().split()\r\n\r\na1 = int(row1[0])\r\nb1 = int(row1[1])\r\nc1 = int(row1[2])\r\na2 = int(row2[0])\r\nb2 = int(row2[1])\r\nc2 = int(row2[2])\r\n\r\nif((a1 == 0 and b1 == 0) and (a2 == 0 and b2 == 0) and c1 != c2):\r\n print(0)\r\nelif((a1 == 0 and b1 == 0 and c1 == 0) or (a2 == 0 and b2 == 0 and c2 == 0)):\r\n print(-1)\r\nelif((a1 == 0 and b1 == 0 and c1 != 0) or (a2 == 0 and b2 == 0 and c2 != 0) and (c1 == c2)):\r\n print(0)\r\nelif(a1 * b2 == b1 * a2 and b2 * c1 == c2 * b1 and c1 * a2 == c2 * a1):\r\n print(-1)\r\nelif(((a1 * b2) - (a2 * b1)) == 0):\r\n print(0)\r\nelse:\r\n print(1)\r\n \t\t \t \t \t\t \t \t\t\t\t \t \t\t", "a1, b1, c1 = map(int, input().split())\na2, b2, c2 = map(int, input().split())\nif a1 == b1 == 0 and a2 == b2 == 0:\n if c1 == c2 == 0:\n print(-1)\n else:\n print(0)\nelif (a1 * b2 != a2 * b1):\n print(1)\nelif (a1 * c2 == a2 * c1 and b1 * c2 == b2 * c1):\n print(-1)\nelse:\n print(0)", "eq1 = [int(i) for i in input().split(\" \")]\neq2 = [int(i) for i in input().split(\" \")]\n\na1, b1, c1 = eq1\na2, b2, c2 = eq2\n\nif a1 == 0 and b1 == 0 and c1 != 0 or a2 == 0 and b2 == 0 and c2 != 0:\n\tprint(\"0\")\n\texit()\nelif a1*b2 == b1*a2 and b1*c2 == b2*c1 and a1*c2 == a2*c1:\n\tprint(\"-1\")\n\texit()\nelif a1*b2 == b1*a2:\n\tprint(\"0\")\n\texit()\nelse:\n\tprint(\"1\")\n\texit()\n \t\t\t\t \t\t\t\t \t\t \t\t\t\t\t \t \t \t\t\t", "A1, B1, C1 = list(map(int, input().split(\" \")))\nA2, B2, C2 = list(map(int, input().split(\" \")))\n\ndef func():\n if (A1==0 and B1==0 and C1!=0) or (A2==0 and B2==0 and C2!=0):\n print(0)\n return\n if (A1==0 and B1==0 and C1==0) or (A2==0 and B2==0 and C2==0):\n print(-1)\n return\n if (A1==0 and A2!=0) or (A1!=0 and A2==0):\n print(1)\n return\n if A1==0 and A2==0:\n k1 = 1.0 * C1/B1\n k2 = 1.0 * C2/B2\n if(k1==k2):\n print(-1)\n return\n else:\n print(0)\n return\n \n if (B1==0 and B2!=0) or (B1!=0 and B2==0):\n print(1)\n return\n if(B1==0 and B2==0):\n k1 = 1.0 * C1/A1\n k2 = 1.0 * C2/A2\n if(k1==k2):\n print(-1)\n return\n else:\n print(0)\n return\n\n if (B1==0 and A2==0) or (B2==0 and A1==0):\n print(1)\n return\n\n k1 = 1.0 * A1/B1\n k2 = 1.0 * A2/B2\n if k1 == k2:\n if (C1==0 and C2!=0) or (C1!=0 and C2==0):\n print(0)\n return\n if C1==0 and C2==0:\n kk1 = 1.0 * A1/A2\n kk2 = 1.0 * B1/B2\n if kk1 == kk2:\n print(-1)\n return\n else:\n print(0)\n return\n else:\n kk1 = 1.0 * A1/A2\n kk2 = 1.0 * B1/B2\n kk3 = 1.0 * C1/C2\n if kk1==kk2 and kk2==kk3:\n print(-1)\n return\n else:\n print(0)\n return\n else:\n print(1)\n return\n\nfunc()\n \t \t \t\t \t \t\t\t\t\t\t \t\t\t \t \t \t", "R=lambda:map(int,input().split())\r\na1,b1,c1=R()\r\na2,b2,c2=R()\r\nZ=lambda x,y,z:not x and not y and z\r\nif a1*b2-a2*b1!=0: print(\"1\")\r\nelif Z(a1,b1,c1) or Z(a2,b2,c2) or c1*b2-b1*c2 or c1*a2-c2*a1: print(\"0\")\r\nelse: print(\"-1\")", "a1, b1, c1 = map(int, input().split())\na2, b2, c2 = map(int, input().split())\n\nif a1 == 0 and b1 == 0 and a2 == 0 and b2 == 0 and c1 != c2:\n print(0)\nelif (a1 == 0 and b1 == 0 and c1 == 0) or (a2 == 0 and b2 == 0 and c2 == 0):\n print(\"-1\")\nelif (a1 == 0 and b1 == 0 and c1 != 0) or (a2 == 0 and b2 == 0 and c2 != 0) and (c1 == c2):\n print(0)\nelif a1*b2 == a2*b1:\n if b2*c1 == c2*b1 and c1*a2 == c2*a1:\n print(\"-1\")\n else:\n print(0)\nelse:\n print(1)\n\n \t\t\t \t \t \t \t\t \t\t\t\t \t \t", "R=lambda:map(int,input().split())\r\na1,b1,c1=R()\r\na2,b2,c2=R()\r\nZ = lambda x,y,z:not x and not y and z\r\nprint(\"1\") if (a1*b2-a2*b1) else print(\"0\") if Z(a1,b1,c1) or Z(a2,b2,c2) or (c1*b2-c2*b1) or (a1*c2-a2*c1) else print(\"-1\")\r\n", "a1, b1, c1 = map(int , input().split())\r\na2, b2, c2 = map(int , input().split())\r\n\r\nif(a1 * b2 == a2 * b1) :\r\n if(a1 * c2 == a2 * c1 and b1 * c2 == b2 * c1 ) :\r\n if a1 == 0 and a2 == 0 and b1 == 0 and b2 == 0 :\r\n if c1 == 0 and c2 == 0 :\r\n print(-1)\r\n else :\r\n print(0)\r\n else :\r\n print(-1)\r\n else :\r\n print(0)\r\n \r\nelse :\r\n print(1)\r\n" ]

[ "import math\r\nz = []\r\nz[0:] = map(int, input().split())\r\nz.sort()\r\nlst1 = []\r\nlst2 = []\r\nlst3 = []\r\nlst = [1]\r\n\r\nfor i in range(1,z[1]):\r\n if i not in lst and z[0] % i == 0 and z[2] % i == 0: #and i not in lst:# and z[2] % i == 0:\r\n lst.append(i)\r\n #break\r\n if i not in lst and z[0] % i == 0 and z[1] % i == 0: #and i not in lst:# and z[2] % i == 0:\r\n lst.append(i)\r\n #break\r\n#print(lst)\r\ncount = sum(z)\r\nif len(lst1) == 0:\r\n lst1.append(1)\r\n lst1.append(z[1] // lst1[0])\r\n lst1.append(z[2] // lst1[1])\r\nelse:\r\n lst1.append(z[1] // lst1[0])\r\n lst1.append(z[2] // lst1[1])\r\nfor i in range(len(lst)):\r\n if (lst1[0] * lst1[1] + lst1[0] * lst1[2] + lst1[1] * lst1[2]) != count:\r\n lst1.clear()\r\n lst1.append(lst[len(lst1) - 1 -i])\r\n lst1.append(z[1] // lst1[0])\r\n lst1.append(z[2] // lst1[1])\r\n else:\r\n break\r\n\r\n\r\nprint(sum(lst1) * 4)", "from itertools import permutations \n\ndef solve(arr):\n perm = permutations(arr)\n for i in list(perm):\n v = (i[1]*i[2]/i[0])**.5\n if v.is_integer() :\n return int(4*v + 4*i[1]//v + 4*i[2]//v) \n\n \n\n\ndef main():\n arr = list(map(int, input().split(\" \")))\n print(solve(arr))\n\nmain()", "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 is_int(n):\r\n if n//1==n/1:\r\n return True\r\n else:\r\n return False\r\n\r\ndef main():\r\n # start=time.time()\r\n a,b,c=map(int,input().split())\r\n for i in range(1,10001):\r\n x=i\r\n y=a/i\r\n z=c/i\r\n if is_int(x) and is_int(y) and is_int(z) and y*z==b:\r\n print(4*int(x+y+z))\r\n break\r\n \r\n\r\n # end=time.time()\r\nmain()", "s = input().split()\r\na,b,c = (int(i) for i in s)\r\n\r\nprint(int(4*(((a*c/b)**0.5)+((a*b/c)**0.5)+((b*c/a)**0.5))))\r\n", "import math\r\nan = list(map(int, input().split()))\r\na = int(math.sqrt(an[1]*an[2]/an[0])*an[0]/an[1])\r\nb = int(math.sqrt(an[1]*an[2]/an[0])*an[0]/an[2])\r\nc = int(math.sqrt(an[1]*an[2]/an[0]))\r\nprint(str(a*4+b*4+c*4))\r\n", "import math\r\n\r\narr = list(map(int, input().rstrip().split()))\r\nt = 0\r\na = math.sqrt((arr[0]*arr[1]/arr[2]))\r\nb = math.sqrt((arr[1]*arr[2]/arr[0]))\r\nc = math.sqrt((arr[0]*arr[2]/arr[1]))\r\nprint(int((a+b+c)*4))", "xz,xy,yz = map(int,input().split())\r\n \r\nx = ((xz*xy)/yz)**0.5\r\n\r\nprint(int(4*(x+xy/x+xz/x)))", "import math\r\nins = [int(x) for x in input().split()]\r\nx = round(math.sqrt(ins[0] * ins[2] // ins[1]))\r\nz = ins[2]//x\r\ny = ins[1]//z\r\n\r\n# print(x , y ,z)\r\nprint(4*(x + y + z))", "a,b,c=map(int,input().split())\r\nvol=(a*b*c)**(0.5)\r\nprint(int(4*(vol/a+vol/b+vol/c)))", "import math\r\nx,y,z =map(int,input().split())\r\ntotal1=4*(math.sqrt(x*y/z))\r\ntotal2=4*(math.sqrt(x*z/y))\r\ntotal3=4*(math.sqrt(z*y/x))\r\nprint(math.floor(total1+total2+total3))\r\n# print(math.floor(total))\r\n", "s1,s2,s3=list(map(int,input().split()))\r\na=(s1*s2//s3)**.5\r\nb=(s3*s2//s1)**.5\r\nc=(s1*s3//s2)**.5\r\nprint(int(4*(a+b+c)))\r\n", "import math\r\na, b, c = map(int, input().split())\r\nprint(int((math.sqrt(a*c/b) + math.sqrt(b*c/a) + math.sqrt(a*b/c)) * 4))\r\n\r\n\r\n", "\r\n\"\"\"\r\nCreated on Mon Jul 6 21:28:12 2020\r\n\r\n@author: rishi\r\n\"\"\"\r\nimport math\r\n\r\ndef sumofno(n):\r\n summ=0\r\n while(n>0):\r\n summ+=n%10\r\n n//=10\r\n return summ\r\n\r\ndef get_key(val,lis): \r\n for key, value in lis.items(): \r\n if value == val : \r\n return key \r\n\r\ndef isprime(val):\r\n c=0\r\n for j in range(2,val):\r\n if(val%j)==0:\r\n return False\r\n return True\r\n \r\n#print(isprime(15))\r\ntry:\r\n #t=int(input())\r\n ans=[]\r\n \r\n for i in range(1):\r\n #n=input()\r\n #n=int(n)\r\n a,b,c=list(map(int,input().split()))\r\n \r\n area=(a*b*c)**(0.5)\r\n h=area//a\r\n l=area//b\r\n br=area//c\r\n ans.append(int(4*(h+l+br)))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n #print (ans)\r\n for an in ans:\r\n #print(\"hi\")\r\n print(an)\r\n\r\nexcept:\r\n pass\r\n ", "from math import sqrt\nx,y,z=map(int,input().split())\nv=sqrt(x*y*z)\nprint(int(4*((x*y+y*z+z*x)//v)))", "\ndef main():\n a,b,c = map(int, input().split())\n ans = 0\n ans+=int((pow(a*b/c,1/2)))\n ans+=int((pow(b*c/a,1/2)))\n ans+=int((pow(c*a/b,1/2)))\n ans*=4\n print(ans)\n\n\n return\n\n\nmain()", "from math import sqrt as s\r\na,b,c = map(int,input().split())\r\ns1 = s((a*c)/b)\r\ns2 = s((a*b)/c)\r\ns3 = s((b*c)/a)\r\nprint(int(4*(s1+s2+s3)))", "import math\r\n\r\ndef sum(a,b,c):\r\n x=math.sqrt(a*b/c)\r\n y=math.sqrt(b*c/a)\r\n z=math.sqrt(a*c/b)\r\n s=x+y+z\r\n return 4*s\r\n\r\na,b,c= map(int, input().split())\r\nprint(int(sum(a,b,c)))\r\n\r\n", "x, y, z = map(int, input().split())\na = (x * y / z) ** 0.5\nb = (y * z / x) ** 0.5\nc = (z * x / y) ** 0.5\nprint(4 * int(a + b + c))\n# print(a, b, c)\n", "from math import sqrt\r\n\r\nm,n,o = map(int, input().split())\r\n\r\nans = 4*(sqrt((o*n)/m)+sqrt((n*m)/o) + sqrt((m*o)/n))\r\nprint(int(ans))", "import math\r\na,b,c=map(int,input().split())\r\nx=math.sqrt((a*b)/c)\r\ny=math.sqrt((b*c)/a)\r\nz=math.sqrt((c*a)/b)\r\nprint(int(4*(x+y+z)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\na,b,c = map(int, input().split())\r\nz = int((b*c/a)**0.5)\r\nx = b//z\r\ny = a//x\r\nprint(4*(x+y+z))\r\n", "import math\nx, y, z = map(int, input().split())\na = math.sqrt(x * y / z)\nb = math.sqrt(x * z / y)\nc = math.sqrt(y * z / x)\nans = int(4 * (a + b + c))\nprint(ans)", "x,y,z = list(map(int, input().split()))\r\n\r\na = pow((x*y)/z,1/2)\r\nb = pow((x*z)/y,1/2)\r\nc = pow((y*z)/x,1/2)\r\nans = 4*(a+b+c)\r\n\r\nprint(int(ans))", "#%%\r\nimport math\r\nins = list(map(int, input().split(\" \")))\r\n\r\nins[2] = int(math.sqrt(ins[2] * ins[1] / ins[0]))\r\nins[1] /= ins[2]\r\nins[0] /= ins[1]\r\n\r\nins[0], ins[1] = int(ins[0]), int(ins[1])\r\n\r\nprint(4 * sum(ins))", "a,b,c=map(int,input().strip().split())\n\nvolumes = (a*b*c)**0.5\n\nle = volumes / a\nbr = volumes / b \nhe = volumes/c \n\n\n\n\n\n\n\n\n\n\nprint( int(4 * (le + br + he)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 26 21:44:54 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\nimport math\r\ns = input()\r\ns = s.split()\r\ns = list(map(lambda x: int(x),s))\r\n\r\nb = math.sqrt((s[0]*s[1])//s[2])\r\na = s[0]//b\r\nc = s[2]//a\r\n\r\narestas = 4*a+4*b+4*c\r\nprint(int(arestas))", "import math\r\nA1, A2, A3 = map(int, input().split())\r\na2 = math.sqrt((A1*A2)//A3)\r\na1 = A1//a2\r\na3 = A2//a2\r\nprint(int(4*(a1+a2+a3)))\r\n", "s1, s2, s3=map(int, input().split())\r\nprint(int(4*((s1*s2/s3)**0.5+(s1*s3/s2)**0.5+(s2*s3/s1)**0.5)))\r\n", "import math\r\na1,a2,a3 = map(int,input().split())\r\na = math.sqrt((a1*a2)/a3)\r\nb = math.sqrt((a3*a2)/a1)\r\nc = math.sqrt((a1*a3)/a2)\r\nprint(int(a+b+c)*4)", "import math\nan = list(map(int, input().split()))\na = int(math.sqrt(an[1]*an[2]/an[0])*an[0]/an[1])\nb = int(math.sqrt(an[1]*an[2]/an[0])*an[0]/an[2])\nc = int(math.sqrt(an[1]*an[2]/an[0]))\nprint(str(a*4+b*4+c*4))\n", "from math import sqrt\r\narr=list(map(int,input().split()))\r\n\r\n\r\nh=sqrt((arr[1]*arr[2])/arr[0])\r\nb=arr[1]/h\r\nl=arr[2]/h\r\n\r\nprint(int(4*(l+b+h)))\r\n\r\n", "import math\r\na,b,c=map(int,input().split())\r\ns1=int(math.floor(math.sqrt(((a*b)/c))))\r\ns3=b//s1\r\ns2=c//s3\r\ns=(s1*4)+(s2*4)+(s3*4)\r\nprint(s)", "from math import sqrt\r\nx,y,z=map(int,input().split())\r\na=int(sqrt(x*y//z))\r\nprint(4*(a+y//a+x//a))", "s1,s2,s3=map(int,input().split())\r\na=((s1*s3)//s2)**0.5\r\nb=((s1*s2)//s3)**0.5\r\nc=((s2*s3)//s1)**0.5\r\nprint(int(4*(a+b+c)))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nx,y,z=(int(i) for i in input().split())\r\nprint(4*(int(math.sqrt((x*y)//z))+int(math.sqrt((y*z)//x))+int(math.sqrt((x*z)//y))))", "import math\r\ns=input()\r\ns=s.split()\r\nl=list(s)\r\n \r\nx=l[0]\r\nx=int(x)\r\ny=l[1]\r\ny=int(y)\r\nz=l[2]\r\nz=int(z)\r\nls=(x*z)/y\r\nhs=(z*y)/x\r\nbs=(x*y)/z\r\nl1=math.sqrt(ls)\r\nh=math.sqrt(hs)\r\nb=math.sqrt(bs)\r\nans=4*(l1+b+h)\r\nans=int(ans)\r\nprint(ans)", "import math as m\r\na,b,c=map(int,input().split())\r\ns1 = m.sqrt(a*b/c)\r\ns2 = m.sqrt(a*c/b)\r\ns3 = m.sqrt(b*c/a)\r\nprint(4*int(s1+s2+s3))", "import math\r\n\r\ndef calc(s1 , s2 , s3):\r\n a = math.sqrt(s1*s3/s2)\r\n b = math.sqrt(s1*s2/s3)\r\n c = math.sqrt(s2*s3/s1)\r\n\r\n sm = a + b + c\r\n\r\n return sm * 4\r\n\r\ns1 , s2 , s3 = map(int,input().split())\r\nprint(int(calc(s1 , s2 , s3)))", "from math import sqrt\r\nlst = list(map(int, input().split()))\r\na = sqrt((lst[0]*lst[2])/lst[1])\r\nb = sqrt((lst[0]*lst[1])/lst[2])\r\nc = sqrt((lst[1]*lst[2])/lst[0])\r\nprint(int(4*(a+b+c)))", "import math\r\na,b,c=list(map(int,input().split()))\r\nprint(4*int(math.sqrt(a*b//c)+math.sqrt(a*c//b)+math.sqrt(b*c//a)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 10 21:12:36 2023\r\n\r\n@author: dell\r\n\"\"\"\r\nimport math\r\n\r\nx=list(map(float,input().split()))\r\na= math.sqrt(x[0]*x[1]*x[2])/x[1]\r\nb= math.sqrt(x[0]*x[1]*x[2])/x[2]\r\nc= math.sqrt(x[0]*x[1]*x[2])/x[0]\r\nprint(int(4*(a+b+c)))", "# your code goes here\r\nfrom math import sqrt\r\na1,a2,a3=map(int, input().split())\r\nb=sqrt((a1*a3/a2))\r\na=a1/b\r\nc=a3/b\r\nprint(int(4*(a+b+c)))", "from math import *\r\ns1, s2, s3 = [int(x) for x in input().split()]\r\na = sqrt((s1*s3)/s2)\r\nb = sqrt((s1*s2)/s3)\r\nc = sqrt((s2*s3)/s1)\r\nprint(int(4*(a+b+c)))", "import math\r\n[a1,a2,a3] = [int(x) for x in input().split()]\r\n\r\na = math.sqrt((a1*a2)/a3)\r\nb = math.sqrt((a1*a3)/a2)\r\nc = math.sqrt((a3*a2)/a1)\r\n\r\nsum = int(4*(a+b+c))\r\nprint(sum)", "import math\r\n\r\nareas = list(map(int, input().split(\" \")))\r\n\r\nc = int(math.sqrt((areas[2]/areas[0])*areas[1]))\r\nb = int(areas[1]/c)\r\na = int(areas[0]/b)\r\n\r\nprint(4*(a+b+c))", "import math\n\na1,a2,a3 = map(int, input().split())\n\nsq = int(math.sqrt(a1 * a2 * a3))\n\na = int(sq/a1)\nb = int(sq/a2)\nc = int(sq/a3)\n\nprint(4*a + 4*b + 4*c)\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[61]:\n\n\n# 20 10 50\n# 9 4 36\n# 1022 584 112\ndef cf(a, b):\n commons = []\n for i in range(1, min(a, b) + 1):\n if a%i == 0 and b%i == 0:\n commons.append(i)\n return commons\n\n\n# In[82]:\n\n\nthree_areas = list(map(int, input().split()))\n\n\n# In[83]:\n\n\na_x, a_y, a_z = three_areas[0], three_areas[1], three_areas[2]\ncomp_1 = cf(a_x ,a_y)\ncomp_2 = cf(a_x, a_z)\n\n\n# In[88]:\n\n\npotential_y_z = []\nfor i in comp_1:\n for j in comp_2:\n if i*j == a_x:\n potential_y_z.append([i, j])\n \n\n\n# In[90]:\n\n\nfor edge_y_z in potential_y_z:\n edge_y = edge_y_z[0]\n edge_z = edge_y_z[1]\n \n if int(a_z/edge_y) == int(a_y/edge_z):\n edge_x = int(a_z/edge_y)\n break\n elif int(a_z/edge_z) == int(a_y/edge_y):\n edge_x = int(a_z/edge_z)\n break\n\n\n# In[93]:\n\n\n# print(comp_1, comp_2)\n# print(a_x, a_y, a_z)\n# print(edge_x, edge_y, edge_z)\n\n\n# In[92]:\n\n\ncircum = (edge_x + edge_y + edge_z) * 4\nprint(circum)\n\n\n# In[ ]:\n\n\n\n\n", "x,y,z=[int(a) for a in input().split()]\r\nn=4*((1/x+1/y+1/z)*(x*y*z)**0.5)\r\nprint(int(n) if n-int(n)<=0.5 else int(n)+1)", "from math import*\r\ns1,s2,s3=map(int,input().split())\r\np=sqrt(s1*s2/s3)\r\nq=sqrt(s1*s3/s2)\r\nr=sqrt(s2*s3/s1)\r\nprint(int(4*(p+q+r)))\r\n", "def main():\n values = input()\n values = values.split()\n values[0] = int(values[0])\n values[1] = int(values[1])\n values[2] = int(values[2])\n print(int(4*values[1]/(values[1]*values[2]/values[0])**(1/2)) +\n int(4*values[2]/(values[1]*values[2]/values[0])**(1/2)) +\n int(4*(values[1]*values[2]/values[0])**(1/2))) \nmain() \n\n\n\t\t \t\t\t\t \t\t \t\t\t \t \t\t \t \t\t \t", "def edges_sum(n1,n2,n3):\n X=(n3*n1/n2)**(1/2)\n Y=n1/X\n Z=n2/Y\n return round(4*X+4*Y+4*Z)\nn=list(map(int, input().split()))\nstates=[[0,1,2],[0,2,1],[1,0,2],[1,2,0],[2,1,0],[2,0,1]]\nfor s in states:\n try:\n print(edges_sum(n[s[0]],n[s[1]],n[s[2]]))\n break\n except:\n pass\n\n\n \t \t \t\t \t\t\t\t \t \t\t \t\t \t \t", "import math\r\nx,y,z=map(int,input().split())\r\na = math.sqrt(x * y * z)\r\nprint(int(4 * (a // x + a // y + a // z)))", "a1,a2,a3 = [int(item) for item in input().split()]\r\na = int(((a1*a2*a3)//(a1**2))**0.5)\r\nb = int(((a1*a2*a3)//(a2**2))**0.5)\r\nc = int(((a1*a2*a3)//(a3**2))**0.5)\r\nprint(4*(a+b+c))", "row = input().split()\r\n\r\narea1 = int(row[0])\r\narea2 = int(row[1])\r\narea3 = int(row[2])\r\n\r\nimport math\r\nlen1 = int(math.sqrt(area1*area3/area2))\r\nlen2 = int(math.sqrt(area1*area2/area3))\r\nlen3 = int(math.sqrt(area2*area3/area1))\r\n\r\n\r\n\r\nprint (int((len1*4) + (len2*4) + (len3*4)))\r\n", "from math import sqrt\na,b,c=[int(v) for v in input().split()]\nprint(int(4*(sqrt(a*b/c)+sqrt(c*b/a)+sqrt(a*c/b))))\n\t \t\t \t \t \t\t \t \t \t\t\t \t\t\t\t\t", "import math\r\n\r\n\r\nclass Code:\r\n def __init__(self):\r\n self.a, self.b, self.c = list(map(int, input().split()))\r\n\r\n def process(self):\r\n a = math.ceil(math.sqrt((self.a * self.b) / self.c))\r\n b = math.ceil(math.sqrt((self.a * self.c) / self.b))\r\n c = math.ceil(math.sqrt((self.b * self.c) / self.a))\r\n print(4 * (a + b + c))\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "\r\nfrom math import sqrt\r\nA,B,C=map(int,input().split())\r\nx=sqrt(A*B*C)\r\na=x/A\r\nb=x/B\r\nc=x/C\r\nprint(int(4*(a+b+c)))\r\n\r\n", "a,b,c=map(int,input().split())\r\ns=(a*b*c)**0.5\r\nprint(int((s/a+s/b+s/c)*4))\r\n", "from math import sqrt\n\na, b, c = [int(a) for a in input().split()]\n\ns2 = sqrt(a * c / b)\ns1 = a / s2\ns3 = c / s2\n\nprint(int(4*s1 + 4*s2 + 4*s3))\n", "A, B, C = map(int, input().split())\r\nfor a in range(1,10**4+1):\r\n b = A/a\r\n c = C/a\r\n if b*c==B and int(b)==b and int(c)==c:\r\n #print(a,b,c)\r\n print(int(a*4 + b*4 + c*4))\r\n exit()\r\n", "a,b,c=map(int,input().split())\r\nprint(int(4*(((a*b)/c)**0.5+((b*c)/a)**0.5+((a*c)/b)**0.5)))", "from hashlib import new\r\nimport sys\r\nimport threading\r\nfrom sys import stdin, stdout\r\nfrom itertools import accumulate\r\ninput = stdin.readline\r\nprint = stdout.write\r\nimport math\r\n\r\nif __name__ == \"__main__\":\r\n \r\n lb, bh, lh = map(int, input().strip().split())\r\n \r\n h = int(math.sqrt((lh*bh)//lb))\r\n l = (h*lb)//lh\r\n b = (lb//l)\r\n\r\n print(f\"{4*(l+b+h)}\\n\")", "from math import sqrt\r\nx,y,z=input().split(' ')\r\nx,y,z=int(x),int(y),int(z)\r\n\r\na=sqrt(x*y/z)\r\nb=y/a\r\nc=x/a\r\n\r\nanswer=4*(a+b+c)\r\n\r\nprint(int(answer))", "A, B, C = [int(x) for x in input().split()]\n\n#cada aresta distinta do paralelepipedo pode ser calculada da seguinte forma: raiz das 2 areas distintas dividido pela terceira area, sempre alternando o numerador e o denominador\n#a soma de todas as arestas se da pelos 3 lados distintos multiplicado por 4\n\na = int((A*B//C)**0.5)\n\nb = int((B*C//A)**0.5)\n\nc = int((A*C//B)**0.5)\n\nprint(4*(a + b + c))\n \t\t\t \t \t \t \t \t\t \t \t \t\t", "import math\r\ndef ans(s1, s2, s3):\r\n\r\n a = math.sqrt(s1 * s2 / s3)\r\n b = math.sqrt(s3 * s1 / s2)\r\n c = math.sqrt(s3 * s2 / s1)\r\n\r\n sum = a + b + c\r\n\r\n return int(4 * sum)\r\na,b,c = map(int,input().split())\r\nprint(ans(a,b,c))", "import math\r\nab,bc,ca =map(int, input().split())\r\n\r\nb = math.sqrt(ab*bc//ca)\r\na = math.sqrt(ab*ca//bc)\r\nc = math.sqrt(bc*ca//ab)\r\nprint(int(4*(a+b+c)))", "a, b, c = map(int, input().split())\r\nx = (c * b / a) ** 0.5\r\ny = b // x\r\nz = a // y\r\nprint(int(4 * (x + y + z)))", "l = list(map(int, input().split()))\r\n\r\na = int(((l[0]*l[2])//l[1])**0.5)\r\nb = int(((l[0]*l[1])//l[2])**0.5)\r\nc = int(((l[1]*l[2])//l[0])**0.5)\r\n\r\nprint(4*(a+b+c))\r\n", "import math\r\ns1,s2,s3 = map(int,input().split())\r\nc = math.sqrt(s2*s3//s1)\r\nb = math.sqrt(s1*s3//s2)\r\na = math.sqrt(s1*s2//s3)\r\nprint(int(4*(a+b+c)))", "first,second,third=map(int,input().split())\r\nprint(int(((((first*second)+(second*third)+(third*first))/(first*second*third)**.5)*4)))", "x,y,z = list(map(int,input().split())) \r\nv = (x*y*z)**0.5 \r\nprint(4*(int(v/x+v/y+v/z)))", "import math\r\nx, y, z=map(int, input().split())\r\na=int(x*z/y)\r\nb=int(y*z/x)\r\nc=int(x*y/z)\r\np=int(math.sqrt(a))\r\nq=int(math.sqrt(b))\r\nr=int(math.sqrt(c))\r\nprint((p+q+r)*4)", "from math import sqrt\r\na,b,c=map(int,input().split())\r\nn1=sqrt((a*b)/c)\r\nn2=sqrt((b*c)/a)\r\nn3=sqrt((c*a)/b)\r\nprint(int(4*(n1+n2+n3)))\r\n", "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\na,b,c=mn()\r\nprint(int(4*(pow(a*b/c,0.5)+pow(a*c/b,0.5)+pow(b*c/a,0.5))))", "k1,k2,k3 = list(map(int,input().split()))\r\nb = ((k1*k2)/k3)**(.5)\r\nb = int(b)\r\na = int(k1/b)\r\nc = int(k3/a)\r\nprint(4*(a+b+c))\r\n", "x, y, z = map(int, input().split())\r\n\r\na = int((x * z / y) ** (1/2))\r\nb = int((x * y / z) ** (1/2))\r\nc = int((y * z / x) ** (1/2))\r\n\r\ntotal = 4 * (a + b + c)\r\nprint(total)\r\n", "import math\r\n\r\nx, y, z = map(int, input().split())\r\na = int(math.sqrt((x * y) / z))\r\nb = int(math.sqrt((x * z) / y))\r\nc = int(math.sqrt((y * z) / x))\r\nval = (a + b + c) * 4\r\nprint(val)\r\n", "a,b,c = map(float,input().split())\ns1 = int(((a*b)/c)**.5)\ns2 = int(((a*c)/b)**.5)\ns3 = int(((b*c)/a)**.5)\nprint(4*(s1+s2+s3))\n\n", "import math\na,b,c = [int(x) for x in input().split()]\nx = math.sqrt(a*b/c)\ny = math.sqrt(b*c/a)\nz =math.sqrt(a*c/b)\nw = x+y+z\nprint(4*int(w))\n\t\t\t\t \t \t \t \t \t\t \t\t \t \t", "import math\r\na1, a2, a3 = list(map(int, input().split(' ')))\r\n\r\nproduct = int(math.sqrt(a1*a2*a3))\r\na, b, c = product//a1, product//a2, product//a3\r\nprint(4*(a+b+c))", "x,y,z=map(int,input().split())\r\nxx=(x*y/z)**0.5\r\nyy=(y*z/x)**0.5\r\nzz=(z*x/y)**0.5\r\nprint(int(xx+yy+zz)*4)\r\n", "######################################################################\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\na,b,c=RI()\r\ntemp=a*b*c\r\nx=pow(temp//(a**2),0.5)\r\ny=pow(temp//(b**2),0.5)\r\nz=pow(temp//(c**2),0.5)\r\n\r\nprint(int(4*(x+y+z)))\r\n\r\n", "import math\r\na, b, c = map(int,input().split())\r\nx = math.sqrt((a*b)/c) + math.sqrt((a*c)/b) + math.sqrt((c*b)/a)\r\nprint(4*int(x))\r\n", "import math\r\nx,y,z= map(int,input().split())\r\nb=x*y*z\r\na=[]\r\nr= math.sqrt(b)\r\nk= r/x\r\nm= r/y\r\nh= r/z\r\nans= 4*(k+m+h)\r\nprint(int(ans))", "x, y, z = map(int, input().split())\r\nb = (z * y / x) ** .5\r\nprint(int(4 * (b + b * x / y + b * x / z)))", "import math\r\na1,a2,a3=map(int,input().split())\r\ns1=math.sqrt((a1*a3)//a2)\r\ns2=math.sqrt((a1*a2)//a3)\r\ns3=math.sqrt((a2*a3)//a1)\r\nprint(int(4*(s1+s2+s3)))", "x,y,z=list(map(int,input().split()))\r\na=((x*y)/z)**0.5\r\nb=((x*z)/y)**0.5\r\nc=((z*y)/x)**0.5\r\nprint(int(4*(a+b+c)))", "#from sys import stdin,stdout\r\n#input = stdin.readline\r\n \r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #n,k = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n s1,s2,s3 = map(int,input().split())\r\n # a * b = s1\r\n # b * c = s2\r\n # c * a = s3\r\n # a/c = s1/s2\r\n c = int((s3 * s2 / s1) ** 0.5)\r\n a = s3 // c\r\n b = s2 // c\r\n print((a + b + c) * 4)\r\nmain()\r\n", "# It's all about what U BELIEVE\ndef gint():\n return int(input())\ndef gint_arr():\n return list(map(int, input().split()))\ndef gfloat():\n return float(input())\ndef gfloat_arr():\n return list(map(float, input().split()))\ndef pair_int():\n return map(int, input().split())\n#############################################\nINF = (1 << 31)\n#############################################\n#############################################\nx, y, z = gint_arr()\n\nsum = round(pow(x * z / y, 0.5) + pow(x * y / z, 0.5) + pow(y * z / x, 0.5))\nprint(sum * 4)\n", "import math\r\ninputs = [int(num) for num in input().split()]\r\na1=inputs[0]\r\na2=inputs[1]\r\na3=inputs[2]\r\npro =int(math.sqrt(a1*a2*a3))\r\na=pro//a1\r\nb=pro//a2\r\nc=pro//a3\r\nprint((a+b+c)*4)", "import math\r\nx,y,z=map(int,input().split())\r\na=math.sqrt((x*y)/z)\r\nb=math.sqrt((y*z)/x)\r\nc=math.sqrt((z*x)/y)\r\nr=(4*a)+(4*b)+(4*c)\r\nprint(int(r))", "def main():\r\n\ta, b, c = map(int, input().split())\r\n\r\n\taas = []\r\n\tfor i in range(10001):\r\n\t\tfor j in range(1000):\r\n\t\t\tif (i * j == a or i * j == b):\r\n\t\t\t\taas.append(i)\r\n\t\t\t\taas.append(j)\r\n\r\n\tfor i in range(len(aas)):\r\n\t\tfor j in range(len(aas)):\r\n\t\t\tfor k in range(len(aas)):\r\n\t\t\t\tif (aas[i] * aas[j] == b and aas[i] * aas[k] == c and aas[j] * aas[k] == a):\r\n\t\t\t\t\tprint(aas[i] * 4 + aas[j] * 4 + aas[k] * 4)\r\n\t\t\t\t\texit()\r\n\r\nmain()", "a1,a2,a3=map(int,input().split())\r\nl=((a1*a3)/a2)**(0.5)\r\nb=((a1*a2)/a3)**(0.5)\r\nh=((a2*a3)/a1)**(0.5)\r\nprint(int(4*(l+b+h)))", "import math\r\na,b,c=map(int,input().split(\" \"))\r\ns1=math.sqrt((a*c)/b)\r\ns2=math.sqrt((a*b)/c)\r\ns3=math.sqrt((b*c)/a)\r\nprint(int(4*(s1+s2+s3))) ", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\na1, a2, a3 = In()\r\nprint(int(4*(math.sqrt((a1*a2)//a3) + math.sqrt((a3*a2)//a1) + math.sqrt((a1*a3)//a2))))", "side_area = list(map(int, input().split()))\r\ns1 = side_area[0]\r\ns2 = side_area[1]\r\ns3 = side_area[2]\r\na = (s1*s2/s3)**(0.5)\r\nb = (s1*s3/s2)**(0.5)\r\nc = (s3*s2/s1)**(0.5)\r\nprint(int(4*(a+b+c)))", "area1,area2,area3 = tuple([int(item) for item in input().split()])\r\na = ((area1*area2*area3)**0.5)/area1\r\nb = ((area1*area2*area3)**0.5)/area2\r\nc = ((area1*area2*area3)**0.5)/area3\r\nprint(int(4*(a+b+c)))", "a1,a2,a3=map(int,input().split())\r\nnum=4*(a1*a2+a2*a3+a3*a1)\r\nden=(a1*a2*a3)**0.5\r\nif num%den==0:print(int(num//den))\r\nelse:print(num/den)", "a, b, c = [int(i) for i in input().split()]\r\nx = a * b / c\r\ny = b * c / a\r\nz = a * c / b\r\nprint(int(x ** 0.5 + y ** 0.5 + z ** 0.5) * 4)", "# https://codeforces.com/problemset/problem/224/A\n# Time O(1) | Aux Space O(1)\n\n# Note: Had to derive expression (line 9) using pen/paper\n\nimport math\nx, y, z = [int(num) for num in input().split()]\n\nprint(int(4*(x*y + y*z + z*x)/math.sqrt(x*y*z)))", "s1,s2,s3=input().split()\r\ns1=int(s1)\r\ns2=int(s2)\r\ns3=int(s3)\r\na=(int)((s1*s3)//s2)**0.5\r\nb=(int)((s1*s2)//s3)**0.5\r\nc=(int)((s2*s3)//s1)**0.5\r\nprint(int(4*(a+b+c)))", "from math import sqrt\n\nfaces = input().split()\nfaces = [int(x) for x in faces]\n\nvex_a = sqrt((faces[0]*faces[1]/faces[2]))\nvex_b = faces[1]/vex_a\nvex_c = faces[2]/vex_b\n\nprint(int(vex_a *4 + vex_b*4 + vex_c*4))\n\t\t \t\t\t \t\t \t \t \t\t\t\t\t \t\t\t", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\na, b, c = gets(int)\nd = round((a * b * c) ** .5)\nprint((d // a + d // b + d // c) << 2)\n", "def parallelepiped():\r\n s=[int(x) for x in input().split()]\r\n (p,q,r)=(s[0],s[1],s[2])\r\n l=((p*q)/r)**(0.5)\r\n h=((q*r)/p)**(0.5)\r\n b=((p*r)/q)**(0.5)\r\n print(int(4*(l+b+h)))\r\n\r\nparallelepiped()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s1, s2, s3 = list(map(int, input().split()))\n\na = (s1 * s2 / s3)**0.5\nb = (s2 * s3 / s1)**0.5\nc = (s3 * s1 / s2)**0.5\n\nprint(int(4*(a+b+c)))\n", "e = [int(x) for x in input().split()]\r\nedge_len = []\r\nedge_len.append(((e[0] * e[1])/e[2]) ** 0.5)\r\nedge_len.append(((e[1] * e[2])/e[0]) ** 0.5)\r\nedge_len.append(((e[0] * e[2])/e[1]) ** 0.5)\r\nprint(round(4 * sum(edge_len)))", "import math\r\nA, B, C = map(int, input().split())\r\n#ab = A[0], bc = A[1], ac = A[2]\r\n\r\nABC = A*B*C\r\nabc = int(math.sqrt(ABC) + 2)\r\n\r\nwhile abc**2 > ABC:\r\n\tabc -= 1\r\n\r\na = abc//B\r\nb = abc//C\r\nc = abc//A\r\n\r\nprint(4*(a+b+c))\r\n\r\n", "import math\r\nareas = list(map(int, input().split()))\r\nareas.sort()\r\na = math.sqrt((areas[0] * areas[1]) / areas[2])\r\nb = math.sqrt((areas[0] * areas[2]) / areas[1])\r\nc = math.sqrt((areas[1] * areas[2]) / areas[0])\r\n\r\nprint(int(4 * (a + b + c)))", "\r\na1,a2,a3= list(map(int,input().split()))\r\n\r\nx= ((a1*a2)//a3)**0.5\r\ny= ((a3*a2)//a1)**0.5\r\nz= ((a1*a3)//a2)**0.5\r\n\r\np= 4*x + 4*y + 4*z\r\nprint(int(p))\r\n", "a1,a2,a3=map(int,input().split())\r\nc1=(a1*a2//a3)**0.5\r\nc2=(a2*a3//a1)**0.5\r\nc3=(a1*a3//a2)**0.5\r\nprint(int(4*c1+4*c2+4*c3))", "sqrt = lambda x:x**(0.5)\r\na,b,c = map(int,input().split())\r\nprint(int(4*(sqrt(a*c/b)+sqrt(a*b/c)+sqrt(b*c/a))))\r\n", "\r\na1,a2,a3=map(int, input().split())\r\nb=((a1*a3/a2))**0.5\r\na=a1/b\r\nc=a3/b\r\nprint(int(4*(a+b+c)))", "\ndef solve() :\n xy=a\n yz=b\n zx=c\n\n x=((zx)*(xy)/(yz))**0.5\n y=((xy)*(yz)/(zx))**0.5\n z=((zx)*(yz)/(xy))**0.5\n\n return int(4*(x+y+z))\n\n\n\n\n\n\n\n\n \n\n \n\na,b,c=[int(x) for x in input().split()]\n\nprint(solve())\n\n\n\n'''\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n'''\n'''\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "\r\nimport math\r\nx ,y,z=list(map(int ,input().split()))\r\n\r\nans= 4 *(math.sqrt((x*y)/z) + math.sqrt((x*z)/y) +math.sqrt((z*y)/x) )\r\n\r\nprint(int(ans))", "import math\r\ns1, s2, s3=map(int,input().split())\r\na = math.sqrt(s1 * s2 / s3)\r\nb = math.sqrt(s3 * s1 / s2)\r\nc = math.sqrt(s3 * s2 / s1)\r\nsum = a + b + c\r\nprint(int(4 * sum))\r\n", "import math\r\n\r\ns1, s2, s3 = input().split()\r\n\r\na = math.sqrt(int(s1) * int(s3) / int(s2))\r\nb = math.sqrt(int(s1) * int(s2) / int(s3))\r\nc = math.sqrt(int(s3) * int(s2) / int(s1))\r\n\r\nprint(int(4*(a+b+c)))", "import math\r\ns1,s2,s3 = list(map(int,input().split()))\r\n\r\na = math.sqrt((s1*s3)//s2)\r\nb = math.sqrt((s1*s2)//s3)\r\nc = math.sqrt((s2*s3)//s1)\r\n\r\nprint((int)(4*(a+b+c)))\r\n\r\n", "a,b,c=map(int,input().split())\r\nl=((a*b*c)**0.5)/(b)\r\nm=((a*b*c)**0.5)/(a)\r\no=((a*b*c)**0.5)/(c)\r\n\r\nprint(int(4*l+4*m+4*o))", "import math\r\na,b,c = map(int, input().split())\r\n\r\nx = int(math.sqrt((a*b) // c))\r\ny = a//x\r\nz = b//x\r\nprint(x*4 + y*4 + z*4)", "from math import sqrt\r\ndef parellelepiped(s1, s2, s3):\r\n a = sqrt((s1*s3)/s2)\r\n b = sqrt((s1*s2)/s3)\r\n c = sqrt((s2*s3)/s1)\r\n\r\n return int(4*(a+b+c))\r\n\r\na, b, c = map(int, input().split())\r\nprint(parellelepiped(a, b, c))", "import math\r\nab, bc, ac = list(map(int, input().split()))\r\nq = ab*(bc+ac) + bc*(ac + ab) + ac*(ab+bc)\r\n\r\na = math.sqrt((2*ab*ac)*(ac+ab)/(q-2*ab*ac))\r\nb = ab/a\r\nc = ac/a\r\nans = 4*(a+b+c)\r\nprint(int(ans))\r\n\r\n", "import math\n\nab, ac, bc = [int(x) for x in input().split()]\n\nb = math.sqrt(bc * ab / ac)\na = ab / b\nc = ac / a\n\ns = 4*a + 4*b + 4*c\nprint(int(s))\n\n\t \t \t\t\t \t\t \t\t\t \t\t \t\t \t\t", "import math\r\n[a1,a2,a3] = list(map(int,input().split()))\r\n\r\nl = math.sqrt(a1*a3/a2)\r\n\r\nb = math.sqrt(a1*a2/a3)\r\n\r\nh = math.sqrt(a2*a3/a1)\r\n\r\nprint(int(4*(l+b+h)))", "import math as m\r\na1,a2,a3=map(int,input().split())\r\np=m.sqrt( (a1*a3)//a2 )\r\nq=m.sqrt( (a2*a3)//a1 )\r\nr=m.sqrt( (a1*a2)//a3 )\r\nprint(int(4*(p+q+r)))", "l = list(map(int, input().split()))\r\na = ((l[0]*l[1])/l[2])**(1/2)\r\nb = ((l[0]*l[2])/l[1])**(1/2)\r\nc = ((l[1]*l[2])/l[0])**(1/2)\r\ns = (a+b+c)*4\r\nprint(int(s))", "arr=list(map(int,input().split()))\r\nc=((arr[1]*arr[2])/arr[0])**0.5\r\nb=arr[1]/c\r\na=arr[0]/b\r\nprint(int(4*(a+b+c)))", "from math import sqrt\r\na, b, c = map(int, input().split())\r\ny = sqrt(a * c / b)\r\nx, z = a / y, c / y\r\nprint(4 * int(x + y + z))\r\n", "'''\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 :A. Parallelepiped\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\n# a1, a2, a3 = map(int, input().split())\r\n \r\n# x = int((a1 * a3 / a2) ** (1/2))\r\n# y = int((a1 * a2 / a3) ** (1/2))\r\n# z = int((a2 * a3 / a1) ** (1/2))\r\n \r\n# print(4 * sum((x, y, z)))\r\na,b,c=map(int,input().split())\r\nx=int((a*c/b)** 0.5)\r\ny=int((a*b/c)**0.5)\r\nz=int((b*c/a)**0.5)\r\nprint(4*sum((x,y,z)))", "a,b,c=map(int,input().split())\nk=(a*b*c)**0.5\nprint(4 * int(k/a + k/b + k/c))\n \t \t\t \t\t \t \t\t\t \t \t\t\t \t\t\t\t", "import math\r\na = list(map(int, input().split()))\r\nl = math.sqrt(a[0] * a[1] / a[2])\r\nb = math.sqrt(a[2] * a[0] / a[1])\r\nh = math.sqrt(a[2] * a[1] / a[0])\r\nsums = l+b+h\r\nprint(int(4*sums))", "a,b,c=list(map(int,input().split()))\r\na1=a*b*c\r\ns1=int(((a1/(a**2)))**.5)\r\ns2=int(((a1/(b**2)))**.5)\r\ns3=int(((a1/(c**2)))**.5)\r\nprint(4*(s1+s2+s3))", "import math\n\ndef solution():\n x, y, z = map(int, input().split()) # the areas\n sol = int(4*(math.sqrt(z*x/y) + math.sqrt(y*x/z) + math.sqrt(y*z/x)))\n print(sol)\n\nsolution()", "import math\nsides = [int(x) for x in input().split(\" \")]\nsides.sort()\n\na1, a2, a3 = sides\nl1 = int(math.sqrt((a1*a2)/a3))\nl3 = int(a2 / l1)\nl2 = int(a3 / l3)\n\nprint(4 * (l1+l2+l3))\n\t\t \t\t\t\t \t\t \t\t \t \t\t \t \t\t \t", "## let the sides a,b and c\r\nimport math\r\nsides = list(map(int,input().split()))\r\nb = math.sqrt((sides[0]*sides[1])/sides[2])\r\na = sides[0]/b\r\nc = sides[1]/b\r\nres = int(4*a + 4*b + 4*c)\r\nprint(res)", "a,b,c=map(int,input().split())\r\nx=(((a*b)//c)**0.5)\r\ny=(((a*c)//b)**0.5)\r\nz=(((c*b)//a)**0.5)\r\nd=int(4*(x+y+z))\r\nprint(d)", "from math import sqrt\r\na,b,c = map(int,input().split())\r\ny = int(sqrt((a*b)/c))\r\nx = int(a/y)\r\nz = int(b/y)\r\nprint(4*x+4*y+4*z)", "a,b,c=[int(x) for x in input(\"\").split()]\r\nx=(((a*b)/c)**(1/2))\r\ny=(((b*c)/a)**(1/2))\r\nz=(((c*a)/b)**(1/2))\r\n\r\nprint(int(4*(x+y+z)))", "a,b,c = map(int,input().split())\nx = ((a*b) / c)**0.5\ny = ((c*a)/b) ** 0.5\nz = ((c*b)/a) ** 0.5\ns = int((x+y+z) * 4)\nprint(s)\n", "l = list(map(int,input().split(' ')))\r\nl = sorted(l)\r\nfor i in range(1,l[0]+1):\r\n if l[0]%i == 0 and l[1]%i == 0:\r\n b = l[0]/i\r\n c = l[1]/i\r\n if l[2] == b*c:\r\n print(int(4*(i+b+c)))\r\n break\r\n", "import math\na, b, c = map(int, input().split(' '))\ny = int(math.sqrt(a*c / b)) \nz = int(c / y)\nx = int(a / y)\nprint(4 * (x + y + z))", "from math import sqrt\r\n\r\ns1, s2, s3 = map(int, input().split())\r\n\r\na = int(sqrt((s1 * s3)//s2))\r\n\r\nb = int(sqrt((s1 * s2)//s3))\r\n\r\nc = int(sqrt((s2 * s3)//s1))\r\n\r\nprint(4 * (a + b + c))\r\n", "a,b,c=map(int,input().split())\r\nprint(int(4*(((a*b)/c)**0.5+((c*b)/a)**0.5+((a*c)/b)**0.5)))\r\n", "\r\n# ██╗ ██╗ █████╗ ██╗ ██████╗ ███████╗ ████████╗ ██╗ ██╗ \r\n# ██║ ██╔╝██╔══██╗██║ ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║ ██║ \r\n# █████╔╝ ███████║██║ ██║ ██║ █████╗ ████████║ ███████║ \r\n# ██╔═██╗ ██╔══██║██║ ██║ ██║ ██╔══╝ ╔════╝██║ ██╔══██║ \r\n# ██║ ██╗██║ ██║███████╗██████╔╝ ███████╗ ████████║ ██║ ██║ \r\n# ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═════╝ ╚══════╝ ╚══════╝╚ ═╝ ╚═╝ \r\n\r\nMOD = int(1e9)+7\r\nfrom math import sqrt,ceil,log,log2,\\\r\nfloor,gcd,pi,factorial,lcm\r\nfrom collections import deque\r\nfrom itertools import permutations\r\n\r\ndef solve():\r\n x = int(sqrt((a1*a2)/a3))\r\n y = a2//x\r\n z = a1//x\r\n print((x+y+z)*4)\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n a1,a2,a3 = map(int,input().split())\r\n solve()\r\n", "k=list(map(int,input().split()))\r\nx,y,z=int(k[0]),int(k[1]),int(k[2])\r\nl=(x*z/y)**0.5\r\nh=(y*z/x)**0.5\r\nb=(x*y/z)**0.5\r\nprint(4*int(l+b+h))", "a,b,c = map(int, input().split())\r\nprint(int((a*b/c + a*c/b + b*c/a + 2*(a+b+c))**0.5*4))\r\n", "a,b,c = map(int,input().split())\r\nx = ((a*b)/c)**0.5\r\ny = ((c*b)/a)**0.5\r\nz = ((a*c)/b)**0.5\r\nprint(int(4*(x+y+z)))", "import math\na,b,c= map(int,input().split())\ndiv = []\nfor i in range(1,a+1):\n if(a%i==0):\n div.append(i)\n\nfor i in div:\n x= a//i\n if(b%i==0 and c//x == b//i):\n print(4*(i+a//i +b//i))\n break\n\n", "from sys import stdin\r\nfrom itertools import cycle\r\ninput = stdin.readline\r\none, two, three = map(int, input().split())\r\ny = int((one*two/three)**0.5)\r\nx = int((one*three/two)**0.5)\r\nz = int((three*two/one)**0.5)\r\n\r\nprint((x+ y +z)*4)\r\n", "import math\r\nx, y, z = [int(n) for n in input().split()]\r\na = math.sqrt((x * y) / z)\r\nb = math.sqrt((z * x) / y)\r\nc = math.sqrt((y * z) / x)\r\nsum = int((a + b + c) * 4)\r\nprint(sum)", "import math\r\na,b,c= map(int, input().split())\r\n\r\nx=math.sqrt((a*c)/b)\r\ny=math.sqrt((a*b)/c)\r\nz=math.sqrt((b*c)/a)\r\nsum = x+y+z\r\nprint(int(4*sum))\r\n\r\n\r\n# a,b,c=map(int,input().split())\r\n# xyz=(a*b*c)**0.5\r\n# z=xyz/a\r\n# y=xyz/c\r\n# x=xyz/b\r\n# vv=0\r\n# print(int(4*(x+y+z)))\r\n", "import math\r\nA1,A2,A3=map(int,input().split())\r\n\r\n# A1= LH\r\n# A2= WH\r\n# A3= LW\r\n\r\nH=math.sqrt((A1*A2)/A3)\r\nL=A1/H\r\nW=A2/H\r\n\r\nprint(int(4*L+4*W+4*H))", "import math\r\n# from typing import Counter\r\n# for _ in range(1,int(input())+1):\r\n # h,m=map(int,input().split())\r\n # a=list(map(int,input().split()))\r\n\r\nxy,yz,zx=map(int,input().split())\r\nsop=xy+yz+zx\r\nx2=(xy*zx)/yz\r\ny2=(xy*yz)/zx\r\nz2=(zx*yz)/xy\r\nval=4*math.sqrt(x2+y2+z2+2*(sop))\r\nprint(int(val))", "import math\r\n\r\ndef solve():\r\n lb,bh,hl = map(int, input().split(' '))\r\n h = math.sqrt(hl*bh / lb)\r\n l = hl/h\r\n b = lb/l\r\n print(int(4*(l+b+h)))\r\n\r\n\r\n\r\n\r\nsolve()", "from math import sqrt\r\n\r\nA,B,C = map(int,input().split()) # A => ab, B => bc, C => ca\r\na = sqrt((A*C)/B)\r\nb = sqrt((B*A)/C)\r\nc = sqrt((C*B)/A)\r\n\r\nprint(int(4*(a+b+c)))\r\n", "import math\n\nif __name__ == '__main__':\n a, b, c = [int(i) for i in input().split()]\n print(int(4 * (math.sqrt(a * b / c) + math.sqrt(a * c / b) + math.sqrt(b * c / a))))\n\n\t\t\t \t\t\t\t \t \t \t \t\t \t\t \t\t \t", "x,y,z=map(int,input().split())\r\n\r\na=(x*y/z)**(1/2)\r\nb=(z*y/x)**(1/2)\r\nc=(x*z/y)**(1/2)\r\n\r\nprint(int(4*(a+b+c)))", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\na,b,c = map(int, input().split())\r\nx = int(((a*c)/b)**(0.5))\r\ny = int(((a*b)/c)**(0.5))\r\nz = int(((b*c)/a)**(0.5))\r\nprint(4*(x+y+z))", "from math import sqrt\ns = input().split(\" \")\ns = map(int, s)\ns = list(s)\n\nx = sqrt(s[1]*s[2]/s[0])\nx += sqrt(s[0]*s[2]/s[1])\nx += sqrt(s[0]*s[1]/s[2])\n\nx = int(x)\nx *= 4\nprint(x)", "x,y,z=map(int,input().split())\r\na=int((x*y*z)**0.5)\r\nprint(4*((a//x)+(a//y)+(a//z)))\r\n", "from math import sqrt\r\na1,a2,a3 = map(int,input().split())\r\nn = (a2*a3)/a1\r\nh = int(sqrt(n))\r\nb = int(a2/h)\r\nl = int(a1/b)\r\nprint(4*(l+b+h))", "# https://codeforces.com/problemset/problem/224/A\r\n\r\na, b, c = [int(x) for x in input().split()]\r\n\r\na, b, c = ((a*b)/c) ** 0.5, ((a*c)/b) ** 0.5, ((b*c)/a) ** 0.5\r\nprint(int(4 * (a + b + c)))", "#文字列入力はするな！！\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\na,b,c=map(int,input().split())\r\nk=(a*b*c)**0.5\r\nprint(4*int((k//a)+(k//b)+(k//c)))\r\n\r\n\r\n \r\n\r\n#carpe diem \r\n#carpe diem", "a1, a2, a3 = map(int, input().split())\r\n\r\na = (a1 * a3 // a2) ** (0.5)\r\nb = (a1 * a2 // a3) ** (0.5)\r\nc = (a2 * a3 // a1) ** (0.5)\r\n\r\nprint(int(4 * (a + b + c)))\r\n\r\n\r\n", "import math\r\n\r\na1,a2,a3 = list(map(int,input().split()))\r\n\r\na = math.sqrt((a1*a2)//a3)\r\nb = math.sqrt((a1*a3)//a2)\r\nc = math.sqrt((a2*a3)//a1)\r\n\r\nans = int((a+b+c)*4)\r\n\r\nprint(ans)", "g = input().split()\r\nd = []\r\nfor i in range(3):\r\n d.append(int(g[i]))\r\ns1, s2, s3 = d[0], d[1], d[2]\r\na = (s2 * s3 / s1) ** (1 / 2)\r\nb = (s1 * s3 / s2)** (1 / 2)\r\nc = (s1 * s2 / s3) ** (1 / 2)\r\nprint(int(4 * (a + b + c)))\r\n", "a,b,c = map(int,input().split())\n\nl1 = (a*c/b)**0.5*4\nl2 = (a*b/c)**0.5*4\nl3 = (b*c/a)**0.5*4\nprint(int(l1+l2+l3))\n \t \t \t\t \t\t \t\t \t\t\t \t \t\t\t \t\t\t", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\nimport math\r\ndef exe():\r\n x=int(math.sqrt((a*c)//b))\r\n y=int(math.sqrt((a*b)//c))\r\n z=int(math.sqrt((b*c)//a))\r\n return 4*(x+y+z)\r\na,b,c=map(int,input().split())\r\nprint(exe())", "import math\na, b, c = map(int, input().split())\nabc = math.isqrt(a * b * c)\nd = abc // a\ne = abc // b\nf = abc // c\nprint(4 * (d + e + f))\n", "from math import sqrt\r\na,b,c=map(int,input().split(' '))\r\nx=sqrt((a*b)/c)\r\ny=sqrt((a*c)/b)\r\nz=sqrt((b*c)/a)\r\n\r\nprint(int(4*(x+y+z)))", "# https://codeforces.com/problemset/problem/224/A\r\n\r\nimport sys\r\n#-----------------------------------------------------------------------------#\r\ntry:\r\n sys.stdin = open('inputs.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\nfinally:\r\n input = sys.stdin.readline\r\n print = sys.stdout.write\r\n\r\n#-----------------------------------------------------------------------------#\r\nfrom math import sqrt\r\nab, bc, ca = map(int, input().split())\r\n\r\nprint(\"{0:.0f}\".format(\r\n 4 * sum(map(sqrt, (ab * bc // ca, ab * ca // bc, bc * ca // ab)))))\r\n", "a,b,c = [int(x) for x in input().split()]\r\n\r\nL = (a*b/c)**(1/2)\r\nH = b / L\r\nW = c / H\r\n\r\nans = 4*L + 4*H + 4*W\r\nprint(int(ans))", "(a,b,c) = list(int(x) for x in input().split())\r\nprint(int(4*(((a*b)/c)**0.5+((a*c)/b)**0.5+((c*b)/a)**0.5)))", "import math\r\n\r\nn = input()\r\n\r\nstack = n.split(\" \")\r\n\r\na = math.sqrt(int(stack[0])*int(stack[2])/int(stack[1]))\r\nb = math.sqrt(int(stack[0])*int(stack[1])/int(stack[2]))\r\nc = math.sqrt(int(stack[1])*int(stack[2])/int(stack[0]))\r\n\r\nprint(int(4*(a+b+c)))\r\n\r\n", "import math\na1, a2, a3 = [int(x) for x in input().split()]\n\ne1 = math.sqrt(a2 * a3 / a1);\ne2 = math.sqrt(a3 * a1 / a2);\ne3 = math.sqrt(a1 * a2 / a3);\n\nprint(4 * int(e1 + e2 + e3));\n \t\t\t\t\t \t\t\t\t\t\t \t \t\t \t \t\t", "def solve(a, b, c):\r\n x = (a * b // c) ** 0.5\r\n y = (b * c // a) ** 0.5\r\n z = (c * a // b) ** 0.5\r\n return int(4 * (x + y + z))\r\n\r\na, b, c = map(int, input().split())\r\n\r\nprint(solve(a, b, c))\r\n", "# -*- 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\na,b,c=map(int,input().split())\nimport math\nl=math.sqrt(a*c/b)\nw=math.sqrt(a*b/c)\nh=math.sqrt(b*c/a)\nprint(int(4*(l+w+h)))", "def google():\r\n \r\n a,b,c = [int(x) for x in input().split()]\r\n \r\n heigth = int(((b*a)//c)**(1/2))\r\n base = (c*heigth)//a\r\n length = a//heigth\r\n\r\n print(length*4+heigth*4+base*4)\r\n\r\n\r\n\r\ngoogle()\r\n", "import math\na,b,c=list(map(int,input().split()))\nm=math.sqrt((a*b)/c)\nn=math.sqrt((a*c)/b)\no=math.sqrt((b*c)/a)\nprint(int((m+n+o)*4))\n\t\t \t \t\t \t \t\t\t \t \t\t\t \t\t", "import math\r\n\r\na,b,c=map(int,input().split())\r\n\r\nA=math.sqrt((a*c)//b)\r\nB=math.sqrt((a*b)//c)\r\nC=math.sqrt((b*c)//a)\r\n\r\nprint(int(A*4+B*4+C*4))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c = map(int, input().split())\r\nfor i in range(1, a + 1):\r\n j = a // i\r\n k = b // j\r\n if i * j == a and j * k == b and k * i == c:\r\n ans = 4 * (i + j + k)\r\n break\r\nprint(ans)", "a,b,c = map(int,input().split())\r\nx = (a*b/c)**0.5\r\ny = (b*c/a)**0.5\r\nz = (a*c/b)**0.5\r\nprint(int(4*x + 4*y + 4*z))", "x, y, z = map(int,input().split())\r\n\r\na = ((x*z)//y)**0.5\r\nc = ((z*y)//x)**0.5\r\nb = ((x*y)//z)**0.5\r\n\r\nres = int(4*(a+b+c))\r\nprint(res)", "a1, a2, a3 = list(map(int, input().split()))\nif((a1*a3)%a2 == 0):\n a1, a2 = a2, a1\nelif((a1*a2)%a3 == 0):\n a1, a3 = a3, a1\n\nh = int((a2*a3/a1)**(1/2))\nl = h*a1//a2\nb = a2//h\nprint(4*(l+b+h))\n", "from math import sqrt\r\na, b, c = map(int, input().split())\r\nx = sqrt(a*b*c)\r\na = x/a\r\nb = x/b\r\nc = x/c\r\nprint(int(4*(a+b+c)))", "x,y,z=map(int,input().split())\r\nprint(int(4*(((x/y)*z)**0.5+x/((x/y)*z)**0.5+z/((x/y)*z)**0.5)))", "import math as m\r\nx,y,z= map(int,input().split())\r\na=m.sqrt(x*y*z)\r\nprint(int(4*(a/x+a/y+a/z)))\r\n", "a, b, c=map(int, input().split())\r\nk=(a * b * c) ** 0.5\r\nprint(4 * int(k / a + k / b + k / c))\r\n", "s1,s2,s3=map(int,input().split());c=(s2*s3/s1)**0.5;a=s3//c;b=s2//c\r\nprint(4*int(a+b+c))", "import math\r\n\r\n\r\na,b,c=map(int,input().split())\r\ns1=math.sqrt((b*c)//a)\r\ns2=math.sqrt((a*c)//b)\r\ns3=math.sqrt((a*b//c))\r\n#print(s1,s2,s3)\r\np=((s1+s2+s3)*4)\r\np=int(p)\r\nprint(p)\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 math\na,b,c=list(map(int,input().split()))\nheight=math.sqrt(b*c/a)\nbreath=b/height\nlength=a/breath\nprint(int((height*4+breath*4+length*4)))", "a, b, c = map(int, input().split())\r\n\r\ns1 = (a * b / c) ** (1 / 2)\r\ns2 = (a * c / b) ** (1 / 2)\r\ns3 = (b * c / a) ** (1 / 2) \r\n\r\nprint(4 * int((s1 + s2 + s3)))", "a,b,c=map(int,input().split())\r\nprint(int(4*((((a*b)//c)**0.5)+(((a*c)//b)**0.5)+(((b*c)//a)**0.5))))", "x, y, z = map(int, input().split())\r\nfound = False\r\na = 0\r\nwhile found == False:\r\n a += 1\r\n if x % a == 0 and z % a == 0:\r\n b = x//a\r\n c = z//a\r\n if b * c == y:\r\n found = True\r\nprint((a*4)+(b*4)+(c*4))", "x,y,z = map(int, input().split());\r\n\r\nb = int(((x*y)//z)**0.5);\r\na = x//b;\r\nc = z//a;\r\n\r\nprint(4 * (a + b + c));\r\n", "import math\r\ndef findEdges(s1, s2, s3):\r\n a = math.sqrt(s1 * s2 / s3)\r\n b = math.sqrt(s3 * s1 / s2)\r\n c = math.sqrt(s3 * s2 / s1)\r\n sum = a + b + c\r\n return 4 * sum\r\n\r\ndef main() :\r\n a,b,c = map(int,input().split())\r\n ans = findEdges(a,b,c)\r\n print(int(ans))\r\nmain()", "x,y,z= map(int,input().split()) \r\na=int(x*y*z)**0.5/(x)\r\nb=(x*y*z)**0.5/(y)\r\nc=(x*y*z)**0.5/(z)\r\nprint(int(4*(a+b+c)))", "import math\n\ns1, s2, s3 = map(int, input().split(\" \"))\na = math.sqrt((s1*s3)/s2)\nb = math.sqrt((s1*s2)/s3)\nc = math.sqrt((s2*s3)/s1)\n\nprint(int(4 * (a + b + c)))\n", "from sys import stdin\nfrom collections import deque\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\n\n\ndef ii(): return int(stdin.readline())\n\n\ndef fi(): return float(stdin.readline())\n\n\ndef mi(): return map(int, stdin.readline().split())\n\n\ndef fmi(): return map(float, stdin.readline().split())\n\n\ndef li(): return list(mi())\n\n\ndef lsi():\n x=list(stdin.readline())\n x.pop()\n return x\n\n\ndef si(): return stdin.readline()\n\n\ndef sieve(x):\n a=[True]*(x+1)\n sq=floor(sqrt(x))\n for i in range(3, sq+1, 2):\n if a[i]:\n for j in range(i*i, x+1, i):\n a[j]=False\n if x>1:\n p=[2]\n else:\n p=[]\n for i in range(3, x+1, 2):\n if a[i]:\n p.append(i)\n return p\n#vowel={'a', 'e', 'i', 'o', 'u', 'y', 'A', 'E', 'I', 'O', 'U', 'Y'}\n#pow=[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 34359738368, 68719476736, 137438953472, 274877906944, 549755813888, 1099511627776, 2199023255552, 4398046511104, 8796093022208, 17592186044416, 35184372088832, 70368744177664, 140737488355328, 281474976710656, 562949953421312, 1125899906842624, 2251799813685248, 4503599627370496, 9007199254740992, 18014398509481984, 36028797018963968, 72057594037927936, 144115188075855872, 288230376151711744, 576460752303423488, 1152921504606846976, 2305843009213693952, 4611686018427387904, 9223372036854775808]\n############# CODE STARTS HERE #############\na=li()\na.sort()\ni=1\nwhile i*i<=a[0]:\n if not a[0]%i and not a[1]%i:\n if a[2]==(a[0]//i)*(a[1]//i):\n print(4*(i+(a[0]//i)+(a[1]//i)))\n break\n i+=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 Apr 30 23:19:30 2020\r\n\r\n@author: Administrator \r\n\"\"\"\r\nfrom math import sqrt\r\nab,bc,ca = map(int, input().split())\r\n\r\nprod = ab * bc * ca\r\n\r\nabc = int(sqrt(prod))\r\n\r\na = abc//bc\r\nb = ab//a\r\nc = ca//a\r\n\r\nprint(4*(a+b+c))\r\n\r\n", "from math import sqrt\r\narr = input().split(' ')\r\ns1 = int(arr[0])\r\ns2 = int(arr[1])\r\ns3 = int(arr[2])\r\na = sqrt((s1*s2)/s3)\r\nb = sqrt((s1*s3)/s2)\r\nc = sqrt((s3*s2)/s1)\r\nprint(4*(int(a)+int(b)+int(c)))\r\n", "# countx,county,countz = 0,0,0\r\n\r\n# for _ in range(int(input())):\r\nx,y,z = map(int,input().split())\r\nx,y,z = (x*y)/z,(y*z)/x,(x*z)/y\r\nx,y,z = int(x**0.5),int(y**0.5),int(z**0.5)\r\n\r\nsum = (x+y+z)*4\r\nprint(sum)\r\n", "a, b, c = map(int, input().split())\r\nprint(int(4*((a*c/b)**0.5) + 4*(a/((a*c/b)**0.5)) + 4*(c/((a*c/b)**0.5))))\r\n", "def Parallelepiped():\r\n import math\r\n area_of_3_sides = input().split(' ')\r\n area_of_3_sides = [eval(i) for i in area_of_3_sides]\r\n xy = area_of_3_sides[0]\r\n yz = area_of_3_sides[1]\r\n xz = area_of_3_sides[2]\r\n\r\n x = math.sqrt((xy*xz)/yz)\r\n y = math.sqrt((yz*xy)/xz)\r\n z = math.sqrt((yz*xz)/xy)\r\n\r\n sum_of_all_edges = (x+y+z)*4\r\n print(int(sum_of_all_edges))\r\n\r\n\r\nParallelepiped()", "import math\r\ns1,s2,s3=map(int,input().split())\r\na=math.sqrt((s1*s3)/s2)\r\nb=math.sqrt((s1*s2)/s3)\r\nc=math.sqrt((s2*s3)/s1)\r\nx=4*(a+b+c)\r\nprint(int(x))\r\n", "import math\r\ndef SumOfEdges(ab,bc,ac):\r\n a=math.sqrt((ab*ac)/bc)\r\n b=ab/a\r\n c=ac/a\r\n return int(4*(a+b+c))\r\n\r\nab,bc,ac=map(int,input().split())\r\nprint(SumOfEdges(ab,bc,ac))", "from math import sqrt\r\na1,a2,a3 = list(map(int,input().split())) #1e4\r\na,b,c = sqrt((a2*a3)/a1), sqrt((a1*a3)/a2), sqrt((a1*a2)/a3)\r\nprint(4*int(a+b+c))\r\n", "import math\r\ndef findEdges(s1, s2, s3):\r\n \r\n # to calculate the length of one edge\r\n a = math.sqrt(s1 * s2 / s3)\r\n b = math.sqrt(s3 * s1 / s2)\r\n c = math.sqrt(s3 * s2 / s1)\r\n sum = a + b + c\r\n return 4 * sum\r\nn, s, k = map(int, input().split())\r\nprint(int(findEdges(n,s,k)))", "for i in range(1):\r\n a,b,c=map(int,input().split())\r\n k=(a*b/c)**0.5+(b*c/a)**0.5+(c*a/b)**0.5\r\n print(int(4*k))\r\n", "n = input().split()\r\na_c = int(n[0])\r\na_b = int(n[1])\r\nb_c = int(n[2])\r\nc = (a_c / a_b * b_c) ** 0.5\r\na = a_c / c\r\nb = a_b / a\r\nprint(int(4 * a + 4 * b + 4 * c))\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n x, y, z = [int(i) for i in input().split(\" \")]\r\n one = [x, y, z]\r\n two = [z, x, y]\r\n three = [y, z, x]\r\n for i in [one, two, three]:\r\n x, y, z = i\r\n if (x * y) % z == 0 and math.sqrt((x * y) // z) == math.ceil(math.sqrt((x * y) // z)):\r\n a = int(math.sqrt((x * y) // z))\r\n b = x // a\r\n c = y // a\r\n print(4 * a + 4 * b + 4 * c)\r\n\r\n\r\nmain_function()\r\n", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"OUTPUT3.out\",\"w\") \r\na,b,c=map(int,input().split())\r\nV=int(pow((a*b*c),0.5))\r\nprint(4*(V//a+V//b +V//c))", "import math\r\n\r\nx,y,z=([int(x) for x in input().split()])\r\na=math.sqrt(x*y*z)\r\nb=x*y+y*z+z*x\r\nprint(int(4*b/a))", "a, b, c = map(int, input().split())\n\ns1 = int(((a * c) / b) ** 0.5)\ns2 = int(((a * b) / c) ** 0.5)\ns3 = int(((b * c) / a) ** 0.5)\n\nsums = 4 * sum([s1, s2, s3])\nprint(sums)\n", "import math\r\nxy,yz,xz=map(int,input().split())\r\na=xy/yz\r\nx=math.sqrt(a*xz)\r\ny=xy/x\r\nz=yz/y\r\nprint(int(x+y+z)*4)", "from math import sqrt\nentrada = input()\nentrada = list(map(int, entrada.split()))\nz = int(sqrt((entrada[2]*entrada[1])/entrada[0]))\nx = int(entrada[1]/z)\ny = int(entrada[0]/x)\n\ntotal = 4*(x + y + z)\nprint(total)", "from math import sqrt\r\na,b,c=map(int,input().split())\r\nx=int(sqrt((a*b)//c))\r\ny=int(sqrt((a*c)//b))\r\nz=int(sqrt((b*c)//a))\r\nprint((4*(x+y+z)))", "import math\na,b,c=list(map(int,input().split()))\nm=math.sqrt((a*b)/c)\nn=math.sqrt((a*c)/b)\no=math.sqrt((b*c)/a)\nk=int((m+n+o)*4)\nprint(k)\n\t\t \t\t\t\t\t\t\t\t \t\t \t \t\t \t \t\t\t \t\t", "num=list(map(int,input().split()))\r\na=1\r\nfor i in range(3):\r\n a=a*num[i]\r\na=a**0.5\r\nprint(int(4*sum((list(map(lambda x: a/x,num))))))\r\n", "import sys, os\r\nfrom collections import defaultdict\r\nfrom math import gcd, sqrt\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n\r\ndef main():\r\n a, b, c = read()\r\n print(4*int(sqrt(((a*b)//c))) + 4*int(sqrt(((a*c)//b))) + 4*int(sqrt(((c*b)//a))))\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\r\n\r\n\r\n\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"", "import math\r\ns1, s2, s3 = map(int, input().split())\r\nv2 = s1*s2*s3\r\nprint(int(4 * (math.sqrt(v2 / (s1 * s1)) + math.sqrt(v2 / (s2 * s2)) + math.sqrt(v2 / (s3 * s3)))))\r\n", "x,y,z=map(int,input().split())\r\nprint(int(4*(x*y+y*z+z*x)//((x*y*z)**(0.5))))", "from math import sqrt\na,b,c=map(int,input().split())\nx=sqrt((a*c)/b)\ny=sqrt((a*b)/c)\nz=sqrt((b*c)/a)\nprint(int(4*(x+y+z)))\n", "arr = [int(x) for x in input().split()]\r\nl = (int((arr[0]*arr[2])/arr[1]))**0.5 \r\n\r\nb = int(arr[0]/l)\r\nh = int(arr[2]/l)\r\n\r\nprint(int(4*(l+b+h)))", "area1, area2, area3 = [int(i) for i in input().split()]\r\nside1 = ((area1*area3)//area2)**(1/2)\r\nside2 = ((area3*area2)//area1)**(1/2)\r\nside3 = ((area1*area2)//area3)**(1/2)\r\nans = int(4 * (side1 + side2 + side3))\r\nprint(ans)", "\r\na,b,c=map(int,input().split())\r\np=(a*b*c)**0.5\r\n\r\nprint(int(4*((p/a) + (p/b) + (p/c))))", "import math\r\nx,y,z=map(int,input().split())\r\nb=math.sqrt(x*y/z)\r\na=x/b\r\nc=y/b\r\nprint(int((a+b+c)*4))", "areas = input().split()\r\n\r\narea1 = int(areas[0])\r\narea2 = int(areas[1])\r\narea3 = int(areas[2])\r\n\r\nheight = int(pow(area3*area2/area1,0.5))\r\nwidth = int(area1*height/area2)\r\nlength = int(area1/width)\r\n\r\nprint(4*(height + width + length))\r\n\r\n\r\n\r\n", "n1,n2,n3=list(map(int,input().split()))\r\nf=int((n1*n2*n3)**0.5)\r\nprint(int((f/n1+f/n2+f/n3)*4))", "s1,s2,s3=map(int,input().split())\r\na=int(((s1*s2)//s3)**0.5)\r\nb=int(((s1*s3)//s2)**0.5)\r\nc=int(((s3*s2)//s1)**0.5)\r\nprint(4*(a+b+c))", "x, y, z = [int(i) for i in input().split()]\r\n\r\n# x = ab y = bc z = ca\r\na = int((z*x/y)**0.5)\r\nb = int((x*y/z)**0.5)\r\nc = int((y*z/x)**0.5)\r\n\r\nprint(4*(a+b+c))\r\n", "a,b,c = map(int,input().split())\r\nk=0\r\ns1= ((a*b)//c)**0.5\r\ns2= ((a*c)//b)**0.5\r\ns3= ((c*b)//a)**0.5\r\nk = s1+s2+s3\r\nprint(int(k*4))", "a,b,c = map(int,input().split())\r\ns = []\r\nfor i in range(1,min(a,b)+1):\r\n if(a%i==0 and b%i==0):\r\n s.append(i)\r\n# print(s)\r\nans = []\r\nfor i in s:\r\n if(((a//i)*(b//i))==c):\r\n ans.append(i)\r\n ans.append(b//i)\r\n ans.append(a//i)\r\nprint(sum(ans)*4)\r\n\r\n\r\n\r\n", "import math\r\nx, y, z= map(int, input().split()); l= math.sqrt(x*y*z); print(4*int(l/x+ l/y+ l/z))", "a,b,c=map(int,input().split())\r\nsuma=int((a*b*c)**0.5)\r\nprint(int((suma/a+suma/b+suma/c)*4))", "a,b,c = map(int,input().split())\n\nres = (a*b*c)**0.5\n\nh = res/(a)\nl = res/(b)\nb = res/c\n\nprint(int(4*(l+b+h)))\n\n", "a1, a2, a3 = [int(x) for x in input().split()]\r\n\r\nfrom math import*\r\n\r\nw = sqrt((a1/a3)*a2)\r\nl = a2/w\r\nh = a1/w\r\n\r\nprint(int(w*4 + l*4 + h*4))", "import math\nx, y, z = map(int,input().split())\n\nb = int(math.sqrt(x*y//z))\na = int(math.sqrt(x*z//y))\nc = int(math.sqrt(z*y//x))\n\n\nma = max(a,b,c)\nmi = min(a,b,c)\nmd = sum([a,b,c]) - ma -mi\nprint(ma*4 + mi*4 + md*4)\n", "ls = [int(i) for i in input().split()]\r\na = ls[0]\r\nb=ls[1]\r\nc=ls[2]\r\n\r\nk = (a*b*c)**0.5\r\nprint(4*int(k/a+k/b+k/c))", "import math\r\np=input()\r\na,d,c=map(int,p.split())\r\nl=int(math.sqrt((a*c)/d))\r\nb=int(math.sqrt((a*d)/c))\r\nh=int(math.sqrt((c*d)/a))\r\nprint(4*(l+b+h))", "import math\r\n\r\ns1, s2, s3 = map(int, input().split())\r\na = math.sqrt(s1*s2/s3)\r\nb = math.sqrt(s3*s2/s1)\r\nc = math.sqrt(s1*s3/s2)\r\nsummation = a + b + c\r\nprint(int(4*summation))", "import math\r\n\r\na, b, c = [int(x) for x in input().split()]\r\n\r\nprint(int(4 * (math.sqrt(a * b / c) + math.sqrt(c * a / b) + math.sqrt(c * b / a))))", "from math import sqrt\r\n\r\ns1 , s2 , s3 = map(int,input().split())\r\n\r\nres = sqrt(s1*s3/s2)+sqrt(s1*s2/s3)\r\nres += sqrt(s2*s3/s1)\r\nprint(int(res*4))", "from sys import *\r\nfrom sys import stdin,stdout\r\nfrom math import sqrt\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\n\r\na,b,c = get_int()\r\n\r\na,b,c = int(sqrt((a * c) // b)),int(sqrt((a * b) // c)),int(sqrt((b * c) // a))\r\nprint(4 * (a + b + c))", "import math\r\ns1, s2, s3 = map(int,input().split())\r\nprint(int(4 * ( math.sqrt(s1 * s2 / s3) + math.sqrt(s3 * s1 / s2) + math.sqrt(s3 * s2 / s1) )))", "import math\r\na,b,c=map(int,input().split())\r\nx=math.sqrt((a*b)/c)\r\ny=math.sqrt((a*c)/b)\r\nz=math.sqrt((c*b)/a)\r\nans=(x+y+z)*4\r\nprint(int(ans))", "from math import sqrt\r\nA,B,C=map(int,input().split())\r\nl=sqrt(A*C/B)\r\nb=sqrt(A*B/C)\r\nh=sqrt(B*C/A)\r\nprint(int((l+b+h)*4))", "import math\r\nar1, ar2, ar3 = map(int, input().split())\r\nabc = math.sqrt(ar1 * ar2 * ar3)\r\na = abc // ar1\r\nb = abc // ar2\r\nc = abc // ar3\r\nprint(int(4*(a+b+c)))", "import math\n\nval = [int(x) for x in input().split(' ')]\n\nd = math.sqrt(val[1] * val[2] / val[0])\nh = val[1] / d\nw = val[2] / d\n\nprint(int(4 * (d+h+w)))\n\n\t\t \t\t\t\t\t \t\t \t\t \t \t\t \t", "a, b, c = map(int, input().split())\r\nt = a / b\r\nh = int((c / t) ** (0.5))\r\nb = c // h\r\nl = a // b\r\ns = 4 * (l + b + h)\r\nprint(s)\r\n", "s,x,y=map(int,input().split())\r\n\r\na=(((s*x)//y)**0.5)\r\nb=(((s*y)//x)**0.5)\r\nc=(((y*x)//s)**0.5)\r\n\r\nprint(4*int((a+b+c)))\r\n", "a, b, c = [int(i) for i in input().split()]\r\nprint( int(4*(((a*b)/c)**0.5 + ((a*c)/b)**0.5 + ((c*b)/a)**0.5)) )", "# -*- coding: utf-8 -*-\r\nimport math\r\narr = list(map(int,input().split()))\r\n\r\nb = int(math.sqrt((arr[1]*arr[0])/arr[2]))\r\n\r\na = arr[0]//b\r\nc = arr[2]//a\r\n\r\nans = 4*(a+b+c)\r\n\r\nprint(ans)\r\n\r\n", "a,b,c=map(int,input().split())\r\nimport math\r\nx=math.sqrt((a*b)//c)\r\ny=math.sqrt((b*c)//a)\r\nz=math.sqrt((c*a)//b)\r\nans=int((x+y+z)*4)\r\nprint(ans)", "import math\r\na1,a2,a3=list(map(int,input().split()))\r\nc=int(math.sqrt((a3*a2)/a1))\r\na=int(a3/c)\r\nb=int(a1/a)\r\nprint(4*(a+b+c))", "from math import sqrt\r\na, b, c = map(int, input().split())\r\nx = sqrt((a*c) / b)\r\ny = a / x\r\nz = b / y\r\nprint(int(4*x + 4*y + 4*z))", "a = b = c = 1\r\nx, y, z = map(int, input().split())\r\nfor i in range(1, x+1):\r\n a = i\r\n b = x/a\r\n if(b == int(b)):\r\n for j in range(int(b), y+1):\r\n c = y/b\r\n if(c==z//a and c == int(c)):\r\n print(int(4*(a+b+c)))\r\n exit()\r\n \r\n \r\n\r\n\r\n\r\n", "import math\r\n\r\nsides = list(map(int, input().strip().split()))\r\n\r\na = math.sqrt(sides[0]*sides[1] / sides[2])\r\nb = math.sqrt(sides[0]*sides[2] / sides[1])\r\nc = math.sqrt(sides[1]*sides[2] / sides[0])\r\n\r\nprint(int(4 * a + 4 * b + 4 * c))", "import math\r\nx, y, z=map(int, input().split())\r\na=int((x*z)/y)\r\nA=int(math.sqrt(a))\r\nb=int((x*y)/z)\r\nB=int(math.sqrt(b))\r\nc=int((y*z)/x)\r\nC=int(math.sqrt(c))\r\nprint((A+B+C)*4)", "import math\r\nlb, bh, hl = [int(x) for x in input().split()]\r\nlbh = int(math.sqrt(lb * bh * hl))\r\nl = lbh // bh\r\nb = lbh // hl\r\nh = lbh // lb\r\nsum = 4 * (l + b + h)\r\nprint(sum)", "import math as m\r\ns1,s2,s3=map(int,input().split(\" \"))\r\na=m.sqrt(s1*s2//s3)\r\nb=m.sqrt(s1*s3//s2)\r\nc=m.sqrt(s3*s2//s1)\r\nprint(int(a*4+b*4+c*4))", "\"\"\"\r\n\r\n12 edges\r\nres = 4 * side1 + 4 * side2 + 4 * side3\r\n\r\nI need to find side1, side2, and side3\r\n\r\narea1 area2 area3\r\n\r\narea1 = a*c\r\narea2 = b*c\r\narea3 = a*b\r\n\r\na = math.sqrt(area1 * area3 / area2)\r\nb = math.sqrt(area2 * area3 / area1)\r\nc = math.sqrt(area1*area2/area3)\r\n\r\n\"\"\"\r\n\r\nimport math\r\n\r\na1, a2, a3 = [int(a) for a in input().split(' ')]\r\n\r\na = math.sqrt((a1 * a3)/a2)\r\nb = math.sqrt((a2 * a3) / a1)\r\nc = math.sqrt((a1 * a2) / a3)\r\n\r\nprint(str(int(4*a + 4*b + 4* c)))\r\n\r\n", "from math import sqrt\r\n\r\narea1, area2, area3 = map(int, input().split())\r\nc = sqrt((area2 * area3) / area1)\r\na = area2 / c\r\nb = area3 / c\r\n\r\nprint(int((a + b + c) * 4))\r\n", "n=[int(i) for i in input().split()]\r\nab=n[0]\r\nac=n[1]\r\nbc=n[2]\r\np=n[1]/n[0]\r\nc=int((p*bc)**0.5)\r\nb=int(n[2]/c)\r\na=int(n[0]/b)\r\nprint(4*(a+b+c))\r\n", "\r\nareas = input().split()\r\n\r\nfor a in range(1, int(areas[0]) + 1):\r\n if int(areas[0]) % a == 0:\r\n b = int(int(areas[0]) / a)\r\n for c in range(1, int(areas[1]) + 1):\r\n if b * c == int(areas[1]):\r\n if a * c == int(areas[2]):\r\n print(((a*2) + (b*2) + (c*2)) *2)\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/224/A\r\n\r\ns1, s2, s3 = map(int, input().split())\r\na = ((s1*s3)/s2) ** 0.5\r\nb = ((s1*s2)/s3) ** 0.5\r\nc = ((s2*s3)/s1) ** 0.5\r\nprint(4*int(a+b+c))\r\n", "s1,s2,s3=[int(x) for x in input().split()]\r\na=((s1*s3)/s2)**(1/2)\r\nb=((s1*s2)/s3)**(1/2)\r\nc=((s2*s3)/s1)**(1/2)\r\nprint(int(4*(a+b+c)))", "import math\r\n\r\na,b,c = list(map(int,input().split()))\r\ns1 = math.sqrt(a*b/c)\r\ns2 = math.sqrt(b*c/a)\r\ns3 = math.sqrt(c*a/b)\r\n\r\nsum = s1+s2+s3\r\nprint(int(sum)*4)", "from math import sqrt\r\n\r\nab, bc, ac = list(map(int, input().split(\" \")))\r\n\r\nabc = sqrt(ab*bc*ac)\r\n\r\na = abc//bc\r\nb = abc//ac\r\nc = abc//ab\r\n\r\nprint(4*int(a+b+c))", "a,b,c=map(int,input().split())\r\nxyz=(a*b*c)**0.5\r\nz=xyz/a\r\ny=xyz/c\r\nx=xyz/b\r\nprint(int(4*(x+y+z)))\r\n", "import math as m\r\n\r\n\r\na, b, c = map(int, input().split())\r\nv= m.sqrt(a*b*c)\r\nprint(int(4*(v/a+v/b+v/c)))", "a1,a2,a3=map(int,input().split())\r\na=int(pow(a1*a3/a2,0.5))\r\nb=int(pow(a1*a2/a3,0.5))\r\nc=int(pow(a2*a3/a1,0.5))\r\nprint(4*(a+b+c))\r\n", "a, b, c = map(int, input().split())\r\nprint(int((a * b // c) ** 0.5 * 4 + (b * c // a) ** 0.5 * 4 + (c * a // b) ** 0.5 * 4))", "x=list(map(int, input().split()))\r\nab=x[0]\r\nbc=x[1]\r\nca=x[2]\r\nimport math\r\nc=math.sqrt((ca*bc)/ab)\r\na=(c*ab)/bc\r\nb=bc/c\r\nr=4*(a+b+c)\r\nprint(\"{:.0f}\".format(r))", "a1,a2,a3=map(int,input().split())\r\nd=(pow((a1*a3/a2),0.5)+pow((a2*a3/a1),0.5)+pow((a2*a1/a3),0.5))*4\r\nprint(int(d))\r\n", "# http://codeforces.com/problemset/problem/224/A\r\n\r\n\"\"\"\r\nYou know the area of the three faces of a parallelepiped. Find it's perimeter (sum of edge lengths)\r\n\r\nRectangular parallelepiped is just a cuboid.\r\n\r\nSo areas are xy, xz, yz and we want 4(x+y+z) for perimeter\r\n\r\nWe also know that the edge lengths are integers\r\n\"\"\"\r\n\r\nimport sys\r\n\r\nareas = list(map(int, sys.stdin.readline().split()))\r\n\r\ndef main():\r\n\r\n # Check all the cases\r\n for i in range(3):\r\n A = areas.copy()\r\n xy = A.pop(i)\r\n for j in range(2):\r\n B = A.copy()\r\n xz = B.pop(j)\r\n yz = B.pop()\r\n\r\n # Solve the simultaneous\r\n x, y, z = (xy * xz / yz) ** 0.5, (xy * yz / xz) ** 0.5, (xz * yz / xy) ** 0.5\r\n\r\n if x % 1 == 0 and y % 1 == 0 and z % 1 == 0:\r\n sys.stdout.write(str(int(4*(x+y+z))))\r\n return True\r\n\r\nif __name__ == '__main__':\r\n main()", "from math import ceil\r\n\r\ndef sqrt(x):\r\n return pow(x, 0.5)\r\n\r\nm, n, p = map(int, input().split())\r\na = int(sqrt((n * p) // m))\r\nb = int(sqrt((m * p) // n))\r\nc = int(sqrt((m * n) // p))\r\nprint(4 * (a + b + c))\r\n\r\n'''\r\n* So I drown it out \r\n* Like I always do\r\n* Dancing through our house\r\n* With the ghost of you\r\n'''\r\n", "\r\na,b,c = map(int, input().split())\r\nimport math\r\nprint(4*(a*b+a*c+b*c)//int(math.sqrt(a*b*c)))\r\n\r\n", "from math import *\n\ndef solve(vetor):\n [a,b,c] = vetor\n lado1 = sqrt(a * c / b)\n lado2 = c / lado1\n lado3 = a / lado1\n return int(4*(lado1+lado2+lado3)) \n \nvetor = list(map(int,input().split()))\nprint(solve(vetor))\n\n \t\t\t \t\t\t\t\t \t \t\t \t\t\t \t\t", "p,q,r=map(int,input().split())\r\na=(p*q//r)**0.5\r\nb=(q*r//p)**0.5\r\nc=(r*p//q)**0.5\r\nprint(4*int(a+b+c))", "xy, yz, zx = map(int, input().split())\r\nx = ((xy*zx)//(yz))**0.5\r\ny = ((yz*xy)//(zx))**0.5\r\nz = ((yz*zx)//(xy))**0.5\r\nans = (4*x) + (4*y) + (4*z)\r\nprint(int(ans))", "s1,s2,s3 = map(int, input().split())\r\n#side of s1 and side of s2 == s3\r\n#height of s1 and s2 are the same\r\nfor i in range(1,min(s1,s2) + 1):\r\n otherS1 = s1/i\r\n otherS2 = s2/i\r\n if(otherS1 * otherS2 == s3):\r\n #matchFound\r\n print(int(4 * (i + otherS1 + otherS2)))", "s1,s2,s3=[int(x) for x in input().split()]\r\nlength=0.0\r\nbreadth=0.0\r\nheight=0.0\r\n\r\nlength=((s1*s3)/s2)**.5\r\nbreadth=((s1*s2)/s3)**.5\r\nheight=((s2*s3)/s1)**.5\r\nprint(int(4*(length+breadth+height)))\r\n", "a,b,c = map(int,input().split())\r\n\r\nx = ((a*b) // c)**0.5\r\ny = a //x\r\nz = b //x\r\n\r\nprint(int((x+y+z) * 4))\r\n", "x,y,z = map(int,input().split())\r\nfrom math import sqrt\r\na = sqrt(x*y*z)\r\nprint(int(4*((a//x)+(a//y)+(a//z))))", "import math\r\nareas = list(map(int,input().split(' ')))\r\nans = 0\r\nmult = areas[0] * areas[1] * areas[2]\r\ns_mult = math.isqrt(mult)\r\nsume_areas = (areas[0]*areas[1])+(areas[1]*areas[2])+(areas[0]*areas[2])\r\nc = sume_areas // s_mult\r\nprint(4*c)", "import math\r\na , b , c = map(int , input().split())\r\nprint(int(math.sqrt(a*b/c) + math.sqrt(a*c/b) + math.sqrt(b*c/a))*4)", "\r\nimport math\r\na,b,c=map(int,input().split())\r\ntemp=int(math.sqrt(a*b*c))\r\narea=(a*b)//temp+(b*c)//temp + (a*c)//temp\r\nprint(4*area)", "import math\r\na,b,c = map(int, input().split())\r\nside1 = math.sqrt(a*b*c)/a\r\nside2 = math.sqrt(a*b*c)/b\r\nside3 =math.sqrt(a*b*c)/c\r\nprint('{:.0f}'.format((side1+side3+side2)*4))", "s1,s2,s3=map(int,input().split())\n\na=(int)((s1*s3)//s2)**0.5\nb=(int)((s1*s2)//s3)**0.5\nc=(int)((s2*s3)//s1)**0.5\nprint(int(4*(a+b+c)))\n", "x,y,z=map(int,input().split())\r\na2=(x*z)/y\r\nb2=(x*y)/z\r\nc2=(y*z)/x\r\na_b_c_2=a2+b2+c2+2*(x+y+z)\r\na_b_c=a_b_c_2**(0.5)\r\nprint(int(4*a_b_c))", "a, b, c = list(map(int, input().split()))\r\nl = ( a*b ) / c\r\nimport math\r\nl = math.sqrt(l)\r\nw = b / l\r\nh = c / w\r\nans = 4 * (l + w + h)\r\nprint(int(ans))", "X = list(map(int, input().split()))\r\nz = ((X[1] * X[2]) / X[0]) ** .5\r\nx = X[2] / z\r\ny = X[1] / z\r\nprint(int(sum([x * 4, y * 4, z * 4])))\r\n\r\n# UB_CodeForces\r\n# Advice: “Get busy living or get busy dying.”\r\n# Location: Behind my desk\r\n# Caption: On the right way\r\n# CodeNumber: 544\r\n", "a,b,c = map(float,input().split())\r\nd = ((a*b*c)**0.5) * (1/a + 1/b + 1/c) * 4\r\nprint(\"%.0f\" % d)", "a1,a2,a3=map(int,input().split(\" \"))\r\nb=int(pow(((a1*a3)/a2),0.5))\r\nl=a3//b\r\nh=a2//l\r\nsum=(4*l)+(4*h)+(4*b)\r\nprint(sum)", "import math\n\ndef findEdges(s1, s2, s3):\n\ta = math.sqrt(s1 * s2 / s3)\n\tb = math.sqrt(s3 * s1 / s2)\n\tc = math.sqrt(s3 * s2 / s1)\n\tsum = a + b + c\n\treturn 4 * sum\n\nif __name__=='__main__':\n\ts1s2s3 = input().split()\n\ts1 = int(s1s2s3[0])\n\ts2 = int(s1s2s3[1])\n\ts3 = int(s1s2s3[2])\n\tprint(int(findEdges(s1, s2, s3)))\n\n\n\n\n\n\n\n\n\n\n\n\n", "def solve(ab, bc, ac):\n\tfor a in range(1, limit):\n\t\tfor b in range(1, limit):\n\t\t\tif a*b == ab and bc//b == ac//a:\n\t\t\t\treturn 4*(a+b+(bc//b))\n\treturn -1\n\nlimit = int(1e4)+1\nab, bc, ac = map(int, input().strip().split())\nprint(solve(ab, bc, ac))\n", "#224A\r\nfrom math import sqrt\r\n[x,y,z] = list(map(int,input().split()))\r\na = sqrt(x*y//z)\r\nb = sqrt(y*z//x)\r\nc = sqrt(x*z//y)\r\nprint(4*int(a +b +c))", "from math import sqrt\r\na,b,c=map(int,input().split())\r\nprint(int(4*((a*b+b*c+c*a)/sqrt(a*b*c))))", "def main():\n\timport math\n\t#x= A x B\ty= B x C \tz= C x A\n\tx,y,z= [int(i) for i in input().split()]\n\tp=x*y*z\n\tprint(round(4*(math.sqrt(p//(x*x))+ math.sqrt(p//(y*y))+ math.sqrt(p//(z*z)))))\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "[s1,s2,s3] = list(map(int,input().split()))\r\n\r\nimport math\r\n\r\nval = (s3*s2)/s1\r\n\r\nb = math.pow(val,0.5)\r\nc = s3/b\r\na = s2/b\r\n\r\nans = 4*a + 4*b + 4*c\r\n\r\nprint(int(ans))", "import math\r\n\r\na,b,c = map(int, input().split())\r\n\r\nd = math.sqrt((a*b)/c)\r\nl = a/d\r\nh = c/l\r\n\r\nprint(int((l+h+d)*4))", "m, l, n = map(int, input().split())\r\ng = int((m*l*n)**0.5)\r\na = g//m; b=g//l; c=g//n\r\nprint(4*(a+b+c))", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\n\r\n#a, b = (map(int, input().split()))\r\n\r\n#t = int(input())\r\n\r\n#for i in range(0, t):\r\n\r\ns1, s2, s3 = (map(int, input().split()))\r\na = pow(s1*s2//s3,0.5)\r\nprint(int(4*(a + s1//a + s2//a)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a1, a2, a3 = map(int, input().split())\r\nimport math\r\nx = math.sqrt(a1 * a3 / a2)\r\ny = a1/x\r\nz = a3/x\r\n\r\nprint(int(4*(x + y + z)))", "from math import sqrt\r\n\r\nx,y,z = map(int,input().split())\r\n\r\na =sqrt(x*y*z)\r\nprint(int(4*(a/x+a/y+a/z)))", "from cmath import pi\n\n\na1, a2, a3 = map(int, input().split())\n\na = a1*a2*a3\na = int(a**0.5)\n\nl1 = a//(a1)\nl2 = a//(a2)\nl3 = a//(a3)\n\nprint(4*(l1+l2+l3))\n\t \t \t \t\t \t \t\t \t\t\t\t\t \t\t\t \t\t", "import math\r\ns1,s2,s3 = [*map(int,input().split())]\r\na = math.sqrt(s1 * s2 / s3)\r\nb = math.sqrt(s3*s1/s2)\r\nc = math.sqrt(s2*s3/s1)\r\nprint(int((a+b+c)*4))", "\r\na1, a2, a3 = map(int, input().split())\r\nz = ((a2*a3 // a1)**0.5)\r\nx = a3 // z\r\ny = a1 // x\r\nprint(int(4*(x+y+z)))", "from math import sqrt, ceil\r\n\r\narea = [int(x) for x in input().split()]\r\n\r\nside = []\r\nfor i in range(1, ceil(sqrt(area[0])) + 1):\r\n if area[0]% i == 0:\r\n j = area[0]/i\r\n if (area[1]%i == 0 and area[2]%j == 0):\r\n if len(set([i, j, area[1]/i, area[2]/j])) <= 3:\r\n side = [i, j, area[1]/i]\r\n\r\n if (area[1]%j == 0 and area[2]%i == 0):\r\n if len(set([i, j, area[1]/j, area[2]/i])) <= 3:\r\n side = [i, j, area[1]/j]\r\n\r\nprint(int(4*sum(side)))\r\n", "import math\r\n\r\na, a2, a3 = map(int, input().split())\r\n\r\nx = math.sqrt((a * a2) / a3)\r\ny = math.sqrt((a * a3) / a2)\r\nz = math.sqrt((a2 * a3) / a)\r\n\r\nsum_of_edges = 4 * (x + y + z)\r\nprint(int(sum_of_edges))\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\na, b, c = mi()\r\nq = math.sqrt(a*b/c)\r\nw = math.sqrt(b*c/a)\r\ne = math.sqrt(a*c/b)\r\nprint(int(4*(q+w+e)))\r\n\r\n", "import math\r\na,b,c=map(int,input().split())\r\nb1=int(math.sqrt((a*b)/c))\r\na1=int(math.sqrt((a*c)/b))\r\nc1=int(math.sqrt((b*c)/a))\r\nprint(4*(a1+b1+c1))", "import math\r\na1,a2,a3=map(int,input().split()) #a1,a2,a3=ab,bc,ca. find (a+b+c)*4\r\na=math.ceil(math.sqrt(a1*a3//a2))\r\nb=a1//a\r\nc=a2//b\r\ns=(a+b+c)*4\r\nprint(s)\r\n", "from math import sqrt\n\na, b, c = map(int, input().split())\n\ns1 = sqrt((a * c) / b)\ns2 = sqrt((a * b) / c)\ns3 = sqrt((b * c) / a)\n\narea = s1 + s2 + s3\nsums = int(4 * area)\nprint(sums)\n", "import math\r\n\r\nsList = input().split()\r\na = math.sqrt((int(sList[0]) * int(sList[1]) / int(sList[2])))\r\nb = math.sqrt((int(sList[0]) * int(sList[2]) / int(sList[1])))\r\nc = math.sqrt((int(sList[1]) * int(sList[2]) / int(sList[0])))\r\n\r\nprint(int((a + b + c) * 4))\r\n", "from math import sqrt \r\na, b, c = map(int, input().split())\r\nx = a *b / c\r\ny = c * b / a\r\nz = c * a / b\r\n \r\nval = sqrt(x) + sqrt(y) + sqrt(z)\r\nprint(int(val*4))", "s1, s2, s3 = map(int, input().split())\r\n\r\na = 4 * (s1 * s2 // s3) ** 0.5\r\nb = 4 * (s1 * s3 // s2) ** 0.5\r\nc = 4 * (s2 * s3 // s1) ** 0.5\r\n\r\nprint(int(a + b + c))\r\n", "import math\na, b, c = map(int, input().split())\nprint(int(4 * (math.sqrt(a * b * c) / a + math.sqrt(a * b * c) / b + math.sqrt(a * b * c) / c)))", "import math\r\n\r\n(x,y,z) = map(int, input().split())\r\n\r\na = math.isqrt((x * y) // z)\r\nb = math.isqrt((x * z) // y)\r\nc = math.isqrt((y * z) // x)\r\n\r\nval = (a + b + c) * 4\r\n\r\nprint(val)", "ab,bc,ca=[int(x) for x in input().split()]\r\na=((ab*ca)/bc)**0.5\r\nb=((ab*bc)/ca)**0.5\r\nc=((bc*ca)/ab)**0.5\r\nprint(int(4*(a+b+c)))", "A,B,C = sorted((int(x) for x in input().split()))\r\nk = max(A,B,C)\r\n\r\nfor a in range(1,k+1):\r\n if A%a == 0 and C%a == 0:\r\n if A*C == B * a * a:\r\n print( 4*sum((a,A//a,C//a)) ) \r\n break\r\n ", "s1, s2, s3 = map(int, input().split())\r\na = int(((s1 * s3) / s2) ** 0.5)\r\nb = int(((s1 * s2) / s3) ** 0.5)\r\nc = int(((s2 * s3) / s1) ** 0.5)\r\nprint(4 * (a+b+c))\r\n", "a,b,c = map(int,input().split())\r\nk = (a*b*c)**0.5\r\n\r\nprint(4 * int(k/a + k/b + k/c))\r\n", "area = list(map(int,input().split()))\r\ns1 = int(((area[0]*area[1]/area[2])**(1/2)))\r\ns2 = int(((area[1]*area[2]/area[0])**(1/2)))\r\ns3 = int(((area[2]*area[0]/area[1])**(1/2)))\r\n\r\nprint(4*(s1+s2+s3))", "x,y,z=map(int,input().split())\r\nimport math\r\na=math.sqrt(z*y/x)\r\nb=math.sqrt(z*x/y)\r\nc=math.sqrt(x*y/z)\r\nsum=int(a+b+c)\r\nprint(4*sum)\r\n", "a,b,c=map(int,input().split())\r\nl=[]\r\ni=1\r\nwhile i<=max(a,b) :\r\n if a%i==0 and b%i==0:\r\n if (a//i)*(b//i)==c :\r\n print(4*(a//i)+4*(b//i)+4*i)\r\n i+=1", "import math\r\na,b,c=map(int,input().split())\r\nprint(int(4*(math.sqrt(a*b/c)+math.sqrt(b*c/a)+math.sqrt(a*c/b))))", "import math\r\na,b,c = map(int,input().split())\r\nL = math.sqrt((a*b)/c)\r\nB = math.sqrt((b*c)/a)\r\nH = math.sqrt((a*c)/b)\r\nprint(int(4*(L+B+H)))", "import math\r\ns=input('')\r\na,b,c=s.split(' ')\r\nx1=int(a)\r\nx2=int(b)\r\nx3=int(c)\r\na=math.sqrt((x1*x3)/x2)\r\nb=math.sqrt((x1*x2)/x3)\r\nc=math.sqrt((x2*x3)/x1)\r\nprint(int(4*a+4*b+4*c))\r\n", "list1=input().split(\" \")\r\nlist1=[int(a) for a in list1]\r\nx=((list1[0]*list1[1])/list1[2])**0.5\r\ny=((list1[1]*list1[2])/list1[0])**0.5\r\nz=((list1[2]*list1[0])/list1[1])**0.5\r\nprint(int(4*(x+y+z)))\r\n", "import math\r\nab,bc,ac = [int(x) for x in input().split()]\r\n \r\na = math.sqrt((ab*ac)/bc)\r\nb = math.sqrt((ab*bc)/ac)\r\nc = math.sqrt((bc*ac)/ab)\r\nprint(int(4*(a+b+c)))", "from math import sqrt\r\n\r\nA, B, C = map(int, input().split())\r\n\r\nx = int(sqrt(A * C / B))\r\ny = int(sqrt(A * B / C))\r\nz = int(sqrt(B * C / A))\r\n\r\nsum_edges = 4 * (x + y + z)\r\n\r\nprint(sum_edges)\r\n", "import math\r\n\r\nab,bc,ca = map(int,input().split())\r\na = math.sqrt((ab/bc)*ca)\r\nb = (ab/a)\r\nc = (ca/a)\r\nprint(int(4*(a+b+c)))", "import math\r\ndata = input().split()\r\n\r\nA1, A2, A3 = int(data[0]), int(data[1]), int(data[2])\r\n\r\n'''\r\n ## A1 = LW ===>>> so, L = A1/W\r\n ## A2 = LH ===>>> so, A2 = (A1/W)*H ==> A2 = (A1/(A3/H))*H\r\n ## A2 = (A1/A3) * H^2 ==> H^2 = (A2 * A3) / A1\r\n ## A3 = WH ===>>> so, W = A3/H\r\n'''\r\nH = int(math.sqrt((A2 * A3) // A1))\r\nW = A3 // H\r\nL = A1 // W\r\n\r\n## For rectangular parallelepiped cosists of 4 edges equal to L and\r\n## 4 equal to W and 4 equal to H\r\nprint(4*L + 4*W + 4*H)", "import math\n\ndef main():\n inp = list(map(int, input().split()))\n A1 = inp[0]\n A2 = inp[1]\n A3 = inp[2]\n x = math.sqrt(A1 * A3 / A2)\n y = A1 / x\n z = A3 / x \n print(int(4 * (x + y + z)))\n\nmain()\n \t \t \t \t \t\t \t \t\t \t \t\t\t\t", "import math\r\n\r\nin_faces = input().split()\r\nfaces = list(int(face) for face in in_faces)\r\n\r\na = math.sqrt((faces[0] * faces[1]) / faces[2])\r\nb = math.sqrt((faces[1] * faces[2]) / faces[0])\r\nc = math.sqrt((faces[0] * faces[2]) / faces[1])\r\n\r\nfaces_sum = a + b + c\r\n\r\nprint(int(faces_sum * 4))\r\n", "import math\r\na1,a2,a3=[int(i) for i in input().split()]\r\na=math.sqrt(a1*a3/a2)\r\nb=math.sqrt(a1*a2/a3)\r\nc=math.sqrt(a2*a3/a1)\r\nprint(int(4*(a+b+c)))\r\n", "a,b,c = [int(i) for i in input().split()]\r\ns1 = (a*c//b)**(1/2)\r\ns2 = (a*b//c)**(1/2)\r\ns3 = (b*c//a)**(1/2)\r\nprint(int(4*(s1+s2+s3)))\r\n \r\n", "a = [int(x) for x in input().split()]\r\n\r\nimport math\r\nval = math.sqrt(a[0]*a[1]*a[2])\r\n\r\nans = 4*((val/a[0]) + (val/a[1]) + (val/a[2]))\r\n\r\nprint(int(ans))", "#the areas are s1,s2 and s3\r\n#a ,b and c be lemgth of sides that have common vertex\r\nimport math\r\ns1,s2,s3=map(int,input().split())\r\na=math.sqrt((s1*s3)/s2)\r\n#print(a)\r\nb=math.sqrt((s1*s2)/s3)\r\n#print(b)\r\nc=math.sqrt((s2*s3)/s1)\r\n#print(c)\r\nprint(\"%d\"%(4*(a+b+c)))", "from math import sqrt\r\n\r\ndef parallelepiped(x,y,z):\r\n a = sqrt((x*y)//z)\r\n b = sqrt((y*z)//x)\r\n c = sqrt((z*x)//y)\r\n ans = int((a+b+c)*4)\r\n \r\n return ans\r\n\r\n\r\nif __name__ == \"__main__\":\r\n x,y,z = [int(i) for i in input().split()]\r\n \r\n ans = parallelepiped(x,y,z)\r\n print(ans)\r\n", "import math\r\n(a, b, c) = map(int, input().split())\r\nx = math.sqrt(a*c/b)\r\ny = math.sqrt(a*b/c)\r\nz = math.sqrt(b*c/a)\r\nresult = 4*(x+y+z)\r\nprint(int(result))", "x, y, z = map(int, input().split())\r\nb = ((y*x)/z)**0.5\r\na = x//b\r\nc = z // a\r\nprint(int(a*4+ b*4+c*4))\r\n\r\n", "a,b,c=map(int,input().split())\nk=(a*b*c)**0.5\nprint(4*int(k/a+k/b+k/c))\n\n \t \t\t\t \t \t \t \t \t\t", "import math\r\nab,bc,ca = map(int, input().split())\r\nc = math.sqrt((ab*bc*ca)/(ab*ab))\r\nb = math.sqrt((ab*bc*ca)/(ca*ca))\r\na = math.sqrt((ab*bc*ca)/(bc*bc))\r\nprint(int((a+b+c)*4))", "import sys\nimport math\ninput = sys.stdin.readline\n\nA, B, C = map(int, input().split())\na = (A*C/B)**0.5\nb = (A*B/C)**0.5\nc = (B*C/A)**0.5\nprint(int((a+b+c)*4))\n", "import math as m\r\na, b, c = map(int,input().split())\r\nans = m.sqrt((a*b)//c) + m.sqrt((b*c)//a) + m.sqrt((a*c)//b) \r\nprint(int(4*ans)) ", "a,b,c=map(int,input().split())\r\n\r\n\r\nv=int((a*b*c)**(1/2))\r\n# print(v)\r\n\r\n\r\nans=(v/a+v/b+v/c)*4\r\nprint(int(ans))", "import math\r\nareas = input().split(' ')\r\nx = int(areas[0])\r\ny= int (areas[1])\r\nz= int (areas[2])\r\nw = math.sqrt((z*y)/x)\r\nl = (x/y)*w\r\nh=(x/z)*w\r\nedges_sum= 4*l + 4*w + 4*h\r\nprint(int(edges_sum))", "a,b,c = map(int,input().split())\r\nfrom math import ceil, sqrt \r\ns = sqrt(a*b/c)\r\nt = sqrt(a*c/b)\r\nr = sqrt(b*c/a)\r\nprint(ceil(4*(s+t+r)))", "import math\r\nx,y,z = map(int, input().split())\r\na=math.sqrt((x*y)//z)\r\nb=math.sqrt((x*z)//y)\r\nc=math.sqrt((y*z)//x)\r\nans=(a+b+c)*4\r\nprint(int(ans))", "a,b,c=map(int,input().split())\r\nv=(a*b*c)**0.5 #l*b*h\r\nprint(int(4*(v/a+v/b+v/c)))\r\n", "import math\r\ns1,s2,s3=[int(x) for x in input().split()]\r\na=math.sqrt((s1*s3)/s2)\r\nb=math.sqrt((s1*s2)/s3)\r\nc=math.sqrt((s2*s3)/s1)\r\nd=4*(a+b+c)\r\nprint(int(d))", "a, b, c = map(int, input().split())\r\n\r\ndef get_perimeter(a, b, c):\r\n for i in range(1, a+1):\r\n if a % i == 0 and b % i == 0 and (a/i) * (b/i) == c:\r\n return 4*(i + b//i + c//(b//i))\r\n return -1\r\nprint(get_perimeter(a, b, c))", "import math\r\nimport sys\r\n\r\ndef main():\r\n s1,s2,s3 = map(int,input().split())\r\n for a in range(1, max(s1,s2,s3) + 1):\r\n if s3 % a == 0 and (s1 % (s3//a) == 0) and (a*(s1//(s3//a)) == s2):\r\n c = s1//(s3//a)\r\n b = s3//a\r\n return (c * 4) + (4 * a) + (4 * b)\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main())", "import math as mi\r\n\r\nx,y,z = map(int,input().split())\r\n\r\na = mi.sqrt(x*y//z)\r\nb = mi.sqrt(x*z//y)\r\nc = mi.sqrt(y*z//x)\r\n\r\n\r\nprint(int(4*(a+b+c)))", "from math import sqrt\r\nn=input().split()\r\ns1=int(n[0])#a*b\r\ns2=int(n[1])#a*c\r\ns3=int(n[2])#b*c\r\na=int(sqrt((s1*s2)/s3))\r\nb=int(sqrt((s1*s3)/s2))\r\nc=int(sqrt((s2*s3)/s1))\r\nprint(a*4+b*4+c*4)\r\n", "import math\r\na=input().split()\r\nb=[int(i) for i in a]\r\nk=math.floor(math.sqrt((b[1]*b[-1])//b[0]))\r\nl=b[-1]//k\r\nm=b[0]//l\r\nprint(4*(k+l+m))\r\n\r\n", "a,b,c=map(int,input().split())\r\ns=int((a*b*c)**.5)\r\na=s//a;b=s//b;c=s//c\r\nprint(4*(a+b+c))", "s1,s2,s3 = map(int, input().split())\n\nimport math\na = math.sqrt(s1 * s2 / s3)\nb = math.sqrt(s3 * s1 / s2)\nc = math.sqrt(s3 * s2 / s1)\nsum = int(a + b + c)\nprint(4*sum)\n \t \t \t \t \t \t \t \t\t", "# LUOGU_RID: 101471795\na, b, c = map(int, input().split())\r\nt = int((a * b * c)**.5)\r\nprint(4 * (t // a + t // b + t // c))", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\n\r\nprint(int(((a*b/c + a*c/b + b*c/a + 2*(a+b+c))**0.5)*4))", "from math import sqrt\na,b,c=[int(x) for x in input().split(' ')]\nl=int(sqrt( (a*c)//b ))\nw=a//l\nh=c//l\nprint(4*(l+w+h))", "import math\r\n\r\ndef findEdges(s1, s2, s3):\r\n\ta = math.sqrt(s1 * s2 / s3)\r\n\tb = math.sqrt(s3 * s1 / s2)\r\n\tc = math.sqrt(s3 * s2 / s1)\r\n\tsum = a + b + c\r\n\treturn 4 * sum\r\n\r\nif __name__=='__main__':\r\n\ts1s2s3 = input().split()\r\n\ts1 = int(s1s2s3[0])\r\n\ts2 = int(s1s2s3[1])\r\n\ts3 = int(s1s2s3[2])\r\n\tprint(int(findEdges(s1, s2, s3)))\r\n\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 math\na,b,c = list(map(int,input().split()))\n\ns = math.sqrt( b*c/a )\ns += math.sqrt( a*b/c )\ns += math.sqrt( a*c/b )\nprint(int(s)*4)", "a1, a2, a3 = list(map(int, input().split()))\nb = ((a1*a2)/a3)**0.5\nl = (a3/a2)*b\nh = a2/b\nprint(4*int(l+b+h))\n", "def common(a,b,c):\r\n return ((a*b/c)**(1/2))\r\n \r\nx,y,z=input().split()\r\nx=int(x)\r\ny=int(y)\r\nz=int(z)\r\nl=common(x,y,z)\r\nb=common(y,z,x)\r\nh=common(x,z,y)\r\nprint (int(4*(l+b+h)))", "a1, a2, a3 = map(int, input().split())\r\n\r\nfor i in range(1, a1+1):\r\n\t\r\n\tj = a1/i\r\n\r\n\tif(i * j != a1):\r\n\t\tcontinue\r\n\r\n\tk = a2 / i\r\n\r\n\tif(i * k != a2):\r\n\t\tcontinue\r\n\r\n\tif(j * k != a3):\r\n\t\tcontinue\r\n\r\n\tprint(int(4*(i+j+k)))\r\n\tbreak", "import math\n\n(x, y, z) = [int(i) for i in input().split()]\n\nperi = 4* (math.sqrt(x*y/z) + math.sqrt(x*z/y) + math.sqrt(z*y/x))\n\nprint(int(peri))\n\t\t\t\t \t \t \t\t\t \t\t\t \t\t \t\t \t\t\t \t\t", "import math\r\na, b, c = map(int, input().split())\r\nl1 = math.sqrt((a/b)*c)\r\nl2 = c//l1\r\nl3 = b//l2\r\nprint(int(l1+l2+l3)*4)", "a, b, c = [int(x) for x in input().split()]\r\nz = ((b*c)/a)**0.5\r\ny = b/z\r\nx = a/y\r\n\r\n\r\nprint(int(z*4 + x*4 + y*4))", "import math \r\ns1, s2, s3, = input().split()\r\ns1 = int(s1)\r\ns2 = int(s2)\r\ns3 = int(s3)\r\na = math.sqrt(s1 * s2 / s3) \r\nb = math.sqrt(s3 * s1 / s2) \r\nc = math.sqrt(s3 * s2 / s1) \r\n\r\nsum = a + b + c \r\nsolve = 4 * sum\r\nprint(int(solve))\r\n", "a,b,c=map(int,input().split())\r\nk=(a*b*c)**0.5\r\nprint(4*int(k/a+k/b+k/c))\r\n", "import sys\r\nimport math\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().strip().split())\r\na, b, c = map(round, map(math.sqrt, (a * b / c, a * c / b, b * c / a)))\r\nprint(4 * (a + b + c))", "'''input\r\n3 3\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom copy import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom array import array\r\nINF = 2147483647\r\nINF64 = 9223372036854775807\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n \r\ndef solve():\r\n\ta,b,c = getints()\r\n\tx,y,z = map(round, [sqrt(a*b*c)/c, sqrt(a*b*c)/b, sqrt(a*b*c)/a])\r\n\tprint(4*(x+y+z))\r\n \r\nif __name__==\"__main__\":\r\n\tt = 1\r\n\tfor i in range(t):\r\n\t\tsolve()", "a,b,c=map(int,input().split())\r\nprint(4*int((a*b+b*c+c*a)//(a*b*c)**0.5))", "A=list(map(int,input().split()))\r\na=(((A[0]/A[1])*A[2])**0.5)\r\nb=(((A[1]/A[2])*A[0])**0.5)\r\nc=(((A[2]/A[0])*A[1])**0.5)\r\nprint(int(4*(a+b+c)))", "a, b, c = [int(x) for x in input().split()]\r\nprint(int(4*((a*b/c)**0.5+(a*c/b)**0.5+(b*c/a)**0.5)))", "a1,a2,a3=map(int,input().split())\r\nx=a2/a3\r\nl=[]\r\nfor i in range(1,a1+1):\r\n if a1%i==0:\r\n l.append(i)\r\n \r\nfor i in range(len(l)):\r\n for j in l:\r\n if j/l[i]==x and j*l[i]==a1:\r\n length=l[i]\r\n breadth=j\r\n \r\nheight=a3/length\r\nprint(int(4*(length+breadth+height))) ", "import math\n\na, b, c = [int(i) for i in input().split()]\n\nd = math.sqrt(a * b // c)\ne = math.sqrt(b * c // a)\nf = math.sqrt(a * c // b)\n\nans = d*4 + e*4 + f*4\nintans = int(ans)\nprint(intans)\n\t\t \t\t\t\t\t\t\t\t \t\t \t \t\t\t\t \t \t\t", "x,y,z=map(int,input().split())\r\na=int(pow(x*z//y,1/2))\r\nb=x//a\r\nc=z//a\r\nprint(4*(a+b+c))", "import math\r\na, b,c = map(int, input().split())\r\nans1=math.sqrt((a*c)/b)\r\nans2=a/ans1\r\nans3=b/ans2\r\nanswer=4*(ans1+ans2+ans3)\r\nif(math.ceil(answer)==math.floor(answer)):\r\n print(int(answer))\r\nelse:\r\n print(answer)", "from math import sqrt\n\na, b, c = map(int, input().split())\nx = sqrt(a * b / c)\ny = sqrt(b * c / a)\nz = sqrt(c * a / b)\nprint(round(4 * (x + y + z)))\n", "import math\r\nf1, f2, f3 = map(int, input(). strip(). split())\r\ncute = f1*f2*f3\r\nc = math.sqrt(cute)/f1\r\nb = math.sqrt(cute)/f3\r\na = math.sqrt(cute)/f2\r\nprint((int(a)+int(b)+int(c))*4)", "a, b, c = list(map(int, input().split()))\n\nimport math\n\nx = math.sqrt(1.0 * a * b / c)\ny = math.sqrt(1.0 * a * c / b)\nz = math.sqrt(1.0 * c * b / a)\n\n# print(x, y, z)\n\nprint(int(4 * (x + y + z)))\n\t\t\t \t\t\t\t\t\t\t \t\t \t \t \t\t \t", "l = list(map(int,input().split()))\r\n\r\na = (l[0]*l[2]/l[1])**0.5\r\nb = (l[0]*l[1]/l[2])**0.5\r\nc = (l[1]*l[2]/l[0])**0.5\r\n\r\n\r\nprint(int(4*(a+b+c)))\r\n", "s1, s2, s3 = map(int, input().split())\r\n\r\na = ((s1 * s3) / s2) ** 0.5\r\nb = ((s1 * s2) / s3) ** 0.5\r\nc = ((s2 * s3) / s1) ** 0.5\r\n\r\nprint(int(4*(a + b + c)))\r\n", "from math import sqrt\n\na, b, c = map(int, input().split())\n\nl1 = sqrt(a * b // c)\nl2 = sqrt(b * c // a)\nl3 = sqrt(a * c // b)\n\nprint(int(4 * (l1 + l2 + l3)))", "import math\n\nl, b, h=map(int, input().split())\ns1=math.sqrt(l*h//b)\ns2=math.sqrt(l*b//h)\ns3=math.sqrt(b*h//l)\nprint(int(4*(s1+s2+s3)))", "import math\r\na, b, c = map(int, input().split())\r\n\r\nx, y, z = math.sqrt((a*c)/b), math.sqrt((a*b)/c), math.sqrt((b*c)/a)\r\nprint(int(4*(x + y + z)))", "import math\r\n\r\ndef solve(x, y, z):\r\n a = int(math.sqrt(x * y // z))\r\n b = int(math.sqrt(y * z // x))\r\n c = int(math.sqrt(x * z // y))\r\n return 4 * (a + b + c)\r\n\r\ndef main():\r\n l = list(map(int, input().strip().split()))\r\n print(solve(l[0], l[1], l[2]))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s1,s2,s3=list(map(int,input().split()))\r\na=(s1*s3/s2)**0.5\r\nb=(s1*s2/s3)**0.5\r\nc=(s2*s3/s1)**0.5\r\nprint(int(4*(a+b+c)))", "import math\r\ndef findEdges(s1, s2, s3):\r\n\ta = math.sqrt(s1 * s2 / s3)\r\n\tb = math.sqrt(s3 * s1 / s2)\r\n\tc = math.sqrt(s3 * s2 / s1)\r\n\tsum = a + b + c\r\n\tprint(int(4 * sum)) \r\n\r\nl=list(map(int,input().split(\" \")))\r\nfindEdges(l[0],l[1],l[2])\r\n", "import math\r\na,b,c = map(int , input().split())\r\nans = math.sqrt(a*b//c) + math.sqrt(a*c//b) + math.sqrt(c*b//a)\r\nprint(4 * int(ans))", "k1,k2,k3=(map(int,input().split()))\r\nl =((k1*k2)/k3)**0.5\r\nb = ((k2*k3)/k1)**0.5\r\nh = ((k3*k1)/k2)**0.5\r\nprint(int(4*(l+b+h)))\r\n\r\n", "x,y,z = map(int,input().split())\r\n\r\nt1 = (x*z)/y\r\nt2 = (x*y)/z\r\nt3 = (z*y)/x\r\n\r\nt4 = t1**0.5\r\nt5 = t2**0.5\r\nt6 = t3**0.5\r\n\r\nprint(int(4*(t4 + t5+ t6)))", "import math\r\nA1,A2,A3=[int(i) for i in input().split()]\r\na=math.sqrt((A2*A1)/A3)\r\nb=math.sqrt((A2*A3)/A1)\r\nc=math.sqrt((A1*A3)/A2)\r\nprint(int(4*(a+b+c)))", "from math import sqrt\nx,y,z = map(int,input().split())\na = int(sqrt(x*z/y))\nb = int(x/a)\nc = int(z/a)\nres = int(4*(a+b+c))\nprint(res)", "from math import sqrt\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nab,bc,ca=map(int,input().split())\r\na=sqrt((ab*ca)//bc)\r\nb=sqrt((ab*bc)//ca)\r\nc=sqrt((bc*ca)//ab)\r\nprint(int(4*(a+b+c)))", "import math\n\ndef findEdges(s1, s2, s3):\n\n\t# to calculate the length of one edge\n\ta = math.sqrt(s1 * s2 // s3)\n\tb = math.sqrt(s3 * s1 // s2)\n\tc = math.sqrt(s3 * s2 // s1)\n\tsum=a+b+c\n\treturn 4 * sum\n\nlis=list(map(int,input().split()))\ns1=lis[0]\ns2=lis[1]\ns3=lis[2]\nk=findEdges(s1,s2,s3)\nprint(int(k))\n\n\n", "a,b,c=map(int,input().split())\nv=(a*b*c)**0.5\nprint(int(4*(v/a+v/b+v/c)))", "a, b, c = map(int, input().split())\r\n\r\nif a == b == c:\r\n print(int(12*(a**(1/2))))\r\nelse:\r\n e1 = ((a*b) // c)**(1/2)\r\n e2 = ((b*c) // a)**(1/2)\r\n e3 = ((a*c) // b)**(1/2)\r\n\r\n print(int(4 * (e1 + e2 + e3)))", "import math\r\ns1,s2,s3 = map(int,input().split())\r\n\r\n\r\na = math.sqrt(s1*s3//s2)\r\nb = math.sqrt(s1*s2//s3)\r\nc = math.sqrt(s2*s3//s1)\r\n\r\nprint(int(a+b+c)*4)\r\n\r\n", "from math import sqrt\r\na = [int(x) for x in input().split()] \r\n\r\nl = sqrt((a[0]/a[1])*a[2])\r\nb = sqrt((a[1]/a[2])*a[0])\r\nh = sqrt((a[2]/a[0])*a[1])\r\n\r\nprint(int(4*(l+b+h)))", "import math\r\ns = input().split(\" \")\r\ns1 = int(s[0])\r\ns2 = int(s[1])\r\ns3 = int(s[2])\r\na = math.sqrt(s1 * s2 / s3) \r\nb = math.sqrt(s3 * s1 / s2) \r\nc = math.sqrt(s3 * s2 / s1) \r\nsumm = a + b + c \r\nprint(int(4 * summ))", "from math import sqrt\narea1, area2, area3 = [int(s) for s in input().split()]\nprint(int(4*sqrt((area1*area3)/area2)+4*sqrt((area1*area2)/area3)+4*sqrt((area2*area3)/area1)))\n\n \n \t \t \t\t\t \t\t \t\t \t\t", "import math\r\nf1,f2,f3=map(int,input().split())\r\nv=int(math.sqrt(f1*f2*f3))\r\nans=4*(v//f1+v//f2+v//f3)\r\nprint(ans)", "import math\r\ns1, s2, s3 = map(int, input().split())\r\na = math.sqrt(s1 * s2 / s3)\r\nb = math.sqrt(s3 * s1 / s2)\r\nc = math.sqrt(s3 * s2 / s1)\r\nsum = 4 * (a + b + c)\r\nprint (int(sum))\r\n", "import math\r\n\r\nv1, v2, v3 = map(int, input().split())\r\n\r\nprint(int(4*(math.sqrt(v1*v2 / v3) + math.sqrt(v2*v3 / v1) + math.sqrt(v1*v3 / v2))))", "import math\n\ndef getSide(firstArea, secondArea, thirdArea):\n return int(math.sqrt((firstArea*secondArea)//thirdArea))\n\na1, a2, a3 = [int(k) for k in input().split()]\na = getSide(a1, a3, a2)\nb = getSide(a1, a2, a3)\nc = getSide(a2, a3, a1)\n\nprint(4*(a + b + c))\n \t\t \t\t \t \t\t \t\t \t\t \t\t\t \t\t\t \t", "import math\n\na = list(map(int,list(input().split())))\nsuma = math.sqrt(a[0]/a[1] * a[2]) + math.sqrt(a[1]/a[2] * a[0]) + math.sqrt(a[2]/a[0] * a[1])\nsuma = 4*suma\n\nprint(int(suma))\n\t \t \t\t\t \t\t\t\t \t \t\t\t\t\t \t\t \t\t\t\t\t", "# Problem Link: https://codeforces.com/problemset/problem/224/A\r\n# Author: Raunak Sett\r\nimport sys\r\nimport math\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\na, b, c = map(int, input().split())\r\n\r\nside1 = int(math.sqrt(a*b/c))\r\nside2 = int(math.sqrt(a*c/b))\r\nside3 = int(math.sqrt(b*c/a))\r\n\r\ns = side1 + side2 + side3\r\nprint (4 * s)\r\n\r\n", "a,b,c = map(int,input().split());print(int(4 * (((a*b/c)**.5 + (b*c/a)**.5 + (a*c/b) ** .5))))\r\n# Not my solution :(", "from math import sqrt\nfrom sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n x, y, z = [int(x) for x in input().split()]\n a, b, c = sqrt(x * y / z), sqrt(z * x / y), sqrt(y * z / x)\n print(int(4 * (a + b + c)))\n\n\nif __name__ == \"__main__\":\n main()\n", "import math\r\ndef findEdges(s1, s2, s3):\r\n a = math.sqrt(s1 * s2 / s3)\r\n b = math.sqrt(s3 * s1 / s2)\r\n c = math.sqrt(s3 * s2 / s1)\r\n \r\n sum = a + b + c\r\n return 4 * sum\r\n\r\nif __name__=='__main__':\r\n s1, s2, s3 = input().split()\r\n s1 = int(s1)\r\n s2 = int(s2)\r\n s3 = int(s3)\r\n print(int(findEdges(s1, s2, s3)))\r\n", "l = list(map(int,input().split(' ')))\r\nfrom math import sqrt\r\n\r\ni = 1\r\nfor j in l:\r\n i*=j\r\n\r\na = sqrt(i)\r\n\r\nprint(int(4*(a/l[0] + a/l[1] + a/l[2])))", "def Sol(arr):\r\n\t\r\n\tn=1\r\n\twhile True:\r\n\t\tif arr[0]%n == 0 and arr[1]%n == 0:\r\n\t\t\tif arr[0]*arr[1]/(n*n) == arr[2]:\r\n\t\t\t\tbreak\r\n\t\tn += 1\r\n\t\r\n\tprint(4*int(arr[0]/n + arr[1]/n + n))\r\n\treturn\r\n\r\narr = list(map(int,input().split()))\r\nSol(arr)", "a,b,c=map(int,input().split())\r\nv=(a*b*c)**0.5\r\ns=int(v//a)+int(v//b)+int(v//c)\r\nprint(4*s)", "a, b, c = map(int, input().split())\r\nl = ((a * c) // b) ** 0.5\r\nbr = ((b * a) // c) ** 0.5\r\nh = ((c * b) // a) ** 0.5\r\nprint(4 * int(l + br + h))\r\n", "import math\n\na,b,c = list(map(int, input().split()))\nx = math.sqrt(a*b/c)\ny = math.sqrt(a*c/b)\nz = math.sqrt(b*c/a)\n\nprint(int(4*x+4*y+4*z))\n\t \t\t\t\t \t \t \t\t\t \t\t \t\t \t \t", "x,y,z=map(int,input().split())\r\nv=int(pow((x*y*z),1/2))\r\nl=v/x;b=v/y;h=v/z\r\ns=int((4*l)+(4*b)+(4*h))\r\nprint(s)\r\n\r\n", "x,y,z=map(int, input().split())\r\nv=(x*y*z)**0.5\r\nprint(4*(int(v/x+v/y+v/z)))", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n s1, s2, s3 = list(map(int, input().split()))\r\n a = (s1*s3/s2) ** (1/2)\r\n b = a * s2 / s3\r\n c = a * s2 / s1\r\n print(int(a+b+c) * 4)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x,y,z=[int(w) for w in input().split()]\r\nimport math\r\nt=math.sqrt(((x*y)/z))\r\nr=math.sqrt(((x*z)/y))\r\ne=math.sqrt(((y*z)/x))\r\nprint(int(4*(t+r+e)))", "import math\r\na, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\na1 = math.sqrt(a * b / c) \r\nb1 = math.sqrt(c * a / b) \r\nc1 = math.sqrt(c * b / a) \r\nprint(int(a1*4 + b1*4 + c1*4))", "from math import sqrt\r\nfrom sys import stdin, stdout\r\nfaces = list(map(int, stdin.readline().strip().split()))\r\n\r\na, b, c = sqrt((faces[0]*faces[2])//faces[1]), sqrt((faces[0]\r\n * faces[1])//faces[2]), sqrt((faces[1]*faces[2])//faces[0])\r\nres = int(4*(a+b+c))\r\n\r\nstdout.write(f\"{res}\")\r\n", "import math\r\nx,y,z=list(map(int,input().split()))\r\nc=math.sqrt(z*y/x)\r\nprint(int(4*(z/c+c+x*c/z)))", "ab,bc,ac = map(int, input().split())\r\na = int(((ab*ac)/bc)**0.5)\r\nb = int(((ab*bc)/ac)**0.5)\r\nc = int(((bc*ac)/ab)**0.5)\r\nprint(4*(a+b+c))", "arr = list(map(int, input().split()))\r\nvol = 1\r\nfor i in arr:\r\n vol*=i\r\nvol = vol**0.5\r\nprint(int((vol/arr[0]+vol/arr[1]+vol/arr[2])*4))", "a,b,c=map(int,input().split())\r\nx=int(((a*b)//c)**0.5)\r\ny=int(((a*c)//b)**0.5)\r\nz=int(((b*c)//a)**0.5)\r\nprint(4*(x+y+z))", "from math import sqrt\r\na,b,c = map(int, input().split(\" \"))\r\ns1 = sqrt((a*b)/c)\r\ns2 = sqrt((b*c)/a)\r\ns3 = sqrt((c*a)/b)\r\nprint(int((s1+s2+s3)*4))", "a,b,c=map(int,input().split())\r\n\r\nx=int(((a*b)/c)**.5)\r\ny=int(((b*c)/a)**.5)\r\nz=int(((a*c)/b)**.5)\r\n\r\nprint(4*(x+y+z))", "s1,s2,s3=map(int,input().split())\r\na=int((s1*s3/s2)**0.5)\r\nb=int((s1*s2/s3)**0.5)\r\nc=((s2*s3/s1)**0.5)\r\n\r\nprint(int(4*(a+b+c)))", "# 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\n\r\n\r\n\r\nimport math \r\ndef main(arr):\r\n\ta1 = math.sqrt((arr[0]*arr[1])//arr[2])\r\n\ta2 = math.sqrt((arr[0]*arr[2])//arr[1])\r\n\ta3 = math.sqrt((arr[1]*arr[2])//arr[0])\r\n\tans = (a1*4) + (a2*4)+(a3*4)\r\n\tprint(int(ans))\r\n\r\narr = list(map(int,input().split()))\r\n# arr.sort()\r\n# arr = [50,10,20]\r\nmain(arr)", "a,b,c=map(int,input().split())\r\nx=(a*b*c)**0.5\r\nprint(int(4*(x//a+x//b+x//c)))", "from math import sqrt\r\n\r\n# faces\r\nx, y, z = map(int, input().split())\r\n\r\n# edges a, b, c\r\n# x = a * b\r\n# y = b * c\r\n# z = a * c\r\n\r\n# a = x/b = z/c\r\n# b = x/a = y/c\r\n# c = y/b = z/a\r\n\r\n# a^2 = x * z / y\r\n# b^2 = x * y / z\r\n# c^2 = y * z / x\r\n\r\n# soma = a*4 + b*4 + c*4\r\n\r\na = sqrt(x * z / y)\r\nb = sqrt(x * y / z)\r\nc = sqrt(y * z / x)\r\n\r\nprint(int(4*(a+b+c)))", "from math import sqrt\niarr = list(map(int,input().split()))\na1 = iarr[0]\na2 = iarr[1]\na3 = iarr[2]\npro = a1*a2*a3\nc = int(sqrt(pro//(a1*a1)))\na = int(sqrt(pro//(a2*a2)))\nb = int(sqrt(pro//(a3*a3)))\nprint(4*(a+b+c))", "import math\r\nx,y,z=map(int,input().split())\r\nprint(int(4*(math.sqrt((x*y)/z)+math.sqrt((x*z)/y)+math.sqrt((z*y)/x))))", "a,b,c = map(int, input().split());\r\nx = int(((a*b)//c)**0.5);\r\ny = a//x;\r\nz = c//y;\r\nprint(4 * (x + y + z));", "\r\nimport math\r\ns1,s2,s3 = list(map(int,input().split()))\r\n\r\na = math.sqrt(s1 * s2 // s3)\r\nb = math.sqrt(s3 * s1 // s2)\r\nc = math.sqrt(s3 * s2 // s1)\r\n\r\nprint(int(4*(a + b + c)))\r\n", "import math\r\na,b,c = map(int,input().strip().split())\r\ns1 = math.sqrt((c*a)/b)\r\ns2 = math.sqrt((b*a)/c)\r\ns3 = math.sqrt((c*b)/a)\r\nprint(int(4*(s1+s2+s3)))\r\n", "from itertools import permutations\r\n\r\nareas = [int(c) for c in input().split()]\r\n\r\nfor x, y, z in permutations(areas):\r\n if (x * y) % z != 0:\r\n continue\r\n\r\n a_sqr = x * y // z\r\n\r\n if int(a_sqr ** 0.5) ** 2 != a_sqr:\r\n continue\r\n\r\n a = int(a_sqr ** 0.5)\r\n\r\n if y % a != 0:\r\n continue\r\n\r\n b = y // a\r\n\r\n if z % b != 0:\r\n continue\r\n\r\n c = z // b\r\n\r\n ans = 4 * (a + b + c)\r\n print(ans)\r\n exit()\r\n\r\n", "import math\r\na=list(map(int,input().split()))\r\nl=0\r\nh=0\r\nbr=0\r\na.sort()\r\nh=math.sqrt((a[1]*a[0])/a[2])\r\nl=a[1]/h\r\nbr=a[2]/l\r\nans=4*l+4*h+4*br\r\nprint(int(ans))\r\n", "import math\r\nx,y,z=map(int,input().split())\r\na=int(math.sqrt((x*z)/y))\r\nb=int(math.sqrt((x*y)/z))\r\nc=int(math.sqrt((y*z)/x))\r\nprint(4*(a+b+c))", "s1,s2,s3 = map(int, input().split())\r\na = (s1*s3//s2)**0.5\r\nb = (s1*s2//s3)**0.5\r\nc = (s2*s3//s1)**0.5\r\nprint(int(4*(a+b+c)))", "import math\r\na1,a2,a3=map(int,input().split())\r\nprint(int(4*(math.sqrt(a1*a2/a3)+math.sqrt(a2*a3/a1)+math.sqrt(a1*a3/a2))))", "from math import sqrt\r\na,b,c= map(int,input().split())\r\ni = sqrt((a*b)/c)\r\nj = sqrt((b*c)/a)\r\nk = sqrt((c*a)/b)\r\n\r\nprint(int(4*(i + j + k)))", "import math\r\n\r\ns1,s2,s3=map(int,input().split())\r\n\r\na=math.sqrt((s1*s2)/s3)\r\nb=math.sqrt((s2*s3)/s1)\r\nc=math.sqrt((s1*s3)/s2)\r\n\r\nprint(int(a+b+c)*4)", "import math\r\n\r\nx, y, z = [int(x) for x in input().split()]\r\n\r\na = math.sqrt(x * z / y)\r\nb = x / a\r\nc = a * y / x\r\n\r\ns = int((a + b + c) * 4)\r\n\r\nprint(s)\r\n", "a, b, c = map(int, input().split())\r\n\r\ntemp = (a * b * c) ** 0.5\r\nprint(4 * int(temp // a + temp // b + temp // c))", "import math\r\na,b,c=map(int,input().split())\r\nx=math.sqrt(a*b/c)\r\ny=math.sqrt(b*c/a)\r\nz=math.sqrt(a*c/b)\r\nprint(int((x+y+z)*4))", "import math\r\na,b,c=map(int,input().split())\r\nprint(int(4*(math.sqrt((a*b)//c) +math.sqrt((b*c)//a)+math.sqrt((a*c)//b))))", "a,b,c=map(int,input().split())\r\n\r\nabc=int((a*b*c)**0.5+0.5)\r\n\r\nprint(4*(abc//a+abc//b+abc//c))", "import math\r\nx,y,z=map(int,input().split())\r\na= int(math.sqrt((y*x)//z))\r\nb= int(math.sqrt((z*x)//y))\r\nc= int(math.sqrt((y*z)//x))\r\nprint(4*(a+b+c))", "from math import sqrt\r\na, b, c = map(int, input().strip().split())\r\na, b, c = sqrt((a * c) // b), sqrt((a * b) // c), sqrt((b * c) // a)\r\nprint(int(4 * (a + b + c)))", "import math as m\r\na,b,c=map(int,input().split())\r\nl=m.sqrt(a*b/c)\r\nbr=m.sqrt(b*c/a)\r\nh=m.sqrt(c*a/b)\r\nprint(int(4*(l+br+h)))", "ab,bc,ca = list(map(int,input().split()))\na = ((ab*ca)//bc)**0.5\nb = ((ab*bc)//ca)**0.5\nc = ((bc*ca)//ab)**0.5\nprint(int(a+b+c)*4)\n\n", "import math\r\na,b,c = map(int,input().split())\r\nl1 = math.sqrt((a*b)/c)\r\nl2 = math.sqrt((b*c)/a)\r\nl3 = math.sqrt((a*c)/b)\r\n\r\nprint(int(4*(l1+l2+l3)))", "#!/usr/bin/pypy3\nx, y, z = map(int, input().split())\n\na = (((x * z) / y)**(1 / 2))\nb = (((y * z) / x)**(1 / 2))\nc = (((x * y) / z)**(1 / 2))\n\nprint(int(4 * (a + b + c)))\n", "s1, s2, s3 = list(map(int, input().split()))\r\n\r\na = int(((s1*s3)//s2)**0.5)\r\nb = int(((s1*s2)//s3)**0.5)\r\nc = int(((s2*s3)//s1)**0.5)\r\n\r\nprint(4*(a+b+c))\r\n", "import math\r\na,b,c=map(int,input().split())\r\nprint(int(4*(math.sqrt((c*a)/b)+math.sqrt((b*a)/c)+math.sqrt((c*b)/a))))", "import math\r\na,b,c = [int(x) for x in input().split()]\r\nx = math.sqrt(a*b/c)\r\ny = math.sqrt(b*c/a)\r\nz = math.sqrt(c*a/b)\r\nprint(int(4*(x+y+z)))", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------06.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\na,b,c=map(int,input().split())\r\nfor i in range(1,a+1):\r\n if a%i==0 and b%i==0:\r\n z=a//i\r\n y=b//i\r\n if y*z==c:\r\n print(4*(i+z+y))\r\n break", "import math\r\nx,y,z=map(int,input().split())\r\na=int(math.sqrt(z*x/y))\r\nb=int(math.sqrt(y*x/z))\r\nc=int(math.sqrt(z*y/x))\r\nprint(4*(a+b+c))\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/224/A\n\nimport math\n\nv1, v2, v3 = map(int, input().split())\n\nprint(int(4*(math.sqrt(v1*v2 / v3) + math.sqrt(v2*v3 / v1) + math.sqrt(v1*v3 / v2))))\n\t \t \t\t\t \t\t\t\t \t \t \t\t \t\t \t \t", "a1, a2, a3 = [int(i) for i in input().split(' ')]\n\nc = ((a2*a3) / a1) ** 0.5\nb = a2 / c\na = a1 / b\n\nsum12 = 4 * (a + b + c)\n\nprint(int(sum12))\n \t \t \t\t \t\t \t \t\t \t\t\t \t\t", "'''\r\n# Submitted By [email protected]\r\nDon't Copy This Code, Try To Solve It By Yourself\r\n'''\r\n# Problem Name = \"Parallelepiped\"\r\n# Class: A\r\n\r\nimport math\r\n\r\n\r\ndef esum(n1, n2, n3):\r\n ans=0\r\n ans+=math.sqrt(n1*n2/n3)\r\n ans+=math.sqrt(n1*n3/n2)\r\n ans+=math.sqrt(n2*n3/n1)\r\n\r\n return int(ans * 4)\r\n\r\ndef Solve():\r\n e=list(map(int, input().split()))\r\n print(esum(*e))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "a,b,c=map(int,input().split())\r\nl=int((int((a*c)/(b)))**0.5)\r\nw=int((int((a*b)/(c)))**0.5)\r\nh=int((int((b*c)/(a)))**0.5)\r\nprint(4*(l+w+h))", "import math\r\na1,a2,a3=map(int,input().split())\r\na=math.sqrt((a1*a3)/a2) #a1=a*b , a2=b*c , a3=c*a , a=math.sqrt((a1*a3)/a2)\r\nb=math.sqrt((a1*a2)/a3)\r\nc=math.sqrt((a2*a3)/a1)\r\nprint(4*int(a+b+c))", "# https://codeforces.com/problemset/problem/224/A\n\na, b, c = map(int, input().split())\n\nk = (a * b * c)**0.5\nprint(4 * int(k / a + k / b + k / c))\n", "from math import pi\r\n\r\n\r\ndef main():\r\n s1, s2, s3 = [int(i) for i in input().split()]\r\n a = (s3 * s1 / s2) ** 0.5\r\n b = s1 / a\r\n c = s2 / b\r\n print(int((a + b + c) * 4))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a,b,c=map(int,input().split())\r\nd=int(pow((a*b)//c,0.5))\r\ne=int(pow((a*c)//b,0.5))\r\nf=int(pow((c*b)//a,0.5))\r\nprint(4*(d+e+f))", "from math import sqrt\r\na, b, c = map(int, input().split())\r\nx = int(sqrt(a * c / b))\r\ny = int(sqrt(a * b / c))\r\nz = int(sqrt(b * c / a))\r\nprint(4 * (x + y + z))", "from math import sqrt\r\nx, y, z = map(int, input().split())\r\nprod = int((x*y*z)**0.5)\r\nprint(4*(prod//x + prod//y + prod//z))\r\n", "import math\r\nx, y, z = map(int, input().split())\r\nabc = int(round(math.sqrt(x*y*z)))\r\nprint(4*abc//x + 4*abc//y + 4*abc//z)", "from math import sqrt\r\n\r\n(x1,x2,x3)=[int(i) for i in input().split()]\r\n\r\nc=sqrt(x2*x3/x1)\r\n\r\nb=x2/c\r\n\r\na=x1/b\r\n\r\nprint(int(4*a+4*b+4*c))\r\n", "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)\nx,y,z=M()\nd=int(mt.sqrt(x*y*z))\nprint(4*(d//x+d//y+d//z))\n", "a, b, c=[int(k) for k in input().split()]\r\n#y=a/x b/h=a/x b/h=a*h/c\r\nh=int((b*c//a)**0.5)\r\nprint((h+b//h+c//h)*4)", "s1, s2, s3 = [int(c) for c in input().split()]\na = (s1*s3/s2)**(1/2)\nb = (s1*s2/s3)**(1/2)\nc = (s2*s3/s1)**(1/2)\nprint(int(4*(a+b+c)))", "input1 = [int(i) for i in input().split()]\r\nlb = input1[0]\r\nbh = input1[1]\r\nlh = input1[2]\r\nl = int(((lb*bh)/lh)**0.5)\r\nb = int(((bh*lh)/lb)**0.5)\r\nh = int(((lh*lb)/bh)**0.5)\r\nans = 4*(l + b + h)\r\nprint(ans)", "a,b,c=map(int,input().split())\r\nf1=[]\r\nfor i in range(1,int(a**0.5)+1):\r\n if a%i==0:\r\n f1.append(i)\r\n if i*i!=a:\r\n f1.append(a//i)\r\nfor item in f1:\r\n x=item\r\n y=a//item\r\n if b%y==0:\r\n z=b//y\r\n if x*z==c:\r\n break\r\n if c%y==0:\r\n z=c//y\r\n if z*x==b:\r\n break\r\nprint(4*(x+y+z))", "'''input\n4 6 6\n'''\n\nx, y, z = map(int, input().split())\n\na = ((x*z)/y)**0.5\nb = ((x*y)/z)**0.5\nc = ((y*z)/x)**0.5\n\nprint(int(a+b+c)*4)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "import math\r\na1, a2, a3 = map(int,input().split())\r\n\r\na = math.sqrt((a1*a3)/a2)\r\nb = math.sqrt((a1*a2)/a3)\r\nc = math.sqrt((a3*a2)/a1)\r\n\r\nprint(int(4*(a + b + c)))\r\n", "a,b,c=map(int,input().split())\r\nl2=int((c*(b/a))**0.5)\r\nl1=c//l2\r\nh=a//l1\r\nprint((l1+l2+h)*4)", "from math import sqrt\r\nx, y, z = map(int,input().split())\r\nfor i in range( 1, int(sqrt(x))+1):\r\n if x % i == 0 :\r\n if i * i == z * x // y:\r\n print ( 4 * (i + x // i + y * i // x ) )\r\n elif i * i == y * x / z :\r\n print ( 4 * ( i + x // i + z * i // x ) )", "from math import sqrt\r\nareas= list(map(int,input().split(' ')))\r\nedge1 = sqrt((areas[0]*areas[1])/areas[2])*4\r\nedge2=sqrt((areas[0]*areas[2])/areas[1])*4\r\nedge3=sqrt((areas[2]*areas[1])/areas[0])*4\r\nsumEdg=edge1+edge2+edge3\r\nprint(int(sumEdg))", "import math\r\nac,ab,bc=map(int,input().split())\r\nc=math.sqrt((bc*ac)/ab) \r\nb=(ab*c)/ac\r\na=ac/c\r\n#print(a,b,c) \r\nprint(int(4*(a+b+c)))\r\n\r\n \r\n \r\n", "import math\r\ns1,s2,s3 = input().split()\r\ns1 = int(s1)\r\ns2 = int(s2)\r\ns3 = int(s3)\r\na = math.sqrt(s1 * s2 / s3)\r\nb = math.sqrt(s3 * s1 / s2)\r\nc = math.sqrt(s2 * s3 / s1)\r\nsumd = a+b+c\r\nsumd = 4*sumd\r\nprint(int(sumd))", "import math\n\nx, y, z = map(int, input().split(' '))\np = int(math.sqrt(x * y * z))\na = p//x\nb = p//y\nc = p//z\n\nprint(4 *(a+b+c))\n\n", "#rough code\r\nimport math\r\np,q,r=map(int,input().split())\r\na=math.sqrt(p*q/r)\r\nb=math.sqrt(r*q/p)\r\nc=math.sqrt(p*r/q)\r\nprint(int(4*(a+b+c)))", "import math\r\nareas= list(map(int,input().split(' ')))\r\nedge1 = math.sqrt((areas[0]*areas[1])/areas[2])*4\r\nedge2=math.sqrt((areas[0]*areas[2])/areas[1])*4\r\nedge3=math.sqrt((areas[2]*areas[1])/areas[0])*4\r\nsumEdg=edge1+edge2+edge3\r\nprint(int(sumEdg))", "import math\r\ns1,s2,s3 = map(int,input().split())\r\n\r\na = int(math.sqrt((s1*s3)/s2))\r\nb = int(math.sqrt((s1*s2)/s3))\r\nc = int(math.sqrt((s2*s3)/s1))\r\n\r\nprint(4*(a+b+c))", "import math\r\n\r\narea1, area2, area3 = map(int,input().split(' '))\r\n\r\nside1 = math.sqrt(area1 * area2 // area3)\r\nside2 = area1 / side1\r\nside3 = area2 / side1\r\n\r\nprint(int(side1 + side2 + side3) * 4)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-02 23:14:03\nLastEditTime: 2021-11-02 23:22:10\nDescription: Parallelepiped\nFilePath: CF224A.py\n'''\n\n\ndef func():\n areas = list(map(int, input().strip().split()))\n a = (areas[0] * areas[1] / areas[2]) ** 0.5\n b = areas[0] / a\n c = areas[1] / a\n return 4 * int(a + b + c)\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "s1,s2,s3=map(int,input().split())\r\na=((s1*s2)/s3)**0.5\r\nb=((s3*s2)/s1)**0.5\r\nc=((s1*s3)/s2)**0.5\r\nprint(int(4*a+4*b+4*c))", "from math import sqrt\r\nl, b, h= map(int, input().split())\r\ns1 = sqrt((l*b)/h)\r\ns2 = sqrt((b*h)/l)\r\ns3 = sqrt((h*l)/b)\r\nprint(int(4*(s1+s2+s3)))", "\r\nx,y,z= map(int, input().split())\r\ntemp= int((x*y*z)**0.5)\r\ntl= int(4*(temp/x + temp/y + temp/z))\r\n\r\nprint(tl)", "a,b,c=map(int,input().split())\r\nt=int((a*b*c)**.5)\r\nprint(4*(t//a+t//b+t//c))", "from math import sqrt\r\na,b,c = map(int,input().split())\r\n\r\nl = sqrt((a*c)/b)\r\nb = a/l\r\nh = c/l\r\n\r\nprint(int(4*(l+b+h)))", "X=list(map(int,input().split()))\r\nprint(int(4*((X[0]*X[2]/X[1])**0.5+(X[0]*X[1]/X[2])**0.5+(X[2]*X[1]/X[0])**0.5)))", "a=[int(i) for i in input().split()]\r\nvol=int(pow(a[0]*a[1]*a[2],0.5))\r\nl=vol//a[0]\r\nb=vol//a[1]\r\nh=vol//a[2]\r\nprint(4*(l+b+h))\r\n", "from math import *\r\ntemp=input()\r\ntemp=temp.split(\" \")\r\nab=int(temp[0])\r\nbc=int(temp[1])\r\nca=int(temp[2])\r\n\r\na=sqrt((ab*ca)/bc)\r\nc=ca/a\r\nb=bc/c\r\nsum=int(4*(a+b+c))\r\nprint(sum)", "x = input().split()\r\np=int(x[0])\r\nq=int(x[1])\r\nr=int(x[2])\r\n\r\na =((p*r)//q)**0.5\r\nb=((p*q)//r)**0.5\r\nc=((r*q)//p)**0.5\r\nprint(int(4*(a+b+c)))", "from math import sqrt\r\na,b,c=map(int,input().split())\r\n\r\nprint(int(4*(sqrt(a*b/c)+sqrt(b*c/a) + sqrt(c*a/b))))", "A1,A2,A3 = map(int,input().split())\r\na = ((A1*A2)/A3)**(1/2)\r\nb = ((A2*A3)/A1)**(1/2)\r\nc = ((A3*A1)/A2)**(1/2)\r\nprint(int(a+b+c)*4)\r\n", "a,b,c=map(int,input().split())\r\nans=(a*b*c)**0.5\r\nprint(int(4*((ans/a) + (ans/b) + (ans/c))))", "import math\r\nl=list(map(int,input().split()))\r\nd=math.sqrt(l[0]*l[1]*l[2])\r\nl1=d/l[0]\r\nl2=d/l[1]\r\nl3=d/l[2]\r\nprint(int(4*(l1+l2+l3)))", "a, b , c = map(int , input().split())\r\nx , y , z = int((a*c/b)**.5) , int((a*b/c)**.5) , int((b*c/a)**.5)\r\nprint(x*4 + y*4 +z*4)", "import math\r\n\r\n\r\ndef solve(areas):\r\n a = math.sqrt((areas[2] * areas[0]) / areas[1])\r\n b = areas[0] / a\r\n c = areas[2] / a\r\n\r\n result = a * 4 + b * 4 + c * 4\r\n return result\r\n\r\n\r\nareas = [int(num) for num in input().split()]\r\nresult = solve(areas)\r\nprint(int(result))\r\n", "a,b,c=map(int, input().split())\r\nnet=(a*b*c)**(0.5)\r\nl=net//a\r\nbr=net//b\r\nh=net//c\r\nprint(int(4*(l+br+h)))", "import math\r\na, b, c=map(int, input().split())\r\nx2=a*c//b\r\ny2=a*b//c\r\nz2=b*c//a\r\nprint((int)(4*(x2**0.5+y2**0.5+z2**0.5)))", "from math import sqrt\nA, B, C = input().split()\n\na, b, c = int(A), int(B), int(C)\n\nx = sqrt((a*b)/c)\n\ny = b/x\n\nz = c/y\n# \n# print('x:{}, y:{}, z:{}'.format(x, y, z))\nprint(int(4*x + 4*y + 4*z))", "a, b, c = map(int, input().split())\r\nd = int((a*b*c)**0.5)\r\nprint(4*(d//a + d//b + d//c))\r\n", "# Parallelepiped\r\na1,a2,a3 = map(int,input().split(\" \"))\r\nl = ((a1/a2)*a3)**0.5\r\nh = ((a2/a3)*a1)**0.5\r\nb = ((a2/a1)*a3)**0.5\r\nx = (l+h+b)*4\r\nif x == int(x):\r\n print(int(x))\r\nelse:\r\n print(x)", "from math import *\r\nx,y,z=input().split()\r\nx,y,z=[int(x),int(y),int(z)]\r\nb=sqrt((x*y)//z)\r\nl=x//b\r\nh=(z*b)//x\r\nans=int(4*(l+b+h))\r\nprint(ans)", "import math\r\ns1,s2,s3 = map(int,input().split())\r\n\r\n#To calculate the length of one side\r\na = math.sqrt(s1*s2/s3)\r\nb = math.sqrt(s3*s1/s2)\r\nc = math.sqrt(s3*s2/s1)\r\n\r\nsuma = int(a+b+c)\r\n\r\nprint(4*suma)\r\n", "import math\n\ndef tamanhoDoLado(a, b, c):\n ans = math.sqrt(a * b // c)\n return ans\n\ndef somaLados(a, b, c):\n ans = (a + b + c) * 4\n return ans\n\n\na, b, c = [int(i) for i in input().split()]\nprint(int(somaLados(tamanhoDoLado(a, b, c), tamanhoDoLado(a, c, b), tamanhoDoLado(b, c, a))))\n\t\t \t\t \t\t \t \t \t\t \t \t \t \t\t", "a,b,c=map(int,input().split())\r\np=int(((a*c)//b)**0.5)\r\nq=int(((a*b)//c)**0.5)\r\nr=int(((b*c)//a)**0.5)\r\nprint(4*(p+q+r))", "import math \r\ndef findEdges(s1, s2, s3): \r\n a = math.sqrt(s1 * s2 / s3) \r\n b = math.sqrt(s3 * s1 / s2) \r\n c = math.sqrt(s3 * s2 / s1) \r\n sum = a + b + c \r\n return 4 * sum\r\n\r\n\r\n\r\ns=list(map(int,input().split()))\r\ns1=s[0]\r\ns2=s[1]\r\ns3=s[2]\r\nprint(int(findEdges(s1, s2, s3))) \r\n", "import math\r\n\r\na, b, c = map(int, input().split())\r\nproduct = int(math.sqrt(a*b*c))\r\na = product//a\r\nb = product//b\r\nc = product//c\r\nprint(4*(a+b+c))", "#!/usr/bin/env python3\r\nfrom math import sqrt\r\n\r\nab, ac, bc = [int(x) for x in input().split()]\r\na = sqrt(ab*ac//bc)\r\nb = sqrt(ab*bc//ac)\r\nc = sqrt(ac*bc//ab)\r\nprint(int(4*(a+b+c)))", "import math\r\na,b,c=map(int,input().split())\r\ns=math.sqrt((a*b)/c)\r\nd=math.sqrt((c*b)/a)\r\nf=math.sqrt((a*c)/b)\r\nprint(int(4*(s+d+f)))", "s1, s2, s3 = [int(x) for x in input().split()]\r\ndiv = []\r\nfor i in range(1, s1 + 1):\r\n if s1 % i == 0:\r\n div.append(i)\r\nfor d in div:\r\n if s2 % d == 0:\r\n if s3 % (s2 // d) == 0:\r\n if s3 // (s2 // d) == s1 // d:\r\n print(4 * (d + s2 // d + s1 // d))\r\n break", "l=list(map(int,input().split()))\r\na=l[0]/l[1]\r\nx=(l[2]/a)**0.5\r\ny=a*x\r\nz=l[0]/y\r\nan=(4*(x+y+z))\r\nprint(int(an))", "from math import sqrt\n\na1, a2, a3 = input().split()\na1 = int(a1)\na2 = int(a2)\na3 = int(a3)\n\na = sqrt(a1 * a2 / a3)\nb = sqrt(a3 * a1 / a2)\nc = sqrt(a3 * a2 / a1)\n\nsoma = (a+b+c) * 4\nsoma = str(soma)\n\ns = soma.split('.')\nif s[1] == '0':\n print(s[0])\nelse:\n soma = float(soma)\n print(f'{soma:.4f}')\n\n \t \t \t\t \t\t\t \t \t \t\t\t", "import math\r\na = list(map(int,input().split()))\r\n\r\nl = int(math.sqrt(a[0]*a[1]*a[2])/a[0])\r\nb = int(math.sqrt(a[0]*a[1]*a[2])/a[1])\r\nh = int(math.sqrt(a[0]*a[1]*a[2])/a[2])\r\n\r\nprint(4*(l+b+h))", "from math import *\r\nl,b,h=map(int,input().split())\r\nprint(4*int((sqrt((l*h)//b)))+4*int((sqrt((l*b)//h)))+4*int((sqrt((b*h)//l))))\r\n", "listt=list(map(int,input().split(' ',2)))\r\nlistt=sorted(listt)\r\npas=0\r\nfor m in range(listt[0],0,-1):\r\n if listt[0]%m==0 and pas==0:\r\n new=[]\r\n key1=listt[0]/m\r\n key2=m\r\n new.append(key1)\r\n new.append(key2)\r\n if listt[1]%key1==0 and (key2*listt[1]/key1)==listt[2]:\r\n pas=1\r\n new.append(listt[1]/key1)\r\n elif listt[1]%key2==0 and (key1*listt[2]/key2)==listt[2]:\r\n pas=1\r\n new.append(listt[1]/key2)\r\n\r\nprint(int((new[0]*4)+(new[1]*4)+(new[2]*4)))\r\n\r\n", "xy,yz,xz=map(int,input().split())\r\nTotal_Prod=(xy*yz*xz)\r\nz=(Total_Prod/(xy**2))**(0.5)\r\nx=(Total_Prod/(yz**2))**(0.5)\r\ny=(Total_Prod/(xz**2))**(0.5)\r\nprint(int((x+y+z)*4))", "x,y,z = map(int,input().split())\nnumsx = []\nnumsy = []\nnumsz = []\nfor i in range(1,x+1):\n if x%i ==0:\n numsx.append(i)\nfor i in range(1,y+1):\n if y%i ==0:\n numsy.append(i)\nfor i in range(1,z+1):\n if z%i ==0:\n numsz.append(i)\n\nfor numx in numsx :\n for numy in numsy:\n for numz in numsz:\n if numx * numy ==x and numx * numz ==z and numy * numz ==y:\n print((numx+numy+numz)*4)\n", "ab, bc, ac = map(int, input().split())\r\n\r\nabc = round((ab*bc*ac)**0.5)\r\nc = abc//ab\r\na = abc//bc\r\nb = abc//ac\r\nprint(4*a+4*b+4*c)", "\r\n# codeforces\r\n# 224A\r\n# solved 2018-11-10 14:37:27\r\n\r\nins = str(input())\r\n \r\ns = list(map(int,ins.split()))\r\n \r\na = (s[0]*s[1]/s[2])**0.5\r\nb = (s[0]*s[2]/s[1])**0.5\r\nc = (s[1]*s[2]/s[0])**0.5\r\n \r\nprint(int((a+b+c)*4))\r\n", "import math\r\na, b, c = map(int, input().split())\r\ny=math.sqrt(((a*b)/c))\r\nz=b/y\r\nx=a/y\r\nprint(int((x+y+z)*4))", "import math\r\ns1,s2,s3=map(int,input().split())\r\na=math.sqrt(s1*s3/s2)\r\nb=math.sqrt(s1*s2/s3)\r\nc=math.sqrt(s2*s3/s1)\r\nprint(int(4*(a+b+c)))", "\"\"\"\r\nLogic:\r\n1. Rectangular parallelpiped, so the areas of faces are ab , bc , ca\r\n2. given ab , bc , ca : we solve for a,b,c\r\n3. 4 * (a+b+c) will give the answer\r\n\"\"\"\r\nimport math\r\n\r\nab, bc, ca = list(map(int, input().rstrip().split()))\r\na = int(math.sqrt(ab * ca / bc))\r\nb = int(math.sqrt(ab * bc / ca))\r\nc = int(math.sqrt(ca * bc / ab))\r\nprint(4 * (a + b + c))\r\n", "a,b,c = map(int, input().rstrip().split(\" \"))\r\nz = (a*b*c)**0.5\r\nn1 = z/b\r\nn2 = z/c\r\nn3= z/a\r\nprint(int((4*(n1+n2+n3))))", "import math\r\na=[]\r\na=list(map(int,input().split()))\r\nab=a[0]\r\nbc=a[1]\r\nca=a[2]\r\nc=math.sqrt(ca/(ab/bc))\r\nb=math.sqrt(ab/(ca/bc))\r\na=math.sqrt(ab/(bc/ca))\r\nprint(int(4*(a+b+c)))\r\n", "a,b,c=map(int,input().split())\r\nx=((a*c)//b)**(1/2)\r\ny=((a*b)//c)**(1/2)\r\nz=((b*c)//a)**(1/2)\r\nprint(int(4*(x+y+z)))", "sa, sb, sc = list(map(int, input().split()))\r\na = int(((sa * sb * sc) // sa ** 2) ** 0.5 + 0.5)\r\nb = int(((sa * sb * sc) // sb ** 2) ** 0.5 + 0.5)\r\nc = int(((sa * sb * sc) // sc ** 2) ** 0.5 + 0.5) \r\nprint((a + b + c) * 4)\r\n", "import math\r\na,b,c = sorted([int(x) for x in input().split()])\r\ndiv = []\r\nsquart = int(math.sqrt(a))\r\nfor i in range(1,squart+1):\r\n if a%i==0:\r\n div.append([i,a//i])\r\nfor i in div:\r\n x,y = i\r\n if b/x==c/y:\r\n print(4*(x+y+b//x))\r\n break", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nfrom math import sqrt\r\na,b,c=map(int,input().split())\r\nx=sqrt((a*b)//c)\r\ny=sqrt((b*c)//a)\r\nz=sqrt((c*a)//b)\r\nprint(4*int(x+y+z))\r\n", "import math\r\narr = [int(x) for x in input().split()]\r\nprint(int(4*(math.sqrt((arr[0]*arr[1])/arr[2])+math.sqrt((arr[0]*arr[2])/arr[1])+math.sqrt((arr[2]*arr[1])/arr[0]))))", "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\ns1,s2,s3=GI()\r\nprint(4*int(sqrt(s1 * s2 / s3)+sqrt(s3 * s1 / s2)+sqrt(s3 * s2 / s1)))", "import math\r\na1 , a2 , a3 = map(int,input().split())\r\na = math.sqrt((a1*a3)//a2)\r\nb = math.sqrt((a1*a2)//a3)\r\nc = math.sqrt((a2*a3)//a1)\r\nsum1 = 4*(a+b+c)\r\nprint(int(sum1))", "import math as m\r\n\r\na,b,c=map(int,input().split())\r\ne1,e2,e3=m.sqrt((a*c)/b),m.sqrt((a*b)/c),m.sqrt((b*c)/a)\r\nprint(int(4*(e1+e2+e3)))\r\n", "import math\r\narr = list(map(lambda x: int(x), input().split()))\r\n\r\na = math.sqrt((arr[0]*arr[1])/arr[2])\r\nb = math.sqrt((arr[2]*arr[1])/arr[0])\r\nc = math.sqrt((arr[2]*arr[0])/arr[1])\r\n\r\nprint(int(4*(a+b+c)))", "import math\r\na, b, c = map(int, input().split(' '))\r\nprint(int(4 * (a * b + b * c + a * c) * math.sqrt(a * b * c) / (a * b * c)))\r\n", "x,y,z = tuple(map(int,input().split()))\r\na = int(((x*z)//y)**(1/2))\r\nb = int(x//a)\r\nc = int(z//a)\r\nprint(4*(a+b+c))\r\n", "import math\n\nA1, A2, A3 = [int(j) for j in input().split()]\n\na = math.sqrt((A1*A2)/A3)\nb = math.sqrt((A1*A3)/A2)\nc = math.sqrt((A2*A3)/A1)\n\nprint(int(4*a + 4*b + 4*c))\n\t\t \t\t \t \t \t \t \t\t\t \t\t\t\t \t", "import math\r\nab,bc,ac=map(int,input().split())\r\nx1,x2,x3=ab/bc,bc/ac,ab/ac\r\na=math.sqrt(x1/x2*bc)\r\nb=math.sqrt(x2*x3*ac)\r\nc=math.sqrt(ab/x1/x3)\r\njam=(4*(a+b+c))\r\nif int(jam)==jam:\r\n print(int(jam))\r\nelse:\r\n print(int(jam)+1)\r\n", "import math\r\nx,y,z=map(int,input().split(\" \"))\r\na=math.sqrt(x*z/y)\r\nb=math.sqrt(x*y/z)\r\nc=math.sqrt(y*z/x)\r\nsum=(int)(4*(a+b+c))\r\nprint(sum)\r\n", "import math\r\na,b,c=map(int,input().split())\r\na1=(a*c/b)**0.5\r\na2=(a*b/c)**0.5\r\na3=(b*c/a)**0.5\r\nprint(int(4*(a1+a2+a3)))", "a,b,c=map(int,input().split())\r\n\r\nm=pow(((a*c)/b),1/2)\r\nn=pow(((b*a)/c),1/2)\r\np=pow(((c*b)/a),1/2)\r\nans=4*(m+p+n)\r\nprint(int(ans))", "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\na=list(map(int,input().split()))\r\nc1=a[2]*a[1]/a[0]\r\nc=c1**0.5\r\nb=a[1]/c\r\na=a[0]/b\r\ns=int((a+b+c)*4)\r\nprint(s)\r\n", "from math import sqrt\nx, y, z = map(int, input().split()) \na = sqrt (int((x * y) / z))\nb = sqrt (int((x * z) / y))\nc = sqrt (int((y * z) / x))\nprint(int((a + b + c) * 4)) ", "a,b,c=map(int,input().split())\r\nabc=int((a*b*c)**0.5)\r\nx=abc//a\r\ny=abc//b\r\nz=abc//c\r\nprint((x+y+z)*4)", "import math\r\na,b,c=map(int,input().split())\r\np=int(math.sqrt(a*b*c))\r\ns=(((a+b+c)**2)-(a**2)-(b**2)-(c**2))//(2*p)\r\nprint(4*s)", "ab,bc,ac = [int(i) for i in input().split()]\r\nc = ((ac/ab)*bc)**0.5\r\nb = ab/ac*c\r\na = ab/b\r\nprint(round(4*a+4*b+4*c))", "import math\r\narr = list(map(int, input().split()))\r\ns1 = math.sqrt(arr[0] * arr[1] / arr[2])\r\ns2 = math.sqrt(arr[2] * arr[0] / arr[1])\r\ns3 = math.sqrt(arr[2] * arr[1] / arr[0])\r\nprint(int(4*(s1+s2+s3)))", "import sys \nimport math\nf1,f2,f3=map(int,input().split())\nc=math.sqrt(f3/(f1/f2))\nb=f2/c\na=f3/c\nprint(int(4*(a+b+c)))\n \t\t\t\t \t\t \t \t\t\t \t\t\t\t \t \t\t", "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)\na, b, c = minp()\nx = sqrt(a * b * c // b ** 2)\ny = sqrt(a * b * c // c ** 2)\nz = sqrt(a * b * c // a ** 2)\npr(4 * int((x + y + z)))", "x,y,z = map(int , input().split())\r\n#>-> shivank singh\r\nk = (x*y*z)**0.5\r\nprint(4*int(k//x+k//y+k//z))", "a,b,c=map(int,input().split())\r\nd=(a*b*c)**.5\r\nprint(int(4*(d/a+d/b+d/c)))", "f1,f2,f3=map(int,input().split(\" \"))\r\nimport math\r\nvol=4*int(math.sqrt(f1*f2*f3))\r\nprint(vol//f1+vol//f2+vol//f3)", "import math\ndata = input().split()\n\nA1, A2, A3 = int(data[0]), int(data[1]), int(data[2])\n\n\nH = int(math.sqrt((A2 * A3) // A1))\nW = A3 // H\nL = A1 // W\n\n\nprint(4*L + 4*W + 4*H)\n \t\t \t\t \t \t\t\t \t\t\t \t\t \t", "import math\r\nfrom collections import Counter\r\nimport io,os\r\n\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n# for _ in range(int(input())):\r\na, b, c = map(int, input().split())\r\ns = math.sqrt(a*b*c)\r\na1 = s/a\r\nb1 = s/b\r\nc1 = s/c\r\nprint(int((a1+b1+c1)*4))\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\n# grid = [list(map(int, input().split())) for _ in range(3)]\r\n# grid = [list(input()) for _ in range(n)]\r\n# result = [[1] * 3 for _ in range(3)]\r\n# n, s, r = map(int, input().split())\r\n# arr = list(map(int, input().split()))\r\n# n = input()\r\n# n = int(n)", "from math import sqrt\r\na,b,c=map(int,input().split())\r\nd=4*(sqrt(a*b//c)+sqrt(c*b//a)+sqrt(a*c//b))\r\nprint(int(d))", "import math\r\n\r\nn, m, k = list(map(int, input().split()))\r\n\r\nc = math.sqrt(k*m/n)\r\na = m/c\r\nb = n/a\r\n\r\nprint(int(c*4+a*4+b*4))", "x,y,z = map(int,input().split())\r\nimport math as m\r\na = m.sqrt(x*z/y)\r\nb = m.sqrt(x*y/z)\r\nc = m.sqrt(y*z/x)\r\nans = int(4*(a+b+c))\r\nprint(ans)", "from math import sqrt \r\nab, bc, ac = map(int, input().split())\r\nx = ab *bc / ac\r\ny = ac * ab / bc\r\nz = bc * ac / ab\r\n\r\nval = sqrt(x) + sqrt(y) + sqrt(z)\r\nprint(int(val*4))", "a, b, c = map(int, input().split())\r\nx = (a * c * b) ** .5\r\nprint(4 * int(x / a + x / b + x / c))", "a1, a2, a3 = map(int, input().split())\r\n\r\nx = int((a1 * a3 / a2) ** (1/2))\r\ny = int((a1 * a2 / a3) ** (1/2))\r\nz = int((a2 * a3 / a1) ** (1/2))\r\n\r\nprint(4 * sum((x, y, z)))", "import math\r\nfrom math import sqrt\r\n\r\na,b,c = list(map(int,input().split()))\r\n\r\n\r\na1 = sqrt((a*b)/c)\r\nb1 = sqrt((b*c)/a)\r\nc1 = sqrt((c*a)/b)\r\n\r\n\r\nprint(int(4*(a1+b1+c1)))", "# benzene_ <>\r\na,b,c=map(int,input().split())\r\nx=(a*b*c)**0.5\r\nprint(int((x/a+x/b+x/c)*4))", "from math import sqrt\r\n\r\nab, bc, ca = map(int, input().split())\r\n\r\nabc = int(sqrt(ab*bc*ca))\r\n\r\nsides = abc // ab + abc // bc + abc // ca\r\n\r\nprint(4*sides)\r\n", "import sys\r\nimport math\r\ndef answer(d, e, f):\r\n a = int(math.sqrt((d * e) // f))\r\n b = d // a\r\n c = e // a\r\n return (a + b + c) * 4\r\n \r\ndef main():\r\n d, e, f = [int(i) for i in sys.stdin.readline().split()]\r\n print(answer(d, e, f))\r\n return\r\nmain()", "from cmath import sqrt\r\na, b, c = map(int, input().split())\r\nprint(int(((sqrt((a*b)//c)+sqrt((a*c)//b)+sqrt((b*c)//a))*4).real))", "#A. Parallelepiped\r\nfrom math import sqrt\r\ns1, s2, s3 = map(int,input().split())\r\na = sqrt((s1*s3)/s2)\r\nb = sqrt((s2*s3)/s1)\r\nc = sqrt((s1*s2)/s3)\r\nprint(int(4*(a+b+c)))", "xy, xz, yz = map(int, input().split())\r\ny = ((xy*yz)/xz)**0.5\r\nx = ((xy*xz)/yz)**0.5\r\nz = ((xz*yz)/xy)**0.5\r\nprint(int(4*(x+y+z)))\r\n", "a,b,c = map(int,input().split())\r\ndel_a = []\r\ndel_b = []\r\ndel_c = []\r\n\r\nn = 1\r\nwhile n**2 <= a:\r\n if a%n == 0:\r\n del_a.append(n)\r\n if a//n not in del_a:\r\n del_a.append(a//n)\r\n n+=1\r\nn = 1\r\n\r\nwhile n**2 <= b:\r\n if b%n == 0:\r\n del_b.append(n)\r\n if b//n not in del_b:\r\n del_b.append(b//n)\r\n n += 1\r\nn = 1\r\nwhile n**2 <= c:\r\n if c%n == 0:\r\n del_c.append(n)\r\n if c//n not in del_c:\r\n del_c.append(c//n)\r\n n += 1\r\not = []\r\nfor i in del_a:\r\n if i in del_b and a//i in del_c and b//i in del_c and c//(a//i) in del_b and b//(c//(a//i)) in del_a and i * c//(a//i) == b:\r\n ot.append(i*4 + a//i*4 + c//(a//i)*4)\r\nprint(min(ot))", "\r\n\"\"\"\r\n Aug 13, 2021\r\n Written by Zach Leach - at 12:05 AM CST\r\n\r\n\"\"\"\r\n\r\nimport sys\r\ngetline = sys.stdin.readline\r\n\r\ndef read_int():\r\n return int(getline())\r\n\r\ndef read_ints():\r\n return list(map(int, getline().split()))\r\n\r\n\"\"\"\r\n Parallelepiped\r\n\r\n edge lengths -> math word -> geometry -> draw a picture\r\n areas -> math word -> geometry -> draw a picture\r\n faces -> math word -> geometry -> draw a picture\r\n common -> related values -> pay attention to words around this word to find what values are related\r\n vertex -> math word -> geometry -> draw a picture\r\n task -> problem word -> what is being solved\r\n find -> problem word -> finding what?\r\n sum -> some values are added together\r\n\r\n\r\n this was a math problem. the 2 second time limit combined with the small input made me inclined to solve this\r\n problem with some crazy factoring simulation thing that was extremely difficult to think about conceptually as well\r\n as implement.\r\n\r\n i spent more than 5 hours on this problem, and when i first read it i already didn't like it. noticing my bias\r\n against \"math\" problems: i went in thinking this was a \"really hard\" problem and that had an impact on how it felt\r\n working on it, and made me hesitate from thinking about more \"simple\" approaches.\r\n\r\n the giveaway here was the word \"common\". you had 3 values that were RELATED by a \"common\" vertex. the task was to\r\n find the edge lengths given the three RELATED values using basic algebra.\r\n\r\n\r\n face 1 = a * b\r\n face 2 = b * c\r\n face 3 = c * a\r\n\r\n a = face 1 / b\r\n a = face 3 / c\r\n\r\n a * a = (face 1 * face 3) / (b * c)\r\n b * c = face 2\r\n \r\n a * a = (face 1 * face 3) / (face 2)\r\n\r\n a = sqrt((face 1 * face 3) / face 2)\r\n\r\n\"\"\"\r\n\r\na, b, c = read_ints()\r\n\r\nh = int(((a * c) / b) ** 0.5)\r\nw = int(((a * b) / c) ** 0.5)\r\nl = int(((b * c) / a) ** 0.5)\r\n\r\nprint(4 * (h + w + l))\r\n", "from math import sqrt\r\nl = input().split(' ')\r\nA1, A2, A3 = int(l[0]), int(l[1]), int(l[2])\r\n\"\"\"\r\nUp: A1 = a * b\r\nfront: A2 = b * c\r\nside: A3 = a * c\r\n\r\nA1/A2 = a/c\r\nA2/A3 = b/a\r\nA1/A3 = b/c\r\n\r\nA1A2/A3 = b^2\r\nb = sqrt(A1A2/A3)\r\nA1A3/A2 = a^2\r\na = sqrt(A1A3/A2)\r\nA2A3/A1 = c^2\r\nc = sqrt(A2A3/A1) \r\n\"\"\"\r\nprint(4*(int(sqrt(A1 * A2/A3))+int(sqrt(A1 * A3/A2))+int(sqrt(A2 * A3/A1))))\r\n", "def _input(): return map(int, input().split())\r\n\r\nm1, m2, m3 = _input()\r\nc = ((m3*m2)//m1)**0.5\r\na = m3//c; b = m2//c\r\nprint(round(4*(a+b+c)))", "c=0\r\nn=[int(n) for n in input().split()]\r\nx1=(n[0]*n[1]//n[2])**(0.5)\r\nx2=n[0]//x1\r\nx3=n[1]//x1\r\nprint(int(4*(x1+x2+x3)))", "import math\r\na,b,c=map(int,input().split())\r\nx=math.sqrt((a*b)//c)\r\ny=math.sqrt((b*c)//a)\r\nz=math.sqrt((a*c)//b)\r\nprint((int(x)+int(y)+int(z))*4)", "import math\r\nA1,A2,A3=map(int,input().split())\r\na=int(math.sqrt((A1*A2)/A3))\r\nb=int(math.sqrt((A2*A3)/A1))\r\nc=int(math.sqrt((A1*A3)/A2))\r\nprint((a+b+c)*4)", "import math\r\na,b,c = map(int, input().split())\r\n\r\nx = int(math.sqrt(a*c/b))\r\ny = int(math.sqrt(a*b/c))\r\nz = int(math.sqrt(c*b/a))\r\n\r\nprint(4*(x+y+z))\r\n\r\n", "import math\nx12, x13, x23 = [int(s) for s in input().split()]\nx1 = math.sqrt(x12*x13/x23)\nx2 = x12 / x1\nx3 = x13 / x1\nprint(int(4*(x1+x2+x3)))\n", "l=list(map(int,input().split()))\r\na=0\r\nb=0\r\nc=0\r\nfor i in range(1,max(l[0],l[1])+1):\r\n if(l[0]%i==l[1]%i==0 and (l[1]//i * l[0]//i)==l[2]):\r\n a=i\r\n b=l[1]//i\r\n c=l[0]//i\r\n break\r\nprint((a+b+c)*4)", "a1,b1,c1 = map(int,input().split())\r\nc=(((c1*b1)//a1)**(1/2))//1\r\nprint(int(4*((c1//c) + (b1//c) + c)))", "root = {}\n\nfor i in range(10**6):\n root[i*i] = i\n\na, b, c = list(map(int, input().split()))\n\nsq = 2*a + 2*b + 2*c + (a*c)/b + (a*b)/c + (b*c)/a\n\nif sq in root:\n print(4*root[sq])\nelse:\n print('Boo')\n", "import math\na,b,c=map(int, input().split())\nx=round(math.sqrt((a*b)/c))\ny=round(math.sqrt((c*b)/a))\nz=round(math.sqrt((a*c)/b))\nprint(4*(x+y+z))", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\ta1, a2, a3 = map(int, input().split())\n\ta_sum = a1 + a2 + a3\n\ta_prod = a1*a2*a3\n\te_sum = ((a_prod)/(a1**2) + (a_prod)/(a2**2) + (a_prod)/(a3**2) + 2*a_sum)**0.5\n\tprint(int(4*e_sum))\n", "a, b, c = map(int, input().split())\n\nprint(int(4*((a*b/c)**.5+(b*c/a)**.5+(c*a/b)**.5)))\n", "a,b,c=map(int,input().split())\r\n#a=list(map(int,input().split()))\r\nc1=(c/(a/b))**0.5\r\na1=c/c1\r\nb1=a/a1\r\nprint(int(4*(a1+b1+c1)))\r\n", "import math\r\nn,m,o=list(map(int,input().split()))\r\na=math.sqrt(n*m/o)\r\nb=math.sqrt(o*n/m)\r\nc=math.sqrt(o*m/n) \r\ns1=a+b+c\r\nprint(round(s1*4)) \r\n", "from math import sqrt\r\ns = input().split()\r\n\r\ns1 = int(s[0])\r\ns2 = int(s[1])\r\ns3 = int(s[2])\r\n\r\na = sqrt(s1*s3/s2)\r\nb = sqrt(s1*s2/s3)\r\nc = sqrt(s2*s3/s1)\r\n\r\nans = int(4*(a+b+c))\r\nprint(ans)", "import math\r\na,b,c=map(int,input().split())\r\nd=int(pow((a*b)//c,0.5))\r\ne=int(pow((b*c)//a,0.5))\r\nf=int(pow((a*c)//b,0.5))\r\nsum=d+e+f\r\nprint(int(4*sum))\r\n\r\n", "a,b,c=map(int,input().split())\r\ns1=a*b\r\ns2=b*c\r\ns3=a*c\r\na1=((a*c)/b)**(1/2)\r\nb1=((a*b)/c)**(1/2)\r\nc1=((c*b)/a)**(1/2)\r\nprint(int(4*(a1+b1+c1)))\r\n", "import math\r\n\r\nab, bc, ca = [int(x) for x in input().split()]\r\n\r\na = math.sqrt(ab*bc*ca)/bc\r\nb = math.sqrt(ab*bc*ca)/ca\r\nc = math.sqrt(ab*bc*ca)/ab\r\nres = int(4*a + 4*b + 4*c)\r\n\r\nprint(res)", "a,b,c = map(int,input().split())\r\nt = (a*b*c)**(1/2)\r\nprint(int(4*((t//a)+(t//b)+(t//c))))", "import math\r\na,b,c =map(int,input().split())\r\nx=math.sqrt(a*c/b)\r\ny=math.sqrt(a*b/c)\r\nz=math.sqrt(b*c/a)\r\nprint(int(4*(x+y+z)))", "a,b,c=map(int,input().split())\r\nx=((a*b)/c)**0.5\r\ny=((b*c)/a)**0.5\r\nz=((c*a)/b)**0.5\r\nprint(int((x+y+z)*4))\r\n", "x,y,z = map(int,input().split())\r\na = int((x*y/z)**0.5)\r\nb = int((x*z/y)**0.5)\r\nc = int((z*y/x)**0.5)\r\nprint(4*(a+b+c))", "import math\r\nar = []\r\nfor i in input().split(' '):\r\n ar.append(int(i))\r\nb = math.sqrt((ar[0]*ar[1])/ar[2])\r\na = ar[0]/b\r\nc = ar[2]/a\r\nprint(int(4*(a+b+c)))\r\n", "import math\r\na1,a2,a3=map(int,input().split())\r\n#a1=ab a2=bc a3=ca => c=a3/a, a=a1/b,a3/c c=a2/b b = a1/a,a2/c =>\r\n# c=a3/a1/b => a3*a2/c*a1 => c = (a2*a3/a1)**0.5\r\n# Similarly a^2 = a1*a3/a2, b^2 = a1*a2/a3\r\n\r\n\r\nsm = 4*( ((a2*a3)//a1)**0.5 + ((a1*a3)//a2)**0.5 + ((a1*a2)//a3)**0.5 )\r\nprint(int(sm))", "import math\r\na,b,c=map(int,input().split())\r\ne=math.sqrt((a*b)//c)\r\nf=math.sqrt((b*c)//a)\r\ng=math.sqrt((a*c)//b)\r\nprint(int(4*(e+f+g)))", "from math import sqrt\r\nx, y, z = map(int, input().split())\r\nprint (int(4*(sqrt(y*z/x)) + 4*(sqrt(x*z/y)) + 4*(sqrt(y*x/z))))", "import math\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\nz = math.sqrt((a[1] * a[2]) / a[0])\r\nv = a[2] / z\r\nu = a[0] / v\r\n\r\nu, v, z = int(u), int(v), int(z)\r\n\r\nprint(4 * (u + v + z))", "import math\r\na,b,c=map(int,input().split())\r\nx=int((a*b+a*c+b*c)/math.sqrt(a*b*c)*4)\r\nprint(x)", "a,b,c=map(int,input().split())\r\nt=int(pow(a*b*c,1/2))\r\nprint(4*(int(t/a+t/b+t/c)))", "import math\r\na = input().split()\r\nar = list(map(int, a))\r\nx = ar[0]*ar[1]*ar[2]\r\nx = math.sqrt(x)\r\nb = x/ar[0]\r\nc = x/ar[1]\r\nd = x/ar[2]\r\nv = b + c + d\r\nprint(int(v*4))", "# /problemset/problem/224/A\r\nimport math\r\nlis=tuple(map(int,input().split()))\r\n(x,y,z)=lis\r\ns=lambda x,y,z:math.sqrt((x*y)/z)\r\nx1=s(x,y,z)\r\ny1=s(y,z,x)\r\nz1=s(z,x,y)\r\nprint(int((4*x1)+(4*y1)+(4*z1)))\r\n", "import math\r\nclass Parallelepiped:\r\n def __init__(self):\r\n self.a,self.b,self.c,self.area=None,None,None,None\r\n\r\n def sum12Edges(self,ab,bc,ac):\r\n self.b=math.sqrt((((bc+ac)/ac)/((bc+ac)/bc))*ab)\r\n self.a=ab/self.b\r\n self.c=bc/self.b\r\n self.area=round(4*(self.a+self.b+self.c)) \r\n #round(num) takes care of rounding up/down based on num\r\n #if <.5 rounded down... >=.5 is rounded up\r\n return self.area\r\n \r\nab,bc,ac=map(int,input().split(\" \"))\r\np=Parallelepiped()\r\nprint(p.sum12Edges(ab,bc,ac))", "import math\r\n\r\nf = list(map(int, input().split()))\r\n\r\na =math.sqrt((f[0]*f[1])/f[2])\r\nb = math.sqrt((f[1]*f[2])/f[0])\r\nc = math.sqrt((f[2]*f[0])/f[1])\r\n\r\nprint(int(4*(a+b+c)))", "a, b, c = map(int, input().strip().split())\r\nprint(4*int(((a*b)/c)**0.5 + ((c*b)/a)**0.5 + ((a*c)/b)**0.5))\r\n", "areas = [int(i) for i in input().split(\" \")]\r\n\r\nxy = areas[0]\r\nyz = areas[1]\r\nzx = areas[2]\r\n\r\nx = ((xy * zx) / yz)**(1/2)\r\ny = xy / x\r\nz = zx / x\r\n\r\nsum_of_edges = int(x*4 + y*4 + z*4)\r\nprint(sum_of_edges)\r\n", "a,b,c=map(int,input().split())\nfrom math import sqrt\nln=sqrt((a*c)/b)\nbr=sqrt((a*b)/c)\nht=sqrt((b*c)/a)\nprint(int(4*(ln+br+ht)))\n", "import math\n\nlul = input().split()\n\nlul = [int(i) for i in lul]\n\nx = lul[0]\ny = lul[1]\nz = lul[2]\n\na = math.sqrt((x*y)/z);\nb = math.sqrt((x*z)/y);\nc = math.sqrt((y*z)/x);\nval=(a+b+c)*4;\nprint(int(val))\n \t\t\t \t\t\t \t\t \t \t\t \t\t \t", "import io,os,sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\ndef solve():\r\n a = list(map(int,input().split()))\r\n return 4 * sum([int(((a[list({0,1,2} - {i})[0]]*a[list({0,1,2} - {i})[1]])//a[i])**(1/2)) for i in range(3)])\r\n\r\nsys.stdout.write(str(solve())+'\\n')", "import math\r\n\r\n(lb, bh, lh) = list(map(int, input().split(\" \")))\r\nv = math.sqrt(lb*bh*lh)\r\nl = v/bh\r\nb = v/lh\r\nh = v/lb\r\nprint(int((l+b+h)*4))\r\n", "from math import *\r\nA1, A2, A3 = map(int, input().split())\r\n\r\na = sqrt(A1 * A3 // A2)\r\nb = A1 // a\r\nc = A3 // a\r\n\r\nprint(int(a + b + c) * 4)" ]

[ "l=input().split()\np,x,y=int(l[0])-26,int(l[1]),int(l[2])\ndef ch(n):\n\ti=(n//50)%475\n\tfor c in range(25):\n\t\ti=(i*96+42)%475\n\t\tif i==p:return 0\n\treturn 1\nz=y+(x-y)%50\nwhile ch(z):z+=50\nif z>x:\n\tn=(z-x)//50\n\tprint((n>>1)+(n&1))\nelse:\n\tprint('0')\n\n", "def checkWin(s,p):\r\n i=(s//50)%475\r\n for j in range(25):\r\n i=(i*96+42)%475\r\n if 26+i==p: return True\r\n return False\r\np,x,y=[int(i) for i in input().split()]\r\nans=0\r\nif x<=y:\r\n x1=x\r\nelse:\r\n x1=x-(x-y)//50*50\r\nwhile not checkWin(x1,p) or x<y:\r\n x1+=50\r\n if x1>x:ans+=1\r\nprint((ans+ans%2)//2)", "def checker(s,p):\r\n i= (s//50)%475\r\n for j in range(25):\r\n i=(i * 96 + 42)%475\r\n if(i+26==p):\r\n return True\r\n return False\r\narr = list(map(int, input().split()))\r\np=arr[0]\r\nx=arr[1]\r\ny=arr[2]\r\nmi=x\r\ntr=False\r\nwhile(mi>=y):\r\n if(checker(mi,p)):\r\n tr=True\r\n print(0)\r\n break\r\n else:\r\n mi-=50\r\nif(not(tr)):\r\n curr=x\r\n c=1\r\n while(True):\r\n if(checker(curr+50,p)):\r\n print(c)\r\n break\r\n elif(checker(curr+100,p)):\r\n print(c)\r\n break\r\n else:\r\n curr+=100\r\n c+=1\r\n \r\n \r\n\r\n", "def check(g, s):\r\n i = (s//50)%475\r\n for j in range(25):\r\n i = (i*96+42)%475\r\n if (i+26) == g:\r\n return True\r\n return False\r\n\r\n(g, p, t) = map(int, input().split())\r\n\r\ntot = 0\r\ns = p\r\n\r\nwhile s >= t:\r\n if s >= t and check(g, s):\r\n print(tot)\r\n exit()\r\n s -= 50\r\n\r\ns = p\r\n\r\nwhile True:\r\n if s >= t and check(g,s):\r\n break\r\n if (s-50) >= t and check(g, s-50):\r\n break\r\n s += 100\r\n tot += 1\r\nprint(tot)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(n):\r\n s = set()\r\n n = (n//50) % 475\r\n for i in range(25):\r\n n = (n*96 + 42) % 475\r\n s.add(26+n)\r\n return s\r\n\r\n\r\np, x, y = map(int, input().split())\r\n\r\na = x - ((x - y)//50 * 50)\r\nfor i in range(a, 1000000, 50):\r\n if p in f(i):\r\n if i <= x:\r\n print(0)\r\n else:\r\n print((i-x)//100 + ((i-x)%100 != 0))\r\n break\r\n", "def do(n,p):\r\n t=(n//50)%475\r\n for i in range(25):\r\n t=(t*96+42)%475\r\n if(26+t==p):\r\n return True\r\n return False\r\np,x,y=map(int,input().split())\r\nfor i in range(500):\r\n for j in range(500):\r\n if(x+100*i-50*j>=y and do(x+100*i-50*j,p)):\r\n print(i)\r\n exit()\r\n\r\n\r\n", "def editor():\r\n\timport sys\r\n\tsys.stdin=open(\"input.txt\",'r')\r\n\tsys.stdout=open(\"output.txt\",'w')\r\n\r\ndef solve():\r\n\tp,x,y=map(int,input().split())\r\n\tdef score(sc):\r\n\t\tl=[]\r\n\t\ti = (sc // 50) % 475\r\n\t\tfor _ in range(25):\r\n\t\t\ti = (i * 96 + 42) % 475\r\n\t\t\tl.append(26 + i)\r\n\t\treturn l\r\n\t\r\n\tans=0\r\n\twronged=0\r\n\tcursc=x\r\n\t# xx=x\r\n\t# yy=y\r\n\tif x>=y:\r\n\t\tcur=x\r\n\t\twhile cur>=y:\r\n\t\t\tl=score(cur)\r\n\t\t\tif p in l:\r\n\t\t\t\tprint(0)#,cur)\r\n\t\t\t\treturn\r\n\t\t\telse:\r\n\t\t\t\tcur-=50\r\n\r\n\t\twhile True:\r\n\t\t\tl=score(cursc)\r\n\t\t\tif p in l:\r\n\t\t\t\tprint(ans)#,cursc)\r\n\t\t\t\treturn\r\n\t\t\telse:\r\n\t\t\t\tcursc+=50\r\n\t\t\t\tans+= (wronged%2==0)\r\n\t\t\t\twronged+=1\r\n\r\n\r\n\telse:\r\n\t\tans += (y-x)//100\r\n\t\tif (y-x)%100 !=0: ans+=1\r\n\t\tcursc+= ans*100\r\n\t\tif cursc-y >=50:\r\n\t\t\tcursc-=50\r\n\t\t\twronged=1\t\r\n\r\n\t\t# now calculating\r\n\t\twhile True:\r\n\t\t\tl=score(cursc)\r\n\t\t\tif p in l:\r\n\t\t\t\tprint(ans)#,cursc)\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tcursc+=50\r\n\t\t\t\tans+= (wronged%2==0)\r\n\t\t\t\twronged+=1\r\n\t# print(l)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\t# editor()\r\n\ttc=1\r\n\t# tc=int(input())\r\n\tfor t in range(tc):\r\n\t\tsolve()", "def places(s):\r\n places = []\r\n i = (s//50)%475\r\n for j in range(25):\r\n i = (i*96+42)%475\r\n places.append(26+i)\r\n return places\r\n\r\na = list(map(int,input().split()))\r\nplace = a[0]\r\ncurrent = a[1]\r\nminimum = a[2]\r\npl = places(current)\r\n\r\nif place in pl:\r\n print(0)\r\n exit(0)\r\nwhile current > minimum:\r\n current -=50\r\n if current>=minimum:\r\n pl = places(current)\r\n if place in pl:\r\n print(0)\r\n exit(0) \r\ncurrent1 = a[1]\r\ncurrent2 = a[1]-50\r\nattempts1 = 0\r\nattempts2 = 0\r\nwhile True:\r\n current1+=100\r\n attempts1+=1\r\n pl = places(current1)\r\n if place in pl:\r\n print(attempts1)\r\n exit(0)\r\n current2+=100\r\n attempts2+=1\r\n pl = places(current2)\r\n if place in pl:\r\n print(attempts2)\r\n exit(0)\r\n", "def check(s, p):\r\n i = (s // 50) % 475\r\n for _ in range(25):\r\n i = (i * 96 + 42) % 475\r\n if 26 + i == p:\r\n return True\r\n return False\r\n\r\n\r\np, x, y = map(int, input().split())\r\n\r\nfor up in range(500):\r\n for down in range(500):\r\n s = x + (up * 100) - (down * 50)\r\n if s >= y and check(s, p):\r\n print(up)\r\n exit()\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\np, x, y = iis()\r\n\r\n\r\ndef checker(s):\r\n i = (s // 50) % 475\r\n for _ in range(25):\r\n i = (i * 96 + 42) % 475\r\n if 26 + i == p:\r\n return True\r\n return False\r\n\r\n\r\ndef solve():\r\n cnt = 0\r\n for successful in range(200):\r\n for unsuccessful in range(400):\r\n new_x = x + 100*successful - 50*unsuccessful\r\n if new_x >= y and checker(new_x):\r\n return cnt\r\n cnt += 1\r\n\r\n\r\nprint(solve())\r\n", "p, x, y = map(int, input().split())\r\n\r\n\r\ndef check(s):\r\n i = (s // 50) % 475\r\n for t in range(25):\r\n i = (i * 96 + 42) % 475\r\n if 26 + i == p:\r\n return True\r\n return False\r\n\r\n\r\nflag = False\r\nfor up in range(500):\r\n for down in range(500):\r\n if x + 100 * up - 50 * down >= y and check(x + 100 * up - 50 * down):\r\n print(up)\r\n flag = True\r\n break\r\n if flag: break", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(int)\r\ndef s(x):\r\n\tl=[]\r\n\tfor i in range(25):\r\n\t\tx=(x*96)\r\n\t\tx+=42\r\n\t\tx%=475\r\n\t\tl.append(26+x)\r\n\treturn l\r\nl=[]\r\nfor i in range(475):\r\n l.append(s(i))\r\n\r\np,x,y=M()\r\nt=(x-y)//50\r\nstart=x-t*50\r\n\r\nwhile(True):\r\n key=(start//50)%475\r\n for i in l[key]:\r\n if(p==i):\r\n print(max(0,mt.ceil((start-x)/100)))\r\n exit()\r\n else:\r\n start+=50\r\n\r\n", "p,x,y=map(int,input().split())\r\ndef solve(s):\r\n i=(s//50)%475\r\n for j in range(25):\r\n i=(i*96+42)%475\r\n if 26+i==p:\r\n return True\r\n else:\r\n return False\r\nfor i in range(500):\r\n for j in range(500):\r\n if x+i*100-j*50>=y and solve(x+i*100-j*50)==True:\r\n print(i)\r\n exit()", "p, x, y = map(int, input().split())\ns = y\nwhile(True):\n if (s % 50 != x % 50):\n s+=1\n continue\n ok = False\n i = (s // 50) % 475\n for j in range(25):\n i = (i*96 + 42) % 475\n if (i + 26 == p):\n ok = True\n break\n if (ok):\n print((max(0, s-x) + 50) //100)\n break\n # print(s)\n s+=1\n", "p, x, y = map(int, input().split())\r\n\r\ndef shirtpicking(s, test):\r\n i = (s // 50) % 475\r\n res = []\r\n for t in range(25):\r\n i = (i * 96 + 42) % 475\r\n res.append(i+26)\r\n\r\n if test in res:\r\n return True\r\n else:\r\n return False\r\n\r\nif x >= y:\r\n for x1 in range((x - y) // 50 + 1):\r\n if shirtpicking(x - x1 * 50, p):\r\n print(0)\r\n exit()\r\n\r\nans = 0\r\n\r\ns = x\r\nints = 0\r\n\r\nwhile ans == 0:\r\n\r\n s += 50\r\n\r\n ints += 1\r\n if shirtpicking(s, p):\r\n print((ints + 1) // 2)\r\n exit()\r\n", "p, x, y = map(int, input().split())\r\ndef f(s):\r\n i = s // 50 % 475\r\n for j in range(25):\r\n i = (i * 96 + 42) % 475\r\n if p == 26 + i:\r\n return True\r\n return False\r\nfor i in range(x - (x - y) // 50 * 50, 10 ** 9, 50):\r\n if f(i):\r\n print(max(0, (i - x + 50) // 100))\r\n break", "import math\r\n\r\n\r\ndef check(score):\r\n k = (score // 50) % 475\r\n for i in range(25):\r\n k = (k * 96 + 42) % 475\r\n if 26 + k == p:\r\n return True\r\n return False\r\n\r\np, x, y = map(int, input().split())\r\n\r\nt = math.ceil((y - x) / 50)\r\n\r\nif p <= 25:\r\n print(t)\r\nelse:\r\n while not check(x + 50 * t):\r\n t += 1\r\n print(max(0, (t + 1) // 2))", "p,x,y=list(map(int,input().split()))\ns=0\nwhile 1>0:\n for sc in range(x,y-1,-50):\n i=(sc//50)%475\n for _ in range(25):\n i=(i*96+42)%475\n if 26+i==p:\n print(s)\n exit(0)\n s+=1\n x+=100\n", "import math\r\nimport sys\r\nimport bisect # https://pythonworld.ru/moduli/modul-bisect.html\r\nfrom heapq import heapify, heappop, heappush\r\nfrom itertools import * # https://pythonworld.ru/moduli/modul-itertools.html\r\nfrom collections import deque, OrderedDict\r\nsys.setrecursionlimit(10 ** 6)\r\n# f = open('input.txt')\r\n# f.close()\r\nII = lambda: sys.stdin.readline() # f.readline()\r\ninp = lambda: int(II())\r\ninpm = lambda: map(int, II().split())\r\ninpl = lambda: list(inpm())\r\narr_mn = lambda _n, _m: [[0 for __ in range(_m)] for _ in range(_n)]\r\narr_nn = lambda _n: arr_mn(_n, _n)\r\n\r\nEPS = 1e-9\r\nINF = int(1e18)\r\nMOD = int(1e9) + 7 # 998244353\r\nN = 2000009\r\n\"\"\"\r\n\r\n\"\"\"\r\nmod = 475\r\ndef check(p, s):\r\n i = (s // 50) % mod\r\n for _ in range(25):\r\n i = (i * 96 + 42) % mod\r\n if i + 26 == p:\r\n return True\r\n return False\r\n\r\ndef solve():\r\n p, x, y = inpm()\r\n s = x\r\n for q in range(x, y - 1, -50):\r\n if check(p, q):\r\n print(0)\r\n return\r\n for i in range(mod):\r\n if check(p, s + i * 50):\r\n print((i + 1) // 2)\r\n return\r\n\r\n'''\r\n\r\n'''\r\n\r\ndef main():\r\n t = 1 # inp() # 1 #\r\n for i in range(t):\r\n solve()\r\n # print()\r\nmain()\r\n", "import math\r\n\r\ndef check(s, p):\r\n k = s // 50 % 475\r\n for i in range(25):\r\n k = (k * 96 + 42) % 475\r\n if 26 + k == p:\r\n return True\r\n return False\r\n\r\ndef solve():\r\n p, x, y = list(int(i) for i in input().split())\r\n for i in range(0, 100000):\r\n if x - 50 * i >= y:\r\n if check(x - 50 * i, p):\r\n print(0)\r\n return\r\n for i in range(0, 100000):\r\n if x + 50 * i >= y:\r\n if check(x + 50 * i, p):\r\n print((i + 1) // 2)\r\n return\r\n \r\ndef main():\r\n solve()\r\n exit(0)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def f(p, d, x, y):\n\tx+=d*50\n\tif x<y:\n\t\treturn\n\ts=(x//50)%475\n\tfor i in range(25):\n\t\ts=(96*s+42)%475\n\t\tif s+26==p:\n\t\t\tprint(0 if d<0 else (d+1)>>1)\n\t\t\texit()\np, x, y=map(int, input().split())\nfor i in range(-500, 500):\n\tf(p, i, x, y)\n", "def isTshirt(s):\r\n i = int(s/50) % 475\r\n for _ in range(25):\r\n i = (i * 96 + 42) % 475\r\n if p == 26 + i:\r\n return True\r\n return False\r\n\r\n\r\ndef calcAns(p, x, y):\r\n s = x\r\n while s >= y:\r\n if isTshirt(s):\r\n return 0\r\n s = s-50\r\n\r\n i = 1\r\n s = x\r\n while True:\r\n s = s + 50\r\n i = i + 1\r\n if s >= y and isTshirt(s):\r\n return int(i/2)\r\n\r\n\r\np, x, y = map(int, input().split())\r\nprint(calcAns(p, x, y))\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\np,x,y=map(int,input().strip().split())\r\ndef t_shirt(s):\r\n i=int(s/50)\r\n i%=475\r\n for j in range(25):\r\n i=(i*96+42)%475\r\n if (i+26)==p:\r\n return 1\r\n return 0\r\ncnt=0\r\nt=int(x)\r\nflag=0\r\nwhile x>=y:\r\n if t_shirt(x):\r\n print(cnt)\r\n flag=1\r\n break\r\n x-=50\r\nx=t\r\nif flag==0:\r\n while 1:\r\n cnt+=1\r\n x+=100\r\n if x<y:\r\n continue\r\n if t_shirt(x):\r\n print(cnt)\r\n break\r\n if t_shirt(x-50):\r\n print(cnt)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n", "def f(n):\r\n i = (n // 50) % 475\r\n for j in range(25):\r\n i = (i * 96 + 42) % 475\r\n if i + 26 == p:\r\n return True\r\n \r\n return False\r\n\r\np, x, y = map(int, input().split())\r\nk = 0\r\ncan = False\r\n\r\ni = x\r\nwhile i - 50 >= y:\r\n i -= 50\r\n if f(i):\r\n print(0)\r\n can = True\r\n break\r\n\r\nif not can:\r\n for i in range(x, x + 30001, 50):\r\n if f(i):\r\n print(k)\r\n break\r\n \r\n if not (i - x) % 100:\r\n k += 1", "# coding: utf-8\nimport sys\n\n__author__ = 'buyvich'\n\nSUCCESS_HACK = 100\nUNSUCCESS_HACK = 50\nMAX_SCORES = 20000\n\ndef get_win_places(scores):\n res = []\n k = (scores//50)%475\n for _ in range(25):\n k = (k * 96 + 42)%475\n res.append(26 + k)\n return res\n\ndef find_success_hack_count(place, current_scores, min_goal):\n \"\"\"\n >>> find_success_hack_count(239, 10880, 9889)\n 0\n >>> find_success_hack_count(26, 7258, 6123)\n 2\n >>> find_success_hack_count(493, 8000, 8000)\n 24\n >>> find_success_hack_count(101, 6800, 6500)\n 0\n >>> find_success_hack_count(329, 19913, 19900)\n 8\n \"\"\"\n goal = min_goal\n while True:\n if not (current_scores-goal)%50:\n if place in get_win_places(goal):\n break\n goal += 1\n return (max(0, goal-current_scores)+50)//100\n\n\nif __name__ == '__main__':\n place, current_scores, goal = sys.stdin.readline().strip().split(' ')\n success_hacks_count = find_success_hack_count(int(place),\n int(current_scores),\n int(goal))\n sys.stdout.write('%s' % success_hacks_count)\n\n\n# vim:ts=4:sts=4:sw=4:tw=85:et:\n", "from sys import stdin\r\na,b,c=map(int,stdin.readline().split())\r\ndef score(s):\r\n i=(s//50)%475\r\n for repeat in range(25):\r\n i=(i*96+42)%475\r\n if i+26==a:return True\r\n return False\r\ndef ok():\r\n for i in range(476):\r\n for j in range(476):\r\n if b+100*i-50*j>=c and score(b+100*i-50*j):\r\n return i\r\nprint(ok())", "\np, x, y = map(int,input().split())\n\ndef luck(s,p):\n i = (s//50) % 475\n for _ in range(25):\n i = (i*96+42) % 475\n if 26+i == p:\n return True\n return False\n\n# try downs\ndown = x\nwhile down >= y:\n if luck(down,p):\n print(0)\n exit(0)\n down -= 50\n\n# make you win\ncur = x\nif y > x:\n cur = x + 50*((y-x+1)//50)\n\n\nwhile not luck(cur,p):\n cur += 50\n\nhacks = (cur - x + 99) // 100\n\nprint(hacks)\n\n", "s=4000\r\ni=(s//50)%475\r\n# i=213\r\nallvals=[]\r\nwhile ((len(allvals)==0) or (((i*96+42)%475)!=allvals[0])):\r\n\ti=(i*96+42)%475\r\n\tallvals.append(i)\r\n# print(allvals)\r\np,x,y=[int(x) for x in input().split(' ')]\r\n\r\nCurrState=(x//50)%475\r\n\r\nme=p-26\r\nwhereMe=allvals.index(me)\r\nacceptingStates=[]\r\nfor i in range(25):\r\n\tacceptingStates.append(allvals[whereMe-i-1])\r\nnegAcc=[(x-475) for x in acceptingStates]\r\nacceptingStates.sort()\r\nnegAcc.sort()\r\n\r\n# print(acceptingStates)\r\nsa=set(acceptingStates)\r\n\r\nmaxNeg=0\r\nif(y%50<=x%50):\r\n\tmaxNeg=(x-y)//50\r\nelse:\r\n\tmaxNeg=(x-y)//50\r\n\r\n# print(maxNeg)\r\n\r\nminVisitabeState=(CurrState-maxNeg+475)%475\r\n# print(minVisitabeState)\r\nminVisitabeStates=[minVisitabeState]\r\nfor i in range(10000):\r\n\t(minVisitabeStates.append(minVisitabeStates[-1]+1))\r\n# print(minVisitabeStates[:20])\r\naornot=[None]*10000\r\nfor i in range(10000):\r\n\taornot[i]=int(minVisitabeStates[i] in sa)\r\n# print(aornot[:20])\r\n# \r\nmypos=minVisitabeStates.index(CurrState)\r\n# print(mypos)\r\n\r\nfl=1\r\nfor i in range(mypos+1):\r\n\tif(aornot[i]):\r\n\t\tprint(0)\r\n\t\tfl=0\r\n\t\tbreak\r\nif(fl):\r\n\tfacc=aornot.index(1)\r\n\tif(facc%2!=mypos%2):\r\n\t\tfacc+=1\r\n\tprint((facc-mypos)//2)\r\n\r\n", "import math\n\n\ndef get_tshirts(S):\n winners = []\n i = (S // 50) % 475\n for x in range(25):\n i = (i * 96 + 42) % 475\n winners.append(26 + i)\n return winners\n\n\nclass CodeforcesTask807BSolution:\n def __init__(self):\n self.result = ''\n self.p_x_y = []\n\n def read_input(self):\n self.p_x_y = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n hacks = 0.0\n if self.p_x_y[1] < self.p_x_y[2]:\n hacks += (self.p_x_y[2] - self.p_x_y[1]) // 100 + math.ceil((self.p_x_y[2] - self.p_x_y[1]) % 100 / 100)\n self.p_x_y[1] += ((self.p_x_y[2] - self.p_x_y[1]) // 100) * 100 + \\\n math.ceil((self.p_x_y[2] - self.p_x_y[1]) % 100 / 100) * 100\n started = self.p_x_y[1]\n if self.p_x_y[1] > self.p_x_y[2]:\n self.p_x_y[1] = self.p_x_y[1] - ((self.p_x_y[1] - self.p_x_y[2]) // 50) * 50\n while self.p_x_y[0] not in get_tshirts(self.p_x_y[1]):\n if self.p_x_y[1] >= started:\n hacks += 0.5\n self.p_x_y[1] += 50\n hacks += 0.5\n self.result = str(int((hacks * 2) // 2))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask807BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "\r\nimport math\r\np, x, y = map(int, input().split())\r\ns = y\r\nwhile 1:\r\n if abs(x - s) % 50 == 0: break\r\n s -= -1\r\n \r\nwhile 1:\r\n i = (s // 50) % 475\r\n for j in range(25):\r\n i = (i * 96 + 42) % 475\r\n if i + 26 == p: break\r\n if i + 26 == p:\r\n break\r\n s += 50\r\nif s <= x: print(0)\r\nelse:\r\n if (s - x) % 100 == 0: print((s - x) // 100)\r\n else: print((s - x) // 100 + 1)", "def Ts(rank,score):\r\n #print(score)\r\n arr = []\r\n i = (score // 50) % 475\r\n for x in range(25):\r\n i = (i * 96 + 42) % 475\r\n arr.append(26 + i)\r\n #print(rank,arr)\r\n if rank in arr:\r\n #print(\"yes\")\r\n return False\r\n else:\r\n #print(\"No\")\r\n return True\r\n \r\nrank,cur,need = map(int,input().split())\r\nt_cur = cur\r\nwhile(cur-50 >= need ):\r\n cur-=50\r\nwhile( Ts(rank,cur)):\r\n cur+=50\r\n#print(\"#########################\",cur)\r\ncur-=t_cur\r\ncur+=50\r\nif(cur<0):\r\n ans = 0\r\nelse:\r\n ans = cur//100\r\nprint(ans)\r\n\r\n \r\n \r\n" ]

[ "I=lambda:map(int,input().split())\r\nn,=I()\r\nl=[*I()]\r\nm,=I()\r\nq=0\r\nr=\"\"\r\nfor i in range(m):\r\n w,h=I()\r\n q=max(q,l[w-1])\r\n r+=str(q)+\"\\n\"\r\n q+=h\r\nprint(r)", "from sys import stdin\r\n\r\n\r\ndef ip():\r\n return stdin.readline().split()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(stdin.readline())\r\n li = list(map(int, ip()))\r\n m = int(stdin.readline())\r\n for _ in range(m):\r\n w, h = map(int, ip())\r\n print(max(li[0], li[w-1]))\r\n li[0] = max(li[0], li[w-1]) + h", "import sys\n\ndef main():\n n = int(sys.stdin.readline())\n a = list(map(int, sys.stdin.readline().split(' ')))\n m = int(sys.stdin.readline())\n (w1, h1) = (0, 0)\n H = 0\n for i in range(m):\n (w2, h2) = map(int, sys.stdin.readline().split(' '))\n H = max(H + h1, a[w2 - 1])\n sys.stdout.write('{}\\n'.format(str(H)))\n (w1, h1) = (w2, h2)\n\nmain()\n", "import sys\nimport math\ninput = sys.stdin.readline\nfrom collections import defaultdict\n# n, k = map(int, input().split())\nn = int(input())\nlst = list(map(int, input().split()))\nm = int(input())\nt = 0\nfor i in range(m):\n w, h = map(int, input().split())\n if lst[w-1] > t:\n t = lst[w-1]+ h\n else :\n t += h\n print(t - h)\n", "n = int(input())\na = list(map(int,input().split()))\nm = int(input())\nw = []\nh = []\nfor i in range(m):\n x,y = map(int,input().split())\n w.append(x)\n h.append(y)\n\ncur = 0\nfor i in range(m):\n cur = max(cur, a[w[i]-1])\n print(cur)\n cur += h[i]\n\n\n", "import sys\r\nn = int(sys.stdin.readline())\r\nl = list(map(int, sys.stdin.readline().split()))\r\nm = int(sys.stdin.readline())\r\nx = 0\r\nfor i in range(m):\r\n w, h = map(int, sys.stdin.readline().split())\r\n x = max(x, l[w-1])\r\n sys.stdout.write(str(x)+'\\n')\r\n x += h", "from sys import stdin\r\ninp = lambda: list(map(int, stdin.readline().split()))\r\ninp()\r\naa = inp()\r\nfor i in range(inp()[0]):\r\n a,b=inp()\r\n k=max(aa[0],aa[a-1])\r\n aa[0]=k+b\r\n print(k)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\ns=[]\r\nfor i in range(m):\r\n\ts+=[list(map(int,input().split()))]\r\nh=[]\r\na=0\r\nfor i in range(m):\r\n\tb=l[s[i][0]-1]\r\n\tt=max(b,a+1)\r\n\th+=[t]\r\n\ta=t+s[i][1]-1\r\n\r\nfor i in h:\r\n\tprint(i)", "I=lambda:map(int,input().split())\r\nn,=I()\r\nl=[*I()]\r\nm,=I()\r\nq=0\r\nfor i in range(m):\r\n w,h=I()\r\n q=max(q,l[w-1])\r\n print(q)\r\n q+=h", "l=int(input())\r\na=list(map(int,input().split()))\r\nn=int(input())\r\nw,h=[],[]\r\nfor z in range(n):\r\n b=list(map(int,input().split()))\r\n w.append(b[0])\r\n h.append(b[1])\r\nc=[0]\r\nfor i in range(n):\r\n p=max(a[w[i]-1],c[-1])\r\n print(p)\r\n c.append(p+h[i])\r\n \r\n# print(w,h,c)\r\n \r\n\r\n \r\n \r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(int(input())):\r\n\tw,h=map(int,input().split())\r\n\tk=max(a[0],a[w-1])\r\n\ta[0]=k+h\r\n\tprint(k)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import *\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\npre = 0\r\nfor _ in range(int(input())):\r\n w,h = map(int, input().split())\r\n w-=1\r\n ans = max(pre, A[w])\r\n pre = ans+h\r\n print(ans)\r\n", "y=lambda:map(int,input().split())\r\nn,=y()\r\nl,q=[*y()],0\r\nm,=y()\r\nfor i in range(m):\r\n w,h=y()\r\n q=max(q,l[w-1])\r\n print(q)\r\n q+=h", "n = int(input())\r\nlis= list(map(int,input().split()))\r\na = int(input())\r\nque = []\r\nhi = []\r\nco = 0\r\nfor i in range(a):\r\n\tque.append(list(map(int,input().split())))\r\ni=0\r\nwhile i < a:\r\n\t(w,h) = que[i]\r\n\tif lis[w-1]>=w:\r\n\t\tif lis[w-1]>=co:\r\n\t\t\thi.append(lis[w-1])\r\n\t\t\tco = max(co, lis[w-1] + h)\r\n\t\telse:\r\n\t\t\thi.append(co)\r\n\t\t\tco+= h \r\n\telse:\r\n\t\tif w>=co:\r\n\t\t\thi.append(lis[w-1])\r\n\t\t\tco = max(co, lis[w-1] + h)\r\n\t\telse:\r\n\t\t\thi.append(co)\r\n\t\t\tco+= h\r\n\ti+=1\r\nfor i in hi:\r\n\tprint(i)\r\n\r\n", "from collections import Counter, defaultdict\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n heights = list(map(int, input().split()))\r\n q = int(input())\r\n for _ in range(q):\r\n w, h = list(map(int, input().split()))\r\n mx = max(heights[w-1], heights[0])\r\n heights[0] = mx+h\r\n print(mx)\r\n\r\n\r\nfor _ in range(1):\r\n # print(solve())\r\n solve()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = []\r\nfor _ in range(m):\r\n b.append(list(map(int, input().split())))\r\nfor x, y in b:\r\n m = max(a[0], a[x - 1])\r\n print(m)\r\n a[0] = m + y", "n = int(input())\r\narr = list(map(int, input().split()))\r\nidx, res = 0, []\r\nm = int(input())\r\nfor _ in range(m):\r\n w, h = map(int, input().split())\r\n r = max(arr[w-1], idx)\r\n res.append(r)\r\n arr[w-1] = r + h\r\n idx = max(idx, arr[w-1])\r\nprint('\\n'.join(map(str, res)))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\ndims = []\r\nfor _ in range(m):\r\n dims.append(tuple(map(int, input().split())))\r\n\r\nlast_box = 0\r\nfor box in dims:\r\n current_base = max(last_box, a[box[0] - 1])\r\n print(current_base)\r\n last_box = current_base + box[1]\r\n", "# https://codeforces.com/problemset/problem/272/C\n\n# we just check if the box dropped falls above the previous box or on stair number(1...w)\n# the box is dropped from the top and hence we need to check the heights from the top - \n# which height is suitable and higher\n\nm = int(input())\narr = list(map(int, input().split()))\nt = int(input())\nfor i in range(t):\n w, h = map(int, input().split())\n p = max(arr[0], arr[w - 1]) # checking which height is higher\n print(p)\n # increase the height for the next box to drop - can only drop above the\n arr[0] = p + h\n # current box\n", "def main():\r\n n = int(input())\r\n hts = list(map(int,input().split()))\r\n ans = []\r\n max_ht = 0\r\n m = int(input())\r\n for i in range(m):\r\n w,h = map(int,input().split())\r\n curr_ht = hts[w-1]\r\n if max_ht == 0:\r\n ans.append(curr_ht)\r\n max_ht = curr_ht+h\r\n else:\r\n if curr_ht >= max_ht:\r\n max_ht = curr_ht+h\r\n ans.append(curr_ht)\r\n else:\r\n ans.append(max_ht)\r\n max_ht += h\r\n\r\n for i in range(m):\r\n print(ans[i])\r\n\r\n\r\nmain()\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nc=0\r\nm=int(input())\r\nfor i in range(m):\r\n w,h=(int(i) for i in input().split())\r\n if(l[w-1]<=c):\r\n print(c)\r\n c+=h\r\n else:\r\n print(l[w-1])\r\n c=l[w-1]+h", "\nn = int(input())\n\na = list(map(int, input().split()))\nfor i in range(1, n):\n a[i] = max(a[i], a[i - 1])\n\nm = int(input())\n\nfor _ in range(m):\n w, h = map(int, input().split())\n w -= 1\n print(max(a[0], a[w]))\n a[0] = max(a[0] + h, a[w] + h)\n\n", "\r\ninput()\r\na=list(map(int,input().split()))\r\nb=int(input())\r\nx=0\r\ny=0\r\nfor i in range(b):\r\n c,d=list(map(int,input().split()))\r\n if x==0:\r\n x=a[c-1]\r\n y=d\r\n print(x)\r\n else:\r\n x=max(x+y,a[c-1])\r\n y=d\r\n print(x)", "#C.Dima and Staircase\r\nn = int(input())\r\nheight = list(map(int,input().split()))\r\nm = int(input())\r\nb = []\r\nfor i in range(m):\r\n b.append(list(map(int,input().split())))\r\nfor w,h in b:\r\n x = max(height[0],height[w-1])\r\n print(x)\r\n height[0] = x + h", "n, t, d, p = input(), [0] + list(map(int, input().split())), 0, []\nfor i in range(int(input())):\n w, h = map(int, input().split())\n p.append(max(d, t[w]))\n d = p[i] + h\nprint(' '.join(map(str, p)))\n\t\t \t\t \t\t \t \t \t \t\t \t \t", "def testcase():\n input()\n a = list(map(int, input().strip().split()))\n\n m = int(input().strip())\n wb = []\n for _ in range(m):\n wb.append(list(map(int, input().strip().split())))\n \n w, h = 0, 0\n for i in range(m):\n if w < wb[i][0]:\n h = max(h, a[wb[i][0]-1])\n w = wb[i][0]\n\n print(h)\n h += wb[i][1]\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "## necessary imports\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nfrom math import log2, log, ceil\r\n\r\n\r\n# swap_array function\r\ndef swaparr(arr, a, b):\r\n temp = arr[a];\r\n arr[a] = arr[b];\r\n arr[b] = temp\r\n\r\n\r\n## gcd function\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\n## nCr function efficient using Binomial Cofficient\r\ndef nCr(n, k):\r\n if (k > n - k):\r\n k = n - k\r\n res = 1\r\n for i in range(k):\r\n res = res * (n - i)\r\n res = res / (i + 1)\r\n return res\r\n\r\n\r\n## upper bound function code -- such that e in a[:i] e < x;\r\ndef upper_bound(a, x, lo=0):\r\n hi = len(a)\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if a[mid] < x:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n return lo\r\n\r\n\r\n## prime factorization\r\ndef primefs(n):\r\n ## if n == 1 ## calculating primes\r\n primes = {}\r\n while (n % 2 == 0):\r\n primes[2] = primes.get(2, 0) + 1\r\n n = n // 2\r\n for i in range(3, int(n ** 0.5) + 2, 2):\r\n while (n % i == 0):\r\n primes[i] = primes.get(i, 0) + 1\r\n n = n // i\r\n if n > 2:\r\n primes[n] = primes.get(n, 0) + 1\r\n ## prime factoriazation of n is stored in dictionary\r\n ## primes and can be accesed. O(sqrt n)\r\n return primes\r\n\r\n\r\n## MODULAR EXPONENTIATION FUNCTION\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n if (x == 0):\r\n return 0\r\n while (y > 0):\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n return res\r\n\r\n\r\n## DISJOINT SET UNINON FUNCTIONS\r\ndef swap(a, b):\r\n temp = a\r\n a = b\r\n b = temp\r\n return a, b\r\n\r\n\r\n# find function\r\ndef find(x, link):\r\n while (x != link[x]):\r\n x = link[x]\r\n return x\r\n\r\n\r\n# the union function which makes union(x,y)\r\n# of two nodes x and y\r\ndef union(x, y, link, size):\r\n x = find(x, link)\r\n y = find(y, link)\r\n if size[x] < size[y]:\r\n x, y = swap(x, y)\r\n if x != y:\r\n size[x] += size[y]\r\n link[y] = x\r\n\r\n\r\n## returns an array of boolean if primes or not USING SIEVE OF ERATOSTHANES\r\ndef sieve(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\n\r\n#### PRIME FACTORIZATION IN O(log n) using Sieve ####\r\nMAXN = int(1e6 + 5)\r\n\r\n'''\r\ndef spf_sieve():\r\n spf[1] = 1;\r\n for i in range(2, MAXN):\r\n spf[i] = i;\r\n for i in range(4, MAXN, 2):\r\n spf[i] = 2;\r\n for i in range(3, ceil(MAXN ** 0.5), 2):\r\n if spf[i] == i:\r\n for j in range(i * i, MAXN, i):\r\n if spf[j] == j:\r\n spf[j] = i;\r\n ## function for storing smallest prime factors (spf) in the array\r\n\r\n################## un-comment below 2 lines when using factorization #################\r\n# spf = [0 for i in range(MAXN)]\r\n# spf_sieve()\r\ndef factoriazation(x):\r\n ret = {};\r\n while x != 1:\r\n ret[spf[x]] = ret.get(spf[x], 0) + 1;\r\n x = x // spf[x]\r\n return ret\r\n ## this function is useful for multiple queries only, o/w use\r\n ## primefs function above. complexity O(log n)'''\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\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\ndef find_parent(parent, i,cnt):\r\n cnt+=1\r\n if parent[i-1] ==i:\r\n return cnt\r\n if parent[i-1] !=i:\r\n find_parent(parent, parent[i-1],cnt)\r\n\r\n##########################################################\r\n#for _ in range(int(input())):\r\n# from collections import deque\r\nfrom collections import Counter\r\n# ls=list(map(int,input().split()))\r\n# for i in range(m):\r\n# for i in range(int(input())):\r\n#n,k= map(int, input().split())\r\n#for _ in range(int(input())):\r\n#n,k= map(int, input().split())\r\nfrom collections import Counter\r\nimport math\r\n#for i in range(int(input())):\r\n #n,k=map(int, input().split())\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nbox=[]\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n box.append((u,v))\r\nans=0\r\nval=0\r\nfor i in range(m):\r\n ans=max(val+ans,arr[box[i][0]-1])\r\n val=box[i][1]\r\n print(ans)\r\n", "def go():\n n = int(input())\n a = [int(i) for i in input().split(' ')]\n m = int(input())\n o = ''\n for i in range(m):\n w, h = [int(i) for i in input().split(' ')]\n m = max(a[0], a[w - 1])\n a[0] = m + h\n o += '{}\\n'.format(m)\n return o\nprint(go())\n#0000\n#0000\n#0000\n# ##\n#0 ##\n#000##\n# ###\n#0####\n######\n\n\n#1\n#3\n#4\n#6\n\n", "n = input()\r\nstairs = list(map(int,input().split(' ')))\r\nboxes = []\r\nfor i in range(int(input())):\r\n boxes.append(list(map(int,input().split(' '))))\r\n \r\nch = stairs[0]\r\nans = []\r\nfor box in boxes:\r\n nh = max(ch,stairs[box[0]-1])\r\n ans.append(nh)\r\n ch = nh + box[1]\r\nprint(*ans,sep = '\\n')", "import sys\r\nn=int(sys.stdin.readline())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nm=int(sys.stdin.readline())\r\nx=0\r\nfor i in range(m):\r\n w,h=map(int,sys.stdin.readline().split())\r\n x=max(x,l[w-1])\r\n sys.stdout.write(str(x)+'\\n')\r\n x+=h", "n=int(input())\r\nx=list(map(int,input().split()))\r\nm=int(input())\r\nh=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n h=max(h,x[a-1])\r\n print(h)\r\n h+=b\r\n", "i=int(input())\r\nl=list(map(int,input().split()))\r\np=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n p=max(p,l[a-1])\r\n print(p)\r\n p+=b", "n = int(input())\na = list(map(int,input().split()))\nm = int(input())\nl = [list(map(int,input().split())) for _ in range(m)]\nans = [a[l[0][0]-1]]\nlasth = l[0][1]\nfor _,[w,h] in enumerate(l[1:]):\n\tans.append(max(ans[-1] + lasth,a[w-1]))\n\tlasth = h\nprint(*ans,sep='\\n')\n\t\n\n\n", "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 n = int(sys.stdin.readline())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n\r\n m = int(sys.stdin.readline())\r\n for _ in range(m):\r\n w, h = map(int, sys.stdin.readline().split())\r\n sys.stdout.write(str(max(a[w - 1], a[0])) + \"\\n\")\r\n a[0] = max(a[w - 1], a[0]) + h\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", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n x = max(w[a-1], c)\r\n print(x)\r\n c = x + b\r\n", "from sys import stdin\r\nrdi = lambda: list(map(int, stdin.readline().split()))\r\n\r\nrdi()\r\na = rdi()\r\nfor _ in range(rdi()[0]):\r\n w, h = rdi()\r\n m = max(a[0], a[w-1])\r\n a[0] = m+h\r\n print(m)\r\n", "import math\r\nfrom collections import defaultdict as dt\r\nfrom sys import stdin\r\ninp = lambda : stdin.readline().strip()#input()\r\nintinp = lambda : int(inp())#int(input())\r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\nlistinp= lambda : list(map(int,stdin.readline().split()))#list(input())\r\nmapinp = lambda : map(int,stdin.readline().split())#map(input())\r\n\r\n\r\n##### Code Goes here #####################\r\nfor _ in range(1):\r\n n=intinp()\r\n a=listinp()\r\n m=intinp()\r\n for i in range(m):\r\n w,h=mapinp();l=max(a[0],a[w-1])\r\n print(l)\r\n a[0]=l+h\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nR=0\r\nfor i in range(m):\r\n w,h=map(int,input().split())\r\n if w-1>R and a[w-1]>a[R]: R=w-1\r\n print(a[R])\r\n a[R]+=h\r\n \r\n" ]

[ "text=input()\r\nn=len(text)\r\nc=0\r\nfor i in range(n):\r\n if text[i]!=text[n-i-1]:\r\n c=c+1\r\nif (n%2==0):\r\n if(c==2):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelif(n%2==1):\r\n if (c==2 or c==0):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "word = input().strip()\ni = 0\nj = len(word) - 1\ncount = 0\nwhile i <= j:\n if word[i] != word[j]:\n count +=1\n i += 1\n j -= 1\nif count == 1 or count == 0 and len(word) % 2 == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t\t \t\t \t\t \t \t \t", "s=input()\r\nf=False\r\nfor i in range(len(s)):\r\n for j in range(97,123):\r\n if chr(j)!=s[i]:\r\n new = s[:i]+chr(j)+s[i+1:]\r\n if new==new[::-1]:\r\n f=True\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s = input()\r\n\r\nn = len(s)\r\nc = 0\r\nfor i in range(n//2):\r\n if s[i] != s[n-i-1]:\r\n c += 1\r\n\r\nif c == 1 or (c == 0 and n % 2 == 1):\r\n ans = \"YES\"\r\nelse:\r\n ans = \"NO\"\r\n\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Mike and Palindrome.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1SGlg96J98VVirFKcxmRjWKXQGYe02E09\n\"\"\"\n\ntext = input()\nl = len(text) \nc = 0\nd = 0\nif l%2 == 0 :\n for i in range(l//2) :\n if text[i] != text [l-i-1] :\n c = c + 1\n if c == 1 : \n print(\"YES\") \n else :\n print(\"NO\") \n \nelif l%2 != 0 :\n for i in range(l//2+1) :\n if text[i] != text[l-i-1] :\n d = d + 1\n \n if d == 0 or d == 1 :\n print(\"YES\")\n else :\n print(\"NO\")", "s=input()\r\nl=len(s)\r\ncount=0\r\nfor i in range(l):\r\n if s[i]!=s[(l-1)-i]:\r\n count+=1\r\n else:\r\n count+=0\r\nif(count//2)==1 or count==0 and l%2!=0:\r\n print(\"Yes\")\r\nelif count>=2:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nk = 0\r\nfor i in range(len(s)//2):\r\n if s[i] != s[ - i - 1]:\r\n k += 1\r\nprint(\"YES\" if k == 1 or k == 0 and len(s) % 2 else \"NO\")", "text=input()\r\ncount=0\r\nn=len(text)\r\nfor i in range(n//2):\r\n if text[i]!=text[-1-i]:\r\n count+=1\r\nif (count==1) or (count==0 and len(text)%2!=0):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "p = input('')\r\nq = len(p)\r\nr = 0\r\ns = 0\r\nif q == 1:\r\n print('yes')\r\n exit()\r\nwhile q-r-1 > r:\r\n if p[r] != p[q-r-1]:\r\n s = s + 1\r\n elif q % 2 == 0 and q >= 2:\r\n if p == p[::-1]:\r\n print('no')\r\n exit()\r\n elif q % 2 != 0:\r\n if p == p[::-1]:\r\n print('yes')\r\n exit()\r\n r = r + 1\r\nif s == 1 or q % 2 == 0 and s == 0:\r\n print('yes')\r\nelse:\r\n print('no')", "def isPalindrome(s):\r\n i=0\r\n j=len(s)-1\r\n while(i<j):\r\n if s[i]!=s[j]:\r\n return False\r\n i+=1\r\n j-=1\r\n return True\r\n\r\n\r\ns=input()\r\ni=0\r\nj=len(s)-1\r\nc=0\r\nwhile(i<j):\r\n if s[i]!=s[j]:\r\n c+=1\r\n i+=1\r\n j-=1\r\n# print(s)\r\nif c==1:print(\"YES\")\r\nelif len(s)%2 and isPalindrome(s):print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nl = 0\r\nr = len(s) - 1\r\nnotsame = 0\r\n\r\nwhile (l <= r):\r\n if s[l] != s[r]:\r\n notsame += 1\r\n l += 1\r\n r -= 1\r\nif notsame == 1:\r\n print('YES')\r\nelif notsame == 0 and len(s) % 2 != 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input().strip()\r\n\r\ndef is_palindrome(s):\r\n return s == s[::-1]\r\n\r\nchanges_needed = 0\r\n\r\nfor i in range(len(s) // 2):\r\n if s[i] != s[-i - 1]:\r\n changes_needed += 1\r\n\r\nif changes_needed == 1 or (changes_needed == 0 and len(s) % 2 == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nn=len(s)\r\nx=0\r\nfor i in range(0,n//2):\r\n if s[i]!=s[n-1-i]:\r\n x=x+1\r\nif x==1:\r\n print('YES')\r\nelif x==0 and len(s)%2==1:\r\n print('YES')\r\nelse :\r\n print('NO')\r\n ", "s=input()\r\ns1=s[::-1]\r\nc=0\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]!=s1[i]:\r\n c+=1\r\nif c==2:\r\n print(\"yes\")\r\nelif c==0 and n%2!=0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "x=input()\r\nc=0\r\nn=len(x)\r\nfor i in range(n):\r\n if x[i]!=x[n-i-1]:\r\n c=c+1\r\nif n%2==0 and c==2 or n%2==1 and c<=2 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if s[i]!=s[n-i-1]:\r\n c=c+1\r\nif (n%2==0):\r\n if(c==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif(n%2==1):\r\n if (c==2 or c==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = 0\r\nstring = input()\r\nn = len(string)\r\nfor i in range(n//2) :\r\n if string[i] != string[-(1+i)] :\r\n a = a+1\r\nif a == 1 or ( a == 0 and n%2 != 0) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\") ", "def palin(t):\n n = len(t)\n c = 0\n for i in range(len(t)//2):\n if t[i] != t[n-1]:\n\n c = c+1\n n = n-1\n if c == 1 or (c == 0 and len(t) % 2 != 0):\n return \"YES\"\n else:\n return \"NO\"\n\n\ntxt = input()\n\nprint(palin(txt))\n", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(0,int(n/2)):\r\n if (s[i]!=s[n-i-1]):\r\n c+=1\r\nif (c==1 or c==0 and n%2==1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nc=0\r\np=True\r\nfor i in range(int(len(s)/2)):\r\n if s[i]!=s[len(s)-i-1]:\r\n c+=1\r\n if c>1:\r\n p=False\r\n break\r\nif len(s)%2 == 1 and c == 0:\r\n c += 1\r\nif p and c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nx=0\r\nn=len(s)\r\nfor i in range(0,n//2):\r\n if (s[i]!=s[n-i-1]):\r\n x+=1\r\nif x==1 or x==0 and n%2==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nl = len(s) \r\ncount = 0\r\n\r\nfor i in range(l // 2):\r\n if s[i] != s[l - 1 - i]:\r\n count += 1\r\n\r\nif count <= 1 and l % 2 == 1:\r\n print(\"YES\")\r\nelif count == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\nt=0\r\nfor i in range(len(n)//2):\r\n if(n[i]!=n[len(n)-i-1]):\r\n t+=1\r\nif(t==1 or (t==0 and len(n)%2==1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nfor i in range(len(s)//2):\r\n if(s[i]!=s[-i-1]):\r\n c=c+1\r\nif len(s)%2!=0 and c==0:\r\n c=1\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "str=input()\r\nsv=0\r\nflag=\"NO\"\r\nfor i in range(len(str)//2):\r\n if(str[i]!=str[len(str)-i-1]):\r\n sv+=1\r\nif(sv==1):\r\n flag=\"YES\"\r\nif(sv==0 and (len(str))%2!=0):\r\n flag=\"YES\"\r\nprint(flag)\r\n", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n//2):\r\n if s[i] != s[n-1-i]:\r\n count+=1\r\n \r\nprint('YES' if count==1 or (n%2==1 and count==0) else 'NO')", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n):\r\n if n-i-1>i:\r\n if s[i] != s[n-i-1]:\r\n count=count+1\r\nif count==1:\r\n print(\"YES\")\r\nelif count==0 and n%2==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nk=0\r\nfor i in range(len(s)//2):\r\n if s[i]!=s[-i-1]:\r\n k+=1\r\nprint(\"YES\" if k==1 or k==0 and len(s)%2 else \"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"mike and pallindrome assignment.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1UKLHLyhElh2gBQie3KMmQB5THOjXV63r\n\"\"\"\n\ntext = input()\nn = len(text)\ncount = 0 \nfor i in range(0,int(n/2)):\n if(text[i] != text[n-i-1]):\n count += 1\nif (count == 1 or (count == 0 and n%2 != 0)):\n print('Yes')\nelse:\n print('No')", "\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\nprint('YES'if(lambda a:(sum([int(x!=y)for(x,y)in zip(a,a[::-1])])==2)|(a==a[::-1]and len(a)%2))(input())else'NO')", "s = input()\r\ncount = 0\r\npossible = True\r\nfor i in range(int(len(s) / 2)):\r\n if s[i] != s[len(s) - i - 1]:\r\n count += 1\r\n if count > 1:\r\n possible = False\r\n break\r\n\r\nif len(s) % 2 == 1 and count == 0:\r\n count += 1\r\nif possible and count == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\ncount=0\r\nj=0\r\nl=len(s)\r\nfor i in range(l):\r\n if s[::]==s[::-1]:\r\n if l%2==0:\r\n print('NO')\r\n exit()\r\n elif l%2!=0:\r\n print('YES')\r\n exit()\r\nwhile j <l//2:\r\n if s[j]!=s[l-j-1]:\r\n count+=1\r\n j+=1\r\nif count==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nl=len(s)\r\nx=0\r\nfor i in range(l//2):\r\n if s[i]!=s[l-i-1]:\r\n x=x+1\r\nif x==1 or x==0 and l%2==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input().lower()\r\nb = s[::-1]\r\nif s == b:\r\n if len(s)%2 == 0:\r\n print('no')\r\n else:\r\n print('yes')\r\nelse:\r\n c = 0\r\n for i in range(0,len(s)//2):\r\n if s[i] != s[-(i + 1)]:\r\n c = c + 1\r\n if c == 1:\r\n print('yes')\r\n else:\r\n print('no')\r\n", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n//2):\r\n if s[i] != s[n-1]:\r\n count+=1\r\n n=n-1\r\nif count==1 or (count==0 and len(s)%2 !=0) :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str=input()\r\nL=len(str)\r\ncount=0\r\nfor i in range(L//2):\r\n if str[i]!=str[L-i-1]:\r\n count+=1\r\nif L%2!=0 and count==0:\r\n print(\"YES\")\r\nelif count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nd=s[::-1]\r\nk=0\r\nfor i in range(len(s)):\r\n\tif s[i]!=d[i]:\r\n\t k+=1\r\nif k//2==1 or (k==0 and len(s)%2==1):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s=input()\r\nc=sum(x!=y for x,y in zip(s,s[::-1]))\r\nprint(('NO','YES')[c==2or c==0 and len(s)%2])", "# Mike and palindrome 798A\r\n \r\nMAX_CHAR = 15\r\nMIN_CHAR = 1\r\n \r\ndef is_palindrome(s):\r\n char_removed = 0\r\n s_len = len(s)\r\n \r\n for i in range(s_len // 2):\r\n if(s[i] != s[-1+-i]): char_removed += 1\r\n # print(s[i], s[-1+-i], char_removed)\r\n if(char_removed > 1): return False\r\n return True if char_removed == 1 or char_removed == 0 and s_len%2 != 0 else False\r\n \r\nprint(\"YES\" if is_palindrome(input()) else \"NO\")", "n=input()\r\nn1=n[::-1]\r\ns=0\r\nfor i in range(len(n)//2):\r\n if n[i]!=n1[i]:\r\n s+=1\r\nif s==1 or s==0 and len(n)%2==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\nn = len(s)\r\nc = 0\r\nfor i in range(0,int(n/2)) :\r\n if (s[i] != s[n-i-1]) :\r\n c += 1\r\nif (c == 1 or c == 0 and n%2 == 1) :\r\n print(\"Yes\")\r\nelse :\r\n print(\"NO\") ", "def palindrome(s,n,c=0):\r\n\r\n if len(s) < 2:\r\n if n % 2 == 0:\r\n if c == 1:\r\n return \"YES\"\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n if s[0] != s[-1]:\r\n if c == 1:\r\n return \"NO\"\r\n c += 1\r\n return palindrome(s[1:-1],n,c)\r\n\r\ns = input()\r\nprint(palindrome(s,len(s)))", "s = input()\r\nn = len(s)\r\nc = 0\r\nfor i in range(n//2):\r\n if s[i] != s[-(1+i)] :\r\n c = c + 1\r\nif c == 1 or ( c == 0 and n%2 != 0) :\r\n print(\"Yes\")\r\nelse :\r\n print(\"No\")", "s = input()\r\nlength = len(s)\r\ncount = 0\r\n\r\nfor i in range(length // 2):\r\n if s[i] != s[length - i - 1]:\r\n count += 1\r\n\r\nif count == 1 or (count == 0 and length % 2 != 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")# 1698353939.5814443", "s=input()\r\nn=len(s)\r\nm=0\r\nfor i in range(0,n//2):\r\n if s[i]!=s[-1-i]:\r\n m+=1\r\n a=\"NO\"\r\nif m==1 or (m==0 and n%2==1):\r\n a=\"YES\"\r\nelse:\r\n a=\"NO\"\r\nprint(a)", "import math\r\na = input()\r\nfh = a[:len(a)//2]\r\nsh = a[math.ceil(len(a)/2):]\r\nsh = sh[::-1]\r\ncount = 0\r\nfor i in range(len(fh)):\r\n if fh[i] != sh[i]:\r\n count += 1\r\nif len(a) % 2 != 0 and count == 0:\r\n count += 1\r\nif count > 1 or count == 0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "s=input()\r\nn=len(s)\r\na=0\r\nfor i in range(n//2):\r\n if s[i]!=s[-(1+i)]:\r\n a=a+1\r\nif a==1 or (a==0 and n%2!=0):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "txt= input()\r\nn=len(txt)\r\nt=0\r\nfor i in range(n//2) :\r\n if txt[i]!=txt[n-1-i]:\r\n t+=1\r\nif t==1 or (t==0 and n%2==1):\r\n print('yes')\r\nelse:\r\n print('no')", "data = list(input())\r\ncnt = 0\r\nfor i in range(len(data) // 2):\r\n if data[i] != data[-(i + 1)]:\r\n cnt += 1\r\nif cnt == 1:\r\n print(\"YES\")\r\nelif cnt == 0 and len(data) % 2 == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "b=0\r\n \r\na=input()\r\nn=len(a)\r\nfor i in range(n//2):\r\n if a[i]!=a[-(1+i)]:\r\n b=b+1\r\nif b==1 or (b==0 and n%2!=0):\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "txt=input()\r\nc=0\r\nn=len(txt)\r\nfor i in range(n//2):\r\n if txt[i]!=txt[-i-1]:\r\n c+=1\r\n result='NO'\r\nif c==1 or (c==0 and (n%2)==1):\r\n result='YES'\r\nelse:\r\n result='NO'\r\nprint(result)\r\n \r\n ", "s = input()\nlength = len(s)\ndiff = sum(s[i] != s[~i] for i in range(length // 2))\nif diff == 1 or (diff == 0 and length % 2 == 1):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t \t\t \t \t\t\t \t \t\t", "p = input()\r\nif len(p) == 1:\r\n print(\"YES\")\r\n exit()\r\npalindrome = True\r\ncnt = 1\r\nfor i in range(len(p) // 2):\r\n if p[i] != p[len(p) - 1 - i]:\r\n if cnt > 0:\r\n cnt -= 1\r\n else:\r\n palindrome = False\r\n break\r\nif len(p) % 2 == 1 and cnt == 1:\r\n cnt -= 1\r\nif palindrome and cnt == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = a[::-1]\r\ncount=0\r\nx=len(b)\r\nfor i in range(x):\r\n if(a[i]!=b[i]):\r\n count+=1\r\nif(count==2 or (count==0 and len(a)%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nn=len(s)\r\nfor i in range(0,int(n/2)):\r\n if (s[i]!=s[n-i-1]):\r\n c+=1\r\nif c==1 or c==0 and n%2==1:\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "n=input()\r\ns=len(n)\r\na=0\r\nfor i in range(0,int(s/2)):\r\n if(n[i]!=n[s-i-1]):\r\n a+=1\r\nif (s%2!=0 and a==0 or a==1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nx=len(s)\r\na=0\r\nif x%2==0:\r\n for i in range(x):\r\n if s[i]!=s[-(i+1)]:\r\n a=a+1\r\n if a==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif x%2!=0:\r\n for i in range(x):\r\n if s[i]!=s[-(i+1)]:\r\n a=a+1\r\n if a<=2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "p=input()\r\nn=len(p)\r\nm=0\r\nfor i in range(0,n//2):\r\n if p[i]!=p[-1-i]:\r\n m+=1\r\n a='no'\r\nif m==1 or (m==0 and n%2==1):\r\n a='yes'\r\nelse:\r\n a='no'\r\nprint(a)", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(0,n//2):\r\n if s[i]!=s[n-i-1]:\r\n count+=1\r\nif n%2 and count==0 or count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "text=input()\r\nn=len(text)\r\ncount=0\r\nfor i in range(n//2):\r\n if text[i]!=text[n-1-i]:\r\n count+=1\r\nif n%2!=0 and count==0:\r\n print('YES')\r\nelif count==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "z=input()\r\nx=0\r\nn=len(z)\r\nfor i in range(n//2):\r\n if z[i]!=z[-i-1]:\r\n x=x+1\r\nif x==1 or x==0 and n%2!=0:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "s = input()\nn = len(s)\nres = sum(s[i] != s[n - 1 - i] for i in range(n // 2))\nres = \"YES\" if res == 1 or (res == 0 and n & 1 == 1) else \"NO\"\nprint(res)\n", "s = input().lower()\r\nb = s[::-1]\r\nif s == b:\r\n if len(s)%2 == 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n c = 0\r\n for i in range(0,len(s)//2):\r\n if s[i] != s[-(i + 1)]:\r\n c = c + 1\r\n if c == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "n = input()\r\nc = 0\r\nfor i in range (len(n)//2):\r\n if n[i] != n[-i-1]:\r\n c += 1\r\nif len(n) % 2 != 0 and c == 0:\r\n c = 1\r\nprint(['NO', 'YES'][c == 1])\r\n", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n//2):\r\n if s[i]!=s[n-i-1]:\r\n count += 1\r\nif count==1 or count==0 and n%2!=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = list(input())\r\nc = 0\r\nfor i, j in zip(s, s[::-1]):\r\n if i != j:\r\n c += 1\r\n\r\nprint(\"YES\" if c == 2 or (c == 0 and len(s) % 2 == 1) else \"NO\")", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range(n):\r\n if s[i] == s[n-i-1]:\r\n count=count+1\r\nif n%2!=0 and ((count==n-2) or count==n):\r\n print(\"YES\")\r\nelif n%2==0 and (count==n-2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "x = 0\r\nmike = input()\r\nn = len(mike)\r\nfor i in range(n//2) :\r\n if mike[i] != mike[-(1+i)] :\r\n x = x+1\r\nif x == 1 or ( x == 0 and n%2 != 0) :\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")", "n=input()\r\nc=0\r\nfor i in range(len(n)//2):\r\n\tif n[i]!=n[-i-1]:\r\n\t\tc+=1\r\nif len(n)%2!=0 and c==0:\r\n\tc=1\r\nprint(['NO','YES'][c==1])", "n=input()\r\nx=0\r\nl=len(n)\r\nif n.islower():\r\n for i in range(int(l/2)):\r\n if n[i]!=n[l-i-1]:\r\n x=x+1\r\nif (x==0 and l%2==0) or x>1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\nfrom math import sqrt\r\nimport re\r\nimport itertools\r\nimport sys\r\n\r\n#from google.colab.patches import cv2_imshow\r\n#from matplotlib import pyplot as plt\r\n#sys.setrecursionlimit(10 ** 9)\r\n#print(\"{0:.3f}\".format(ans)) выводит флоат с двумя знаками после запятой\r\ndef is_prime(n):\r\n i = 2\r\n j = 0\r\n while(True):\r\n if(i*i <= n and j != 1):\r\n if(n % i == 0):\r\n j=j+1\r\n i=i+1\r\n elif(j==1):\r\n return False\r\n else:\r\n return True\r\n\r\ndef allCharactersSame(s) :\r\n n = len(s)\r\n for i in range(1, n) :\r\n if s[i] != s[0] :\r\n return False\r\n return True\r\n\r\n\r\n\r\ndef visokosniy(n):\r\n if n % 4 == 0 and n % 100 != 0 or n % 400 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef factorial(n):\r\n if n == 0:\r\n return 1\r\n else:\r\n return n * factorial(n - 1)\r\n\r\n\r\n# для строки\r\ndef isPalindrome(s):\r\n if len(s) <= 1:\r\n return True\r\n else:\r\n return s[0] == s[-1] and isPalindrome(s[1:-1])\r\n\r\n\r\n# ____________________________ACTIVE CODE___________________________\r\nn = input()\r\nc = 0\r\nfor i in range(len(n) // 2):\r\n\tif n[i]!=n[-i-1]:\r\n\t\tc += 1\r\nif len(n) % 2 != 0 and c == 0:\r\n\tc=1\r\nprint(['NO', 'YES'][c == 1])\r\n# ____________________________END ACTIVE CODE________________________\r\n# ____________________________________________________________________\r\n# _________________________NOTES______________________________________\r\n# ____________________________________________________________________\r\n# префикс суммы одной функцией, но нужен импорт import itertools\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# a = list(itertools.accumulate(a))\r\n# for i in range(n):\r\n# print(a[i], end=\" \")\r\n\r\n# ___________________________________________________________________\r\n# сортирует сначала четные потом нечетные\r\n# def sorted_chet_i_nechet(listq):\r\n# list1 = []\r\n# list2 = []\r\n# for i in range(len(listq)):\r\n# if listq[i] % 2 == 0:\r\n# list2.append(listq[i])\r\n# elif listq[i] % 2 == 1:\r\n# list1.append(listq[i])\r\n# list1.sort()\r\n# list2.sort()\r\n# listq = list2 + list1\r\n# return listq\r\n# _______________________________________________________________________\r\n# сортирует сначала нечетные потом четные\r\n# def sorted_nechet_i_chet(listq):\r\n# list1 = []\r\n# list2 = []\r\n# for i in range(len(listq)):\r\n# if listq[i] % 2 == 0:\r\n# list2.append(listq[i])\r\n# elif listq[i] % 2 == 1:\r\n# list1.append(listq[i])\r\n# list1.sort()\r\n# list2.sort()\r\n# listq = list1 + list2\r\n# return listq", "text=input()\r\ncount=0\r\nn=len(text)\r\nfor i in range(n):\r\n if text[i]!=text[n-i-1]:\r\n count=count+1\r\nif n%2==0 and count/2==1 :\r\n print(\"YES\")\r\nelif n%2==1 and count/2<=1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ni = 0\r\nj = len(s)-1\r\nn = len(s)\r\nc=0\r\nx = s[::-1]\r\nwhile(i<j):\r\n if s[i]!=s[j]:\r\n c+=1\r\n i+=1\r\n j-=1\r\nif x==s and n%2==0:\r\n print(\"NO\")\r\nelif x==s and n%2==1:\r\n print(\"YES\")\r\nelif(c==1):\r\n print(\"YES\")\r\nelif c>1:\r\n print(\"NO\")", "str = input()\r\nc = 0\r\nfor i in range(0, len(str)//2):\r\n if str[i] != str[len(str)-i-1]:\r\n c+=1\r\nif c == 1 or (c == 0 and len(str)%2!=0) :\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nt=len(s)\r\nx=0\r\nfor i in range(t//2):\r\n if s[i]!=s[t-1-i]:\r\n x+=1\r\n \r\nif x==1 or (t%2!=0 and x==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nl=len(s)\r\np=0\r\nfor i in range(l):\r\n if (s[i]==s[l-i-1]):\r\n p=p+1\r\nif p==l-2:\r\n print(\"YES\")\r\nelif l==p and l%2!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nn = len(s)\r\ncnt = 0\r\nfor i in range(n//2):\r\n if s[i] != s[n-i-1]:\r\n cnt += 1\r\nif cnt == 1 or (cnt == 0 and n % 2 == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Mike and Palindrome\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Wwph1KmBpH3JL8qWxlV4LqnR2YZmnAik\n\"\"\"\n\nn = input()\nc = 0\nfor i in range (len(n)//2):\n if n[i] != n[-i-1]:\n c += 1\nif len(n) % 2 != 0 and c == 0:\n c = 1\nprint(['NO', 'YES'][c == 1])", "n=input()\r\nl=len(n)\r\nx=0\r\nfor i in range(l//2):\r\n if n[i]!=n[l-i-1]:\r\n x+=1\r\nif x==1 or x==0 and l%2==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\n# Online Python - IDE, Editor, Compiler, Interpreter\n\ns = input()\nn = len(s)\ncount = 0\nfor i in range(n//2):\n if s[i] != s[n-i-1]:\n count += 1\nif count == 1 or (count == 0 and n % 2 == 1):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "string = input()\r\nunique = list(set(string))\r\nif string == string[::-1] and len(string) % 2 == 0:\r\n print(\"NO\")\r\nelif string == string[::-1] and len(string) % 2 != 0:\r\n print(\"YES\")\r\nelse:\r\n flag = False\r\n for i in range(len(unique)):\r\n for j in range(len(string)):\r\n temp = string.replace(string[j], unique[i], 1)\r\n if temp == temp[::-1]:\r\n flag = True\r\n print(\"YES\")\r\n break\r\n if flag:\r\n break\r\n if not flag:\r\n print(\"NO\")", "test = input()\r\nl = len(test)\r\na = 0\r\nfor i in range(l):\r\n if test[i] == test[l-i-1]:\r\n a += 1\r\n\r\nif l%2 == 0:\r\n if a == l-2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif l%2 != 0:\r\n if a== l-2 or a ==l:\r\n print('YES')\r\n else:\r\n print('NO')", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(0, int(n/2)):\r\n if(s[i] != s[n-i-1]):\r\n count+=1\r\nif(count == 1 or (count == 0 and n%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nfrom itertools import combinations\r\nimport time\r\n\r\ns = str(input())\r\nif len(s) % 2 == 1 and s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n k = 0\r\n ss = s[::-1]\r\n for i in range(len(s)):\r\n if s[i] != ss[i]:\r\n k+=1\r\n if k == 2:\r\n print('YES')\r\n else:\r\n print(\"NO\")", "a=input()\r\nb=len(a)\r\nc=0\r\nfor i in range(b):\r\n if a[i]!=a[b-i-1]:\r\n c=c+1\r\nif (b%2==0):\r\n if(c==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif(b%2==1):\r\n if (c==2 or c==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\na = s\r\nb = s[::-1]\r\ntemp = 2\r\n \r\nfor i in range (len(s)):\r\n if (a[i] != b[i]):\r\n temp -= 1\r\n \r\nif ((a == b) and (len(s)%2 != 0)):\r\n print(\"YES\")\r\nelif (temp < 0 or (a == b)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\t \t", "s=input()\r\nl=len(s)\r\nm=0\r\nfor i in range(l//2):\r\n if s[i]!=s[l-i-1]:\r\n m+=1\r\nif l%2!=0 and m==0:\r\n print(\"YES\")\r\nelif m==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\npointer1=0\r\npointer2=-1\r\ncounter=0\r\nfor i in range(len(a)//2):\r\n if a[pointer1]==a[pointer2]:\r\n counter+=1\r\n pointer1+=1\r\n pointer2-=1\r\n\r\nif len(a)%2==0 and counter==(len(a)//2)-1:\r\n print(\"YES\")\r\nelif len(a)%2>0 and counter==(len(a)//2) or counter==(len(a)//2)-1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "def palindrome(s):\r\n n = len(s)\r\n cnt = 0\r\n for i in range(n // 2):\r\n if s[i] != s[n - i - 1]:\r\n cnt += 1\r\n if cnt == 1 or (cnt == 0 and n % 2 == 1):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\ns = input().strip()\r\nprint(palindrome(s))\r\n", "text = input()\r\ncount = 0\r\n\r\nfor i in range(len(text)//2):\r\n if text[i] != text[-1-i]:\r\n count += 1\r\n\r\nif (count == 1) or (count == 0 and len(text)%2 != 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=len(s)\r\nt=0\r\nfor i in range(l//2):\r\n if s[i]!=s[l-i-1]:\r\n t=t+1\r\nif l%2!=0 and t==0:\r\n print(\"yes\")\r\nelif t==1:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "t=input()\r\nr=t[::-1]\r\ncount=0\r\nfor i in range (len(r)):\r\n if(t[i]!=r[i]):\r\n count+=1\r\nif (count==2 or(count==0 and len(t)%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "count = 0\r\ns = str(input())\r\nfor i in range(len(s)//2):\r\n if s[0+i] != s[-1-i]:\r\n count += 1\r\nif count == 1 or count == 0 and len(s)%2 == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "text = input()\r\na = text[::-1]\r\nb=0\r\nfor i in range(len(a)):\r\n if(text[i]!=a[i]):\r\n b+=1\r\nif(b==2 or (b==0 and len(text)%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str = input()\r\nc=0\r\nfor i in range(0,len(str)//2):\r\n if str[i] != str[len(str)-i-1]:\r\n c=c+1\r\nif c==1 or (c==0 and len(str)%2 !=0):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nans = 0\r\nq = s[::-1]\r\nn = len(s) // 2\r\n\r\nfor i in range(n):\r\n if s[i] != q[i]:\r\n ans += 1\r\n\r\nif ans == 1 or (ans == 0 and len(s) % 2 == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nm=len(s)\r\nc=0\r\nfor i in range(m//2):\r\n if s[i] != s[m-(1+i)]:\r\n c+=1\r\nif c == 1 or c==0 and m%2!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "text= input()\r\ncount = 0\r\nn=len(text)\r\nfor i in range(n // 2):\r\n if text[i] != text[n - i - 1]:\r\n count += 1\r\nif count==0 and n%2==1:\r\n print(\"YES\")\r\nelif count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nn = len(s)\r\nk=0\r\nfor i in range(n//2):\r\n if s[i]!=s[-i-1]:\r\n k+=1\r\nif( k==1 or k==0 and n%2 ):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nc=sum(x!=y for x,y in zip(s,s[::-1]))\r\nif c == 2 or (c == 0 and len(s) % 2 == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input().strip()\r\nchange = 0\r\nfor i in range(len(s) // 2):\r\n if s[i] != s[-(i + 1)]:\r\n change += 1\r\nif change == 1 or (change== 0 and len(s) % 2 == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "li = list(input())\r\nr , l , c = len(li)-1 , 0 , 0\r\nt = False\r\nwhile r > l :\r\n if li[r] != li[l]:c += 1\r\n r -= 1 ; l += 1\r\nif c == 0 and len(li)%2==1 : t = True\r\nif c == 1 or t : print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n", "n=input()\r\nm=0\r\nl=len(n)\r\nfor i in range(l//2):\r\n if n[i]!=n[l-i-1]:\r\n m=m+1\r\nif m==1 or m==0 and l%2==1:\r\n print('yes')\r\nelse:\r\n print('no')", "a=input()\r\ncount=0\r\nfor i in range((len(a)//2)):\r\n if a[i]!=a[-1-i]:\r\n count+=1\r\nif (count==1) or (count==0 and (len(a)%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "A=input()\r\nB=int(len(A)/2)\r\nc=0\r\nfor i in range (0,B):\r\n if(A[i]!=A[-(i+1)]):\r\n c+=1\r\nif (c==1):\r\n print(\"YES\")\r\nelif(c==0 and len(A)%2==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "# -*- coding: utf-8 -*-\n\"\"\"PSAT_assignemnt-5_C_Mike_and_Palindrome.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ufF9rMcXbcqVpnsBiybAgDmPMAV7m340\n\"\"\"\n\ntext=input()\nn=len(text)\nresult=\"YES\"\ntext_diff_cnt=0\nfor i in range(n//2):\n if(text[i] != text[(n-1)-i]):\n text_diff_cnt=text_diff_cnt+1\n\nif ( (text_diff_cnt > 1) or (text_diff_cnt ==0) ):\n result=\"NO\"\n\nif ((n%2==1) and (text_diff_cnt ==0)):\n result=\"Yes\"\n\nprint(result)", "str=input()\r\nL=len(str)\r\ncount=0 \r\nfor i in range (L//2):\r\n if str[i]!=str[L-i-1]:\r\n count+=1\r\nif L%2!=0 and count==0:\r\n print(\"yes\")\r\nelif count==1:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n//2):\r\n if s[i]!=s[-(1+i)]:\r\n c=c+1\r\nif c==1 or (c==0 and n%2!=0):\r\n print(\"yes\")\r\nelse:\r\n print('no')\r\n ", "word = input()\r\nwL = len(word)\r\nif wL == 1: \r\n print(\"YES\")\r\nelse:\r\n c = sum(1 for x in range(wL // 2) if word[x] != word[wL-x-1])\r\n print([\"NO\",\"YES\"][(c == 1) or (c == 0 and wL % 2 == 1)])", "def main(s):\r\n r=''\r\n r=s[::-1]\r\n count=0\r\n if(r==s):\r\n if(len(s)%2==0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n for i in range(len(s)):\r\n if(s[i]!=r[i]):\r\n count+=1\r\n if(count==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\nif __name__== \"__main__\" :\r\n s=input()\r\n main(s)", "s=input()\r\nl=0\r\nfor i in range(len(s)//2):\r\n if s[i]!=s[len(s)-1-i]:\r\n l+=1\r\nif (len(s)%2==0 and l==0) or l>1:\r\n print('NO')\r\nelse:\r\n print('YES')", "a=input()\r\nl=len(a)\r\nc=0\r\nfor i in range(l//2):\r\n if a[i] != a[-(1+i)]:\r\n c = c+1\r\nif c == 1 or (c==0 and l%2 !=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nc = 0\r\nfor i in range(len(s)//2):\r\n if(s[i] != s[-1-i]):\r\n c += 1\r\nif(c == 1):\r\n print('YES')\r\nelif(len(s)%2 == 1 and c == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "str=input()\r\nl=len(str)\r\ncount=0\r\nfor i in range (0,l//2):\r\n if str[i]!=str[l-i-1]:\r\n count=count+1\r\n if count>1:\r\n break\r\nif count==1 or count==0 and l%2!=0:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n ", "text=input()\r\ncount=0\r\nfor i in range(len(text)//2):\r\n if text[i]!=text[-1-i]:\r\n count+=1\r\n\r\nif (count==1) or (count==0 and len(text)%2!=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input() [::-1]\r\nn = len(s)\r\nc =0\r\nif 1<= n<= 15 :\r\n for i in range(n):\r\n if s[i]!=s[n-i-1]:\r\n c = c+1\r\n \r\nif c== 2 :\r\n print('YES')\r\nelif c==0 and n%2!=0:\r\n print('YES')\r\nelse :\r\n print('NO')", "#w6-mike\r\n\r\ns=input()\r\nx=0\r\nfor i in range(len(s)//2):\r\n if s[i]!=s[len(s)-1-i]:\r\n x+=1\r\n \r\nif x==1 or (len(s)%2!=0 and x==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "# Mike and Palindrome\r\n\r\na = str(input())\r\nb = a[::-1]\r\n\r\nc = len(a)\r\ncount = 0\r\n\r\nfor i in range(c):\r\n if (a[i]!=b[i]):\r\n count += 1\r\n\r\nif(count==2 or (count==0 and c%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=len(s)\r\nc=l\r\nmid=int(l/2)\r\ncount=0\r\ntemp=\"YES\"\r\nfor i in range(mid):\r\n if(s[i]==s[l-1]):\r\n count+=1\r\n l-=1\r\nif(c%2==0):\r\n if(count==mid-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if(count>=mid-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\nstts = True\na = s\nb = s[::-1]\ntemp = 2\n\nfor i in range (len(s)):\n if (a[i] != b[i]):\n temp -= 1\n\nif ((a == b) and (len(s)%2 != 0)):\n print(\"YES\")\nelif (temp < 0 or (a == b)):\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 \t\t\t", "a = input()\r\nx = 0\r\nfor i in range(len(a)//2):\r\n if a[i] !=a[len(a)-1-i]:\r\n x+=1\r\nif (len(a)%2==0 and x==0) or x>1:\r\n print('NO')\r\nelse :\r\n print('YES')", "s = input()\r\nn = len(s)\r\ncount = 0\r\nfor i in range(n) :\r\n if s[i] == s[n-i-1] :\r\n count = count + 1\r\nif n%2 != 0 and ((count == n-2) or (count == n)) :\r\n print(\"YES\")\r\nelif n%2 == 0 and (count == n-2) :\r\n print(\"YES\")\r\nelse : \r\n print(\"NO\")", "s = input()\r\nn = len(s)\r\ncnt = 0\r\n\r\nfor i in range(n // 2):\r\n if s[i] != s[n - i - 1]:\r\n cnt += 1\r\n\r\nif cnt == 1:\r\n print(\"YES\")\r\nelse:\r\n for i in range(n):\r\n for c in 'abcdefghijklmnopqrstuvwxyz':\r\n if c != s[i]:\r\n t = list(s)\r\n t[i] = c\r\n if ''.join(t) == ''.join(t[::-1]):\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nn = len(s)\r\n\r\n\r\ndef is_palindrome(string):\r\n return string == string[::-1]\r\n\r\n\r\nif n % 2 == 0:\r\n k = sum(s[i] != s[n - i - 1] for i in range(n // 2))\r\n print(\"YES\" if k == 1 else \"NO\")\r\nelse:\r\n k = sum(s[i] != s[n - i - 1] for i in range(n // 2))\r\n print(\"YES\" if k <= 1 else \"NO\")\r\n", "data = input()\r\n\r\ndif = 0\r\n\r\ndata_len = len(data)\r\n\r\nfor i in range(data_len // 2):\r\n if data[i] != data[-1 - i]:\r\n dif += 1\r\n if dif == 2:\r\n break\r\n\r\nif dif == 1 or (data_len % 2 == 1 and dif == 0):\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "s = input().strip()\r\nn = len(s)\r\ndiff_count = 0\r\nfor i in range(n//2):\r\n if s[i] != s[n-i-1]:\r\n diff_count += 1\r\n if diff_count > 1:\r\n print(\"NO\")\r\n exit()\r\nif diff_count == 0:\r\n if n % 2 == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s=input()\r\nn=len(s)\r\nok=0\r\nfor i in range(n//2):\r\n if s[i]!=s[n-i-1]:\r\n ok+=1\r\n\r\nif ok>1:\r\n print('NO')\r\nelif ok==0:\r\n if n%2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "s = input()\r\nn = len(s)\r\nx=0\r\nl = 0\r\nr = n-1\r\nans = 'NO'\r\nfor i in range(n//2):\r\n if s[l]!=s[r]:\r\n x = x + 1\r\n l = l+1\r\n r = r-1\r\nif x==1:\r\n ans='YES'\r\nelif x==0 and n%2!=0:\r\n ans='YES'\r\nprint (ans)", "s = input()\r\nl = len(s)\r\ncount = 0\r\nfor i in range(l):\r\n if s[i] != s[(l-1)-i]:\r\n count +=1\r\n else:\r\n count += 0\r\nif(count//2) ==1 or count == 0 and l %2!=0:\r\n print (\"YES\")\r\nelif count>=2:\r\n print (\"NO\")\r\nelse:\r\n print (\"No\")", "n = input()\r\nx=len(n)\r\ncount=0\r\nfor i in range(x//2):\r\n if n[i]!=n[x-i-1]:\r\n count+=1\r\nif(count==1):\r\n print(\"YES\")\r\nelif(count==0 and len(n)%2==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=len(s)\r\na=0\r\nfor i in range(l//2):\r\n if s[i]!=s[l-i-1]:\r\n a=a+1\r\nif a==1 or a==0 and l%2==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "text = input()\r\nreverse = text[::-1]\r\nn = len(reverse)\r\ncount = 0\r\nfor i in range (n) :\r\n if (text[i]!=reverse[i]) :\r\n count+=1\r\nif(count==2 or (count==0 and n%2!=0)):\r\n print('yes')\r\nelse :\r\n print('no')", "text=input()\r\nl=len(text)\r\nm=l//2\r\na=0\r\nfor i in range(m):\r\n if text[i]!=text[l-i-1]:\r\n a=a+1\r\nif a==0 and l%2==0:\r\n print(\"NO\")\r\nelif a==0 and l%2==1:\r\n print(\"YES\")\r\nelif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nn = len(s)\r\nmismatch = 0\r\nfor i in range(0, n//2):\r\n if(s[i] != s[n-i-1]):\r\n mismatch +=1\r\nif(mismatch == 1 or (mismatch == 0 and n%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "txt=input()\r\nl=len(txt)\r\ncount=0\r\nfor i in range(l//2):\r\n if txt[i]!=txt[l-i-1]:\r\n count=count+1\r\nif count==0 and l%2!=0:\r\n print(\"YES\")\r\nelif count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input(); count = 0\r\nfor i in range(len(x) // 2):\r\n if x[i] != x[~i]:\r\n count +=1\r\nif count == 1 or (count == 0 and len(x) % 2 == 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=(input())\r\nc=0\r\nfor i in range (len(s)//2):\r\n if s[i]!=s[-1-i]:\r\n c=c+1\r\n \r\nif (len(s)%2!=0 and c==0 )or c==1:\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")", "a = input()\r\nb = a[ : :-1]\r\nc = 0\r\nfor i in range(len(a)) :\r\n if ( a[i].lower() != b[i].lower() ):\r\n c += 1\r\nif c == 2 :\r\n print('YES')\r\nelif c == 0 and len(a)%2 != 0 :\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nx = len(n)\r\np = 0\r\nif x % 2 == 0:\r\n for i in range(x//2):\r\n if n[i] != n[-i-1]:\r\n p = p + 1\r\n if p == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nif x % 2 != 0:\r\n for i in range(x//2):\r\n if n[i] != n[-i-1]:\r\n p = p + 1\r\n if p == 1 or p == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "s=input()\r\nc=0\r\nfor i in range(len(s)//2):\r\n if s[i]!=s[-i-1]:\r\n c+=1\r\nif c==1 or c==0 and len(s)%2: \r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "text=input()\r\nreverse=text[::-1]\r\ncount=0\r\nfor i in range (len(reverse)):\r\n if(text[i]!=reverse[i]):\r\n count+=1\r\nif (count==2 or(count==0 and len(text)%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=input()\r\ncount=0\r\nn=len(t)\r\nif t[::1]==t[::-1]:\r\n if n%2==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in range(0,n//2):\r\n if t[i]!=t[n-1-i]:\r\n count=count+1\r\n else:\r\n continue\r\n if count==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "text = input()\r\ntxet = text[::-1]\r\nk = 0\r\nfor i in range(len(text)//2):\r\n if text[i] != txet[i]:\r\n k += 1\r\nif k == 1 or (k == 0 and len(text) % 2 == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\n\nerros = 0\n\nfor l, r in zip(s, reversed(s)):\n if l != r:\n erros += 1\nerros = erros / 2\nif erros == 1 or erros == 0 and len(s) % 2 == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t\t \t \t\t\t\t\t\t\t\t", "t = input()\r\nn = len(t)\r\nx = 0\r\nfor i in range(n//2) :\r\n if t[i] != t[-(1+i)] :\r\n x = x+1\r\nif x == 1 or ( x == 0 and n%2 != 0) :\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")", "t=str(input())\r\nn=len(t)\r\ncount=0\r\nfor i in range(n//2):\r\n if t[i]!=t[n-1]:\r\n count+=1\r\n n-=1\r\nif count==1 or (len(t)%2!=0 and count==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\ndef solve(): \r\n # k=int(input())\r\n st=input()\r\n n=len(st)\r\n c=0\r\n for i in range(math.ceil(n/2)):\r\n if st[i]!=st[n-i-1]:\r\n c+=1\r\n \r\n\r\n if c>=2:\r\n print(\"NO\")\r\n elif c==1:\r\n print(\"YES\")\r\n elif c==0 and n%2==1:\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "s=input()\r\nn=len(s)\r\nk=0\r\nfor i in range(n//2):\r\n if s[i]!=s[-i-1]:\r\n k+=1\r\nif(k==1 or k==0 and n%2):\r\n print('yes')\r\nelse:\r\n print(\"no\")", "#!/usr/bin/env python3\r\n# https://codeforces.com/contest/798/problem/A\r\nword = input().strip()\r\ni = 0\r\nj = len(word) - 1\r\ncount = 0\r\nwhile i <= j:\r\n if word[i] != word[j]:\r\n count +=1\r\n i += 1\r\n j -= 1\r\nif count == 1 or count == 0 and len(word) % 2 == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nn = len(s)\r\nflag = True\r\nans = 0\r\nfor i in range(n // 2):\r\n if s[i] != s[n - i - 1]:\r\n flag = False\r\n ans += 1\r\nif flag:\r\n if n % 2 == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if ans == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s=input()\r\ncount=0\r\nl=len(s)\r\nfor i in range(l):\r\n if s[i]==s[l-1-i]:\r\n continue\r\n else:\r\n count=count+1\r\nif l%2==0:\r\n if count<=2 and count!=0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelif l%2!=0:\r\n if count<=2:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n", "if __name__=='__main__':\r\n s=input()\r\n count=0\r\n possible=True\r\n for i in range(int(len(s)/2)):\r\n if s[i]!=s[len(s)-i-1]:\r\n count+=1\r\n if count>1:\r\n possible=False\r\n break\r\n if len(s)%2==1 and count==0:\r\n count+=1\r\n if possible and count==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "s,res,c=input(),\"YES\",0\r\nfor x in range(len(s)//2) : \r\n if s[x]!=s[len(s)-1-x] : c+=1\r\n if c>1 : \r\n res=\"NO\"\r\n break\r\nif c==0 and len(s)%2==0 : print(\"NO\")\r\nelse:print(res)\r\n \r\n\r\n", "s = input()\nd = 0\nfor i in range(len(s) // 2):\n if s[i] != s[len(s) - i - 1]:\n d += 1\n\nprint(\"YES\" if (d == 1 and len(s) % 2 == 0) or (d in (0, 1) and len(s) % 2 == 1) else \"NO\")\n \t \t \t\t\t \t \t \t \t \t \t", "s=input()\r\nn=len(s)\r\nc=0\r\nfor i in range(n):\r\n if (s[i]!=s[n-i-1]): \r\n c=c+1\r\nif c//2==1 or(c==0 and n%2==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nn=len(s)\r\nf=0\r\nfor i in range(n//2):\r\n if s[i]!=s[n-i-1]:\r\n f=f+1\r\n \r\nif n%2==0:\r\n if f==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif n%2!=0:\r\n if f==0 or f==1:\r\n print('YES')\r\n else:\r\n print('NO')", "a=list(input())\r\nb=a[::-1]\r\nn=len(a)\r\nc=0\r\nfor i in range(n):\r\n if a[i]!=b[i]:\r\n c=c+1\r\n\r\nif n%2==0: \r\n if c==2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if c==0:\r\n print('YES')\r\n elif c==2:\r\n print('YES')\r\n else:\r\n print('NO')", "a=input()\r\nb=a[::-1]\r\ncount=0\r\nl=len(b)\r\nfor i in range(l):\r\n if(a[i]!=b[i]):\r\n count+=1\r\nif(count==2 or (count==0 and len(a)%2!=0)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nrev = s[::-1]\r\nn=len(s)\r\ncount = 0\r\nif n>0 and n<=15:\r\n for i in range(n):\r\n if s[i]!=rev[i]:\r\n count=count + 1\r\nif count==2:\r\n print('YES')\r\nelif s == rev and n%2!=0 :\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ndif = 0\r\nfor i in range(len(s)//2):\r\n if s[i]!=s[-(i+1)]:\r\n dif+=1\r\nif dif == 1 or (dif == 0 and len(s)%2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t=str(input())\r\nr=t[::-1]\r\ncount=0\r\nfor i in range(len(t)):\r\n if t[i]!=r[i]:\r\n count+=1\r\nif len(t)%2==0 and (count==1 or count==2):\r\n print(\"YES\")\r\nelif len(t)%2!=0 and (count<=2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nl = len(a)\r\nd = 0\r\nc = 0\r\nfor i in range(l):\r\n if a[i] == a[l - i - 1]:\r\n d = d + 1\r\n elif a[i] != a[l - i - 1]:\r\n c = c + 1\r\nif c == 2:\r\n print(\"YES\")\r\nelif d == l and l % 2 != 0:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "s=input()\r\nn=len(s)\r\ncount=0\r\nfor i in range (n):\r\n if s[i]!=s[n-i-1]:\r\n count=count+1\r\nif n%2==0:\r\n if count==2:\r\n print('yes')\r\n else:\r\n print('no')\r\nelif n%2==1:\r\n if count==2 or count==0:\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\n\r\n\r\n\r\n\r\n" ]

[ "from sys import stdin\r\n\r\n\r\ndef main():\r\n\tn = int(stdin.readline())\r\n\tar = list(map(int, stdin.readline().split()))\r\n\tcheck = [False] * n\r\n\tans_list = []\r\n\tfor i in range(n):\r\n\t\tif not check[i]:\r\n\t\t\tcount = 0\r\n\t\t\tcurr = i\r\n\t\t\twhile not check[curr]:\r\n\t\t\t\tcheck[curr] = True\r\n\t\t\t\tcount += 1\r\n\t\t\t\tcurr = ar[curr] - 1\r\n\t\t\tans_list.append(count)\r\n\t\r\n\tans_list.sort(reverse=True)\r\n\tans = 0\r\n\tif len(ans_list) >= 2:\r\n\t\tans += (ans_list[0] + ans_list[1]) ** 2\r\n\t\tfor i in range(2, len(ans_list)):\r\n\t\t\tans += ans_list[i] ** 2\r\n\telse:\r\n\t\tans = ans_list[0] ** 2\r\n\tprint(ans)\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()\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\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/8 09:09\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nP = [0] + [int(x) for x in input().split()]\r\n\r\n\r\nLN = []\r\n\r\nC = []\r\nvis = [0] * (N+1)\r\nfor i in range(1, N+1):\r\n if vis[i]:\r\n continue\r\n vis[i] = 1\r\n c = [i]\r\n while True:\r\n i = P[i]\r\n if not vis[i]:\r\n vis[i] = 1\r\n c.append(i)\r\n else:\r\n m = c.index(i)\r\n C.append((len(c), c, i, m, len(c)-m))\r\n break\r\n\r\n\r\nC.sort(reverse=True)\r\n\r\nif len(C) == 1:\r\n print(N*N)\r\n exit(0)\r\n\r\na = C[0]\r\nb = C[1]\r\nans = (a[0] + b[0]) ** 2\r\n\r\nfor c in C[2:]:\r\n _, _, _, l, n = c\r\n ans += n**2 + (2*n+l+1)*l//2\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\np=[0]+list(map(int,input().split()))\r\nvis=[0]*(n+1)\r\npart=[]\r\nfor i in range(1,n+1):\r\n if not vis[i]:\r\n tot=0\r\n x=i\r\n while not vis[x]:\r\n tot+=1\r\n vis[x]=1\r\n x=p[x]\r\n part.append(tot)\r\npart.sort(reverse=True)\r\nif len(part)==1:\r\n print(n*n)\r\nelse:\r\n ans=(part[0]+part[1])**2\r\n for x in part[2:]:\r\n ans+=x*x\r\n print(ans)", "def dfs(u):\r\n c=0\r\n while p[u]:\r\n c+=1\r\n p[u],u=0,p[u]\r\n return c\r\n\r\na=lambda:list(map(int,input().split()))\r\nn=a() #get n first though is useful\r\np=[0]+a()\r\nval=sorted([dfs(u) for u in p])\r\nprint(sum(list(map(lambda x:x*x,val)))+2*val[-1]*val[-2])\r\n#get most 2 and merge a^2+b^2 =(a+b)^2 - a*b*2", "n = int(input())\r\na = [i for i in map(lambda x: int(x) - 1, input().split())]\r\nvisited, comp = [False] * n, 0\r\nnmbs = []\r\nfor i, v in enumerate(a):\r\n if not visited[i]:\r\n t = i\r\n while not visited[t]:\r\n visited[t] = True\r\n comp += 1\r\n t = a[t]\r\n nmbs.append(comp)\r\n comp = 0\r\nnmbs.sort()\r\nnmbs.reverse()\r\nif len(nmbs) == 1:\r\n print(nmbs[0] * nmbs[0])\r\n exit(0)\r\nnmbs[0], nmbs[1] = nmbs[0] + nmbs[1], 0\r\nprint(sum(x * x for x in nmbs))\r\n", "n = int(input())\nline2 = input().split()\ndestination = []\nvisited = []\nfor i in range(n):\n destination.append(int(line2[i])-1)\n visited.append(0)\n\nmaxs = [0,0]\nconvenience = 0\nfor i in range(n):\n if visited[i] == 0:\n visited[i] = 1\n cycle_len = 1\n current_node = i\n while destination[current_node] != i:\n current_node = destination[current_node]\n visited[current_node] = 1 \n cycle_len += 1\n convenience += cycle_len**2\n if cycle_len > min(maxs):\n maxs = [cycle_len,max(maxs)]\n \nconvenience += 2*maxs[0]*maxs[1]\nprint(convenience)\n", "n = int(input())\np = list(map(int,input().split()))\nvis = [False]*n\nnv = 0\nm = 0\ncyc = []\nwhile nv<n:\n while vis[m]:\n m+=1\n temp = []\n c = m\n while not vis[c]:\n temp.append(c)\n nv += 1\n vis[c] = True\n c = p[c]-1\n cyc.append(temp)\nsize = []\nfor i in range(len(cyc)):\n size.append(len(cyc[i]))\nsize = sorted(size)\nif len(size)==1:\n print(size[0]*size[0])\nelse:\n out = (size[len(size)-1]+size[len(size)-2])*(size[len(size)-1]+size[len(size)-2])\n for i in range(len(size)-2):\n out += size[i]*size[i]\n print(out)\n\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\n\ndef dfs(i):\n global vis,N,P\n l = [i]\n num = 0\n while l:\n x = l.pop()\n if vis[x]==1:continue\n vis[x] = 1\n num+=1\n for y in P[x]:\n if vis[y]==1:continue\n l.append(y)\n return num\n\nN = int(input())\nA = list(map(int,input().split()))\nP = [[] for _ in range(N)]\n\nfor i in range(N):\n P[A[i]-1].append(i)\n P[i].append(A[i]-1)\n\nnum = 0\nans = []\nvis = [0]*N\nfor i in range(N):\n if vis[i]==1:continue\n ans.append(dfs(i))\n\nans.sort()\nif len(ans)>=2:\n num+=(ans.pop()+ans.pop())**2\n\nfor i in ans:\n num+=i**2\nprint(num)\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nc = []\r\nvisited = [0]*(n+1)\r\n \r\nfor i in range(n):\r\n if visited[p[i]] == 0:\r\n ct = 1\r\n t = p[p[i]-1]\r\n visited[p[i]] = 1\r\n \r\n while t != p[i]:\r\n visited[t] = 1\r\n t = p[t-1]\r\n ct += 1\r\n \r\n c.append(ct)\r\n \r\nc.sort()\r\nif len(c) == 1:\r\n print(c[0]**2)\r\nelse:\r\n aux = c[-1] + c[-2]\r\n c = c[:-2] + [aux]\r\n print(sum(i**2 for i in c))", "n = int(input())\r\n*a, = map(int, input().split())\r\nvis = set(a)\r\nans = []\r\nwhile vis:\r\n v = vis.pop()\r\n cur = 1\r\n while a[v - 1] in vis:\r\n v = a[v - 1]\r\n vis.remove(v)\r\n cur += 1\r\n ans.append(cur)\r\ns = sum(i ** 2 for i in ans)\r\nif len(ans) == 1:\r\n print(s)\r\n exit()\r\nans.sort()\r\nprint(s + 2 * ans[-1] * ans[-2])", "# -*- 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\nn = int(input())\r\ntabp = list(map(int,input().split(' ')))\r\nnMax = 0\r\nnSecondMax = 0\r\ncounter = 1\r\nVisited = set([])\r\ni = 0\r\nconvenience = 0\r\nwhile i < n:\r\n Visited.add(i)\r\n j = tabp[i]-1\r\n counter = 1\r\n while j != i:\r\n counter += 1\r\n Visited.add(j)\r\n j = tabp[j]-1\r\n if counter >= nMax:\r\n nSecondMax = nMax\r\n nMax = counter\r\n elif counter >= nSecondMax:\r\n nSecondMax = counter\r\n convenience += counter*counter\r\n for k in range(i+1,n+1):\r\n if k not in Visited:\r\n i = k\r\n break\r\n \r\nif nSecondMax > 0:\r\n convenience = convenience - nSecondMax*nSecondMax - nMax*nMax + (nSecondMax+nMax)*(nSecondMax+nMax)\r\n\r\nprint(convenience)", "r = lambda: map(int, input().split())\r\n\r\ndef main():\r\n\tn, = r()\r\n\tp = [x - 1 for x in r()]\r\n\tvis = [False] * n\r\n\tlens = []\r\n\tfor i in range(n):\r\n\t\tif vis[i]:\r\n\t\t\tcontinue\r\n\t\tvis[i], cc = True, 1\r\n\t\tj = p[i]\r\n\t\twhile not vis[j]:\r\n\t\t\tvis[j] = True\r\n\t\t\tcc += 1\r\n\t\t\tj = p[j]\r\n\t\tlens.append(cc)\r\n\tlens.sort()\r\n\tif len(lens) > 1:\r\n\t\tlens[-2] += lens[-1]\r\n\t\tlens.pop()\r\n\tprint(sum(x * x for x in lens))\r\n\r\nmain()", "n=int(input())\r\np=[int(x) for x in input().split()]\r\np.insert(0,-3)\r\nmax1,max2=0,0\r\nused=[0]*(n+1)\r\ncount=0\r\nfor i in range (1, n+1):\r\n m=0\r\n v=i\r\n while used[p[v]]==0:\r\n used[p[v]]=1\r\n v=p[v]\r\n m+=1\r\n if m>max2:\r\n max2=m\r\n if max2>max1:\r\n max2,max1=max1,max2\r\n count+=m**2\r\ncount=count-max1**2-max2**2+(max1+max2)**2\r\n\r\nprint(count)", "n=int(input())\r\nvisited=[0]*n\r\na=list(map(int,input().split()))\r\nsizes=[]\r\nfor i in range(n):\r\n if visited[i]:\r\n continue\r\n dest=a[i]-1\r\n visited[i]=1\r\n count=1\r\n while dest!=i:\r\n visited[dest]=1\r\n dest=a[dest]-1\r\n count+=1\r\n sizes.append(count)\r\nsizes.sort()\r\nif len(sizes)==1:\r\n print(n*n)\r\n exit()\r\nq=sizes[-1]\r\nr=sizes[-2]\r\nans=(q+r)*(q+r)\r\nfor i in range(len(sizes)-2):\r\n ans+=sizes[i]*sizes[i]\r\nprint(ans)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nresults = list()\r\nstoplist = list()\r\n\r\nfor i in p:\r\n if i == 0:\r\n continue\r\n j = p[i - 1]\r\n p[i-1] = 0\r\n result = 1\r\n while j != i:\r\n t = p[j - 1]\r\n p[j - 1] = 0\r\n j = t\r\n result += 1\r\n results.append(result)\r\n\r\nresults.sort(reverse=True)\r\n\r\nif len(results) < 2:\r\n print(sum([x**2 for x in results]))\r\nelif len(results) == 2:\r\n print((results[0]+results[1])**2)\r\nelse:\r\n print(sum([(results[0]+results[1])**2]+[x**2 for x in results[2:]]))\r\n", "\nn = int(input())\n\nP = [int(x) - 1 for x in input().split()]\nvisited = [-1] * n\n\ncc = []\n\nfor i in range(n):\n if visited[i] == -1:\n visited[i] = 0\n amount = 1\n x = P[i]\n while visited[x] == -1:\n visited[x] = 0\n amount += 1\n x = P[x]\n cc += [amount]\n\ncc.sort()\n\nresult = 0\n\nmerged_size = cc[-1]\nif len(cc) > 1:\n merged_size += cc[-2]\n\nresult = merged_size * merged_size\n\nfor i in range(len(cc) - 2):\n result += cc[i] * cc[i]\n\nprint(result)\n", "class node:\r\n def __init__(self,index):\r\n self.index = index\r\n self.nextN = None\r\n self.visited = 0\r\n # 0 - not visited\r\n # 1 - visited\r\n\r\n\r\nn = int(input())\r\nnodes = [node(i+1) for i in range(n)]\r\nc = [int(i) for i in input().split()]\r\ni = 0\r\nwhile i<n:\r\n nodes[i].nextN = nodes[c[i]-1]\r\n i+=1\r\n \r\nsequence = []\r\n\r\ni = 0\r\nnews = []\r\nwhile i<n:\r\n x = i\r\n while(nodes[x].visited!=1):\r\n news.append(nodes[x])\r\n nodes[x].visited = 1\r\n x = nodes[x].nextN.index - 1\r\n sequence.append(news)\r\n news=[]\r\n i+=1\r\nsequence.sort(key=len,reverse=True)\r\nif(n==1):\r\n print(1)\r\nelif(n==2):\r\n print(4)\r\nelse:\r\n x = len(sequence[0])+len(sequence[1])\r\n x *=x\r\n som = 0\r\n for i in range(2,n):\r\n value = len(sequence[i])\r\n if(value == 0):\r\n break\r\n som+=value*value\r\n print(x+som)\r\n \r\n \r\n", "n = int(input())\r\np = list(map(int, input().split(\" \")))\r\nls = []\r\nvis = [False for i in range(n)]\r\ncnt = 0\r\nfor i in range(n):\r\n j = i\r\n cnt = 0\r\n while not(vis[j]):\r\n vis[j] = True\r\n cnt += 1\r\n j = p[j] - 1\r\n if cnt>0:\r\n ls.append(cnt)\r\nls.sort()\r\nif len(ls)>1:\r\n ls[-2] += ls[-1]\r\n ls.pop()\r\nans=0\r\nfor i in ls:\r\n ans=ans+i**2\r\nprint(ans)\r\n", "n = int(input())\np = list(map(int, input().split()))\n\nls = []\nvisited = [False for _ in range(n)]\ncnt = 0\nfor i in range(n):\n j = i\n cnt = 0\n while not visited[j]:\n visited[j] = True\n cnt += 1\n j = p[j] - 1\n if 0 < cnt:\n ls.append(cnt)\n\nls.sort()\nif 1 < len(ls):\n ls[-2] += ls[-1]\n ls.pop()\n\nprint(sum(map(lambda x: x**2, ls)))\n\n", "import sys\r\ninput = sys.stdin.readline\r\nimport heapq\r\n\r\n\r\ndef solve(n, graph):\r\n heap = []\r\n visited = set()\r\n for i in range(n):\r\n if i not in visited:\r\n visited.add(i)\r\n numNodes = 1\r\n stack = [i]\r\n while stack:\r\n node = stack.pop()\r\n if graph[node] not in visited:\r\n visited.add(graph[node])\r\n stack.append(graph[node])\r\n numNodes += 1\r\n heapq.heappush(heap, -numNodes)\r\n\r\n if len(heap) == 1:\r\n print(n*n)\r\n else:\r\n ans = 0\r\n a = heapq.heappop(heap)\r\n b = heapq.heappop(heap)\r\n ans += (-a-b)**2\r\n while heap:\r\n v = heapq.heappop(heap)\r\n ans += v**2\r\n print(ans)\r\n\r\n\r\nn = int(input())\r\narr = list(val-1 for val in map(int, input().split()))\r\nsolve(n, arr)", "import sys\nsys.setrecursionlimit(10000)\n\ndef dfs(root,t):\n\ttime[root]=t\n\tvis[root]=1\n\tstack=[root]\n\twhile (len(stack)!=0):\n\t\telement = stack.pop()\n\t\ttime[element] = t\n\t\tvis[element] = 1\n\t\tfor i in graph[element]:\n\t\t\tif vis[i]==0:\n\t\t\t\tstack.append(i)\n\t\t\t\tt+=1\n\t\t\telse:\n\t\t\t\tc.append(t-time[i]+1)\n\t# for i in graph[root]:\n\t# \tif vis[i]==0:\n\t# \t\tdfs(i,t+1)\n\t# \telse:\n\t# \t\tc.append(t-time[i]+1)\n\n\nn=int(input())\nl=list(map(int,input().split()))\ngraph=[[] for i in range(n)]\nfor i in range(n):\n\tgraph[i].append(l[i]-1)\n# print (graph)\nvis=[0]*n\nc=[]\ntime=[0]*n\nfor i in range(n):\n\tif vis[i]==0:\n\t\tdfs(i,1)\n# print (time)\n# print (c)\nc.sort()\nans=0\nfor i in c:\n\tans+=i**2\nif len(c)>=2:\n\tprint (ans+c[-1]*c[-2]*2)\nelse:\n\tprint (ans)", "import sys\r\ninput = sys.stdin.readline\r\n#greedily create the longest cycle possible, count everything else\r\nfrom collections import deque\r\nfrom heapq import heapify, heappop, heappush\r\ndef solve():\r\n n = int(input())\r\n adj = list(map(int, input().strip().split()))\r\n\r\n visited = [False] * (n+1) \r\n \r\n cycles = []\r\n def cyclelength(start):\r\n #print(start, \"here\")\r\n stack = [start]\r\n ln = 0\r\n while stack:\r\n curr = stack.pop()\r\n ln += 1\r\n visited[curr] = True\r\n if adj[curr-1] == start:\r\n return ln\r\n stack.append(adj[curr-1])\r\n for start in range(1, n+1):\r\n if not visited[start]:\r\n cycles.append(-cyclelength(start))\r\n ans = 0\r\n heapify(cycles)\r\n if len(cycles) >= 2:\r\n a = -heappop(cycles)\r\n b = -heappop(cycles)\r\n\r\n ans += (a+b)**2\r\n\r\n for element in cycles:\r\n ans += element**2\r\n else:\r\n ans += cycles[0] ** 2\r\n print(ans)\r\n\r\n \r\n\r\n\r\nsolve()", "n=int(input())\r\np=list(map(int,input().split()))\r\nfor i in range(n):\r\n p[i]-=1\r\ncolor=[0]*n\r\nc=1\r\ns=[]\r\nfor i in range(n):\r\n if color[i]==0:\r\n j,k=i,1\r\n color[i]=c\r\n while p[j]!=i:\r\n j=p[j]\r\n color[j]=c\r\n k+=1\r\n c+=1\r\n s.append(k)\r\ns.sort()\r\nif len(s)==1:\r\n x=s[0]**2\r\nelse:\r\n x=(s[-1]+s[-2])**2\r\n for i in range(len(s)-2):\r\n x+=s[i]**2\r\nprint(x)\r\n", "import sys\r\n\r\nn = int(input())\r\ndest = [0] + list(map(int, input().split()))\r\nedge = [1]*(n+1)\r\n\r\nfor i, x in enumerate(dest):\r\n if i != x:\r\n edge[x] = 0\r\n\r\nvisit_time = [0]*(n+1)\r\n\r\n\r\ndef solve(i):\r\n t = visit_time[i] = 1\r\n while 1:\r\n t += 1\r\n i = dest[i]\r\n if visit_time[i]:\r\n return t-1, t-visit_time[i]\r\n visit_time[i] = t\r\n\r\n\r\ncomponent = []\r\n\r\nfor i in range(1, n+1):\r\n if edge[i]:\r\n component.append(solve(i))\r\n\r\nfor i in range(1, n+1):\r\n if visit_time[i] == 0:\r\n component.append(solve(i))\r\n\r\ncomponent.sort(key=lambda x: (x[0], -x[1]))\r\n\r\nif len(component) == 1:\r\n print(component[0][0]**2)\r\nelse:\r\n (x1, _), (x2, _) = component.pop(), component.pop()\r\n component.append((x1+x2, x1+x2))\r\n ans = sum(x*y for x, y in component)\r\n # print(component)\r\n print(ans)\r\n", "n = int(input())\r\np = [int(i)-1 for i in input().split()]\r\nvisited = [0 for _ in range(n)]\r\ncycle = [0,0]\r\nfor i in range(n):\r\n j = i\r\n count = 0\r\n while not visited[j]:\r\n visited[j] = 1\r\n count += 1\r\n j = p[j]\r\n if count > 0:\r\n cycle.append(count)\r\ncycle.sort()\r\nprint(sum([i*i for i in cycle]) + 2 * cycle[-1] * cycle[-2])\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc = [-1]*n\r\nw = -1\r\nmx = -1\r\ntm = -1\r\nans = 0\r\nfor i in range(n):\r\n sz=0\r\n ptr = i\r\n if(c[ptr]==-1): w+=1\r\n while c[ptr]==-1:\r\n c[ptr] = w\r\n ptr = l[ptr]-1\r\n sz+=1\r\n if(sz>mx):\r\n tm,mx = mx,sz\r\n else:\r\n tm = max(sz,tm)\r\n if(sz>0):ans+=(sz**2)\r\nif tm == -1:\r\n print(ans)\r\nelse:\r\n print(ans-tm**2-mx**2+(mx+tm)**2)", "n = int(input())\r\na = list(map(int, input().split()))\r\nvis = [False] * 100005\r\nb = []\r\nm = 0\r\nfor i in range(n):\r\n if not vis[i]:\r\n m += 1\r\n cur = i\r\n len = 0\r\n while not vis[cur]:\r\n vis[cur] = True\r\n len += 1\r\n cur = a[cur] - 1\r\n b.append(len)\r\nb.sort()\r\nif m > 1:\r\n b[-2] += b[-1]\r\n b.pop()\r\nprint(sum(map(lambda x : x**2, b)))", "#!/usr/bin/env python3\n\nn = int(input())\nP = [int(p)-1 for p in input().split()] # permutation\nseen = [False]*n\nres = m0 = m1 = 0\nfor i in range(n):\n if not seen[i]:\n seen[i] = True\n j = P[i]\n c = 1 # taille du cycle\n while j!=i:\n seen[j] = True\n j = P[j]\n c += 1\n res += c*c\n if c>m0:\n m0,m1 = c,m0\n elif c>m1:\n m1 = c\n# on fusionne les 2 plus grands cycles\nres += (m0+m1)*(m0+m1)-m0*m0-m1*m1\nprint(res)\n", "import os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\nfrom 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\nn = int(input())\r\na = list(mapi())\r\n\r\nsize = [1]*(n+1)\r\npar = {i:i for i in range(1,n+1)}\r\n\r\ndef find(x):\r\n if par[x] == x:\r\n return x\r\n else:\r\n par[x] = find(par[x])\r\n return par[x]\r\n #\r\ndef union(x,y):\r\n x = find(x)\r\n y = find(y)\r\n if x==y: return\r\n if size[x]>size[y]:\r\n x,y = y,x\r\n par[x] = y\r\n size[y]+=size[x]\r\n #\r\nfor i,v in enumerate(a,1):\r\n union(i,v)\r\nb = []\r\nfor i in range(1,n+1):\r\n if find(i)==i:\r\n b.append(size[i])\r\nb.sort(reverse = True)\r\nres = 0\r\nfor i in range(len(b)):\r\n if i==1:\r\n res-=b[i-1]**2\r\n res+=(b[i]+b[i-1])**2\r\n else:\r\n res+=b[i]**2\r\nprint(res)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nused = [False] * n\r\nnums = list()\r\n\r\n\r\ndef count(i):\r\n c = 0\r\n while True:\r\n if used[i]:\r\n return c\r\n else:\r\n used[i] = True\r\n i = p[i] - 1\r\n c += 1\r\n\r\n\r\nfor i in range(n):\r\n if not used[i]:\r\n nums.append(count(i))\r\n\r\nif n == 1:\r\n print(1)\r\nelif n == 2:\r\n print(4)\r\nelse:\r\n nums.sort(reverse=True)\r\n if len(nums) > 1:\r\n c = (nums[0] + nums[1]) ** 2\r\n for i in nums[2:]:\r\n c += i ** 2\r\n print(c)\r\n else:\r\n print(nums[0] ** 2)\r\n", "n = int(input())\r\ngraph = {}\r\na = input().split()\r\nfor i in range(n):\r\n graph[i] = int(a[i]) - 1\r\nvis = [False] * n\r\ncycles = []\r\nfor i in graph.keys():\r\n if not vis[i]:\r\n cv = graph[i]\r\n vis[i] = True\r\n size = 1\r\n while cv != i:\r\n vis[cv] = True\r\n cv = graph[cv]\r\n size += 1\r\n cycles.append(size)\r\ncycles.sort(reverse = True)\r\nv = 0\r\nif len(cycles) >= 2:\r\n v += (cycles[0] + cycles[1]) ** 2\r\n for i in cycles[2:]:\r\n v += i ** 2\r\nelse:\r\n v = cycles[0] ** 2\r\nprint(v)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nd = [[] for _ in range(n)]\r\nw = list(map(lambda x:int(x)-1, input().split()))\r\nfor j, i in enumerate(w):\r\n d[i].append(j)\r\n d[j].append(i)\r\nx = [0]*n\r\nc = 0\r\nfor i in range(n):\r\n if x[i] == 0:\r\n c += 1\r\n q = [i]\r\n while q:\r\n a = q.pop()\r\n x[a] = c\r\n for j in d[a]:\r\n if x[j] == 0:\r\n q.append(j)\r\n break\r\nd = sorted(Counter(x).values(), reverse=True)\r\nif len(d) == 1:\r\n print(d[0]**2)\r\nelse:\r\n print((d[0]+d[1])**2 + sum(i**2 for i in d[2:]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i, x in enumerate(a):\r\n cycle = 0\r\n while a[i] > 0:\r\n cycle += 1\r\n tmp = a[i] - 1\r\n a[i] -= 1e9\r\n i = tmp\r\n ans.append(cycle)\r\n\r\nif len(ans)==1:\r\n print(ans[0]**2)\r\nelse:\r\n ans.sort()\r\n o = 0\r\n for x in ans[:-2]:\r\n o += x**2\r\n print((ans[-1]+ans[-2])**2 + o)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\ndef get_size(s):\r\n return size[get_root(s)]\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nroot = [i for i in range(n + 1)]\r\nrank = [1 for _ in range(n + 1)]\r\nsize = [1 for _ in range(n + 1)]\r\nfor i in range(n):\r\n if not same(i + 1, p[i]):\r\n unite(i + 1, p[i])\r\nr = set([get_root(i) for i in range(1, n + 1)])\r\nx = []\r\nfor i in r:\r\n x.append(get_size(i))\r\nx.sort()\r\nif len(x) > 1:\r\n a, b = x.pop(), x.pop()\r\n x.append(a + b)\r\nans = 0\r\nfor i in x:\r\n ans += i * i\r\nprint(ans)", "n = int(input())\nedges = [int(x) - 1 for x in input().split()]\nvisited = [False for _ in range(n)]\n\nsizes = []\nfor i in range(n):\n if visited[i]:\n continue\n visited[i] = True\n component_size = 1\n\n j = edges[i]\n while not visited[j]:\n visited[j] = True\n component_size += 1\n j = edges[j]\n\n sizes.append(component_size)\n\nsizes = sorted(sizes)\nif len(sizes) > 1:\n sizes[-2] += sizes[-1]\n sizes.pop()\n\nprint(sum(map(lambda x: x**2, sizes)))\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nvis = set()\r\ncomps = []\r\nfor i in range(n):\r\n if i in vis:\r\n continue\r\n sz = 0\r\n j = i\r\n while j not in vis:\r\n vis.add(j)\r\n sz += 1\r\n j = p[j]-1\r\n comps.append(sz)\r\ncomps= sorted(comps)\r\nif len(comps) == 1:\r\n print(n*n)\r\nelse:\r\n a = comps[-1] + comps[-2]\r\n ans = a*a + sum([c*c for c in comps[:-2]])\r\n print(ans)", "# def dfs(u):\r\n# res = 0\r\n# while p[u] != 0:\r\n# res += 1\r\n# p[u], u = 0, p[u]\r\n# return res\r\n#\r\n#\r\n# n = int(input())\r\n#\r\n# p = [0] + list(map(int, input().split()))\r\n# val = sorted([dfs(u) for u in p])\r\n# s = sum(list(map(lambda x: x * x, val)))\r\n# a = val[-1]\r\n# b = val[-2]\r\n# print(s + 2 * val[-1] * val[-2])\r\n\r\n\r\nn = int(input())\r\ndestination = list(map(lambda x: int(x) - 1, input().split()))\r\nvisited = [False for __ in range(n)]\r\n\r\nmaxs = [0, 0]\r\nconvenience = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n visited[i] = True\r\n cycle_len = 1\r\n current_node = i\r\n while destination[current_node] != i:\r\n current_node = destination[current_node]\r\n visited[current_node] = True\r\n cycle_len += 1\r\n convenience += cycle_len ** 2\r\n if cycle_len > min(maxs):\r\n maxs = [cycle_len, max(maxs)]\r\n\r\nconvenience += 2 * maxs[0] * maxs[1]\r\nprint(convenience)\r\n", "\nbz=[0 for i in range(1000000)]\nto=[0 for i in range(1000000)]\nn=0\nn=int(input())\ni=1\nfor x in (input().split()):\n\tto[i]=int(x)\n\ti+=1\nall_num=0\nmx1=0\nmx2=0\nfor i in range(1,n+1):\n\tif (bz[i]==0):\n\t\tx=i\n\t\tnum=0;\n\t\twhile (bz[x]==0):\n\t\t\tnum+=1\n\t\t\tbz[x]=1\n\t\t\tx=to[x]\n\t\tall_num+=num**2\n\t\tif (mx1<=num):\n\t\t\tmx1,mx2=num,mx1\n\t\telif mx2<num:\n\t\t\tmx2=num\n\nprint(all_num-(mx1**2)-(mx2**2)+((mx1+mx2)**2))\n\t\t\t\n", "n=int(input()) \r\na=[0]+list(map(int,input().split())) \r\nres=[] \r\nfor i in range(1,n+1):\r\n if a[i]!=0:\r\n add=1\r\n j=i\r\n while a[j]!=i:\r\n c=j\r\n j=a[c]\r\n a[c]=0 \r\n add+=1 \r\n a[j]=0 \r\n res.append(add)\r\nres.sort() \r\nif len(res)==1:\r\n print(n*n)\r\nelse:\r\n x=res.pop()\r\n res[-1]+=x \r\n ans=0 \r\n for r in res:\r\n ans+=r*r \r\n print(ans)\r\n ", "def dfs(i, Colour, P):\r\n Stack = [i]\r\n size = 0\r\n while Stack:\r\n v = Stack[-1]\r\n if Colour[v] == 0:\r\n Colour[v] = 1\r\n size += 1\r\n if Colour[P[v] - 1] == 0:\r\n Stack.append(P[v] - 1)\r\n else:\r\n Colour[v] = 2\r\n Stack.pop()\r\n else:\r\n Colour[v] = 2\r\n Stack.pop()\r\n return size\r\n\r\nn = int(input())\r\nP = list(map(int, input().split()))\r\nColour = [0] * n\r\nLen = []\r\nfor i in range(n):\r\n if Colour[i] == 0:\r\n Len.append(dfs(i, Colour, P))\r\nc1 = 0\r\nc2 = 0\r\ncount = 0\r\nfor i in Len:\r\n if c1 <= i:\r\n c2 = c1\r\n c1 = i\r\n elif i > c2:\r\n c2 = i\r\n\r\nfor i in Len:\r\n count += i*i\r\n \r\ncount += c1*c2*2\r\n\r\nprint(count)\r\n \r\n\r\n \r\n", "n = int(input())\r\ndata = list(map(int,input().split()))\r\n\r\ngp = { i:i for i in range(n) }\r\nsets = { i:[i] for i in range(n) }\r\n\r\nfor i in range(n):\r\n u,v = i,data[i]-1\r\n if gp[u]!= gp[v]:\r\n temp=gp[v]\r\n for i in sets[gp[v]]:\r\n gp[i]=gp[u]\r\n sets[gp[u]].append(i)\r\n del sets[temp]\r\n\r\nl=[]\r\nfor i in sets:\r\n l.append(len(sets[i]))\r\nl.sort(reverse=True)\r\nn=len(l)\r\nif n==1:\r\n print(l[0]*l[0])\r\nelse:\r\n ans=(l[0]+l[1])**2\r\n for i in range(2,n):\r\n ans+=l[i]**2\r\n print(ans)\r\n", "# http://codeforces.com/contest/884/problem/C\r\n# unsolved\r\nfrom functools import lru_cache\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\nl = []\r\nscore = 0\r\njeden = 0\r\ndwa = 0\r\n\r\n\r\n@lru_cache(maxsize=10000)\r\ndef wzor(s):\r\n return s * s\r\n\r\n\r\nfor i in range(n):\r\n\r\n if p[i] != 0:\r\n start = i\r\n end = p[i]\r\n lenght = 0\r\n k = 0\r\n\r\n if start + 1 != p[i]:\r\n\r\n while k - 1 != start:\r\n k = end\r\n end = p[end - 1]\r\n p[k - 1] = 0\r\n lenght += 1\r\n\r\n else:\r\n p[end - 1] = 0\r\n lenght += 1\r\n\r\n if lenght > jeden:\r\n l.append(dwa)\r\n dwa = jeden\r\n jeden = lenght\r\n\r\n elif lenght > dwa:\r\n l.append(dwa)\r\n dwa = lenght\r\n\r\n else:\r\n l.append(lenght)\r\n\r\n length = 0\r\n\r\nl.append(jeden + dwa)\r\n\r\nfor iteam in l:\r\n if iteam != 1 or iteam != 0 :\r\n score += wzor(iteam)\r\n elif iteam == 1:\r\n score += 1\r\n\r\nprint(int(score))", "class UnionFind:\r\n def __init__(self, n):\r\n self.par = [-1]*n\r\n self.rank = [0]*n\r\n\r\n def Find(self, x):\r\n if self.par[x] < 0:\r\n return x\r\n else:\r\n self.par[x] = self.Find(self.par[x])\r\n return self.par[x]\r\n\r\n def Unite(self, x, y):\r\n x = self.Find(x)\r\n y = self.Find(y)\r\n\r\n if x != y:\r\n if self.rank[x] < self.rank[y]:\r\n self.par[y] += self.par[x]\r\n self.par[x] = y\r\n else:\r\n self.par[x] += self.par[y]\r\n self.par[y] = x\r\n if self.rank[x] == self.rank[y]:\r\n self.rank[x] += 1\r\n\r\n def Same(self, x, y):\r\n return self.Find(x) == self.Find(y)\r\n\r\n def Size(self, x):\r\n return -self.par[self.Find(x)]\r\n\r\nn = int(input())\r\nP = list(map(int, input().split()))\r\nP = [p-1 for p in P]\r\n\r\nuf = UnionFind(n)\r\nfor i, p in enumerate(P):\r\n uf.Unite(i, p)\r\nX = []\r\nfor i in range(n):\r\n if uf.par[i] < 0:\r\n X.append(uf.Size(i))\r\n#print(X)\r\nif len(X) == 1:\r\n print(n**2)\r\nelse:\r\n X.sort(reverse=True)\r\n y = X[0]+X[1]\r\n ans = y**2\r\n for i in range(2, len(X)):\r\n x = X[i]\r\n ans += x**2\r\n print(ans)\r\n", "def dfs(u):\r\n\tres = 0\r\n\twhile p[u] != 0:\r\n\t\tres += 1\r\n\t\tp[u], u = 0, p[u]\r\n\treturn res\r\n\t\r\nR=lambda:list(map(int,input().split()))\r\nn = R()\r\np = [0] + R()\r\nval = sorted([dfs(u) for u in p])\r\nprint(sum(list(map(lambda x: x*x, val))) + 2 * val[-1] * val[-2])", "n = int(input())\r\np = list(map(int, input().split()))\r\np = [i - 1 for i in p]\r\nvis = [False for _ in range(n)]\r\n\r\nsz = [0]\r\n\r\nfor i in range(n):\r\n j = i\r\n cnt = 0\r\n while not vis[j]:\r\n vis[j] = True\r\n cnt += 1\r\n j = p[j]\r\n if 0 < cnt:\r\n sz.append(cnt)\r\n\r\nsz.sort()\r\nprint(sum(list(map(lambda x: x*x, sz))) + 2 * sz[-1] * sz[-2])", "n = int(input())\r\n\r\nst = [[int(x), False] for x in input().split()]\r\n\r\ngroups = []\r\nptr = 0\r\n\r\nwhile True:\r\n if ptr >= n:\r\n break\r\n\r\n if st[ptr][1]:\r\n ptr += 1\r\n continue\r\n\r\n cnt = 0\r\n cur = ptr\r\n while True:\r\n st[cur][1] = True\r\n cnt += 1\r\n cur = st[cur][0] - 1\r\n if cur == ptr:\r\n break\r\n\r\n groups.append(cnt)\r\n ptr += 1\r\n\r\ngroups.sort(reverse=True)\r\n\r\nif len(groups) == 1:\r\n print(n**2)\r\nelse:\r\n ans = (groups[0] + groups[1]) **2\r\n for i, cnt in enumerate(groups):\r\n if i < 2:\r\n continue\r\n ans += cnt**2\r\n print(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom collections import Counter\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nP = [[] for _ in range(N)]\r\nfor i in range(N):\r\n a = A[i]-1\r\n P[i].append(a)\r\n P[a].append(i)\r\n \r\nseen = [0]*N\r\ndef paint(idx, color):\r\n v = [idx]\r\n while v:\r\n i = v.pop()\r\n if seen[i]:continue\r\n seen[i] = color\r\n \r\n for j in P[i]:\r\n if seen[j]==0:\r\n v.append(j)\r\n\r\ncolor = 1\r\nfor i in range(N):\r\n if seen[i]==0:\r\n paint(i, color)\r\n color+=1\r\n \r\nC = Counter(seen)\r\nB = []\r\nfor k,v in C.items():\r\n B.append([v,k])\r\nB.sort()\r\n#print(B)\r\nif len(B)>1:\r\n v,k = B.pop()\r\n B[-1][0]+=v\r\n \r\nans = 0\r\nfor v,k in B:\r\n ans+=v**2\r\n \r\nprint(ans)", "n = int(input())\np = [int(x)-1 for x in input().split()]\nencontrados = [False]*n\nciclos = []\nfor i in range(n):\n\tif encontrados[i]:\n\t\tcontinue\n\tciclos.append([i])\n\tencontrados[i] = True\n\tj = p[i]\n\twhile not encontrados[j]:\n\t\tciclos[-1].append(j)\n\t\tencontrados[j] = True\n\t\tj = p[j]\nprimero = max([len(x) for x in ciclos])\nfor i in range(n):\n\tif len(ciclos[i]) == primero:\n\t\tciclos.pop(i)\n\t\tbreak\nif ciclos:\n\tsegundo = max([len(x) for x in ciclos])\nelse:\n\tsegundo = 0\nprint((primero+segundo)**2 + sum([len(x)**2 for x in ciclos]) - segundo**2)\n" ]

[ "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\n\r\nimport collections\r\n\r\n\r\ndef find(parents, i):\r\n if parents[i] == i:\r\n return i\r\n result = find(parents, parents[i])\r\n parents[i] = result\r\n return result\r\n\r\n\r\ndef union(parents, i, j):\r\n i, j = find(parents, i), find(parents, j)\r\n parents[i] = j\r\n\r\n\r\nif __name__ == '__main__':\r\n n, x = map(int, input().split())\r\n a = {i + 1: int(ai) for i, ai in enumerate(input().split())}\r\n\r\n parents = {i: i for i in a}\r\n x_order = 1\r\n x_current = x\r\n while a[x_current] != 0:\r\n x_order += 1\r\n x_current = a[x_current]\r\n\r\n for source, target in a.items():\r\n if target != 0:\r\n union(parents, source, target)\r\n\r\n del a\r\n\r\n x_representative = find(parents, x)\r\n\r\n sizes = collections.Counter()\r\n for i in parents:\r\n i_representative = find(parents, i)\r\n if i_representative != x_representative:\r\n sizes[i_representative] += 1\r\n\r\n del parents\r\n\r\n adds = collections.Counter()\r\n for size in sizes.values():\r\n adds[size] += 1\r\n\r\n del sizes\r\n\r\n sieve = {0: 1}\r\n for add, count in adds.items():\r\n sieve_update = {}\r\n for i, j in sieve.items():\r\n if j != 0:\r\n for k in range(1, count + 1):\r\n if i + add * k <= n:\r\n sieve_update[i + add * k] = 1\r\n sieve.update(sieve_update)\r\n\r\n del adds\r\n\r\n for position, value in sorted(sieve.items()):\r\n if value:\r\n print(position + x_order)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\n\r\ndef f(t):\r\n global xx\r\n q = [t]\r\n c = 0\r\n while q:\r\n a = q.pop()\r\n xx[a] = 1\r\n c += 1\r\n for i in d[a]:\r\n if xx[i] == 0:\r\n q.append(i)\r\n return c\r\n\r\n\r\nn, x = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [[] for i in range(n)]\r\nfor i in range(n):\r\n if w[i] != 0:\r\n d[w[i]-1].append(i)\r\n d[i].append(w[i]-1)\r\n if i == x-1:\r\n c1 = 1\r\n while 1:\r\n if w[i] == 0:\r\n break\r\n i = w[i] - 1\r\n c1 += 1\r\n\r\nxx = [0]*n\r\ns = []\r\nf(x-1)\r\n\r\nfor i in range(n):\r\n if xx[i] == 0:\r\n s.append(f(i))\r\n\r\ns = Counter(s)\r\na = {c1}\r\nfor i in s:\r\n b = a.copy()\r\n for j in b:\r\n for l in range(1, s[i]+1):\r\n a.add(l*i+j)\r\nfor i in sorted(a):\r\n print(i)", "n, x = map(int, input().split())\nlink1 = list(map(int, input().split()))\nlink2 = [0] * (n + 1)\nfor i, v in enumerate(link1, 1):\n if v != 0:\n link2[v] = i\n\n\ntable = [False] * n\ntable[0] = True\nfor i, v in enumerate(link1, 1):\n if v == 0:\n len = 0\n flag = False\n now = i\n while now:\n len += 1\n if now == x:\n flag = True\n pos = len\n now = link2[now]\n if not flag:\n for j in reversed(range(n - len)):\n if table[j]:\n table[j + len] = True\nfor i in range(n):\n if table[i]:\n print(i + pos)\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nclass UnionFind():\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * 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\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 len(self.roots())\r\n\r\n def all_group_members(self):\r\n group_members = defaultdict(list)\r\n for member in range(self.n):\r\n group_members[self.find(member)].append(member)\r\n return group_members\r\nn,x=map(int,input().split())\r\nx-=1\r\na=list(map(int,input().split()))\r\nuf=UnionFind(n)\r\nfor i in range(n):\r\n if a[i]!=0:\r\n uf.union(a[i]-1,i)\r\nc=[]\r\nfor r in uf.roots():\r\n if x not in uf.members(r):\r\n c.append(uf.size(r))\r\nsize0=0\r\nxx=x\r\nwhile a[xx]!=0:\r\n size0+=1\r\n xx=a[xx]-1\r\ndp=[[0]*(n+1) for i in range(len(c)+1)]\r\ndp[0][0]=1\r\nfor i in range(1,len(c)+1):\r\n for j in range(n+1):\r\n dp[i][j]|=dp[i-1][j]|dp[i-1][j-c[i-1]]\r\nans=[]\r\nfor i in range(n+1):\r\n if dp[len(c)][i]:\r\n ans.append(i+size0+1)\r\nprint(*ans,sep=\"\\n\")", "\r\n\r\nn, x = map(int, input().split())\r\n\r\na = [-10000] + list(map(int, input().split()))\r\n\r\nceps = []\r\nones = 0\r\nwas = set()\r\n\r\nfor i in range(1, n+1):\r\n if i not in was and i not in a:\r\n cep = [i]\r\n while a[i]:\r\n cep.append(a[i])\r\n i = a[i]\r\n for i in cep:\r\n was.add(i)\r\n #print(cep)\r\n if x in cep:\r\n r = cep.index(x)\r\n l = len(cep) - r - 1\r\n else:\r\n if len(cep) == 1:\r\n ones += 1\r\n else:\r\n ceps.append(len(cep))\r\n\r\nimport itertools\r\n\r\nsums = set(ceps)\r\nfor i in range(2, len(ceps)+1):\r\n for comb in itertools.combinations(ceps, i):\r\n sums.add(sum(comb))\r\nsums.add(0)\r\n\r\nposs = set()\r\n#print(l + 1)\r\nfor s in sums:\r\n for i in range(ones+1):\r\n poss.add(l + s + 1 + i)\r\n #print(l + s + 1)\r\n\r\nfor pos in sorted(poss):\r\n print(pos)\r\n", "def put(): return map(int, input().split())\r\n\r\nn,x = put()\r\na = list(put())\r\n\r\nparent = list(range(n+1))\r\nfor i in range(n):\r\n if a[i]!=0:\r\n parent[a[i]] = i+1\r\n\r\ncnt = []\r\nz = 0\r\n#print(parent)\r\nfor i in range(n):\r\n if a[i]==0:\r\n j = i+1\r\n c = 1\r\n found = False\r\n if j==x:\r\n z=c\r\n found = True\r\n while j != parent[j]:\r\n j = parent[j]\r\n c+=1\r\n if j==x:\r\n z=c\r\n found = True\r\n if not found:\r\n cnt.append(c)\r\n\r\n#print(cnt,z)\r\nn,m = len(cnt)+1, sum(cnt)+1\r\ndp = [[0]*(m+1) for i in range(n+1)]\r\ndp[0][0]=1\r\ns = set()\r\ns.add(0)\r\nfor i in range(1,n):\r\n for j in range(m):\r\n if j==0 or dp[i-1][j]==1 or (j-cnt[i-1]>=0 and dp[i-1][j-cnt[i-1]]==1) :\r\n dp[i][j] = 1\r\n s.add(j)\r\nl = []\r\nfor i in s:\r\n l.append(i+z)\r\n\r\nl.sort()\r\nprint(*l)\r\n", "from collections import defaultdict\r\n\r\nclass UnionFind():\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * 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\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 len(self.roots())\r\n\r\n def all_group_members(self):\r\n group_members = defaultdict(list)\r\n for member in range(self.n):\r\n group_members[self.find(member)].append(member)\r\n return group_members\r\n\r\nn,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]-=1\r\ny=x-1\r\ncnt=0\r\nwhile y!=-1:\r\n cnt+=1\r\n y=a[y]\r\np=x-1\r\nuf=UnionFind(n)\r\nfor i in range(n):\r\n if a[i]!=-1:\r\n uf.union(i,a[i])\r\nl=[0]\r\nfor t in uf.roots():\r\n if not uf.same(t,p):\r\n l.append(uf.size(t))\r\ndp=[0]*(n+1)\r\ndp[0]=1\r\nfor i in range(1,len(l)):\r\n for j in range(1,n+1)[::-1]:\r\n if 0<=j-l[i]<=n and dp[j-l[i]]>=1:\r\n dp[j]=1\r\nans=[]\r\nfor i in range(n+1):\r\n if dp[i]>=1:\r\n ans.append(i+cnt)\r\nprint(*ans,sep=\"\\n\")" ]

[ "n=int(input())\r\nprint(((n+4)*(n+3)*(n+2)*(n+1)*n*(n+2)*(n+1)*n)//720)", "x = int(input()) + 1\r\nresult = (x**3 - x)**2 * (x*x + 5*x + 6) // 720\r\nprint(result)\r\n", "t = int(input())\r\nk = (t+2)*(t+1)*t\r\nm = k*(t+3)*(t+4)\r\nprint(m*k//720)", "from math import comb, factorial\r\nn = int(input())\r\nif (n == 1):\r\n print(1)\r\nelse:\r\n print(comb(n + 4, 5) * comb(n + 2, 3))", "n = int(input())\r\nprint(n*(n+1)*(n+2)//6*n*(n+1)*(n+2)*(n+3)*(n+4)//120)", "n = int(input())\r\nif n == 1:\r\n print(1)\r\n exit()\r\nr1 = 0\r\nr2 = 0\r\ntr = 0\r\nfi = 0\r\ns = 1\r\nr4 = 0\r\nfor i in range(1, n+5):\r\n s *= i\r\n if i == 3:\r\n tr = s\r\n if i == 5:\r\n fi = s\r\n if i == n-1:\r\n r4 = s\r\n if i == n+2:\r\n r2 = s\r\n if i == n+4:\r\n r1 = s\r\nf = r1//(fi*r4)\r\ns = r2//(tr*r4)\r\nprint(f*s)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nN = int(input())\r\n\r\na = math.comb(N+5-1,5)\r\nb = math.comb(N+3-1,3)\r\nprint(a*b)" ]

[ "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n-k>=0:\r\n \r\n print( str(l[n-k])+\" \"+str(l[n-k]))\r\nelse:\r\n print(-1)", "class Input:\r\n take_list_input = lambda : list(map(int, input().split()))\r\n take_string_input = lambda : input()\r\n take_strings_input = lambda : input().split()\r\n\r\n\r\ndef solve(n, k, l):\r\n if k>n:\r\n return (-1, -1)\r\n arr = sorted(l, reverse=True)\r\n return (arr[k-1],0)\r\n\r\n \r\n\r\nn, k = Input.take_list_input()\r\nl = Input.take_list_input()\r\n\r\nans_x, ans_y = solve(n, k, l)\r\n\r\nif (ans_x, ans_y) == (-1, -1):\r\n print(-1)\r\nelse:\r\n print(ans_x, ans_y)", "def solve():\r\n n, k = map(int, input().split())\r\n numbers = sorted(map(int, input().split()), reverse=True)\r\n \r\n if k > n:\r\n print(-1)\r\n else:\r\n print(numbers[k - 1], 0)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n,k=map(int,input().split());a=list(map(int,input().split()));a.sort()\r\nif k>n:print(-1)\r\nelif k==n:print(0,0)\r\nelse:print(a[-k],a[-k])" ]

[ "directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\r\n\r\ndef main():\r\n height, width, walls_to_add = map(int, input().split())\r\n total_open_squares = height * width\r\n maze = []\r\n\r\n for _ in range(height):\r\n maze.append(list(input().strip()))\r\n\r\n total_open_squares -= sum(row.count('#') for row in maze)\r\n required_open_squares = total_open_squares - walls_to_add\r\n\r\n def dfs(square):\r\n stack = [square]\r\n visited = set()\r\n visited.add(square)\r\n count = 1\r\n\r\n while stack and count < required_open_squares:\r\n x, y = stack.pop()\r\n for dx, dy in directions:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < height and 0 <= ny < width and maze[nx][ny] == '.' and (nx, ny) not in visited:\r\n visited.add((nx, ny))\r\n stack.append((nx, ny))\r\n count += 1\r\n if count == required_open_squares:\r\n return visited\r\n return visited\r\n\r\n visited = set()\r\n for i in range(height):\r\n for j in range(width):\r\n if maze[i][j] == '.':\r\n visited = dfs((i, j))\r\n break\r\n if visited:\r\n break\r\n\r\n for i in range(height):\r\n for j in range(width):\r\n if maze[i][j] == '.' and (i, j) not in visited:\r\n maze[i][j] = 'X'\r\n\r\n for row in maze:\r\n print(''.join(row))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m, k = [int(x) for x in input().split()]\r\nmaze = [list(input()) for _ in range(n)]\r\ns = 0\r\npaths = {}\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if maze[i][j] == '.':\r\n paths[(i, j)] = s\r\n s += 1\r\n\r\npoints = [[] for _ in range(s + 1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n point = (i, j)\r\n if point in paths:\r\n up_point = (i - 1, j)\r\n down_point = (i + 1, j)\r\n left_point = (i, j - 1)\r\n right_point = (i, j + 1)\r\n\r\n if up_point in paths:\r\n points[paths[point]].append(paths[up_point])\r\n if down_point in paths:\r\n points[paths[point]].append(paths[down_point])\r\n if left_point in paths:\r\n points[paths[point]].append(paths[left_point])\r\n if right_point in paths:\r\n points[paths[point]].append(paths [right_point])\r\n\r\nvisited = [False] * s\r\nstack = [0]\r\npath_size = 0\r\n\r\nwhile stack:\r\n x = stack.pop()\r\n if not visited[x] and path_size != (s - k):\r\n visited[x] = True\r\n path_size += 1\r\n if path_size != (s - k):\r\n for i in points[x]:\r\n stack.append(i)\r\n\r\npaths_keys = [*paths]\r\nfor i in range(s):\r\n if not visited[i]:\r\n x, y = paths_keys[i]\r\n maze[x][y] = 'X'\r\n\r\n[print(\"\".join(maze[i])) for i in range(n)]\r\n", "import sys\r\nfrom collections import deque\r\n\r\ninput = sys.stdin.readline\r\nn, m, k = map(int, input().split())\r\ngrid, count = [], 0\r\nfor _ in range(n):\r\n grid.append(list(input()[:-1]))\r\n count += grid[-1].count('.')\r\ncount -= k\r\nvisited = set()\r\n\r\ndef bfs(i0, j0):\r\n dq = deque([(i0, j0)])\r\n visited.add((i0, j0))\r\n while len(visited) < count:\r\n i, j = dq.popleft()\r\n for ni, nj in [(i - 1, j), (i, j - 1), (i, j + 1), (i + 1, j)]:\r\n if 0 <= ni < n and 0 <= nj < m and grid[ni][nj] == '.' and (ni, nj) not in visited and len(visited) < count:\r\n dq.append((ni, nj))\r\n visited.add((ni, nj))\r\n\r\nfound = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '.':\r\n bfs(i, j)\r\n found = True\r\n break\r\n if found:\r\n break\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '.' and (i, j) not in visited:\r\n grid[i][j] = 'X'\r\n print(''.join(grid[i]))", "# By nealzane, contest: Codeforces Round #290 (Div. 2), problem: (C) Fox And Names\n# Maze hecho Revision y explicacion de Maximiliano Andaru Henriquez 2020441618\n\nn, m, k = map(int, input().split()) \n# n, m y k. filas,columnas y el número de pasos máximos que se pueden dar para resolver el laberinto, respectivamente.\n \nmaze = [[\"#\"]*(m+2)]+[list(\"#\"+input()+\"#\") for i in range(n)]+[[\"#\"]*(m+2)]\n#crea una matriz \"maze\" que representa el laberinto. Esta matriz se inicializa con un borde \n# de \"#\" (paredes) alrededor del laberinto, y luego se rellena con los caracteres de entrada \n# que representan las celdas vacías (\".\") o las paredes (\"#\").\n\nsteps = [[0,1],[0,-1],[1,0],[-1,0]]\n#lista \"steps\" que contiene las posibles direcciones en las que se puede moverse en el \n# laberinto (arriba, abajo, derecha e izquierda).\n \n \nempty = -k\n#Se inicializa una variable \"empty\" con el valor -k. Esta variable llevará la \n# cuenta de cuántas celdas vacías quedan por visitar\n\nx, y = None, None\n#busca la posición inicial del laberinto, que es la primera celda vacía que se encuentra en la \n# matriz \"maze\". Se guarda la posición de esta celda en las variables \"x\" e \"y\".\n \nfor i in range(n+2):\n \n empty += maze[i].count(\".\")\n \n for j in range(m+2):\n \n if maze[i][j] == \".\":\n \n x, y = i, j\n \n break\n \n \n \nstack = [(x,y)] # Se crea una pila \"stack\" que contiene la posición inicial del laberinto.\n \nwhile empty: # inicia un bucle \"while\" que continúa mientras queden celdas vacías por visitar.\n # En cada iteración del bucle, se extrae la última posición de la pila \"stack\" y se guarda \n # en las variables \"x\" e \"y\". Si la celda en esta posición ya ha sido visitada (es decir, si su valor es \"v\")\n # se salta a la siguiente iteración del bucle.\n (x, y) = stack.pop()\n \n # se recorren las posibles direcciones en las que se puede moverse (definidas en la lista \"steps\") \n # y se comprueba si la celda adyacente en esa dirección es una celda vacía. Si es así, se agrega la \n # posición de la celda adyacente a la pila \"stack\".\n if maze[x][y] == \"v\":\n \n continue\n \n for dx, dy in steps:\n \n if maze[x+dx][y+dy] == \".\":\n \n stack.append((x+dx, y+dy))\n\n # se marca la celda actual como visitada (\"v\") y se decrementa el valor de \"empty\" \n # para indicar que se ha visitado una celda más.\n maze[x][y] = \"v\"\n \n empty -= 1\n \n \n# 11.\tCuando el bucle \"while\" termina, significa que se han visitado todas las celdas vacías del laberinto. \n# Se recorre entonces la matriz \"maze\" y se imprime una representación del laberinto en la que las celdas vacías \n# se marcan con una \"X\" y las celdas visitadas se marcan con un \".\". Esto se hace mediante el uso de la función \"join\" \n# y el método \"replace\".\nfor row in maze[1:-1]:\n \n print(\"\".join(row[1:-1]).replace(\".\",\"X\").replace(\"v\",\".\"))\n\n# ******************************** RESUMEN ****************************\n#El programa resuelve el problema Maze o Laberinto de programación utilizando una búsqueda en anchura \n# (BFS, por sus siglas en inglés). Esto significa que explora el laberinto de manera amplia, visitando \n# todas las celdas adyacentes a una celda antes de profundizar más.\n#Para ello, el programa utiliza una pila \"stack\" para almacenar las posiciones de las celdas que aún \n# deben ser visitadas. En cada iteración del bucle principal, se extrae la última posición de la pila \n# y se marca como visitada. Luego, se recorren las posibles direcciones en las que se puede moverse y \n# se añaden a la pila las posiciones de las celdas adyacentes que aún no han sido visitadas. El bucle \n# termina cuando se han visitado todas las celdas vacías del laberinto.\n#Por último, se imprime una representación del laberinto con las celdas vacías marcadas con una \"X\" y \n# las celdas visitadas marcadas con un \".\".\n\t\t\t\t \t \t\t \t \t \t \t\t\t\t\t \t", "n, m, k = map(int, input().split())\n\na = [0]*n\n\nw = [0]*n\n\nfor i in range(n):\n\ta[i] = list(input())\n\tw[i] = [0]*m\n\nfor sx in range(n):\n\tif a[sx].count('.'):\n\t\tsy = a[sx].index('.')\n\t\tbreak\n\naux = [0]*(n*m)\naux[0] = (sx, sy)\nw[sx][sy] = 1\nauxl = 0\nauxr = 1\n\nwhile auxl < auxr:\n\tx, y = aux[auxl]\n\tauxl += 1\n\tfor dx, dy in ((0,1), (0, -1), (1, 0), (-1, 0)):\n\t\txx = x + dx\n\t\tyy = y + dy\n\t\tif xx >= 0 and xx < n \\\n\t\tand yy >= 0 and yy < m \\\n\t\tand a[xx][yy] == '.' \\\n\t\tand w[xx][yy] == 0:\n\t\t\tw[xx][yy] = 1\n\t\t\taux[auxr] = (xx, yy)\n\t\t\tauxr += 1\n\nfor j in range(auxr-1, auxr-1-k, -1):\n\tx, y = aux[j]\n\ta[x][y] = 'X'\n\nfor j in range(n):\n\tprint(*a[j], sep='')\n\n#118110593", "from collections import deque\r\n\r\n\r\nn,m,k=map(int,input().split())\r\nt=0\r\nstartNode=False\r\nourMaze=[['' for _ in range(m)] for _ in range(n)] \r\ndx=[0,0,-1,1]\r\ndy=[-1,1,0,0]\r\n\r\ndef bfsMaze(startX,startY,t):\r\n ourMaze[startX][startY]='1'\r\n t-=1\r\n xQueue=deque([startX])\r\n yQueue=deque([startY])\r\n while xQueue:\r\n x=xQueue.popleft()\r\n y=yQueue.popleft()\r\n for c in range(4):\r\n if t==0:\r\n return\r\n sx=x+dx[c]\r\n sy=y+dy[c]\r\n if sx>=n or sy>=m or sx<0 or sy<0:\r\n continue\r\n if ourMaze[sx][sy]=='.':\r\n xQueue.append(sx)\r\n yQueue.append(sy)\r\n ourMaze[sx][sy]='1'\r\n t-=1\r\n\r\n\r\nfor i in range(n):\r\n line=input()\r\n for j in range(m):\r\n ourMaze[i][j]=line[j]\r\n if ourMaze[i][j] == '.':\r\n t+=1\r\n if not startNode:\r\n startX=i\r\n startY=j\r\n startNode=True\r\nt-=k\r\nbfsMaze(startX,startY,t)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if ourMaze[i][j]=='1':\r\n print('.',end='')\r\n if ourMaze[i][j]=='.':\r\n print('X',end='')\r\n if ourMaze[i][j]=='#':\r\n print('#',end='')\r\n print()", "n,m,k=map(int,input().split())\r\nMAP=[list(input().strip()) for i in range(n)]\r\n\r\nUSED=[[0]*m for i in range(n)]\r\n\r\n\r\n\r\nempty=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if MAP[i][j]==\".\":\r\n empty+=1\r\n\r\n x,y=i,j\r\n\r\nrest=empty-k\r\nUSED[x][y]=1\r\ncount=1\r\nQ=[(x,y)]\r\n\r\nwhile Q:\r\n x,y=Q.pop()\r\n if count==rest:\r\n break\r\n\r\n for z,w in [(x+1,y),(x-1,y),(x,y+1),(x,y-1)]:\r\n if 0<=z<n and 0<=w<m and USED[z][w]==0 and MAP[z][w]==\".\":\r\n USED[z][w]=1\r\n count+=1\r\n Q.append((z,w))\r\n\r\n\r\n if count==rest:\r\n break\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if USED[i][j]==0 and MAP[i][j]==\".\":\r\n MAP[i][j]=\"X\"\r\n\r\nfor m in MAP:\r\n print(\"\".join(m))\r\n", "n,m,k=map(int,input().split())\r\ngrid=[list(input()) for i in range(n)]\r\nv=set()\r\nv1=set()\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j]=='.':\r\n c+=1\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j]=='.' and i*m+j not in v1:\r\n if v1:\r\n grid[i][j]='X'\r\n continue\r\n q=[i*m+j]\r\n while q and len(v1)<c-k:\r\n node=q[0]\r\n del q[0]\r\n x=node//m\r\n y=node%m\r\n v1.add(node)\r\n if x>0 and grid[x-1][y]=='.' and node-m not in v:\r\n q.append(node-m)\r\n v.add(node-m)\r\n if x<n-1 and grid[x+1][y]=='.' and node+m not in v:\r\n q.append(node+m)\r\n v.add(node+m)\r\n if y>0 and grid[x][y-1]=='.' and node-1 not in v:\r\n q.append(node-1)\r\n v.add(node-1)\r\n if y<m-1 and grid[x][y+1]=='.' and node+1 not in v:\r\n q.append(node+1)\r\n v.add(node+1)\r\nfor row in grid:\r\n print(''.join(row))\r\n \r\n", "from collections import deque\nn,m,k=map(int,input().split())\nvisited=[[False for i in range(m)] for x in range(n)]\nmaze=[[None for i in range(m)]for x in range(n)]\nc=0\nt=0\ninitial=None\nfor i in range(n):\n\tl=list(input())\n\tfor j in range(m):\n\t\tif l[j]==\".\":\n\t\t\tmaze[i][j]=\"X\"\n\t\t\tinitial=(i,j)\n\t\t\tc+=1\n\t\telse:\n\t\t\tmaze[i][j]=l[j]\n\nstack=deque()\nstack.append(initial)\n\nwhile stack:\n\ti,j=stack.pop()\n\tif i<0 or i>=n or j<0 or j>=m or visited[i][j] or t==c-k:\n\t\tcontinue\n\tif maze[i][j]==\"X\":\n\t\tmaze[i][j]=\".\"\n\t\tt=t+1\n\t\tstack.append((i,j-1))\n\t\tstack.append((i,j+1))\n\t\tstack.append((i-1,j))\n\t\tstack.append((i+1,j))\nfor i in maze:\n\tprint(\"\".join(i))", "n, m, k = map(int, input().split())\n\n# read grid, replace all '.' with 'X'\ng = [input().replace('.', 'X') for i in range(n)]\n\n# compute the number of steps\n#k = n * m - k - sum(i.count('#') for i in t)\n\nempty = 0\nfor i in range(n):\n for j in range(m):\n if g[i][j] == 'X':\n empty += 1\n\nk = empty - k\n\n# convert all strings to list (for element modification)\ng = [list(i) for i in g]\ni, p = 0, []\n\nwhile k:\n if 'X' in g[i]:\n j = g[i].index('X')\n\n g[i][j], p = '.', [(i, j)]\n k -= 1\n break\n i += 1\n \nwhile k:\n x, y = p.pop()\n for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\n if i < 0 or j < 0: continue\n if i < n and j < m and g[i][j] == 'X':\n g[i][j] = '.'\n p.append((i, j))\n k -= 1\n if k == 0: break\n\nfor row in g:\n print(''.join(row))\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 # Write Your Code Here\r\n n,m,k = get_ints_in_variables()\r\n maze = []\r\n for _ in range(0, n):\r\n ip = input()\r\n maze.append(ip)\r\n \r\n mp = {}\r\n count = 0\r\n start = 0\r\n for i in range(0, n):\r\n for j in range(0, m):\r\n count += 1\r\n if maze[i][j] != \"#\":\r\n start = count\r\n if maze[i][j] not in mp:\r\n mp[count] = []\r\n # mp[(i+1)*(j+1)].append()\r\n # check left is safe\r\n if (j-1)>=0:\r\n if maze[i][j-1] != \"#\":\r\n mp[count].append(count-1)\r\n # check upper is safe\r\n if (i-1)>=0:\r\n if maze[i-1][j] != \"#\":\r\n mp[count].append(((i-1)*m)+(j+1))\r\n # check right is safe\r\n if (j+1)<m:\r\n if maze[i][j+1] != \"#\":\r\n mp[count].append(count+1)\r\n # check bottom is safe\r\n if (i+1)<n:\r\n if maze[i+1][j] != \"#\":\r\n mp[count].append(((i+1)*m)+(j+1))\r\n \r\n visited = []\r\n st = []\r\n for i in range(0, (m*n)+1):\r\n visited.append(False)\r\n\r\n res = []\r\n # def dfs():\r\n # # visited[start] = True\r\n st.append(start)\r\n while len(st) > 0:\r\n tmp = st.pop()\r\n if visited[tmp] == False:\r\n visited[tmp] = True\r\n res.append(tmp)\r\n for i in range(0, len(mp[tmp])):\r\n st.append(mp[tmp][i])\r\n\r\n result = [] \r\n for i in range(0, n):\r\n tmpArr = []\r\n for j in range(0, m):\r\n tmpArr.append(maze[i][j])\r\n result.append(tmpArr)\r\n \r\n start = len(res)-1\r\n mpp = {}\r\n while k > 0:\r\n mpp[res[start]] = res[start]\r\n start -= 1\r\n k -= 1\r\n \r\n count = 0\r\n for i in range(0, n):\r\n for j in range(0, m):\r\n count += 1\r\n if count in mpp:\r\n result[i][j] = \"X\"\r\n \r\n for i in range(0, n):\r\n tmpp = \"\".join(result[i])\r\n print(tmpp)\r\n\r\n\r\n\r\n\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from collections import deque\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\ngrid = [list(input()) for _ in range(n)]\r\n\r\ndi = [0,0,-1,1]\r\ndj = [1,-1,0,0]\r\n\r\ns = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n s += (grid[i][j] == '.')\r\n\r\n if grid[i][j] == '.':\r\n si, sj = i, j\r\n\r\nvis = [[False]*m for _ in range(n)]\r\nq = deque([(si, sj)])\r\nvis[si][sj] = True\r\n\r\ncount = 0\r\nwhile len(q) > 0:\r\n i, j = q.popleft()\r\n grid[i][j] = '0'\r\n count += 1\r\n if count == s-k:\r\n break\r\n\r\n for kk in range(4):\r\n x = i + di[kk]\r\n y = j + dj[kk]\r\n\r\n if x < 0 or x >= n or y < 0 or y >= m:\r\n continue\r\n if grid[x][y] == '#' or vis[x][y]:\r\n continue\r\n \r\n vis[x][y] = True\r\n q.append((x,y))\r\n\r\nfor row in grid:\r\n for j in range(m):\r\n if row[j] == '.':\r\n row[j] = 'X'\r\n if row[j] == '0':\r\n row[j] = '.'\r\n \r\n print(''.join(row))\r\n \r\n", "n, m, k = map(int, input().split())\r\narr = [list(input()) for _ in range(n)]\r\n\r\nif k == 0:\r\n for row in arr:\r\n for element in row:\r\n print(element, end=\"\")\r\n print(\"\")\r\n exit(0)\r\n\r\nx, y = -1, -1\r\nto_visit = -k\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n to_visit += 1\r\n x = i\r\n y = j\r\n\r\n\r\ns = [(x, y)]\r\nwhile to_visit > 0 and len(s) > 0:\r\n i, j = s.pop()\r\n arr[i][j] = '?'\r\n to_visit -= 1\r\n if i > 0 and arr[i - 1][j] == '.':\r\n s.append((i - 1, j))\r\n arr[i-1][j] = '@'\r\n if i < n - 1 and arr[i + 1][j] == '.':\r\n s.append((i + 1, j))\r\n arr[i+1][j] = '@'\r\n if j > 0 and arr[i][j - 1] == '.':\r\n s.append((i, j - 1))\r\n arr[i][j-1] = '@'\r\n if j < m - 1 and arr[i][j + 1] == '.':\r\n s.append((i, j + 1))\r\n arr[i][j+1] = '@'\r\n\r\n\r\nfor row in arr:\r\n for element in row:\r\n if element == '?':\r\n print('.', end=\"\")\r\n elif element == '.' or element == '@':\r\n print('X', end=\"\")\r\n else:\r\n print(element, end=\"\")\r\n print(\"\")", "\r\nfrom collections import deque\r\n\r\n\r\nn,m,k = list(map(int, input().split()))\r\nMaze = []\r\nempty = 0\r\nfor i in range(n):\r\n line = list(input())\r\n empty += line.count(\".\")\r\n Maze.append(line)\r\nvisited = [[False]*m for _ in range(n)]\r\n\r\ndef canMove(i,j):\r\n return i<n and i >=0 and j>=0 and j<m and Maze[i][j] != \"#\"\r\n\r\ndef BFS(maze, i,j,lenNewPath):\r\n to_visit = []\r\n to_visit.append([i,j])\r\n visited[i][j] = True\r\n cpt=1\r\n while to_visit:\r\n current = to_visit.pop(0)\r\n neighbors = [[current[0]+1,current[1]],[current[0]-1,current[1]],[current[0],current[1]+1],[current[0],current[1]-1]]\r\n for neighbor in neighbors:\r\n if canMove(neighbor[0],neighbor[1]):\r\n if cpt==lenNewPath:\r\n return\r\n if (not visited[neighbor[0]][neighbor[1]]):\r\n cpt=cpt+1\r\n to_visit.append(neighbor)\r\n visited[neighbor[0]][neighbor[1]] = True\r\n \r\nBreak = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if (Maze[i][j] == \".\"):\r\n BFS(Maze,i,j,empty-k)\r\n Break = True\r\n break\r\n if Break:\r\n\r\n break\r\nfor i in range(n):\r\n line = \"\"\r\n for j in range(m):\r\n if(visited[i][j] and Maze[i][j]==\".\"):\r\n line += \".\"\r\n elif(Maze[i][j]==\"#\"):\r\n line += \"#\"\r\n else:\r\n line += \"X\"\r\n print(line)\r\n", "a, b, c = map(int, input().split())\r\n \r\nentry_list = [input().replace('.', 'X') for i in range(a)]\r\n \r\nc = a * b - c - sum(i.count('#') for i in entry_list)\r\n \r\nentry_list = [list(i) for i in entry_list]\r\n \r\nindex, final_list = 0, []\r\n \r\nwhile c:\r\n if 'X' in entry_list[index]:\r\n j = entry_list[index].index('X')\r\n entry_list[index][j], final_list = '.', [(index, j)]\r\n c -= 1\r\n break\r\n index += 1\r\nwhile c:\r\n x, y = final_list.pop()\r\n for index, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\r\n if 0 <= index < a and 0 <= j < b and entry_list[index][j] == 'X':\r\n entry_list[index][j] = '.'\r\n final_list.append((index, j))\r\n c -= 1\r\n if c == 0: break\r\nfor i in range(a):\r\n entry_list[i] = ''.join(entry_list[i])\r\nprint('\\n'.join(entry_list))\r\n", "# height, width, walls\nn, m, k = [int(num) for num in input().split()]\nmaze = [list(input()) for _ in range(n)]\n\nif k == 0:\n for line in maze:\n print(\"\".join(line))\n exit(0)\n\nline, column = -1, -1\nto_visit = -k\nfor l in range(n):\n for c in range(m):\n if maze[l][c] == \".\":\n to_visit += 1\n line = l\n column = c\n\ns = [(line, column)]\nwhile to_visit > 0 and len(s) > 0:\n l, c = s.pop()\n maze[l][c] = 'EMPTY'\n to_visit -= 1\n\n if l > 0 and maze[l - 1][c] == \".\":\n s.append((l - 1, c))\n maze[l - 1][c] = \"WALL\"\n \n if l < n - 1 and maze[l + 1][c] == \".\":\n s.append((l + 1, c))\n maze[l + 1][c] = \"WALL\"\n \n if c > 0 and maze[l][c - 1] == \".\":\n s.append((l, c - 1))\n maze[l][c - 1] = \"WALL\"\n\n if c < m - 1 and maze[l][c + 1] == \".\":\n s.append((l, c + 1))\n maze[l][c + 1] = \"WALL\"\n\nfor line in maze:\n new_line = \"\"\n for character in line:\n if character == \"EMPTY\":\n new_line += \".\"\n elif character == \".\" or character == \"WALL\":\n new_line += \"X\"\n else:\n new_line += character\n print(new_line)\n", "def perform_dfs(n, m, k, arr):\n def valid(x, y):\n return 0 <= x < n and 0 <= y < m\n\n if k == 0: \n for row in arr:\n print(''.join(row))\n return\n\n x, y = -1, -1 \n to_visit = -k \n\n for i in range(n):\n for j in range(m):\n if arr[i][j] == '.':\n to_visit += 1\n x, y = i, j\n\n stack = [(x, y)] \n while to_visit > 0 and stack:\n i, j = stack.pop()\n arr[i][j] = '?' \n\n to_visit -= 1\n \n if i > 0 and arr[i - 1][j] == '.':\n stack.append((i - 1, j))\n arr[i - 1][j] = '@'\n \n if i < n - 1 and arr[i + 1][j] == '.':\n stack.append((i + 1, j))\n arr[i + 1][j] = '@'\n \n if j > 0 and arr[i][j - 1] == '.':\n stack.append((i, j - 1))\n arr[i][j - 1] = '@'\n \n if j < m - 1 and arr[i][j + 1] == '.':\n stack.append((i, j + 1))\n arr[i][j + 1] = '@'\n\n for row in arr:\n for element in row:\n if element == '?':\n print('.', end=\"\")\n elif element == '.' or element == '@':\n print('X', end=\"\")\n else:\n print(element, end=\"\")\n print(\"\")\n\n\nif __name__ == \"__main__\":\n n, m, k = map(int, input().split())\n maze = [list(input()) for _ in range(n)] \n\n perform_dfs(n, m, k, maze)\n\n \t\t\t \t \t\t\t \t \t \t\t\t \t \t \t \t", "\r\n\r\n\r\nn, m, k = map(int, input().split())\r\ngraph = []\r\nvisited = []\r\nx = 0\r\ny = 0\r\nss = -k\r\nfor i in range(n):\r\n graph.append([])\r\n visited.append([0]*m)\r\n\r\nfor i in range(n):\r\n graph[i] = list(input())\r\n for j in range(m):\r\n if(graph[i][j] == \".\"):\r\n x = i\r\n y = j\r\n ss +=1\r\n graph[i][j] = \"X\"\r\n else:\r\n visited[i][j] = True\r\nqueue = []\r\nqueue.append((x, y))\r\n\r\nif(ss!=0):\r\n ss-=1\r\n graph[x][y] = \".\"\r\n visited[x][y] = True\r\n\r\nwhile queue:\r\n s = queue.pop(0)\r\n x = s[0]\r\n y = s[1]\r\n if(y+1<m and visited[x][y+1] == False):\r\n queue.append((x, y+1))\r\n visited[x][y+1] = True\r\n if(ss == 0):\r\n break\r\n else:\r\n ss-=1\r\n graph[x][y+1] = \".\"\r\n if(x+1<n and visited[x+1][y] == False):\r\n queue.append((x+1, y))\r\n visited[x+1][y] = True\r\n if(ss == 0):\r\n break\r\n else:\r\n ss-=1\r\n graph[x+1][y] = \".\"\r\n if(x-1>=0 and visited[x-1][y] == False):\r\n queue.append((x-1, y))\r\n visited[x-1][y] = True\r\n if(ss == 0):\r\n break\r\n else:\r\n ss-=1\r\n graph[x-1][y] = \".\"\r\n if(y-1>=0 and visited[x][y-1] == False):\r\n queue.append((x, y-1))\r\n visited[x][y-1] = True\r\n if(ss == 0):\r\n break\r\n else:\r\n ss-=1\r\n graph[x][y-1] = \".\"\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(graph[i][j], end = \"\")\r\n\r\n print(\"\")\r\n", "from collections import deque\r\nm, n, k = map(int, input().split())\r\ngraph = []\r\nfor _ in range(m):\r\n graph.append([x for x in input()])\r\nif k == 0:\r\n for x in graph:\r\n print(\"\".join(x))\r\nelse:\r\n count = 0\r\n for i in range(m):\r\n for j in range(n):\r\n if graph[i][j] == \".\":\r\n count += 1\r\n\r\n to_do = count - k\r\n flag = False\r\n for i in range(m):\r\n for j in range(n):\r\n if to_do > 0 and graph[i][j]==\".\":\r\n queue = deque([(i,j)])\r\n visited = set([(i,j)])\r\n while queue:\r\n x, y = queue.popleft()\r\n graph[x][y] = \"@\"\r\n to_do -= 1\r\n if to_do <= 0:\r\n flag = True\r\n break\r\n for nx,ny in (x-1,y),(x+1,y),(x,y-1),(x,y+1):\r\n if 0 <= nx < m and 0 <= ny < n and (nx,ny) not in visited and graph[nx][ny]==\".\":\r\n queue.append((nx,ny))\r\n visited.add((nx,ny))\r\n if flag == True:\r\n break\r\n \r\n for i in range(m):\r\n for j in range(n):\r\n if graph[i][j] == \".\":\r\n graph[i][j] = \"X\"\r\n elif graph[i][j] == \"@\":\r\n graph[i][j] = \".\"\r\n\r\n\r\n for x in graph:\r\n print(\"\".join(x))\r\n\r\n\r\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\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\nm,n,k=li()\r\n\r\nmat=[]\r\nfor _ in range(m):\r\n mat.append(list(input()))\r\n\r\nt=0\r\nx=y=0\r\nfor i in range(m):\r\n for j in range(n):\r\n if mat[i][j]==\".\":\r\n t+=1\r\n mat[i][j]=\"X\"\r\n x,y=i,j\r\n\r\np=t-k\r\n\r\n#print(t,p,k)\r\n\r\nque=deque([(x,y)])\r\n\r\nvis={(x,y)}\r\nwhile True:\r\n x,y=que.popleft()\r\n mat[x][y]=\".\"\r\n p-=1\r\n if p==0:\r\n break\r\n for nx,ny in [(x-1,y),(x+1,y),(x,y-1),(x,y+1)]:\r\n if 0<=nx<m and 0<=ny<n and mat[nx][ny]==\"X\" and (nx,ny) not in vis:\r\n que.append((nx,ny))\r\n vis.add((nx,ny))\r\n\r\nfor i in range(m):\r\n print(\"\".join(mat[i]))\r\n\r\n\r\n", "n, m, k = map(int, input().split())\ng = [input().replace(\".\", \"X\") for i in range(n)]\nk = n * m - k - sum(i.count(\"#\") for i in g)\ng = [list(i) for i in g]\ni, p = 0, []\n\nwhile k:\n if \"X\" in g[i]:\n j = g[i].index(\"X\")\n g[i][j], p = \".\", [(i, j)]\n k -= 1\n break\n i += 1\n\nwhile k:\n x, y = p.pop()\n for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\n if i < 0 or j < 0:\n continue\n if i < n and j < m and g[i][j] == \"X\":\n g[i][j] = \".\"\n p.append((i, j))\n k -= 1\n if k == 0:\n break\n\nfor i in range(n):\n g[i] = \"\".join(g[i])\n\nprint(\"\\n\".join(g))\n", "n, m, k = map(int, input().split())\r\n\r\narr = []\r\nfor i in range(0,n):\r\n arr.append(list(input()))\r\n\r\nx, y = -1, -1\r\nv = k\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n v -= 1\r\n x = i\r\n y = j\r\n\r\ns = [(x, y)]\r\nwhile v < 0 and len(s) > 0:\r\n i, j = s.pop()\r\n arr[i][j] = 'V'\r\n v += 1\r\n if i > 0 and arr[i - 1][j] == '.':\r\n s.append((i - 1, j))\r\n arr[i-1][j] = 'P'\r\n if i < n - 1 and arr[i + 1][j] == '.':\r\n s.append((i + 1, j))\r\n arr[i+1][j] = 'P'\r\n if j > 0 and arr[i][j - 1] == '.':\r\n s.append((i, j - 1))\r\n arr[i][j-1] = 'P'\r\n if j < m - 1 and arr[i][j + 1] == '.':\r\n s.append((i, j + 1))\r\n arr[i][j+1] = 'P'\r\n\r\nfor r in arr:\r\n for e in r:\r\n if e == 'V':\r\n print('.', end=\"\")\r\n elif e == '.' or e == 'P':\r\n print('X', end=\"\")\r\n else:\r\n print(e, end=\"\")\r\n print(\"\")\r\n", "from collections import deque as dq\nn, m, k = map(int, input().split())\n\ng = [[] for i in range(n)]\nc = 0\nfor i in range(n):\n a = input()\n a = [j for j in a]\n for j in range(m):\n if a[j] == '.':\n a[j] = 'X'\n x = (i, j)\n c += 1\n g[i].append(a[j])\n\nd = dq()\nd.append(x)\nrest = 0\nwhile len(d) > 0:\n i, j = d.popleft()\n\n if rest == c-k:\n break\n\n if g[i][j] == 'X':\n if i > 0:\n d.append((i-1, j))\n if j > 0:\n d.append((i, j-1))\n if i < n-1:\n d.append((i+1, j))\n if j < m-1:\n d.append((i, j+1))\n\n g[i][j] = '.'\n rest += 1\n\nfor i in range(n):\n for j in range(m):\n print(g[i][j], end='')\n print('')\n", "def solve():\r\n n,m,k=map(int,input().split())\r\n Maze=[list(input())for row in range(n)]\r\n bfs(Maze,n,m,k)\r\n print(\"\\n\".join(\"\".join(row) for row in Maze))\r\ndef bfs(M,n,m,k):\r\n r,c=findEmptyCell(M)\r\n visited=[[False for col in range(m)]for row in range(n)]\r\n visited[r][c]=True\r\n queue=deque()\r\n queue.append((r,c))\r\n s=sum(sum((x==\".\"for x in row),0)for row in M)\r\n toConnect=s-k-1\r\n while queue:\r\n coords=queue.popleft()\r\n for(r,c)in neighbors(coords,n,m):\r\n if not visited[r][c]and M[r][c]==\".\":\r\n visited[r][c]=True\r\n queue.append((r,c))\r\n toConnect-=1\r\n if toConnect<0:\r\n M[r][c]=\"X\"\r\ndef findEmptyCell(M):\r\n for(r, row)in enumerate(M):\r\n for(c, cell)in enumerate(row):\r\n if cell==\".\":\r\n return(r, c)\r\ndef neighbors(coords,n,m):\r\n r,c=coords\r\n if r>0:\r\n yield(r-1,c)\r\n if r<n-1:\r\n yield(r+1,c)\r\n if c>0:\r\n yield(r,c-1)\r\n if c<m-1:\r\n yield(r,c+1)\r\nif __name__ =='__main__':\r\n from collections import deque\r\n solve()", "a, b, c = map(int, input().split())\r\nlista = [[\"#\"]*(b+2)] + [[\"#\"] + list(input()) + [\"#\"] for _ in range(a)] + [[\"#\"]*(b+2)]\r\nt = sum(l.count(\".\") for l in lista)\r\nst=[]\r\nfor i in range(a+2):\r\n for j in range(b+2):\r\n if lista[i][j]=='.':\r\n st.append((i,j))\r\n break\r\n if len(st)>0:\r\n break\r\n \r\nd = 0\r\nwhile d < t - c:\r\n i, j = st.pop(0)\r\n if lista[i][j] != \".\":\r\n continue\r\n lista[i][j] = \"O\"\r\n d += 1\r\n for x, y in ((i-1, j), (i+1, j), (i, j-1), (i, j+1)):\r\n if lista[x][y] == \".\":\r\n st.append((x, y))\r\n \r\nlista = \"\\n\".join(\"\".join(l[1:-1]) for l in lista[1:-1])\r\nprint(lista.replace(\".\", \"X\").replace(\"O\", \".\"))", "# Fast IO Region\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\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 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 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 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\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef main():\r\n from collections import deque\r\n n,m,k=map(int,input().split())\r\n l=[]\r\n nn=0\r\n for i in range(n):\r\n s=[*input().strip().replace('.','X')]\r\n l.append(s)\r\n nn+=s.count('X')\r\n gr=[[]for i in range(n*m)]\r\n for x in range(n):\r\n for i in range(m):\r\n if l[x][i]=='X':\r\n try:\r\n if l[x][i+1]=='X':gr[(x)*(m)+i].append((x)*(m)+i+1)\r\n except:pass\r\n try:\r\n if l[x+1][i]=='X':gr[(x)*(m)+i].append((x+1)*(m)+i)\r\n except:pass\r\n try:\r\n if l[x][i-1]=='X'and i>0:gr[(x)*(m)+i].append((x)*(m)+i-1)\r\n except:pass\r\n try:\r\n if l[x-1][i]=='X'and x>0:gr[(x)*(m)+i].append((x-1)*(m)+i)\r\n except:pass\r\n\r\n queue=deque()\r\n used={i:0 for i in range(n*m)}\r\n first=-1\r\n for i in range(len(gr)):\r\n if gr[i]:first=i;break\r\n global q\r\n q=[]\r\n def bfs(used,queue,le):\r\n i=queue.pop()\r\n q.append(i)\r\n if gr[i]:\r\n used[i]=1\r\n for x in gr[i]:\r\n if used[x]==0:\r\n used[x]=1\r\n queue.append(x)\r\n le+=1\r\n return used,queue,le\r\n if first!=-1:\r\n queue.append(first)\r\n le=1\r\n while nn-le>k:\r\n used,queue,le=bfs(used,queue,le)\r\n queue=q+[*queue]\r\n for g in range(nn-k):\r\n l[queue[g]//m][queue[g]%m]='.'\r\n for i in l:\r\n print(''.join(i))\r\n else:\r\n if k==1:\r\n for i in l:\r\n print(''.join(i))\r\n else:\r\n for i in l:\r\n print(''.join(i).replace('X','.'))\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n", "import queue\r\n\r\nn, m, k = list(map(int, input().split()))\r\nsuporte = [['a'] * m for _ in range(n)]\r\nvisitado = [[False] * m for _ in range(n)]\r\ns = 0\r\ncomeco = (-1, -1)\r\nfor i in range(n):\r\n suporte[i] = list(input().rstrip())\r\n if k > 0:\r\n for j in range(m):\r\n if suporte[i][j] == '.':\r\n s += 1\r\n comeco = (i, j)\r\n \r\ndiferenca = s - k\r\nif diferenca > 0:\r\n q = queue.Queue()\r\n q.put(comeco)\r\n visitado[comeco[0]][comeco[1]] = True\r\n diferenca -= 1\r\n while diferenca > 0:\r\n cur = q.get()\r\n i, j = cur\r\n if i > 0 and suporte[i - 1][j] == '.' and not visitado[i - 1][j]:\r\n q.put((i - 1, j))\r\n visitado[i - 1][j] = True\r\n diferenca -= 1\r\n if diferenca == 0:\r\n break\r\n if j > 0 and suporte[i][j - 1] == '.' and not visitado[i][j - 1]:\r\n q.put((i, j - 1))\r\n visitado[i][j - 1] = True\r\n diferenca -= 1\r\n if diferenca == 0:\r\n break\r\n if i < n - 1 and suporte[i + 1][j] == '.' and not visitado[i + 1][j]:\r\n q.put((i + 1, j))\r\n visitado[i + 1][j] = True\r\n diferenca -= 1\r\n if diferenca == 0:\r\n break\r\n if j < m - 1 and suporte[i][j + 1] == '.' and not visitado[i][j + 1]:\r\n q.put((i, j + 1))\r\n visitado[i][j + 1] = True\r\n diferenca -= 1\r\n if diferenca == 0:\r\n break\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if suporte[i][j] == '.' and not visitado[i][j]:\r\n suporte[i][j] = 'X'\r\nfor coluna in suporte:\r\n print(''.join(coluna))", "from ensurepip import bootstrap\nfrom itertools import count\nimport sys\nfrom collections import Counter, deque\nfrom types import GeneratorType\nresult = []\n\n# input = sys.stdin.readline\n\ndef bootstrap(f, stack=[]):\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 \n return wrappedfunc\n\n\n\nn, m, k = map(int, input().split())\n\n\nmatrix = []\n\n\nfor i in range(n):\n matrix.append(list(input()))\n\n\n\n\nvisited = set()\n\ndef getNeighbours(row, col):\n neighbours = []\n\n\n for rowInc, colInc in [[1, 0], [-1, 0], [0, 1], [0, -1]]:\n newRow, newCol = row + rowInc, col + colInc\n if 0 <= newRow < n and 0 <= newCol < m and matrix[newRow][newCol] == '.':\n neighbours.append([newRow, newCol])\n\n return neighbours \n\nqueue = deque()\n\n\ntotal = 0\n\n\nfor row in matrix:\n for cell in row:\n total += cell == \".\"\n\n\n@bootstrap\ndef dfs(row, col):\n if len(visited) == (total - k):\n yield None\n\n neighbours = getNeighbours(row, col)\n\n visited.add((row, col))\n for neighbour in neighbours:\n if tuple(neighbour) not in visited:\n (yield dfs(neighbour[0], neighbour[1]))\n\n yield None \n\n\n\nfor row in range(n):\n for col in range(m):\n if matrix[row][col] == '.':\n dfs(row, col)\n break\n\n\nfor row in range(n):\n for col in range(m):\n if matrix[row][col] == '.' and (row, col) not in visited:\n matrix[row][col] = \"X\"\n\n\nfor row in matrix:\n print(''.join(row))\n\t \t \t \t \t\t\t \t\t\t", "n, m, k = map(int, input().split())\r\nt = [input().replace('.', 'X') for i in range(n)]\r\nk = n * m - k - sum(i.count('#') for i in t)\r\nt = [list(i) for i in t]\r\ni, p = 0, []\r\nwhile k:\r\n if 'X' in t[i]:\r\n j = t[i].index('X')\r\n t[i][j], p = '.', [(i, j)]\r\n k -= 1\r\n break\r\n i += 1\r\nwhile k:\r\n x, y = p.pop()\r\n for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\r\n if i < 0 or j < 0: continue\r\n if i < n and j < m and t[i][j] == 'X':\r\n t[i][j] = '.'\r\n p.append((i, j))\r\n k -= 1\r\n if k == 0: break\r\nfor i in range(n): t[i] = ''.join(t[i])\r\nprint('\\n'.join(t))", "n, m, k = [int(i) for i in input().split()]\r\n \r\nmaze = []\r\nfor row in range (n):\r\n ro = []\r\n temp = input()\r\n for i in temp:\r\n if i == '.':\r\n ro.append(1)\r\n \r\n else:\r\n ro.append(0)\r\n maze.append(ro)\r\n# print(maze)\r\ndone = 0\r\nfor i in range (n):\r\n if done == 1:\r\n break\r\n for j in range (m):\r\n if maze[i][j] == 1:\r\n root_node = [i, j]\r\n done = 1\r\n break\r\n \r\nvisited = [[0 for i in range (m)] for j in range (n)]\r\n \r\nvisited[root_node[0]][root_node[1]] = 1\r\n \r\nlevels = []\r\nlevels.append([root_node])\r\n# print(root_node)\r\n \r\nstop = 0\r\nwhile True:\r\n if stop == 1:\r\n break\r\n \r\n else:\r\n bottom_most_nodes = levels[-1]\r\n upcoming_nodes = []\r\n \r\n for node in bottom_most_nodes:\r\n i, j = node[0], node[1]\r\n if i == 0:\r\n if j == 0:\r\n for row, col in [[min(i+1, n-1), j], [i, min(j+1, m-1)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n elif j == m-1:\r\n for row, col in [[min(i+1, n-1), j], [i, max(j-1, 0)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n else:\r\n for row, col in [[min(i+1, n-1), j], [i, min(j+1, m-1)], [i, max(j-1, 0)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n elif i == n-1:\r\n if j == 0:\r\n for row, col in [[max(i-1, 0), j], [i, min(j+1, m-1)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n elif j == m-1:\r\n for row, col in [[max(i-1, 0), j], [i, max(j-1, 0)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n else:\r\n for row, col in [[max(i-1, 0), j], [i, min(j+1, m-1)], [i, max(j-1, 0)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n else:\r\n if j == 0:\r\n for row, col in [[max(i-1, 0), j], [min(i+1, n-1), j], [i, min(j+1, m-1)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n elif j == m-1:\r\n for row, col in [[min(i+1, n-1), j], [max(i-1, 0), j], [i, max(j-1, 0)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n else:\r\n for row, col in [[min(i+1, n-1), j], [i, min(j+1, m-1)], [max(i-1, 0), j], [i, max(j-1, 0)]]:\r\n if maze[row][col] == 1 and visited[row][col] == 0:\r\n upcoming_nodes.append([row, col])\r\n visited[row][col] = 1\r\n \r\n if upcoming_nodes == []:\r\n stop = 1\r\n break\r\n \r\n else:\r\n levels.append(upcoming_nodes)\r\n \r\n \r\nfinal_arcitect = []\r\nfor i in maze:\r\n temp = []\r\n for j in i:\r\n temp.append(j)\r\n \r\n final_arcitect.append(temp)\r\n \r\nremaining = k\r\nwhile (remaining > 0):\r\n current_level = levels.pop(-1)\r\n if len(current_level) <= remaining:\r\n for j in current_level:\r\n maze[j[0]][j[1]] = -1\r\n \r\n remaining -= len(current_level)\r\n else:\r\n for j in range (remaining):\r\n maze[current_level[j][0]][current_level[j][1]] = -1\r\n \r\n remaining = 0\r\n \r\nfor i in range (n):\r\n line = ''\r\n for j in range (m):\r\n if maze[i][j] == 1:\r\n line += '.'\r\n elif maze[i][j] == 0:\r\n line += '#'\r\n else:\r\n line += 'X'\r\n print(line)", "n,m,k=map(int,input().split())\r\ns=0\r\ng=[]\r\nx,y=-1,-1\r\nfor i in range(n):\r\n t=[i for i in input()]\r\n g.append(t)\r\n c=0\r\n for j in range(m):\r\n if t[j]==\".\":\r\n c+=1\r\n x,y=i,j\r\n s+=c\r\nq=[(x,y)]\r\nv=set()\r\nv.add((x,y))\r\nwhile q and len(v)<s-k:\r\n x,y=q.pop()\r\n for dx,dy in [(1,0),(0,1),(0,-1),(-1,0)]:\r\n nx,ny=dx+x,dy+y\r\n if 0<=nx<n and 0<=ny<m and g[nx][ny]==\".\" and (nx,ny) not in v:\r\n v.add((nx,ny))\r\n q.append((nx,ny))\r\n if len(v)==s-k:\r\n break\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j]==\".\" and (i,j) not in v:\r\n g[i][j]=\"X\"\r\nfor i in g:\r\n print(\"\".join(i))", "from collections import deque\r\n\r\ndef bfsMaze(starti,startj,t):\r\n Maze[starti][startj]='1'\r\n t-=1\r\n iQueue=deque([starti])\r\n jQueue=deque([startj])\r\n while iQueue:\r\n i=iQueue.popleft()\r\n j=jQueue.popleft()\r\n for k in range(4):\r\n if t==0:\r\n return\r\n si=i+di[k]\r\n sj=j+dj[k]\r\n if si>=n or si<0 or sj>=m or sj<0:\r\n continue\r\n if Maze[si][sj]=='.':\r\n iQueue.append(si)\r\n jQueue.append(sj)\r\n Maze[si][sj]='1'\r\n t-=1\r\n\r\nn,m,k=map(int,input().split())\r\nMaze=[['' for _ in range(m)] for _ in range(n)] \r\n\r\ndi=[0,0,-1,1]\r\ndj=[-1,1,0,0]\r\n\r\nt=0\r\nstart=False\r\nfor i in range(n):\r\n line=input()\r\n for j in range(m):\r\n Maze[i][j]=line[j]\r\n if Maze[i][j] == '.':\r\n t+=1\r\n if not start:\r\n starti=i\r\n startj=j\r\n start=True\r\nt-=k\r\nbfsMaze(starti,startj,t)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if Maze[i][j]=='1':\r\n print('.',end='')\r\n if Maze[i][j]=='.':\r\n print('X',end='')\r\n if Maze[i][j]=='#':\r\n print('#',end='')\r\n print()", "x, y, z = list(map(int, input().split()))\nvisited = [[False for i in range(y)] for j in range(x)]\nmaze = [[None for i in range(y)] for j in range(x)]\ntotal, cnt = 0, 0\npos = None\nfor i in range(x):\n l = list(input())\n for j in range(y):\n if l[j] == \".\":\n maze[i][j] = \"X\"\n pos = (i, j)\n total += 1\n else:\n maze[i][j] = l[j]\nlista = []\nlista.append(pos)\nwhile lista:\n i, j = lista.pop()\n if i < 0 or i >= x or j < 0 or j >= y or visited[i][j] or cnt == total - z:\n continue\n if maze[i][j] == \"X\":\n maze[i][j] = \".\"\n cnt = cnt + 1\n lista.append((i, j - 1))\n lista.append((i, j + 1))\n lista.append((i - 1, j))\n lista.append((i + 1, j))\nfor i in maze:\n print(\"\".join(i))\n \t\t\t\t\t \t \t \t\t\t\t\t\t\t \t \t\t", "n,m,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nv={}\r\ntotal=0\r\nq=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='.':\r\n v[(i,j)]=False\r\n if total==0:\r\n q.append([i,j])\r\n total+=1\r\nc=0\r\nwhile len(q)!=0:\r\n e=q[0]\r\n q.pop(0)\r\n i,j=e\r\n if v[(i,j)]:\r\n continue\r\n v[(i,j)]=True\r\n c+=1\r\n if c>total-k:\r\n l[i][j]='X'\r\n if j-1>=0 and l[i][j-1]=='.':\r\n q.append([i,j-1])\r\n if j+1<m and l[i][j+1]=='.':\r\n q.append([i,j+1])\r\n if i-1>=0 and l[i-1][j]=='.':\r\n q.append([i-1,j])\r\n if i+1<n and l[i+1][j]=='.':\r\n q.append([i+1,j])\r\n\r\nfor i in l:\r\n print(''.join(i))\r\n", "from collections import deque\r\n\r\nn, m, k = map(int, input().split())\r\nt = [input().replace('.', 'X') for _ in range(n)]\r\nk = n * m - k - sum(i.count('#') for i in t)\r\nt = [list(i) for i in t]\r\n\r\ndef bfs(x, y,k):\r\n # nonelocal k\r\n queue = deque([(x, y)])\r\n while queue and k:\r\n x, y = queue.popleft()\r\n if t[x][y] == 'X':\r\n t[x][y] = '.'\r\n k -= 1\r\n if k == 0:\r\n return\r\n for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < n and 0 <= ny < m and t[nx][ny] == 'X':\r\n queue.append((nx, ny))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if t[i][j] == 'X':\r\n bfs(i, j,k)\r\n break\r\n else:\r\n continue\r\n break\r\n\r\nfor i in range(n):\r\n t[i] = ''.join(t[i])\r\n\r\nprint('\\n'.join(t))\r\n", "#!/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]))", "directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n\ndef main():\n height, width, walls_to_add = map(int, input().split())\n total_open_squares = height * width\n maze = []\n\n for _ in range(height):\n maze.append(list(input().strip()))\n\n total_open_squares -= sum(row.count('#') for row in maze)\n required_open_squares = total_open_squares - walls_to_add\n\n def dfs(square):\n stack = [square]\n visited = set()\n visited.add(square)\n count = 1\n\n while stack and count < required_open_squares:\n x, y = stack.pop()\n for dx, dy in directions:\n new_x, new_y = x + dx, y + dy\n\n if new_x < 0 or new_y < 0 or new_x >= height or new_y >= width:\n continue\n if (new_x, new_y) in visited:\n continue\n if maze[new_x][new_y] == '#':\n continue\n visited.add((new_x, new_y))\n stack.append((new_x, new_y))\n count += 1\n if count == required_open_squares:\n return visited\n return visited\n\n visited = set()\n for i in range(height):\n for j in range(width):\n if maze[i][j] == '.':\n visited = dfs((i, j))\n break\n if visited:\n break\n\n for i in range(height):\n for j in range(width):\n if maze[i][j] == '.' and (i, j) not in visited:\n maze[i][j] = 'X'\n\n for row in maze:\n print(''.join(row))\n\nif __name__ == '__main__':\n main()\n\n\t \t \t\t \t \t\t \t \t \t \t\t\t\t", "def addWalls(row, col):\r\n count = 0\r\n\r\n queue = [(row,col)]\r\n cellsChecked[row][col] = True\r\n\r\n while queue:\r\n coordinate = queue.pop(0)\r\n count += 1\r\n\r\n y = coordinate[0]\r\n x = coordinate[1]\r\n if count > emptyCells-k:\r\n grid[y][x] = 'X'\r\n \r\n if y+1 < n and grid[y+1][x] != '#' and not cellsChecked[y+1][x]:\r\n queue.append((y+1, x))\r\n cellsChecked[y+1][x] = True\r\n\r\n if y-1 >= 0 and grid[y-1][x] != '#' and not cellsChecked[y-1][x]:\r\n queue.append((y-1, x))\r\n cellsChecked[y-1][x] = True\r\n\r\n if x+1 < m and grid[y][x+1] != '#' and not cellsChecked[y][x+1]:\r\n queue.append((y, x+1))\r\n cellsChecked[y][x+1] = True\r\n\r\n if x-1 >= 0 and grid[y][x-1] != '#' and not cellsChecked[y][x-1]:\r\n queue.append((y, x-1))\r\n cellsChecked[y][x-1] = True\r\n\r\n\r\nn, m, k = map(int,input().split())\r\n\r\ncellsChecked = [[False for _ in range(m)] for _ in range(n)]\r\ngrid = []\r\nemptyCells = 0\r\n \r\nfor row in range(n):\r\n line = list(input())\r\n grid.append(line)\r\n emptyCells += line.count('.')\r\n if '.' in line:\r\n position = (row, line.index('.'))\r\n\r\naddWalls(position[0], position[1])\r\n\r\nfor line in grid:\r\n print(''.join(line))\r\n", "# import collections\r\n#\r\n# test_cases = int(input())\r\n#\r\n# \"\"\"\r\n# 1\r\n# 15\r\n# 1 2 3 4 5 6 7 8 9 100 22 10 11 12 13\r\n# \"\"\"\r\n# for t in range(test_cases):\r\n# n = int(input())\r\n# dolls = [int(a) for a in input().strip().split(' ')]\r\n# counts = collections.Counter(dolls)\r\n# keys = counts.keys()\r\n# keys = sorted(list(keys))\r\n# res = 0\r\n# count_sim = 0\r\n# # 33 33 34 34 34 36 37\r\n# for i, k in enumerate(keys):\r\n# if i - 1 == -1:\r\n# res = counts[k]\r\n# else:\r\n# if keys[i - 1] == (k - 1):\r\n# count_sim = counts[keys[i - 1]] - counts[k]\r\n# if counts[k] <= count_sim:\r\n# continue\r\n# else:\r\n# counts_diff = counts[k] - counts[keys[i - 1]]\r\n# res += counts_diff\r\n# else:\r\n# res += counts[k]\r\n# print(str(res))\r\n\r\nfrom pprint import pprint\r\n\r\nn, m, k = map(int, input().split())\r\narr = [list(input()) for _ in range(n)] # The maze\r\n\r\nif k == 0: # if no wall needed, print maze as it is and exit\r\n for row in arr:\r\n for element in row:\r\n print(element, end=\"\")\r\n print(\"\")\r\n exit(0)\r\n\r\nx, y = -1, -1 # indices to start DFS with, x and y can point to any cell which is '.' (empty)\r\nto_visit = -k # the number of connected components of graph we need to visit(remaining '.' cells will be marked as 'X')\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n to_visit += 1\r\n x = i\r\n y = j\r\n\r\ns = [(x, y)] # a stack for performing DFS\r\nwhile to_visit > 0 and len(s) > 0:\r\n i, j = s.pop()\r\n arr[i][j] = '?' # make it anything other than '.', '#' and 'X', to mark it visited.\r\n # so we can later remaining '.' to 'X' and change '?' to '.'\r\n to_visit -= 1\r\n # top\r\n if i > 0 and arr[i - 1][j] == '.':\r\n s.append((i - 1, j))\r\n arr[i - 1][j] = '@'\r\n # bottom\r\n if i < n - 1 and arr[i + 1][j] == '.':\r\n s.append((i + 1, j))\r\n arr[i + 1][j] = '@'\r\n # left\r\n if j > 0 and arr[i][j - 1] == '.':\r\n s.append((i, j - 1))\r\n arr[i][j - 1] = '@'\r\n # right\r\n if j < m - 1 and arr[i][j + 1] == '.':\r\n s.append((i, j + 1))\r\n arr[i][j + 1] = '@'\r\n\r\nfor row in arr:\r\n for element in row:\r\n if element == '?':\r\n print('.', end=\"\")\r\n elif element == '.' or element == '@':\r\n print('X', end=\"\")\r\n else:\r\n print(element, end=\"\")\r\n print(\"\")\r\n", "from collections import deque\r\n\r\ndef reset():\r\n for i in range(n):\r\n for j in range(m):\r\n vis[i][j] = 0\r\n level[i][j] = 0\r\n\r\ndef isValid(x, y):\r\n return not vis[x][y] and x >= 0 and y >= 0 and x < n and y < m and c[x][y] == '.'\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 v.append((x, y))\r\n\r\n while q:\r\n x, y = q.popleft()\r\n\r\n for i in range(4):\r\n cx = x + dr[i]\r\n cy = y + dc[i]\r\n\r\n if isValid(cx, cy):\r\n vis[cx][cy] = 1\r\n level[cx][cy] = level[x][y] + 1\r\n v.append((cx, cy))\r\n q.append((cx, cy))\r\n\r\nmaxn = 505\r\nn, m, k = map(int, input().split())\r\nvis = [[0 for _ in range(maxn)] for _ in range(maxn)]\r\nlevel = [[0 for _ in range(maxn)] for _ in range(maxn)]\r\nv = []\r\nc = [['' for _ in range(maxn)] for _ in range(maxn)]\r\n\r\ndr = [1, 0, -1, 0]\r\ndc = [0, 1, 0, -1]\r\n\r\nreset()\r\n\r\nstart = (-1, -1)\r\n\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n c[i][j] = row[j]\r\n if c[i][j] == '.' and start == (-1, -1):\r\n start = (i, j)\r\n\r\nbfs(start[0], start[1])\r\n\r\nfor i in range(len(v)):\r\n c[v[i][0]][v[i][1]] = '.'\r\n if i >= len(v) - k:\r\n c[v[i][0]][v[i][1]] = 'X'\r\n\r\nfor i in range(n):\r\n print(''.join(c[i]))", "from collections import deque\r\n\r\nn, m, k = map(int, input().split())\r\nh = [list(input()) for _ in range(n)]\r\nd = {}\r\nv = (-1, -1)\r\nrt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if h[i][j] == \".\":\r\n if v == (-1, -1):\r\n v = (i, j)\r\n rt += 1\r\nw = deque()\r\nw.append(v)\r\nt = set()\r\nwhile (len(t) != (rt - k)) and (len(w) > 0):\r\n t.add(w[0])\r\n for x, y in [(w[0][0] + 1, w[0][1]), (w[0][0] - 1, w[0][1]), (w[0][0], w[0][1] - 1), (w[0][0], w[0][1] + 1)]:\r\n if (0 <= x < n) and (0 <= y < m):\r\n if h[x][y] == \".\":\r\n if (x, y) in t:\r\n continue\r\n if len(t) >= (rt - k):\r\n break\r\n t.add((x, y))\r\n w.append((x, y))\r\n w.popleft()\r\nfor i in range(n):\r\n for j in range(m):\r\n if h[i][j] == \".\":\r\n if (i, j) not in t:\r\n h[i][j] = \"X\"\r\nfor t in h:\r\n print(\"\".join(t))\r\n\n# Tue Jul 11 2023 11:49:34 GMT+0300 (Moscow Standard Time)\n", "import sys\r\nimport os.path\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 sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndd = lambda x: defaultdict(lambda: x)\r\n\r\nn,m,k=map(int, input().split())\r\nt=[input().replace('.', 'X') for i in range(n)]\r\nk=n*m-k-sum(i.count('#') for i in t)\r\nt=[list(i) for i in t]\r\ni,p=0,[]\r\nwhile k:\r\n if 'X' in t[i]:\r\n j = t[i].index('X')\r\n t[i][j], p = '.', [(i, j)]\r\n k -= 1\r\n break\r\n i += 1\r\nwhile k:\r\n x, y = p.pop()\r\n for i, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\r\n if i < 0 or j < 0: continue\r\n if i < n and j < m and t[i][j] == 'X':\r\n t[i][j] = '.'\r\n p.append((i, j))\r\n k -= 1\r\n if k == 0: break\r\nfor i in range(n): t[i] = ''.join(t[i])\r\nprint('\\n'.join(t))", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*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\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n# from sys import stdin\r\n# input = stdin.buffer.readline\r\n# I = lambda : list(map(int,input().split()))\r\n\r\nn,m,k=L()\r\nA=[list(input()) for i in range(n)]\r\n\r\nvis=[[0 for j in range(m)] for i in range(n)]\r\n\r\nq=deque()\r\nF=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\".\" and len(q)==0:\r\n q.append([i,j])\r\n F+=int(A[i][j]==\".\")\r\n\r\nx,y=q.popleft()\r\nval=k\r\ncntr=1\r\nvis[x][y]=cntr \r\ncntr+=1\r\nq.append([x,y])\r\nwhile(q):\r\n x,y=q.popleft()\r\n \r\n r=[-1,0,0,1]\r\n c=[0,-1,1,0]\r\n for k in range(4):\r\n a=x+r[k]\r\n b=y+c[k]\r\n if 0<=a<n and 0<=b<m and vis[a][b]==0 and A[a][b]==\".\":\r\n vis[a][b]=cntr \r\n cntr+=1\r\n if cntr>F-val+1:\r\n A[a][b]=\"X\"\r\n q.append([a,b])\r\n\r\n\r\nfor ele in A:\r\n print(\"\".join(ele))\r\n", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n\r\n# n,m=map(int,input().split())\r\n# arr=list(map(int, input().split()))\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\n\r\n\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n n,m,k=map(int,input().split())\r\n grid=[0]*(n)\r\n for i in range(n):\r\n grid[i]=list(strinp(90))\r\n vis=[[-1 for i in range(m)] for j in range(n)]\r\n lev=[[] for i in range(n*m)]\r\n sx=-1\r\n sy=-1\r\n for i in range(n):\r\n for j in range(m):\r\n if grid[i][j]=='.':\r\n sx=i\r\n sy=j\r\n break\r\n if sx!=-1:\r\n break\r\n q=[[sx,sy]]\r\n ptr=0\r\n vis[sx][sy]=0\r\n while(ptr!=len(q)):\r\n x=q[ptr][0]\r\n y=q[ptr][1]\r\n ptr+=1\r\n lev[vis[x][y]].append([x,y])\r\n if x>0 and grid[x-1][y]=='.' and vis[x-1][y]==-1:\r\n q.append([x-1,y])\r\n vis[x-1][y]=vis[x][y]+1\r\n \r\n if x<n-1 and grid[x+1][y]=='.' and vis[x+1][y]==-1:\r\n q.append([x+1,y])\r\n vis[x+1][y]=vis[x][y]+1\r\n \r\n if y<m-1 and grid[x][y+1]=='.' and vis[x][y+1]==-1:\r\n q.append([x,y+1])\r\n vis[x][y+1]=vis[x][y]+1\r\n \r\n if y>0 and grid[x][y-1]=='.' and vis[x][y-1]==-1:\r\n q.append([x,y-1])\r\n vis[x][y-1]=vis[x][y]+1\r\n ct=0\r\n for i in range(n*m-1,-1,-1):\r\n for j in range(len(lev[i])):\r\n if ct==k:\r\n break\r\n grid[lev[i][j][0]][lev[i][j][1]]='X'\r\n ct+=1\r\n if ct==k:\r\n break\r\n for i in range(n):\r\n print(''.join(grid[i]))\r\nmain()", "from collections import deque\nimport sys\n\ndef bfs(i,j):\n\tglobal maze,m,n,k,cont,limite\n\n\tvisitados = [[0 for i in range(n)] for j in range(m)]\n\tq = deque()\n\tq.append((i,j))\n\tcont = 0\n\n\twhile len(q) != 0:\n\n\t\tai,aj = q.popleft()\n\t\tif visitados[ai][aj]:\n\t\t\tcontinue\n\n\t\tvisitados[ai][aj] = 1\n\t\tcont += 1\n\n\t\tif cont == limite:\n\t\t\tbreak\n\n\t\t\n\t\tmovimentos = [[1,0],[-1,0],[0,1],[0,-1]]\n\n\t\tfor mi,mj in movimentos:\n\t\t\tif 0 <= ai + mi < m and 0 <= aj + mj < n and maze[ai+mi][aj+mj] == '.':\n\t\t\t\tq.append((ai + mi,aj + mj))\n\t\n\treturn cont,visitados \n\ndef pinta(i,j,maze):\n\tglobal m,n\n\tvisitados = [[0 for i in range(n)] for j in range(m)]\n\tq = deque()\n\tq.append((i,j))\n\n\twhile len(q):\n\t\tai,aj = q.popleft()\n\t\tif visitados[ai][aj]:\n\t\t\tcontinue\n\n\t\tvisitados[ai][aj] = 1\n\t\tmaze[ai][aj] = 'X'\n\t\t\n\t\tmovimentos = [[1,0],[-1,0],[0,1],[0,-1]]\n\n\t\tfor mi,mj in movimentos:\n\t\t\tif 0 <= ai + mi < m and 0 <= aj + mj < n and maze[ai+mi][aj+mj] == '.':\n\t\t\t\tq.append((ai+mi,aj+mj))\n\n\treturn maze\t\n\nm,n,k = map(int,input().split())\nmaze = []\nfor i in range(m):\n\tmaze.append(list(input()))\n\ncont = 0\n\nfor i in range(m):\n\tfor j in range(n):\n\t\tif maze[i][j] == '#':\n\t\t\tcont += 1\n\n\nlimite = (m*n) - (cont+k)\n\nfor i in range(m):\n\tfor j in range(n):\n\t\tif maze[i][j] == '.':\n\t\t\tpontos,visitados = bfs(i,j)\n\n\t\t\tif pontos >= limite:\n\n\t\t\t\taux = 0\n\t\t\t\tfor i in range(m):\n\t\t\t\t\tfor j in range(n):\n\t\t\t\t\t\tif visitados[i][j] == 1:\n\t\t\t\t\t\t\taux += 1\n\t\t\t\t\t\telif maze[i][j] == '.':\n\t\t\t\t\t\t\tmaze[i][j] = 'X'\n\n\t\t\t\tfor i in range(m):\n\t\t\t\t\tfor j in range(n):\n\t\t\t\t\t\tprint(maze[i][j],end='')\n\t\t\t\t\tif i != m-1:\n\t\t\t\t\t\tprint()\n\t\t\t\tsys.exit()\t\t\n\t\t\telse:\n\t\t\t\tmaze = pinta(i,j,maze)\n\t\t\n\n", "def isOk(i, j):\n if 0 <= i <= a-1 and 0 <= j <= b-1:\n if array[i][j] != '#':\n return True\n return False\n\na, b, c = map(int, input().split(' '))\n\narray = [[i for i in input()] for j in range(a)]\np = []\nx = 0\n\nfor i in range(a):\n for j in range(b):\n if array[i][j] == '.':\n p.append((i, j))\n x += 1\n\nvisited = [[False] * b for i in range(a)]\n\n\ncounter = 0\nwhile counter < x-c:\n i, j = p.pop()\n \n if visited[i][j]:\n \n continue\n if isOk(i, j-1):\n if not visited[i][j-1]:\n p.append((i, j-1))\n\n if isOk(i, j+1):\n if not visited[i][j+1]:\n p.append((i, j+1))\n\n if isOk(i+1, j):\n if not visited[i+1][j]:\n p.append((i+1, j))\n\n if isOk(i-1, j):\n if not visited[i-1][j]:\n p.append((i-1, j))\n \n visited[i][j] = True\n counter += 1\n\nfor i in range(a):\n for j in range(b):\n if array[i][j] == '.' and not visited[i][j]:\n array[i][j] = 'X'\n\nfor each in [''.join(i) for i in array]:\n print(each)", "n,m,k=map(int,input().split(' '))\r\na=[]\r\n\r\nfor i in range(n):\r\n a.append(list(input()))\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='.':\r\n queue=[[i,j]]\r\n break\r\n\r\ncount=[[queue[0]]]\r\na[queue[0][0]][queue[0][1]]=0\r\n\r\n\r\nwhile len(queue)!=0:\r\n x,y=queue.pop(0)\r\n if len(count)<=a[x][y]+1:\r\n count.append([])\r\n if x+1<n and a[x+1][y]=='.':\r\n queue.append([x+1,y])\r\n a[x+1][y]=a[x][y]+1\r\n count[a[x][y]+1].append([x+1,y])\r\n if x-1>=0 and a[x-1][y]=='.':\r\n queue.append([x-1,y])\r\n a[x-1][y]=a[x][y]+1\r\n count[a[x][y]+1].append([x-1,y])\r\n if y+1<m and a[x][y+1]=='.':\r\n queue.append([x,y+1])\r\n a[x][y+1]=a[x][y]+1\r\n count[a[x][y]+1].append([x,y+1])\r\n if y-1>=0 and a[x][y-1]=='.':\r\n queue.append([x,y-1])\r\n a[x][y-1]=a[x][y]+1\r\n count[a[x][y]+1].append([x,y-1])\r\n\r\nif len(count[-1])==0:\r\n count.pop()\r\n\r\nfor i in range(len(count)-1,0,-1):\r\n if k==0:\r\n break\r\n for j in range(len(count[i])):\r\n a[count[i][j][0]][count[i][j][1]]='X'\r\n k-=1\r\n if k==0:\r\n break\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if type(a[i][j])==int:\r\n a[i][j]='.'\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n print(a[i][j],end='')\r\n print()", "#https://codeforces.com/problemset/problem/377/A\r\n#M\r\n\r\nn, m, k = map(int, input().split())\r\ngrid = []\r\ncount_hash = 0\r\n\r\nfor _ in range(n):\r\n row = input().replace('.', 'X')\r\n count_hash += row.count('#')\r\n grid.append(list(row))\r\n\r\nk = (n * m) - k - count_hash\r\n\r\nx, y = next((i, j) for i, row in enumerate(grid) for j, cell in enumerate(row) if cell == 'X')\r\n\r\nqueue = [(x, y)]\r\nk -= 1\r\ngrid[x][y] = '.'\r\n\r\nwhile k > 0:\r\n x, y = queue.pop(0)\r\n for dx, dy in [(0, -1), (0, 1), (-1, 0), (1, 0)]:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < n and 0 <= ny < m and grid[nx][ny] == 'X':\r\n grid[nx][ny] = '.'\r\n queue.append((nx, ny))\r\n k -= 1\r\n if k == 0:\r\n break\r\n\r\nfor row in grid:\r\n print(''.join(row))\r\n\r\n", "import math\r\nimport os\r\nimport sys\r\nfrom bisect import bisect_left, bisect_right\r\nimport math\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache\r\nfrom heapq import heappop, heappush\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n# Fast IO Region\r\nBUFSIZE = 8192\r\nimport math\r\nimport os\r\nimport sys\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache\r\nfrom heapq import heappop, heappush\r\nimport os\r\nfrom io import BytesIO, IOBase\r\n\r\n# 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\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\ndef _sA():\r\n return input().split()\r\n\r\n\r\n\r\nn,m,k=_nA()\r\ngrid=[]\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n\r\ndir = [-1, 0, 1, 0, -1]\r\nvis = [[False]*m for _ in range(n)]\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j]=='.':\r\n cnt+=1\r\ncnt-=k\r\ndef bfs():\r\n global grid\r\n global cnt\r\n for i in range(n):\r\n for j in range(m):\r\n if grid[i][j]=='.':\r\n q=[(i,j)]\r\n vis[i][j]=True\r\n while q:\r\n x, y = q.pop(0)\r\n grid[x][y]='H'\r\n cnt-=1\r\n if cnt==0:\r\n for i in range(n):\r\n for j in range(m):\r\n if grid[i][j]=='.':\r\n grid[i][j]='X'\r\n elif grid[i][j]=='H':\r\n grid[i][j] = '.'\r\n grid[i]=''.join(grid[i])\r\n print('\\n'.join(grid))\r\n exit()\r\n for k in range(4):\r\n nx,ny=x+dir[k],y+dir[k+1]\r\n if nx < 0 or nx == n or ny < 0 or ny == m or vis[nx][ny] or grid[nx][ny]!='.':\r\n continue\r\n q.append((nx,ny))\r\n vis[nx][ny]=True\r\nbfs()\r\n", "from collections import defaultdict, deque\ndef bfs(p, q):\n d = deque([(p, q)])\n distances = defaultdict(int)\n vis = defaultdict(lambda: False)\n while d:\n i, j = d.pop()\n vis[(i, j)] = True\n for x, y in {(i + 1, j), (i - 1, j), (i, j + 1), (i, j - 1)}:\n if 0 <= x < n and 0 <= y < m and mat[x][y] == '.' and not vis[(x, y)]:\n d.append((x, y))\n distances[(x, y)] = distances[(i, j)] + 1\n return distances\n\nn, m, k = (int(x) for x in input().split())\nmat = []\nflag = False\nfor i in range(n):\n mat.append(list(input()))\nfor i in range(n):\n for j in range(m):\n if mat[i][j] == '.':\n d = bfs(i, j)\n # print(d)\n flag = True\n v = sorted([(y, x) for x, y in d.items()], reverse=True)\n for u in range(k):\n p, q = v[u]\n mat[q[0]][q[1]] = 'X'\n for r in mat:\n print(''.join(r))\n break\n if flag:\n break", "directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n\r\ndef main():\r\n height, width, walls_to_add = map(int, input().split())\r\n maze = []\r\n\r\n for _ in range(height):\r\n maze.append(list(input().strip()))\r\n\r\n total_open_squares = sum(row.count('.') for row in maze)\r\n required_open_squares = total_open_squares - walls_to_add\r\n\r\n def iterative_dfs(start):\r\n stack = [start]\r\n visited = set()\r\n visited.add(start)\r\n count = 1 # Count the starting square\r\n\r\n while stack and count < required_open_squares:\r\n x, y = stack.pop()\r\n for dx, dy in directions:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < height and 0 <= ny < width and maze[nx][ny] == '.' and (nx, ny) not in visited:\r\n visited.add((nx, ny))\r\n stack.append((nx, ny))\r\n count += 1\r\n if count == required_open_squares:\r\n return visited\r\n return visited\r\n\r\n # Start the iterative DFS from the first '.' found.\r\n visited = set()\r\n for i in range(height):\r\n for j in range(width):\r\n if maze[i][j] == '.':\r\n visited = iterative_dfs((i, j))\r\n break\r\n if visited:\r\n break\r\n\r\n # Modify the maze to add walls to all '.' that are not in the visited set\r\n for i in range(height):\r\n for j in range(width):\r\n if maze[i][j] == '.' and (i, j) not in visited:\r\n maze[i][j] = 'X'\r\n\r\n # Print the modified maze\r\n for row in maze:\r\n print(''.join(row))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import deque\r\n\r\nn,m,k = map(int, input().split())\r\n\r\ngrid = []\r\n\r\nfor _ in range(n):\r\n grid.append(list(input()))\r\n\r\n\r\ncount = 0\r\nfor row in grid:\r\n count += row.count('.')\r\n\r\nf = 0\r\nq = deque()\r\nvisited = set()\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '.':\r\n q.append((i,j))\r\n visited.add((i,j))\r\n f= 1\r\n break\r\n if f:break\r\n\r\n\r\nwhile q and count > k:\r\n for _ in range(len(q)):\r\n i,j = q.popleft()\r\n if count > k:\r\n grid[i][j] = '1'\r\n count -= 1\r\n \r\n for x,y in [[1,0],[0,1],[-1,0],[0,-1]]:\r\n nx, ny = x+i, y+j\r\n if -1<nx<n and -1<ny<m and (nx,ny) not in visited and grid[nx][ny] == '.':\r\n q.append((nx,ny))\r\n visited.add((nx,ny))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n # print(i,j)\r\n if grid[i][j] == '.':\r\n grid[i][j] = 'X'\r\n elif grid[i][j] == '1':\r\n grid[i][j] = '.'\r\n\r\nfor g in grid:print(*g, sep='')\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 = \"Maze\"\r\n# Class: C\r\n\r\nimport sys, threading\r\nsys.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 dfs(node):\r\n global graph, seen, path\r\n if node not in seen:\r\n seen.add(node)\r\n path.append(node)\r\n for child in graph[node]:\r\n if child not in seen:\r\n dfs(child)\r\n\r\ndef Solve():\r\n global graph, seen, path\r\n n, m, k = list(map(int, input().split()))\r\n graph = dict()\r\n grid = []\r\n for x in range(1, n+1):\r\n line = input().strip()\r\n grid.append(list(line))\r\n for o in range(m):\r\n if line[o] == \".\":\r\n y = o+1\r\n graph[(x, y)] = set()\r\n if (x-1, y) in graph.keys():\r\n graph[(x, y)].add((x-1, y)) ; graph[(x-1, y)].add((x, y))\r\n if (x, y-1) in graph.keys():\r\n graph[(x, y)].add((x, y-1)) ; graph[(x, y-1)].add((x, y))\r\n \r\n seen = set()\r\n paths = set()\r\n path = []\r\n for node in graph.keys():\r\n if node not in seen:\r\n paths.add(tuple(path))\r\n path = []\r\n dfs(node)\r\n \r\n paths.add(tuple(path))\r\n \r\n for path in sorted(paths, key=len):\r\n for point in path[::-1]:\r\n if k>0:\r\n grid[point[0]-1][point[1]-1] = \"X\"\r\n k-=1\r\n else:\r\n break\r\n\r\n for line in grid:\r\n print(\"\".join(line))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n threading.stack_size(10**8)\r\n threading.Thread(target=Solve).start()", "#bisect.bisect_left(a, x, lo=0, hi=len(a)) is the analog of std::lower_bound()\r\n#bisect.bisect_right(a, x, lo=0, hi=len(a)) is the analog of std::upper_bound()\r\n#from heapq import heappop,heappush,heapify #heappop(hq), heapify(list)\r\n#from collections import deque as dq #deque e.g. myqueue=dq(list)\r\n#append/appendleft/appendright/pop/popleft\r\n#from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\r\n#import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\r\n#import statistics as stat # stat.median(a), mode, mean\r\n#from itertools import permutations(p,r)#combinations(p,r)\r\n#combinations(p,r) gives r-length tuples #combinations_with_replacement\r\n#every element can be repeated\r\n \r\n#Note direct assignment to check somethings doesnt work always\r\n#say there exists s (list) then ss=s and if we edit ss, it edits s as well\r\n#always try to use ss=s.copy() if u wish to make changes to ss and not reflect them in s.\r\n#For example: see **1379A - Acacius and String** for reference\r\n \r\n'''\r\nPost multiply trying copied from:\r\nBy sagarpal1909, contest: Codeforces Round 222 (Div. 1), problem: (A) Maze, Accepted, #, Copy\r\n\r\nAfter Understanding!!\r\n\r\nStill can't figure out what's wrong with my code!\r\n'''\r\nimport sys, threading, os, io \r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\nfrom io import BytesIO, IOBase\t\t\t\t\t\t\t\t\r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\nsys.setrecursionlimit(20000)\r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\r\n)\r\ndef lmii():\r\n return list(map(int,input().split()))\r\n\r\ndef ii():\r\n return int(input())\r\n\r\ndef si():\r\n return str(input())\r\ndef lmsi():\r\n return list(map(str,input().split()))\r\ndef mii():\r\n return map(int,input().split())\r\n\r\ndef msi():\r\n return map(str,input().split())\r\n\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n \r\n# os.read(0, os.fstat(0).st_size)).readline\r\n \r\n \r\ndef solve():\r\n n,m,k = mii()\r\n\r\n mat = []\r\n\r\n for i in range(n):\r\n x = si()\r\n mat.append(list(x))\r\n\r\n c = 0\r\n\r\n ind1 = -1\r\n ind2=-1\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == \".\":\r\n c += 1\r\n ind1 = i\r\n ind2 = j\r\n\r\n if k == 0:\r\n for i in mat:\r\n print(\"\".join(i))\r\n \r\n elif c-k == 0:\r\n for i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == \".\":\r\n mat[i][j] = \"X\"\r\n\r\n for i in mat:\r\n print(\"\".join(i))\r\n else:\r\n\r\n vis = set()\r\n\r\n def solve(i,j,rakhlo):\r\n q = deque()\r\n q.append((i,j))\r\n while q:\r\n i,j = q.popleft()\r\n vis.add((i,j))\r\n if len(vis) == rakhlo:\r\n return \r\n\r\n for x,y in [[1,0],[0,1],[-1,0],[0,-1]]:\r\n r = x+i\r\n c = y+j\r\n if 0 <= r < n and 0 <= c < m and mat[r][c] == \".\" and (r,c) not in vis:\r\n q.append((r,c))\r\n vis.add((r,c))\r\n if len(vis) == rakhlo:\r\n return\r\n\r\n\r\n return\r\n\r\n\r\n solve(ind1,ind2,c-k)\r\n\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == \".\" and (i,j) not in vis:\r\n mat[i][j] = \"X\"\r\n\r\n\r\n for i in mat:\r\n print(\"\".join(i))\r\n\r\n \r\nsolve()", "from collections import deque\n\n\ndirs = ((1, 0), (0, 1), (-1, 0), (0, -1))\n\n\ndef valid(r, c):\n return 0 <= r < n and 0 <= c < m and grid[r][c] == '.'\n\n\ndef dfs(r, c, count, viewed):\n queue = deque()\n queue.append((r, c))\n viewed[r][c] = True\n count -= 1\n while len(queue) != 0 and count > 0:\n r, c = queue.popleft()\n for dr, dc in dirs:\n if valid(r + dr, c + dc) and not viewed[r + dr][c + dc]:\n viewed[r + dr][c + dc] = True\n queue.append((r + dr, c + dc))\n count -= 1\n if count == 0:\n break\n\n\nn, m, k = map(int, input().split())\ngrid = [list(input()) for _ in range(n)]\nr, c = -1, -1\nempty_count = 0\nfor ii, i in enumerate(grid):\n for jj, j in enumerate(i):\n if j == '.':\n r, c = ii, jj\n empty_count += 1\nviewed = [[False] * m for _ in range(n)]\ndfs(r, c, empty_count - k, viewed)\nfor i in range(n):\n for j in range(m):\n if grid[i][j] == '.' and not viewed[i][j]:\n grid[i][j] = 'X'\nfor i in grid:\n print(''.join(i))\n", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import *\r\n#from fractions import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom io import BytesIO, IOBase\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # array input\r\ndef sarr(): return [int(i) for i in input()] #array from string\r\ndef starr(): return [str(x) for x in input().split()] #string array\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # array of pairs\r\nmo = 1000000007\r\n# ----------------------------CODE------------------------------#\r\nn,m,k=value()\r\na=[[str(x) for x in input()] for i in range(n)]\r\ndef printf(visit):\r\n for i in range(n):\r\n for j in range(m):\r\n if (a[i][j] == '.' and (i, j) not in visit):\r\n a[i][j] = 'X'\r\n for i in range(n):\r\n print(*a[i], sep=\"\")\r\ndef bfs(x,y,need):\r\n visit=defaultdict(int)\r\n visit[(x,y)]+=1\r\n q=[(x,y)]\r\n need-=1\r\n while(len(q)!=0):\r\n res=q.pop()\r\n if(res[0]>0 and a[res[0]-1][res[1]]=='.' and ((res[0]-1,res[1]) not in visit)):\r\n q=[(res[0]-1,res[1])]+q\r\n visit[(res[0]-1,res[1])]+=1\r\n need-=1\r\n if(need==0):\r\n printf(visit)\r\n return 1\r\n if(res[0]<n-1 and a[res[0]+1][res[1]]=='.' and (res[0]+1,res[1]) not in visit):\r\n q=[(res[0]+1,res[1])]+q\r\n visit[(res[0]+1,res[1])]+=1\r\n need-=1\r\n if (need == 0):\r\n printf(visit)\r\n return 1\r\n if (res[1] > 0 and a[res[0]][res[1]-1] == '.' and (res[0],res[1]-1) not in visit):\r\n q = [(res[0], res[1]-1)] + q\r\n visit[(res[0], res[1]-1)] += 1\r\n need -= 1\r\n if (need == 0):\r\n printf(visit)\r\n return 1\r\n if (res[1] < m - 1 and a[res[0]][res[1]+1] == '.' and (res[0], res[1]+1) not in visit):\r\n q = [(res[0], res[1]+1)] + q\r\n visit[(res[0], res[1]+1)] += 1\r\n need -= 1\r\n if (need == 0):\r\n printf(visit)\r\n return 1\r\n return 0\r\n\r\ncnt=0\r\nfor i in range(n):\r\n cnt+=a[i].count('.')\r\ncnt=cnt-k\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i][j]=='.'):\r\n flag=bfs(i,j,cnt)\r\n if(flag==1):\r\n exit()\r\n\r\n\r\n", "\"\"\"def dfs(graph,i,j,vis):\r\n global k\r\n if vis[i][j]!=0:\r\n return\r\n vis[i][j]=1\r\n #print(i,j)\r\n if j!=0 and graph[i][j-1]==\".\":\r\n dfs(graph,i,j-1,vis)\r\n if i!=0 and graph[i-1][j]==\".\":\r\n dfs(graph,i-1,j,vis)\r\n if j!=m-1 and graph[i][j+1]==\".\":\r\n dfs(graph,i,j+1,vis)\r\n if i!=n-1 and graph[i+1][j]==\".\":\r\n dfs(graph,i+1,j,vis)\r\n if k>0:\r\n graph[i][j]=\"X\"\r\n k-=1\r\n print(k)\r\n return\"\"\"\r\nn,m,k=map(int,input().split())\r\ngraph=[]\r\nle,r=-1,-1\r\ntovisit=-k\r\nfor i in range(n):\r\n l=list(map(str,input()))\r\n for j in range(len(l)):\r\n if l[j]==\".\":\r\n le=i\r\n r=j\r\n tovisit+=1\r\n graph.append(l)\r\nsta=[(le,r)]\r\nwhile(tovisit>0 and len(sta)>0):\r\n i,j=sta.pop()\r\n graph[i][j]=\"?\"\r\n tovisit-=1\r\n if j!=0 and graph[i][j-1]==\".\":\r\n sta.append((i,j-1))\r\n graph[i][j-1]=\"@\"\r\n if i!=0 and graph[i-1][j]==\".\":\r\n sta.append((i-1,j))\r\n graph[i-1][j]=\"@\"\r\n if j!=m-1 and graph[i][j+1]==\".\":\r\n sta.append((i,j+1))\r\n graph[i][j+1]=\"@\"\r\n if i!=n-1 and graph[i+1][j]==\".\":\r\n sta.append((i+1,j))\r\n graph[i+1][j]=\"@\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if graph[i][j]=='?':\r\n print(\".\",end=\"\")\r\n elif graph[i][j]==\".\" or graph[i][j]==\"@\":\r\n print(\"X\",end=\"\")\r\n else:\r\n print(graph[i][j],end=\"\")\r\n print()\r\n\r\n ", "\r\n\r\n\r\nfrom collections import deque\r\n\r\nn , m , k = map(int,input().split())\r\ngrid = [[None for i in range(m)] for j in range(n) ]\r\nvisited = [[False for i in range(m)] for i in range(n)]\r\ntotal , cnt = 0 , 0\r\nstart = 0\r\nmoveX = [-1, 1, 0, 0]\r\nmoveY = [0, 0, 1, -1]\r\nfor i in range(n):\r\n s = list(input())\r\n for j in range(m):\r\n if s[j] == '.':\r\n start = (i , j)\r\n grid[i][j] = 'X'\r\n total +=1\r\n\r\n else:\r\n grid[i][j] = s[j]\r\n\r\n\r\nq = deque()\r\nq.append(start)\r\nwhile q :\r\n\r\n s1 , s2 = q.popleft()\r\n if s1 < 0 or s1 >= n or s2 < 0 or s2 >= m or visited[s1][s2] or cnt == total - k :\r\n continue\r\n\r\n else:\r\n\r\n if grid[s1][s2] == 'X':\r\n grid[s1][s2]= '.'\r\n cnt +=1\r\n for f in range(4):\r\n f1 =moveX[f] + s1\r\n f2 = moveY[f] + s2\r\n if 0<=f1<n and 0<=f2<m:\r\n q.append((f1 , f2))\r\n\r\n\r\n\r\nfor i in grid:\r\n print(''.join(i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\n\r\ndx = [0,0,1,-1]\r\ndy = [1,-1,0,0]\r\n \r\nn, m, k = map(int, input().split())\r\n\r\nmaze = []\r\nsx = 0\r\nsy = 0\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n line = input()\r\n t = []\r\n for j,cell in enumerate(line):\r\n if cell == '.':\r\n sx, sy = i, j\r\n total += 1\r\n cell = 'X'\r\n t.append(cell)\r\n maze.append(t[:])\r\n\r\ndq = deque([(sx,sy)])\r\ndone = 0\r\n\r\nwhile len(dq) > 0:\r\n now = dq.pop()\r\n\r\n if done >= total - k:\r\n break\r\n \r\n x,y = now\r\n\r\n if(maze[x][y] == 'X'):\r\n done += 1\r\n \r\n maze[x][y] = '.'\r\n \r\n for i in range(4):\r\n tx = x + dx[i]\r\n ty = y + dy[i]\r\n if 0 <= tx < n and 0 <= ty < m and maze[tx][ty] == 'X':\r\n dq.append((tx,ty))\r\n\r\nfor i in maze:\r\n print(\"\".join(i))\r\n ", "def printPuzz():\r\n\tglobal n\r\n\tglobal m\r\n\tglobal lab\r\n\tfor i in range(n):\r\n\t\ts = ''\r\n\t\tfor j in range(m):\r\n\t\t\tif (lab[i][j] == 0) or (lab[i][j] == -1):\r\n\t\t\t\ts += '.'\r\n\t\t\telif lab[i][j] == 1:\r\n\t\t\t\ts += '#'\r\n\t\t\telif lab[i][j] == 2:\r\n\t\t\t\ts += 'X'\r\n\t\t\telse:\r\n\t\t\t\ts += '?'\r\n\t\tprint(s)\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nlab = []\r\nlab_path = [] \r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\ts1 = s.replace('#', '1 ')\r\n\ts2 = s1.replace('.', '0 ')\r\n\tstroka_lab = list(map(int, s2.split()))\r\n\tlab.append(stroka_lab)\r\n\t\r\n\tstroka_lab_path = [[-1, -1] for j in range(m)]\r\n\tlab_path.append(stroka_lab_path)\r\n\r\nemptyFound = False\r\ni = 0\r\nwhile not emptyFound:\r\n\trow1 = i // m\r\n\tcol1 = i % m\r\n\r\n\tif lab[row1][col1] == 0:\r\n\t\temptyFound = True\r\n\r\n\ti += 1\r\n\r\ni = row1\r\nj = col1\r\nwhile k > 0:\r\n\tlab[i][j] = -1 \r\n\tif (j > 0) and (lab[i][j - 1] == 0): \r\n\t\tlab_path[i][j-1][0] = i\r\n\t\tlab_path[i][j-1][1] = j\r\n\t\ti = i\r\n\t\tj -= 1\r\n\t\t\r\n\telif (i<n-1) and (lab[i+1][j]==0): \r\n\t\tlab_path[i+1][j][0] = i\r\n\t\tlab_path[i+1][j][1] = j\r\n\t\ti += 1\r\n\t\tj = j\r\n\t\t\r\n\telif (j<m-1) and (lab[i][j+1]==0): \r\n\t\tlab_path[i][j+1][0] = i\r\n\t\tlab_path[i][j+1][1] = j\r\n\t\ti = i\r\n\t\tj += 1\r\n\t\t\r\n\telif (i>0) and (lab[i-1][j]==0): \r\n\t\tlab_path[i-1][j][0] = i\r\n\t\tlab_path[i-1][j][1] = j\r\n\t\ti -= 1\r\n\t\tj = j\r\n\t\r\n\telse:\r\n\t\tlab[i][j] = 2 \r\n\t\tk -= 1\r\n\t\t\r\n\t\ti1 = lab_path[i][j][0]\r\n\t\tj1 = lab_path[i][j][1]\r\n\t\tif (i1==-1) and (j1==-1):\r\n\t\t\tif (j1 > 0) and (lab[i1][j1 - 1] == 0): \r\n\t\t\t\ti1 = i1\r\n\t\t\t\tj1 -= 1\r\n\t\t\telif (i1 < n - 1) and (lab[i1 + 1][j1] == 0): \r\n\t\t\t\ti1 += 1\r\n\t\t\t\tj1 = j1\r\n\t\t\telif (j1 < m - 1) and (lab[i1][j1 + 1] == 0): \r\n\t\t\t\ti1 = i1\r\n\t\t\t\tj1 += 1\r\n\t\t\telse: \r\n\t\t\t\ti1 -= 1\r\n\t\t\t\tj1 = j1\r\n\t\telse:\r\n\t\t\ti = i1\r\n\t\t\tj = j1\r\n\r\nprintPuzz()", "import collections\r\nimport sys\r\nn,m,k=map(int,input().split())\r\nA=[]\r\nsee=set()\r\ndirection=[(1,0),(-1,0),(0,1),(0,-1)]\r\nfor i in range(n):\r\n A.append(input())\r\ncount=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\".\":\r\n count+=1\r\nk=count-k\r\ndef get():\r\n for i in range(n):\r\n for j in range(m):\r\n if A[i][j]==\".\":\r\n return (i,j)\r\nx,y=get()\r\ndef solve(x,y):\r\n if len(see)==k:\r\n return\r\n dq=collections.deque()\r\n dq.append((x,y))\r\n see.add((x,y))\r\n if len(see)==k:\r\n return\r\n while dq:\r\n a,b=dq.popleft()\r\n for X,Y in direction:\r\n X+=a\r\n Y+=b\r\n if 0<=X<n and 0<=Y<m and (X,Y) not in see and A[X][Y]==\".\":\r\n dq.append((X,Y))\r\n see.add((X,Y))\r\n if len(see)==k:\r\n return\r\n return\r\nsolve(x,y)\r\nfor i in range(n):\r\n s=\"\"\r\n for j in range(m):\r\n if A[i][j]==\".\" and (i,j) not in see:\r\n s+=\"X\"\r\n else:\r\n s+=A[i][j]\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def obterVizinhos(ind, n, m):\n res = []\n if ind % m > 0:\n res.append(ind - 1)\n if ind % m < m - 1:\n res.append(ind + 1)\n if ind // m > 0:\n res.append(ind - m)\n if ind // m < n - 1:\n res.append(ind + m)\n return res\n\nn, m, k = map(int, input().split())\nlabirinto = [list(input()) for x in range(n)]\ncount = 0\npilha = []\nvisitado = [[False for y in range(m)] for x in range(n)]\ns = 0\n\nfor linha in labirinto:\n for caractere in linha:\n if caractere == '.':\n s += 1\n\nraiz = 0\nwhile labirinto[raiz // m][raiz % m] == '#':\n raiz += 1\n\npilha.append(raiz)\n\nwhile len(pilha) > 0:\n atual = pilha.pop()\n if visitado[atual // m][atual % m]:\n continue\n count += 1\n visitado[atual // m][atual % m] = True\n if count + k > s:\n labirinto[atual // m][atual % m] = 'X'\n vizinhos = obterVizinhos(atual, n, m)\n for vizinho in vizinhos:\n if labirinto[vizinho // m][vizinho % m] == '#':\n continue\n pilha.append(vizinho)\n\nfor linha in labirinto:\n for caractere in linha:\n print(caractere, end=\"\")\n print()\n\n\t\t\t\t \t \t \t\t\t \t\t \t \t \t\t\t\t", "from sys import stdin\r\nfrom collections import deque\r\ninp = stdin.readline\r\n\r\nn, m, k = map(int, inp().split())\r\narr = [[x for x in \"#\"*(m+2)]]\r\n\r\nfor _ in range(n):\r\n s = inp().strip()\r\n arr.append([x for x in \"#\" + s + \"#\"])\r\n\r\narr.append([x for x in \"#\"*(m+2)])\r\n\r\nans = [[x for x in \"#\"*(m+2)] for _ in range(n+2)]\r\n\r\nq = deque()\r\ncount = 0\r\ns = 0\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if arr[i][j] == \".\":\r\n s += 1\r\n ans[i][j] = \"X\"\r\n if not q:\r\n q.append((i, j))\r\n\r\nwhile q and count < s-k:\r\n c = q.popleft()\r\n i = c[0]\r\n j = c[1]\r\n if ans[i][j] == \".\":\r\n continue\r\n\r\n if arr[i-1][j] == \".\":\r\n q.append((i-1, j))\r\n\r\n if arr[i][j+1] == \".\":\r\n q.append((i, j+1))\r\n\r\n if arr[i][j-1] == \".\":\r\n q.append((i, j-1))\r\n\r\n if arr[i+1][j] == \".\":\r\n q.append((i+1, j))\r\n\r\n ans[i][j] = \".\"\r\n count += 1\r\n\r\nfor c in ans[1:-1]:\r\n print(*c[1:-1], sep=\"\")\r\n", "n,m,k = map(int,input().split())\r\ng = [input().replace('.','X') for i in range(n)]\r\nk = n*m - k - sum(i.count('#')for i in g)\r\ng = [list(i) for i in g]\r\ni,p = 0,[]\r\nwhile k:\r\n if 'X'in g[i]:\r\n j = g[i].index('X')\r\n g[i][j],p = '.',[(i,j)]\r\n k -= 1\r\n break\r\n i += 1\r\nwhile k:\r\n x,y = p.pop()\r\n for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\r\n if i < 0 or j < 0:\r\n continue\r\n if i < n and j < m and g[i][j] == 'X':\r\n g[i][j] = '.'\r\n p.append((i,j))\r\n k -= 1\r\n if k == 0:\r\n break\r\nfor i in range(n):\r\n g[i]=''.join(g[i])\r\nprint('\\n'.join(g))", "rows, cols, k = map(int, input().split())\r\ngraph = []\r\nfor i in range(rows):\r\n graph.append(list(input()))\r\n\r\nfree = 0\r\nstack = []\r\nvisited = set()\r\nfor i in range(rows):\r\n for j in range(cols):\r\n if graph[i][j] == \".\":\r\n free += 1\r\n if not stack:\r\n stack.append((i, j))\r\n visited.add((i, j))\r\n\r\narea = free - k\r\nchecked = [[False for _ in range(cols)] for _ in range(rows)]\r\nwhile stack and area > 0:\r\n cr, cc = stack.pop()\r\n area -= 1\r\n checked[cr][cc] = True\r\n for dr, dc in [(0, 1), (1, 0), (-1, 0), (0, -1)]:\r\n nr = dr + cr\r\n nc = dc + cc\r\n if 0 <= nr < rows and 0 <= nc < cols and graph[nr][nc] == '.' and (nr, nc) not in visited:\r\n visited.add((nr, nc))\r\n stack.append((nr, nc))\r\n\r\nfor i in range(rows):\r\n for j in range(cols):\r\n if graph[i][j] == '.' and not checked[i][j]:\r\n graph[i][j] = \"X\"\r\n\r\nfor i in range(rows):\r\n print(''.join(graph[i]))\r\n", "# for I/O for local system\r\nimport 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\n\r\n# For fast I/O\r\n# input = sys.stdin.buffer.readline\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\n# Import libraries here whenever required\r\nfrom collections import deque\r\nfrom random import randint\r\n\r\n# Use this because normal dict can sometimes give TLE\r\nclass mydict:\r\n def __init__(self, func=lambda: 0):\r\n self.random = randint(0, 1 << 32)\r\n self.default = func\r\n self.dict = {}\r\n def __getitem__(self, key):\r\n mykey = self.random ^ key\r\n if mykey not in self.dict:\r\n self.dict[mykey] = self.default()\r\n return self.dict[mykey]\r\n def get(self, key, default):\r\n mykey = self.random ^ key\r\n if mykey not in self.dict:\r\n return default\r\n return self.dict[mykey]\r\n def __setitem__(self, key, item):\r\n mykey = self.random ^ key\r\n self.dict[mykey] = item\r\n def getkeys(self):\r\n return [self.random ^ i for i in self.dict]\r\n def __str__(self):\r\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\r\n \r\n# Solver function\r\ndef solve():\r\n n,m,k = map(int,input().split())\r\n grid = []\r\n for i in range(n):\r\n s = list(map(str,input().strip()))\r\n grid.append(s.copy())\r\n start = []\r\n for i in range(n):\r\n for j in range(m):\r\n if(grid[i][j] == \".\"):\r\n start = [i,j]\r\n break\r\n if(len(start) != 0):\r\n break\r\n q = deque()\r\n q.append(start)\r\n stack = [start]\r\n vis = [[False for i in range(m)] for i in range(n)]\r\n while q:\r\n for i in range(len(q)):\r\n u,v = q.popleft()\r\n vis[u][v] = True\r\n if(u+1 < n and grid[u+1][v] == \".\" and vis[u+1][v] == False):\r\n q.append([u+1,v])\r\n vis[u+1][v] = True\r\n stack.append([u+1,v])\r\n if(u-1 >= 0 and grid[u-1][v] == \".\" and vis[u-1][v] == False):\r\n q.append([u-1,v])\r\n vis[u-1][v] = True\r\n stack.append([u-1,v])\r\n if(v+1 < m and grid[u][v+1] == \".\" and vis[u][v+1] == False):\r\n q.append([u,v+1])\r\n vis[u][v+1] = True\r\n stack.append([u,v+1])\r\n if(v-1 >= 0 and grid[u][v-1] == \".\" and vis[u][v-1] == False):\r\n q.append([u,v-1])\r\n vis[u][v-1] = True\r\n stack.append([u,v-1])\r\n while k > 0:\r\n k -= 1\r\n i,j = stack.pop()\r\n grid[i][j] = \"X\"\r\n for i in range(n):\r\n print(''.join(map(str,grid[i])) + \"\\n\")\r\n \r\n# Main \r\nfor _ in range(1):\r\n solve()", "n, m, k = tuple(int(x) for x in input().split())\ngrid = []\ndirections = [[0,1],[0,-1],[1,0],[-1,0]]\nfor i in range(n):\n row = []\n temp = input()\n for j in range(m):\n row.append(temp[j])\n grid.append(row)\ndfs_start = None\nfor i in range(n):\n for j in range(m):\n if grid[i][j] == \".\":\n dfs_start = (i,j)\n break\n if dfs_start:\n break\nstack = [dfs_start]\nfurthest = []\nvisited = set()\nvisited.add(dfs_start)\nwhile stack:\n pos = stack.pop()\n furthest.append(pos)\n for direction in directions:\n x = pos[0] + direction[0]\n y = pos[1] + direction[1]\n if 0 <= x < n and 0 <= y < m and grid[x][y] == \".\" and (x,y) not in visited:\n stack.append((x,y))\n visited.add((x,y))\nwhile k > 0:\n replace = furthest.pop()\n grid[replace[0]][replace[1]] = \"X\"\n k -= 1\nfor i in range(n):\n for j in range(m):\n print(grid[i][j],end=\"\")\n print()\n \t\t \t\t\t \t \t\t \t\t\t\t \t\t\t \t\t \t \t", "# Now we would like to traverse the graph using a depth first search\r\n# Let's build the dfs function\r\n\r\nfrom collections import deque\r\n\r\n\r\ndef solve():\r\n n, m, k = map(int, input().split())\r\n\r\n maze = []\r\n for i in range(n):\r\n maze.append([x for x in input().strip()])\r\n\r\n # Create visited matrix\r\n visited = [[False for j in range(m)] for i in range(n)]\r\n\r\n # Find a node that is \".\"\r\n start_i = -1\r\n start_j = -1\r\n empty_cells = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if maze[i][j] == \".\":\r\n empty_cells += 1\r\n if start_i == -1 and start_j == -1:\r\n start_i = i\r\n start_j = j\r\n\r\n # Start node\r\n stack = deque([(start_i, start_j)])\r\n\r\n # DFS\r\n n_visited = 0\r\n while stack:\r\n node = stack.pop()\r\n i = node[0]\r\n j = node[1]\r\n\r\n if visited[i][j]:\r\n continue\r\n\r\n visited[i][j] = True\r\n n_visited += 1\r\n # print(n_visited, empty_cells - k)\r\n if n_visited > empty_cells - k:\r\n maze[i][j] = \"X\"\r\n\r\n # Add unvisited neighbours\r\n if i - 1 >= 0 and not visited[i - 1][j] and maze[i - 1][j] == \".\":\r\n stack.append((i - 1, j))\r\n if j - 1 >= 0 and not visited[i][j - 1] and maze[i][j - 1] == \".\":\r\n stack.append((i, j - 1))\r\n if i + 1 < n and not visited[i + 1][j] and maze[i + 1][j] == \".\":\r\n stack.append((i + 1, j))\r\n if j + 1 < m and not visited[i][j + 1] and maze[i][j + 1] == \".\":\r\n stack.append((i, j + 1))\r\n\r\n # Print maze\r\n for line in maze:\r\n print(\"\".join(line))\r\n\r\n\r\nsolve()\r\n", "\r\nn,m,k = map(int, input().split())\r\nmat = [list(input()) for i in range(n)]\r\n\r\nq = []\r\ns=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == '.' :\r\n if len(q) == 0:\r\n q.append((i,j))\r\n mat[i][j]='-'\r\n s+=1\r\n \r\nk = s-k\r\nk-=1\r\nwhile q and k:\r\n i,j = q.pop()\r\n \r\n \r\n for a, b in zip([0,1,0,-1],[1,0,-1,0]):\r\n if 0<=i+a<n and 0<=j+b<m and mat[i+a][j+b] == '.' and k:\r\n mat[i+a][j+b] ='-'\r\n k-=1\r\n q.append((i+a, j+b))\r\nd={'-':'.','.':'X','#':'#'}\r\nfor i in range(n):\r\n for j in range(m):\r\n print(d[mat[i][j]],end='')\r\n print()", "n, m, k = map(int, input().split())\r\n\r\nmat = []\r\nfor i in range(n):\r\n row = str(input())\r\n mat.append([cell for cell in row])\r\n\r\ns = 0\r\nempty = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == '.':\r\n empty = [i,j] \r\n s += 1\r\n\r\nwalls = {}\r\ncount = 1\r\nstack = [[empty[0],empty[1]]]\r\nvisited = set([(empty[0],empty[1])])\r\nwhile stack:\r\n a,b = stack.pop()\r\n for x,y in [[a+1,b],[a-1,b],[a,b+1],[a,b-1]]:\r\n if 0 <= x < n and 0 <= y < m and mat[x][y] == '.' and (x,y) not in visited:\r\n visited.add((x,y))\r\n stack.append([x,y])\r\n count += 1\r\n if count > s-k:\r\n walls[(x,y)] = 1\r\n\r\nfor i,j in walls:\r\n mat[i][j] = 'X'\r\n\r\nfor i in range(n):\r\n row = ''.join(mat[i])\r\n print(row)", "from collections import defaultdict, deque\r\n\r\ndef helper(row, col):\r\n\tqueue = deque([(row, col)])\r\n\tvisited = {(row, col)}\r\n\t\r\n\twhile queue:\r\n\t\tr, c = queue.popleft()\r\n\t\tfor x, y in [(r-1, c), (r+1, c), (r, c-1), (r, c+1)]:\r\n\t\t\tif 0 <= x < n and 0 <= y < m and grid[x][y] == '.' and (x, y) not in visited:\r\n\t\t\t\tqueue.append((x, y))\r\n\t\t\t\tvisited.add((x, y))\r\n\t\t\t\tif len(visited) > s-k:\r\n\t\t\t\t\tgrid[x][y] = 'X'\r\n\r\n\r\n\r\nn, m, k = map(int, input().split())\r\ngrid = []\r\ns = 0\r\nfor i in range(n):\r\n\tgrid.append(list(input()))\r\n\tfor j in range(m):\r\n\t\tif grid[i][j] == '.':\r\n\t\t\ts += 1\r\n\t\t\trow, col = i, j\r\n\r\nif k:\r\n\thelper(row, col)\r\n\r\nfor i in range(n):\r\n\tprint(''.join(grid[i]))\r\n\t\t\t", "from collections import defaultdict\r\nimport sys\r\ninput = __import__('sys').stdin.readline\r\nsys.setrecursionlimit(10**5)\r\ndx = [0,0,-1,1]\r\ndy = [1,-1,0,0]\r\ndef dfs(x,y):\r\n global vis\r\n global grid\r\n global k\r\n vis[x][y] = True\r\n for i in range(4):\r\n tempx = x + dx[i]\r\n tempy = y + dy[i]\r\n if (tempx < n and tempx >= 0) and (tempy < m and tempy >= 0):\r\n if (not vis[tempx][tempy]) and (grid[tempx][tempy] == \".\"):\r\n dfs(tempx,tempy)\r\n if k > 0:\r\n grid[x][y] = \"X\"\r\n k -= 1\r\n return \r\n\r\n\r\nn,m,k = map(int,input().split())\r\nadj = defaultdict(list)\r\ngrid = []\r\ncnt = 0\r\nfor i in range(n):\r\n a = list(input().strip())\r\n grid.append(a)\r\n cnt += a.count(\".\")\r\n\r\n\r\nvis = [[False for i in range(m)] for i in range(n)]\r\n\r\nyep = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \".\":\r\n stack = [[i,j]] \r\n vis[i][j] = True\r\n cnt -= 1\r\n while stack:\r\n node = stack.pop()\r\n x = node[0]\r\n y = node[1]\r\n vis[x][y] = True\r\n for i in range(4):\r\n if yep:\r\n break\r\n if cnt > k:\r\n tempx = x + dx[i]\r\n tempy = y + dy[i]\r\n if (tempx < n and tempx >= 0) and (tempy < m and tempy >= 0):\r\n if (not vis[tempx][tempy]) and (grid[tempx][tempy] == \".\"):\r\n vis[tempx][tempy] = True\r\n stack.append([tempx,tempy])\r\n cnt -= 1\r\n else:\r\n yep = True\r\n if yep:\r\n break\r\n if yep:\r\n break\r\n if yep:\r\n break\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == \".\" and not vis[i][j]:\r\n grid[i][j] = \"X\"\r\nfor x in grid:\r\n print(*x,sep = \"\")\r\n\r\n", "# https://codeforces.com/problemset/problem/377/A\r\n\r\nrows,cols,walls=map(int, input().split())\r\nmaze=[list(input()) for _ in range(rows)]\r\ndotCount = sum([1 if maze[r][c]=='.' else 0 for r in range(rows) for c in range(cols)])\r\nvisited, found = {}, False\r\ndirs = [(0,-1), (0,1), (-1,0), (1,0)]\r\n# print(dotCount, walls)\r\n# print('\\n'.join([''.join(row) for row in maze]),'\\n\\n')\r\nfor r in range(rows):\r\n\tfor c in range(cols):\r\n\t\tif maze[r][c] == '.':\r\n\t\t\tfound = True\r\n\t\t\tvisited.clear()\r\n\t\t\ttoVisit, count = [(r,c)], 0\r\n\t\t\twhile count < dotCount-walls:\r\n\t\t\t\tcell = toVisit.pop(0)\r\n\t\t\t\tif not visited.get(cell, False):\r\n\t\t\t\t\tvisited[cell] = True\r\n\t\t\t\telse:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tcount += 1\r\n\t\t\t\tfor dir in dirs:\r\n\t\t\t\t\tnr, nc = cell[0]+dir[0], cell[1]+dir[1]\r\n\t\t\t\t\tif nr>=0 and nr<rows:\r\n\t\t\t\t\t\tif nc>=0 and nc<cols:\r\n\t\t\t\t\t\t\tif maze[nr][nc]=='.' and not visited.get((nr,nc),False):\r\n\t\t\t\t\t\t\t\ttoVisit.append((nr,nc))\r\n\t\tif found:\r\n\t\t\tbreak\r\n\tif found:\r\n\t\tbreak\r\n# print(visited)\r\nfor r in range(rows):\r\n\tfor c in range(cols):\r\n\t\tif not visited.get((r,c), False) and maze[r][c]=='.':\r\n\t\t\tmaze[r][c] = 'X'\r\nprint('\\n'.join([''.join(row) for row in maze]))\r\n", "from collections import deque\r\n \r\nn, m, k = map(int, input().split())\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\nmaze = [[None for i in range(m)] for j in range(n)]\r\ntotal, cnt = 0, 0\r\nStarting_Point = None\r\nfor i in range(n):\r\n l = list(input())\r\n for j in range(m):\r\n if l[j] == \".\":\r\n maze[i][j] = \"X\"\r\n final_point = (i, j)\r\n total += 1\r\n else:\r\n maze[i][j] = l[j]\r\nq = deque()\r\n#print(final_point)\r\nq.append(final_point)\r\nwhile q:\r\n i, j = q.popleft()\r\n if i < 0 or i >= n or j < 0 or j >= m or cnt == total - k:\r\n continue\r\n if maze[i][j] == \"X\":\r\n maze[i][j] = \".\"\r\n cnt = cnt + 1\r\n q.append((i, j - 1))\r\n q.append((i, j + 1))\r\n q.append((i - 1, j))\r\n q.append((i + 1, j))\r\nfor i in maze:\r\n print(\"\".join(i))\r\n \r\n\t", "n, m, k = map(int, input().split())\r\n\r\nmaze = [input().replace('.', 'X') for i in range(n)]\r\np = n * m - k - sum(i.count('#') for i in maze)\r\nmaze = [list(i) for i in maze]\r\n\r\ni = 0\r\nstack = []\r\n\r\nwhile p:\r\n if 'X' in maze[i]:\r\n j = maze[i].index('X')\r\n stack = [(i, j)]\r\n maze[i][j] = '.'\r\n p -= 1\r\n break\r\n i += 1\r\n\r\nwhile p:\r\n x, y = stack.pop()\r\n moves = [(x + 1, y), (x, y - 1),\r\n (x - 1, y), (x, y + 1)]\r\n for i, j in moves:\r\n if 0 <= i < n and 0 <= j < m:\r\n if maze[i][j] == 'X':\r\n maze[i][j] = '.'\r\n stack.append((i, j))\r\n p -= 1\r\n if p == 0: break\r\n\r\nfor row in maze:\r\n for cell in row:\r\n print(cell, end=\"\")\r\n print()\r\n", "from collections import deque\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(list(input().replace('.', 'X')))\r\nnumEmpty = sum([grid[x].count('X') for x in range(n)])\r\nnumToKeep = numEmpty - k\r\n\r\nd = deque()\r\nfor i in range(n):\r\n if 'X' in grid[i]:\r\n j = grid[i].index('X')\r\n d.append((i, j))\r\n break\r\n \r\ncount = 0\r\nchange = set()\r\ndr = [0, -1, 0, 1]\r\ndc = [1, 0, -1, 0]\r\nwhile count < numToKeep:\r\n loc = d.pop()\r\n if (loc[0] < 0) or (loc[0] >= n) or (loc[1] < 0) or (loc[1] >= m) or grid[loc[0]][loc[1]] == '#' or loc in change:\r\n continue\r\n change.add(loc)\r\n count += 1\r\n for i in range(4):\r\n d.append((loc[0] + dr[i], loc[1] + dc[i]))\r\n\r\nfor loc in change:\r\n grid[loc[0]][loc[1]] = '.'\r\n\r\nprint('\\n'.join([''.join(x) for x in grid]))\r\n# print(numEmpty)", "def valid(i,j,n,m):\r\n\tif (i >= 0 and j >=0 and i < n and j < m):\r\n\t\treturn True \r\n\r\n\treturn False \r\n\r\ndef solve():\r\n\tfrom collections import deque\r\n\tnmk = input().split()\r\n\tn = int(nmk[0])\r\n\tm = int(nmk[1])\r\n\tk = int(nmk[2])\r\n\r\n\ttext = [['X' for _ in range(m)] for _ in range(n)]\r\n\tgraph = {(i,j):list() for i in range(n) for j in range(m)}\r\n\tempty = list()\r\n\tadd_i = [-1,0,0,1]\r\n\tadd_j = [0,1,-1,0]\r\n\tfor i in range(n):\r\n\t\tline = input()\r\n\t\tfor j in range(m):\r\n\t\t\tif (line[j] == '#'):\r\n\t\t\t\ttext[i][j] = '#'\r\n\t\t\telse:\r\n\t\t\t\tempty.append((i,j))\r\n\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tfor u in range(4):\r\n\t\t\t\tnext_i = i + add_i[u]\r\n\t\t\t\tnext_j = j + add_j[u]\r\n\t\t\t\tif (valid(next_i,next_j,n,m) and text[next_i][next_j] != '#'\r\n\t\t\t\t\tand text[i][j] != '#'):\r\n\t\t\t\t\tgraph[(i,j)].append((next_i,next_j))\r\n\r\n\r\n\r\n\tvisited = {key:False for key in empty}\r\n\tcnt = 1 \r\n\tneed = len(empty) - k \r\n\r\n\tq = deque()\r\n\tq.append(empty[0])\r\n\ttext[empty[0][0]][empty[0][1]] = '.'\r\n\tend = (cnt == need)\r\n\twhile q:\r\n\t\tif (end):\r\n\t\t\tbreak \r\n\r\n\t\tpoint = q.popleft()\r\n\t\tvisited[point] = True \r\n\r\n\t\tfor other in graph[point]:\r\n\t\t\tif not visited[other]:\r\n\t\t\t\tvisited[other] = True \r\n\t\t\t\ttext[other[0]][other[1]] = '.'\r\n\t\t\t\tcnt += 1 \r\n\t\t\t\tq.append(other)\r\n\t\t\t\tif (cnt == need):\r\n\t\t\t\t\tend = True \r\n\t\t\t\t\tbreak \r\n\r\n\r\n\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tprint(text[i][j],end = '')\r\n\r\n\t\tprint() \r\n\r\n\r\nsolve()", "def getNeighs(ind, n, m):\r\n res = []\r\n if ind % m > 0:\r\n res.append(ind - 1)\r\n if ind % m < m - 1:\r\n res.append(ind + 1)\r\n if ind // m > 0:\r\n res.append(ind - m)\r\n if ind // m < n - 1:\r\n res.append(ind + m)\r\n return res\r\n\r\nn, m, k = map(int, input().split())\r\nmaze = [list(input()) for x in range(n)]\r\ncount = 0\r\nstack = []\r\nvisited = [[False for y in range(m)] for x in range(n)]\r\ns = 0\r\n\r\nfor st in maze:\r\n for ch in st:\r\n if ch == '.':\r\n s += 1\r\n\r\nroot = 0\r\nwhile maze[root // m][root % m] == '#':\r\n root += 1\r\n\r\nstack.append(root)\r\n\r\nwhile len(stack) > 0:\r\n curr = stack.pop()\r\n if visited[curr // m][curr % m]:\r\n continue\r\n count += 1\r\n visited[curr // m][curr % m] = True\r\n #print(count, s)\r\n if count + k > s:\r\n maze[curr // m][curr % m] = 'X'\r\n neighs = getNeighs(curr, n, m)\r\n for neigh in neighs:\r\n if maze[neigh // m][neigh % m] == '#':\r\n continue\r\n stack.append(neigh)\r\n\r\nfor st in maze:\r\n for ch in st:\r\n print(ch, end=\"\")\r\n print()\r\n", "import re\r\n\r\ndef main():\r\n n, m, k = (int(value) for value in input().split(' '))\r\n maze = [list(input().replace('.', 'A')) for _ in range(n)]\r\n\r\n i, j, idx_cell_root, idy_cell_root, qt_wo_wall = 0, 0, 0, 0, -1\r\n while i < n:\r\n j = 0\r\n while j < m:\r\n if maze[i][j] == 'A':\r\n idx_cell_root = i\r\n idy_cell_root = j\r\n qt_wo_wall += 1\r\n j += 1\r\n i += 1\r\n\r\n points_path = [(idx_cell_root, idy_cell_root)]\r\n while qt_wo_wall > 0:\r\n i, j = points_path[-1][0], points_path[-1][1]\r\n\r\n val_bool_1, val_bool_2, val_bool_3, val_bool_4 = True, True, True, True\r\n if i > 0:\r\n if maze[i-1][j] != 'A':\r\n val_bool_1 = False\r\n else:\r\n val_bool_1 = False\r\n if j > 0:\r\n if maze[i][j-1] != 'A':\r\n val_bool_2 = False\r\n else:\r\n val_bool_2 = False\r\n if i < n - 1:\r\n if maze[i+1][j] != 'A':\r\n val_bool_3 = False\r\n else:\r\n val_bool_3 = False\r\n if j < m - 1:\r\n if maze[i][j+1] != 'A':\r\n val_bool_4 = False\r\n else:\r\n val_bool_4 = False\r\n\r\n if not val_bool_1 and not val_bool_2 and not val_bool_3 and not val_bool_4:\r\n maze[i][j] = '.'\r\n if k > 0:\r\n points_path.pop()\r\n maze[i][j] = 'X'\r\n k -= 1\r\n else:\r\n break\r\n else:\r\n maze[i][j] = '.'\r\n if i > 0:\r\n if maze[i-1][j] == 'A':\r\n points_path.append((i-1, j))\r\n qt_wo_wall -= 1\r\n continue\r\n if j > 0:\r\n if maze[i][j-1] == 'A':\r\n points_path.append((i, j-1))\r\n qt_wo_wall -= 1\r\n continue\r\n if i < n - 1:\r\n if maze[i+1][j] == 'A':\r\n points_path.append((i+1, j))\r\n qt_wo_wall -= 1\r\n continue\r\n if j < m - 1:\r\n if maze[i][j+1] == 'A':\r\n points_path.append((i, j+1))\r\n qt_wo_wall -= 1\r\n continue\r\n\r\n while k > 0:\r\n i, j = points_path[-1][0], points_path[-1][1]\r\n points_path.pop()\r\n maze[i][j] = 'X'\r\n k -= 1\r\n\r\n for line in maze:\r\n print(re.sub(r\"[,\\s']\", '', str(line)[1:-1]).replace('A', '.'))\r\n\r\nif __name__ == '__main__':\r\n main()", "dx = [0, 1, 0, -1]\r\ndy = [1, 0, -1, 0]\r\nN = 1234\r\na = []\r\nwas = [[False] * N for _ in range(N)]\r\nx = [0] * (N * N)\r\ny = [0] * (N * N)\r\nn, m, s = map(int, input().split())\r\nfor _ in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n was[i][j] = False\r\nfound = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if not found and a[i][j] == '.':\r\n b = 1\r\n e = 1\r\n x[1] = i\r\n y[1] = j\r\n was[i][j] = True\r\n while b <= e:\r\n for q in range(4):\r\n xk = x[b] + dx[q]\r\n yk = y[b] + dy[q]\r\n if 0 <= xk < n and 0 <= yk < m:\r\n if a[xk][yk] == '.' and not was[xk][yk]:\r\n e += 1\r\n x[e] = xk\r\n y[e] = yk\r\n was[xk][yk] = True\r\n b += 1\r\n for id in range(e - s + 1, e + 1):\r\n a[x[id]] = a[x[id]][:y[id]] + 'X' + a[x[id]][y[id] + 1:]\r\n found = True\r\nfor i in range(n):\r\n print(a[i])# 1692169858.6499023", "from bisect import bisect_left as bl, bisect_right as br, insort_left, insort_right\nfrom collections import deque, Counter as counter, defaultdict as dd\nfrom copy import copy, deepcopy\nfrom functools import cache, cmp_to_key, lru_cache, reduce, partial\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge, nlargest, nsmallest\nfrom itertools import count, cycle, repeat, accumulate, chain, groupby, starmap, product, permutations, combinations, combinations_with_replacement, zip_longest\nfrom math import ceil, comb, factorial, floor, gcd, lcm, prod, log, sqrt, acos, asin, atan, dist, sin, cos, tan, degrees, radians, pi, e, inf\nfrom operator import add, sub, mul, truediv, floordiv, mod, xor, and_, or_, eq, ne, neg, concat, contains\nfrom random import randint, choice, shuffle\nfrom string import ascii_lowercase as lowers, ascii_uppercase as uppers, ascii_letters as all_letters, digits\nfrom sys import stdin, argv, setrecursionlimit\n\nDEBUG = len(argv) > 1\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)]\ndef dprint(*args, **kwargs):\n if DEBUG: print(\"DEBUG:\", *args, *kwargs)\nMOD = 10**9+7\nMULTIPLE_CASES = 0\n \ndef _solve():\n N,M,K = rl(int)\n grid = rls(N, lambda x: list(str(x)))\n dprint(grid)\n\n def find_empty():\n for r in range(N):\n for c in range(M):\n if grid[r][c] == \".\":\n return r,c\n\n r0,c0 = find_empty()\n dfs = [(r0,c0)]\n seen = {(r0,c0)}\n order = []\n\n while dfs:\n r,c = dfs.pop()\n order.append((r,c))\n\n for r2,c2 in [(r+1,c),(r-1,c),(r,c+1),(r,c-1)]:\n if r2 in range(N) and c2 in range(M) and grid[r2][c2] == \".\" and (r2,c2) not in seen:\n dfs.append((r2,c2))\n seen.add((r2,c2))\n\n dprint(order)\n ans = deepcopy(grid)\n\n for i in range(K):\n r,c = order[~i]\n ans[r][c] = \"X\"\n\n for row in ans:\n print(\"\".join(row))\n\nfor case_i in range(rd(int) if MULTIPLE_CASES else 1): _solve()", "n, m, k = map(int, input().split())\r\narr = list(list(input()) for _ in range(n))\r\nlvl = [[0] * m for i in range(n)]\r\ndx = [1, -1, 0, 0]\r\ndy = [0, 0, 1, -1]\r\nres = []\r\n\r\ndef is_valid(i, j):\r\n return i >= 0 and j >= 0 and i < n and j < m\r\n\r\ndef bfs(x, y):\r\n q = []\r\n q.append((x, y))\r\n lvl[x][y] = 1\r\n while q:\r\n x, y = q[0]\r\n q.pop(0)\r\n for t in range(4):\r\n nx = x + dx[t]\r\n ny = y + dy[t]\r\n if is_valid(nx, ny) and lvl[nx][ny] == 0 and arr[nx][ny] == '.':\r\n lvl[nx][ny] = lvl[x][y] + 1\r\n q.append((nx, ny))\r\n res.append((-lvl[nx][ny], nx, ny))\r\n\r\nx, y = -1, -1\r\nfor i in range(n):\r\n if '.' in arr[i]:\r\n x = i\r\n y = arr[i].index('.')\r\n break\r\nbfs(x, y)\r\nres.sort()\r\nfor i in range(k):\r\n _, x, y = res[i]\r\n arr[x][y] = 'X'\r\nprint('\\n'.join(''.join(i) for i in arr))\r\n", "\r\nn,m,k = [int(x) for x in input().split(\" \")]\r\n\r\nmp = []\r\ndotc = 0\r\nmp=[input().replace('.','X') for i in range(n)]\r\nk=n*m-k-sum(i.count('#')for i in mp)\r\nmp=[list(i) for i in mp]\r\ni = 0\r\nwhile k:\r\n if 'X' in mp[i]:\r\n j=mp[i].index('X')\r\n mp[i][j],bfs='.',[(i,j)]\r\n k-=1\r\n break\r\n i+=1\r\nwhile k>0:\r\n x,y = bfs.pop()\r\n for i,j in ((x-1,y),(x,y-1),(x+1,y),(x,y+1)):\r\n if 0<=i<n and 0<=j<m and mp[i][j] == \"X\":\r\n mp[i][j] = '.'\r\n bfs.append((i,j))\r\n k-=1\r\n if k <= 0:break\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(mp[i][j],end=\"\")\r\n print()\r\n ", "import sys \n\ndef main():\n row, column, walls = sys.stdin.readline().split()\n matrix = [] \n\n for i in range(int(row)):\n line = sys.stdin.readline()[:-1]\n matrix.append([s for s in line])\n\n path = -int(walls)\n index_i = -1\n index_j = -1\n\n for i in range(int(row)):\n for j in range(int(column)):\n if matrix[i][j] == '.':\n index_i = i\n index_j = j\n path += 1\n\n array = [(index_i, index_j)]\n\n while len(array) != 0 and path > 0:\n i, j = array.pop(0)\n\n matrix[i][j] = 'C'\n path -= 1\n\n if j < int(column) - 1 and matrix[i][j+1] == '.':\n array.append((i, j + 1))\n matrix[i][j + 1] = 'F'\n if j > 0 and matrix[i][j-1] == '.':\n array.append((i, j - 1))\n matrix[i][j - 1] = 'F'\n if i < int(row) - 1 and matrix[i+1][j] == '.':\n array.append((i + 1, j))\n matrix[i + 1][j] = 'F'\n if i > 0 and matrix[i-1][j] == '.':\n array.append((i - 1, j))\n matrix[i - 1][j] = 'F'\n\n for i in range(int(row)):\n for j in range(int(column)):\n if matrix[i][j] == 'C':\n print('.', end='')\n elif matrix[i][j] == '#':\n print('#', end='')\n else:\n print('X', end='')\n print() \n \n\nif __name__ == '__main__':\n main()", "from functools import lru_cache\r\nfrom collections import defaultdict, deque\r\nclass Solution:\r\n def Maze(self, array, n, m, k):\r\n # TODO write an algorithm here\r\n def getNeighbour(i, j):\r\n neighbours = []\r\n if i > 0 and array[i-1][j] == \".\": neighbours.append((i-1, j))\r\n if i < n-1 and array[i+1][j] == \".\": neighbours.append((i+1, j))\r\n if j > 0 and array[i][j-1] == \".\": neighbours.append((i, j-1))\r\n if j < m-1 and array[i][j+1] == \".\": neighbours.append((i, j+1))\r\n return neighbours\r\n start, flag, emp_no = (0, 0), True, 0\r\n for i in range(n):\r\n for j in range(m):\r\n if array[i][j] == \".\" and flag:\r\n start = (i, j)\r\n flag = False\r\n if array[i][j] == \".\":\r\n emp_no += 1\r\n queue = deque([start])\r\n visited = 0\r\n while queue:\r\n for _ in range(len(queue)):\r\n curr = queue.popleft()\r\n if array[curr[0]][curr[1]] != \".\": continue\r\n if visited < emp_no - k:\r\n array[curr[0]][curr[1]] = \"*\"\r\n visited += 1\r\n else:\r\n array[curr[0]][curr[1]] = \"X\"\r\n visited += 1\r\n \r\n neighbour = getNeighbour(curr[0], curr[1])\r\n for x in neighbour:\r\n queue.append(x)\r\n \r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if array[i][j] == \"*\":\r\n array[i][j] = \".\"\r\n \r\n return array\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n n, m, k = list(map(int, input().split()))\r\n array = []\r\n for i in range(n):\r\n x = list(input())\r\n array.append(x)\r\n \r\n answer = solution.Maze(array, n, m, k)\r\n for ans in answer:\r\n print(\"\".join(ans))", "from sys import stdin ,stdout , setrecursionlimit\r\nfrom threading import stack_size , Thread\r\nsetrecursionlimit(2**31-1)\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef vaild(point):\r\n x,y=point\r\n return 0<=x<n and 0<=y<m and maze[x][y]==\".\"\r\n\r\ndef dfs(p):\r\n global k\r\n x1,y1=p ; maze[x1][y1]=\"1\"\r\n for i in range(4):\r\n x2=x1+dx[i] ; y2=y1+dy[i]\r\n if vaild((x2,y2)):\r\n dfs((x2,y2))\r\n \r\n if k>0:\r\n maze[x1][y1]=\"X\"\r\n k-=1\r\ndef Solve(): \r\n global n,m,k,maze , dx,dy \r\n n,m,k=map(int,input().split()) ; maze=[] ; start=(-1,-1)\r\n dx=[1,-1,0,0] ; dy=[0,0,1,-1]\r\n for i in range(n):\r\n a=list(input().strip())\r\n if start==(-1,-1):\r\n for j in range(m):\r\n if a[j]==\".\":\r\n start=(i,j) ; break\r\n maze.append(a)\r\n dfs(start)\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if maze[i][j]==\"1\":\r\n print(\".\",end=\"\")\r\n else:print(maze[i][j],end=\"\")\r\n print()\r\nstack_size(10**8)\r\nThread(target=Solve).start()", "input1, input2, input3 = map(int, input().split())\r\narray_list=[input().replace('.', 'X') for i in range(input1)]\r\ninput3=input1*input2-input3-sum(i.count('#') for i in array_list)\r\narray_list=[list(i) for i in array_list]\r\nindex, final_array=0,[]\r\nwhile input3:\r\n if 'X' in array_list[index]:\r\n j = array_list[index].index('X')\r\n array_list[index][j], final_array = '.', [(index, j)]\r\n input3 -= 1\r\n break\r\n index += 1\r\nwhile input3:\r\n x, y = final_array.pop()\r\n for index, j in ((x, y - 1), (x, y + 1), (x - 1, y), (x + 1, y)):\r\n if 0<=index < input1 and 0<=j < input2 and array_list[index][j] == 'X':\r\n array_list[index][j] = '.'\r\n final_array.append((index, j))\r\n input3 -= 1\r\n if input3 == 0: break\r\nfor i in range(input1):\r\n array_list[i] = ''.join(array_list[i])\r\nprint('\\n'.join(array_list))", "def dfs(mat, r, c, visited, limit):\r\n dfsStack = [(r,c)]\r\n while dfsStack and limit > 0:\r\n i, j = dfsStack.pop()\r\n if 0 <= i < len(mat) and 0 <= j < len(mat[i]) and mat[i][j] == \".\" and not visited[i][j]:\r\n mat[i][j] = \"C\"\r\n visited[i][j] = True\r\n limit -= 1\r\n dfsStack.append((i + 1, j))\r\n dfsStack.append((i - 1, j))\r\n dfsStack.append((i, j - 1))\r\n dfsStack.append((i, j + 1))\r\n \r\n# main method\r\nheight, width, walls = map(int, input().split())\r\nempty = 0\r\nmat = []\r\nvisited = []\r\ni = -1\r\nj = -1\r\nfor r in range(height):\r\n line = input()\r\n if i == j == -1 and line.find(\".\") > -1:\r\n i = r\r\n j = line.index(\".\")\r\n mat.append(list(line))\r\n visited.append([False] * len(line))\r\n empty += line.count(\".\")\r\nemptyLeft = empty - walls\r\n# we want to get an {emptyLeft} size connected component\r\n# then mark all the other empty cells as walls \r\ndfs(mat, i, j, visited, emptyLeft)\r\n \r\n# mark connected component as empty first\r\n# other empty cells changed to walls\r\n# print mat\r\nfor i in range(height):\r\n line = \"\".join(mat[i])\r\n print(line.replace(\".\", \"X\").replace(\"C\", \".\"))", "import heapq\r\nimport sys\r\nfrom collections import deque\r\n\r\ndef bfs(start,mat,k):\r\n visited = {start}\r\n queue = deque([start])\r\n ans = []\r\n while len(queue) > 0:\r\n x = queue.popleft()\r\n ans.append(x)\r\n k -= 1\r\n if k == 0:\r\n break\r\n\r\n i = x[0]\r\n j = x[1]\r\n l = [(i-1,j),(i+1,j),(i,j-1),(i,j+1)]\r\n for node in l:\r\n if node[0] < 0 or node[0] >= len(mat) or node[1] < 0 or node[1] >= len(mat[0]):\r\n continue\r\n\r\n if node not in visited:\r\n if mat[node[0]][node[1]] == \".\":\r\n visited.add(node)\r\n queue.append(node)\r\n\r\n return ans\r\n\r\n# input = sys.stdin.readline\r\nn,m,k = map(int,input().split())\r\nmat = []\r\nfor i in range(n):\r\n l = list(input())\r\n mat.append(l)\r\n\r\nflag = 0\r\nstart = (-1,-1)\r\ns = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == \".\":\r\n s += 1\r\n start = (i,j)\r\n\r\no = set(bfs(start,mat,s-k))\r\n# print(o)\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i,j) not in o and mat[i][j] == \".\":\r\n mat[i][j] = \"X\"\r\n\r\nfor i in mat:\r\n print(\"\".join(i))\r\n ", "n,m,k=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n L.append(list(input()))\r\nst=(-1,-1)\r\nemp=-1\r\nfor i in range(n):\r\n for j in range(m):\r\n if L[i][j]==\".\":\r\n st=i,j\r\n emp+=1\r\nlevels=[[st]]\r\nL[st[0]][st[1]]=\"Y\"\r\nwhile emp!=0 and k!=0:\r\n X=[]\r\n for i,j in levels[-1]:\r\n if i!=0:\r\n if L[i-1][j]==\".\":\r\n L[i-1][j]=\"Y\"\r\n X.append((i-1,j))\r\n emp-=1\r\n if i!=n-1:\r\n if L[i+1][j]==\".\":\r\n L[i+1][j]=\"Y\"\r\n X.append((i+1,j))\r\n emp-=1\r\n if j!=0:\r\n if L[i][j-1]==\".\":\r\n L[i][j-1]=\"Y\"\r\n X.append((i,j-1))\r\n emp-=1\r\n if j!=m-1:\r\n if L[i][j+1]==\".\":\r\n L[i][j+1]=\"Y\"\r\n X.append((i,j+1))\r\n #print((i,j),(i,j+1))\r\n emp-=1\r\n levels.append(X)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if L[i][j]==\"Y\":\r\n L[i][j]=\".\"\r\n\r\nX=[]\r\nwhile k!=0:\r\n if X==[]:\r\n X=levels.pop()\r\n i,j=X.pop()\r\n L[i][j]=\"X\"\r\n k-=1\r\n\r\nfor i in range(n):\r\n print(\"\".join(L[i]))\r\n \r\n \r\n\r\n\r\n\r\n", "def f(x, y):\n # x - row, y - col\n\n ns = []\n\n if y-1 >= 0 and g[x][y-1] == 'X':\n ns.append((x, y-1))\n if y + 1 < m and g[x][y+1] == 'X':\n ns.append((x, y+1))\n if x-1 >= 0 and g[x-1][y] == 'X':\n ns.append((x-1, y))\n if x+1 < n and g[x+1][y] == 'X':\n ns.append((x+1, y))\n\n return ns\n\n\nn, m, K = [int(x) for x in input().split()]\ng = [list(input()) for _ in range(n)]\n\n# find first '.' and count number of '.'\nstack = [] \nempty = 0\nfor i in range(n):\n for j in range(m):\n if g[i][j] == '.':\n g[i][j] = 'X'\n empty += 1\n\n if not stack:\n g[i][j] = '.'\n stack.append((i,j)) \n\nsteps = empty - K - 1\n\n# here we don't need `visited` since\n# we mark all the visited cells by '.' upon discovery\nwhile steps:\n node = stack.pop()\n x1, y1 = node\n\n for nei in f(*node):\n x, y = nei\n # mark this cell \n g[x][y] = '.'\n stack.append(nei)\n steps -= 1\n if not steps:\n break\n\nfor s in g:\n print(''.join(s))\n", "n,m,k=map(int,input().split())\r\nt=[input().replace('.','X') for i in range(n)]\r\nk=n*m-k-sum(i.count('#')for i in t)\r\nt=[list(i) for i in t]\r\ni,p=0,[]\r\nwhile k:\r\n if 'X' in t[i]:\r\n j=t[i].index('X')\r\n t[i][j],p='.',[(i,j)]\r\n k-=1\r\n break\r\n i+=1\r\nwhile k:\r\n x,y=p.pop()\r\n for i,j in ((x,y-1),(x,y+1),(x-1,y),(x+1,y)):\r\n if 0<=i<n and 0<=j<m and t[i][j]=='X':\r\n t[i][j]='.'\r\n p.append((i,j))\r\n k-=1\r\n if k==0: break\r\nfor i in range(n):\r\n t[i]=''.join(t[i])\r\nprint('\\n'.join(t))", "n, m, k = map(int, input().split())\r\n\r\n\r\nvisited = set()\r\nvisitedOrder = []\r\ndef dfs(maze, pos):\r\n global n, m, k, visited, visitedOrder\r\n toVisitSet = set()\r\n toVisit = [pos]\r\n toVisitSet.add(pos)\r\n while len(toVisit) != 0:\r\n point = toVisit.pop()\r\n toVisitSet.remove(point)\r\n if point in visited:\r\n continue\r\n visitedOrder.append(point)\r\n visited.add(point)\r\n if point[0]-1 >= 0 and maze[point[0]-1][point[1]] == 0 and (point[0]-1, point[1]) not in visited and (point[0]-1, point[1]) not in toVisitSet:\r\n toVisit.append((point[0]-1, point[1]))\r\n toVisitSet.add((point[0]-1, point[1]))\r\n if point[0]+1 < n and maze[point[0]+1][point[1]] == 0 and (point[0]+1, point[1]) not in visited and (point[0]+1, point[1]) not in toVisitSet:\r\n toVisit.append((point[0]+1, point[1]))\r\n toVisitSet.add((point[0]+1, point[1]))\r\n if point[1]-1 >= 0 and maze[point[0]][point[1]-1] == 0 and (point[0], point[1]-1) not in visited and (point[0], point[1]-1) not in toVisitSet:\r\n toVisit.append((point[0], point[1]-1))\r\n toVisitSet.add((point[0], point[1]-1))\r\n if point[1]+1 < m and maze[point[0]][point[1]+1] == 0 and (point[0], point[1]+1) not in visited and (point[0], point[1]+1) not in toVisitSet:\r\n toVisit.append((point[0], point[1]+1))\r\n toVisitSet.add((point[0], point[1]+1))\r\n\r\n while k > 0:\r\n k -= 1\r\n point = visitedOrder.pop()\r\n maze[point[0]][point[1]] = \"X\"\r\n \r\n\r\n\r\nmaze = [[0]*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 if s[j] == \"#\":\r\n maze[i][j] = 1\r\n else:\r\n point = (i, j)\r\n\r\ndfs(maze, point)\r\n# print(k)\r\nfor line in maze:\r\n for i in line:\r\n a = i\r\n if i == 0:\r\n a = \".\"\r\n elif i == 1:\r\n a = \"#\"\r\n print(a, end=\"\")\r\n print()", "n, m, k = list(map(int, input().split()))\n\nl = []\ns = 0\nfor i in range(n):\n l.append([])\n for j, c in enumerate(input()):\n l[-1].append(c)\n if c == '.':\n s = i, j\n \nd = {s}\ns = [s]\nwhile s and k:\n i, j = s[-1]\n if l[i][j] != '.':\n d.remove(s.pop())\n continue\n flag = True\n for p,q in [(i-1, j), (i+1, j), (i, j-1), (i, j+1)]:\n if not (0 <= p < n and 0 <= q < m): \n continue\n if l[p][q] != '.': \n continue\n if (p, q) in d: \n continue\n s.append((p, q))\n d.add((p, q))\n flag = False\n if flag:\n d.remove(s.pop())\n l[i][j] = 'X'\n k -= 1\n \nfor k in l:\n print(\"\".join(k))", "import sys\r\nfrom collections import deque, defaultdict\r\n\r\nALLOWED = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n\r\n\r\ndef topological_order():\r\n ...\r\n\r\n\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n m, n, k = (int(i) for i in read().split())\r\n matrix: list[list[str]] = []\r\n empty_cells = []\r\n # Let s be the number of empty spots\r\n s = 0\r\n for row_idx in range(m):\r\n line = read().strip()\r\n curr = []\r\n for col_idx, char in enumerate(line):\r\n curr.append(char)\r\n if char == '.':\r\n empty_cells.append((row_idx, col_idx))\r\n s += 1\r\n matrix.append(curr)\r\n queue: deque[tuple[int, int]] = deque()\r\n # If k need to be converted to blocks, then s - k need to remain connected.\r\n # So as long as we explore exactly s - k nodes, we know they will be connected.\r\n visited = defaultdict(lambda : False)\r\n # Connected elts needed\r\n remain_empty = set()\r\n needed = s - k\r\n queue.append(empty_cells[-1])\r\n visited[empty_cells[-1]] = True\r\n while queue and needed > 0:\r\n i, j = queue.popleft()\r\n remain_empty.add((i, j))\r\n needed -= 1\r\n # Explore the children\r\n for delta_i, delta_j in ALLOWED:\r\n if delta_i + i < 0 or delta_i + i >= m or delta_j + j < 0 or delta_j + j >= n:\r\n continue\r\n if not visited[(i + delta_i, j + delta_j)] and matrix[i + delta_i][j + delta_j] == '.':\r\n visited[(i + delta_i, j + delta_j)] = True\r\n queue.append((i + delta_i, j + delta_j))\r\n for i, j in empty_cells:\r\n if (i, j) not in remain_empty:\r\n k -= 1\r\n matrix[i][j] = 'X'\r\n if k <= 0:\r\n break\r\n\r\n for row in matrix:\r\n print(''.join(row))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# This code is contributed by Siddharth\r\n\r\nfrom sys import *\r\ninput = stdin.readline\r\n\r\n\r\n\r\n\r\nimport random\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nimport operator\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\nMOD=998244353\r\ns1 = 'abcdefghijklmnopqrstuvwxyz'\r\ns2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n# inverse modulo power pow(a,-1,mod) - it only works on py 3.8 ( *not in pypy )\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\r\ndef main():\r\n t=1\r\n #t=inpu()\r\n for _ in range(t):\r\n n,m,k=map(int,input().split())\r\n arr = []\r\n for i in range(n):\r\n arr.append(list(input()))\r\n x, y = -1, -1\r\n v = k\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '.':\r\n v -= 1\r\n x = i\r\n y = j\r\n s = [(x, y)]\r\n while v < 0 and len(s) > 0:\r\n i, j = s.pop()\r\n arr[i][j] = 'V'\r\n v += 1\r\n if i > 0 and arr[i - 1][j] == '.':\r\n s.append((i - 1, j))\r\n arr[i - 1][j] = 'P'\r\n if i < n - 1 and arr[i + 1][j] == '.':\r\n s.append((i + 1, j))\r\n arr[i + 1][j] = 'P'\r\n if j > 0 and arr[i][j - 1] == '.':\r\n s.append((i, j - 1))\r\n arr[i][j - 1] = 'P'\r\n if j < m - 1 and arr[i][j + 1] == '.':\r\n s.append((i, j + 1))\r\n arr[i][j + 1] = 'P'\r\n for r in arr:\r\n for e in r:\r\n if e == 'V':\r\n print('.', end=\"\")\r\n elif e == '.' or e == 'P':\r\n print('X', end=\"\")\r\n else:\r\n print(e, end=\"\")\r\n print()\r\nmain()", "from ensurepip import bootstrap as eb\nfrom itertools import count as ct\nimport sys\nfrom collections import Counter as C, deque as dq\nfrom types import GeneratorType as GT\nresult = []\n\n# input = sys.stdin.readline\n\ndef custom_bootstrap(f, stack=[]):\n def wrapped_func(*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 GT:\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 \n return wrapped_func\n\nn, m, k = map(int, input().split())\n\nmatrix = []\n\nfor i in range(n):\n matrix.append(list(input()))\n\nvisited = set()\n\ndef get_neighbours(row, col):\n neighbours = []\n\n for row_inc, col_inc in [[1, 0], [-1, 0], [0, 1], [0, -1]]:\n new_row, new_col = row + row_inc, col + col_inc\n if 0 <= new_row < n and 0 <= new_col < m and matrix[new_row][new_col] == '.':\n neighbours.append([new_row, new_col])\n\n return neighbours \n\nqueue = dq()\n\ntotal = 0\n\nfor row in matrix:\n for cell in row:\n total += cell == \".\"\n\n@custom_bootstrap\ndef depth_first_search(row, col):\n if len(visited) == (total - k):\n yield None\n\n neighbours = get_neighbours(row, col)\n\n visited.add((row, col))\n for neighbour in neighbours:\n if tuple(neighbour) not in visited:\n yield depth_first_search(neighbour[0], neighbour[1])\n\n yield None \n\nfor row in range(n):\n for col in range(m):\n if matrix[row][col] == '.':\n depth_first_search(row, col)\n break\n\nfor row in range(n):\n for col in range(m):\n if matrix[row][col] == '.' and (row, col) not in visited:\n matrix[row][col] = \"X\"\n\nfor row in matrix:\n print(''.join(row))\n\n\t\t \t\t \t\t \t \t\t\t\t \t \t \t" ]

[ "n, m = map(int, input().split())\nc = list(map(int, input().split()))\nk = list(map(int, input().split()))\np = [0] * m\nc = [i -1 for i in c]\ns = sum(k)\ncnt = k.count(0)\nl = 0\nr = 0\nwhile r < n and cnt < m:\n p[c[r]] += 1\n if p[c[r]] == k[c[r]]:\n cnt += 1\n r += 1\nif cnt != m:\n print(-1)\n exit(0)\nans = r-l\nwhile l < n:\n p[c[l]] -= 1\n while r < n and p[c[l]] < k[c[l]]:\n p[c[r]] += 1\n r += 1\n if p[c[l]] >= k[c[l]]:\n ans = min(ans, r-l-1)\n elif r == n:\n break\n l += 1\nprint(ans-s)\n", "import sys\r\ninput = sys.stdin.readline\r\ndef f(x):\r\n sz = sum(k)+x\r\n freq = [0]*(m+1)\r\n for i in range(sz):\r\n freq[a[i]] += 1\r\n small = 0\r\n for i in range(1,m+1):\r\n if freq[i] < k[i]:\r\n small += 1\r\n if not small: return True\r\n for i in range(sz, n):\r\n freq[a[i-sz]] -= 1\r\n if freq[a[i-sz]] == k[a[i-sz]]-1:\r\n small += 1\r\n freq[a[i]] += 1\r\n if freq[a[i]] == k[a[i]]:\r\n small -= 1\r\n if not small: return True\r\n return False\r\nglobal n,m\r\nn, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nk = [0]+list(map(int,input().split()))\r\nfreq = [0]*(m+1)\r\nfor i in a:\r\n freq[i] += 1\r\nfor i in range(1,m+1):\r\n if freq[i] < k[i]:\r\n print(-1)\r\n sys.exit(0)\r\nl = 0\r\nr = n-sum(k)\r\nans = r\r\nwhile l <= r:\r\n x = (l+r)//2\r\n if f(x):\r\n ans = x\r\n r = x-1\r\n else:\r\n l = x+1\r\nprint(ans)\r\n", "from collections import defaultdict\n\n\nn, m = map(int, input().split())\n\nns = list(map(int, input().split()))\nms = list(map(int, input().split()))\nsumms = sum(ms)\n\ntarget = {\n i: m\n for i, m in enumerate(ms, 1)\n}\nremain = set(i for i, m in target.items() if m != 0)\n\ncount = defaultdict(int)\n\na = 0\nb = 0\n\nwhile remain and b < n:\n count[ns[b]] += 1\n if ns[b] in remain and target[ns[b]] <= count[ns[b]]:\n remain.remove(ns[b])\n b += 1\n\nif remain:\n print(-1)\nelse:\n ans = b - summs\n while b <= n:\n if remain:\n if b >= n:\n break\n count[ns[b]] += 1\n if ns[b] in remain and target[ns[b]] <= count[ns[b]]:\n remain.remove(ns[b])\n b += 1\n else:\n count[ns[a]] -= 1\n if target[ns[a]] > count[ns[a]]:\n remain.add(ns[a])\n else:\n ans = min(ans, b - a - 1 - summs)\n a += 1\n\n print(ans)\n", "import random, math\nfrom copy import deepcopy as dc\nfrom bisect import bisect_left, bisect_right\n\n\n\n# Function to call the actual solution\ndef solution(li, li1):\n\tfreq = {}\n\tfor i in range(len(li1)):\n\t\tif li1[i]:\n\t\t\tfreq[i+1] = li1[i]\n\t\n\tmaxi = len(li)\n\t# Exclusive ranges j - i \n\ti = 0\n\tj = 0\n\treq = dc(freq)\n\tcur_freq = [0]*(len(li1) + 1)\n\tflag = False\n\twhile i < len(li):\n\t\twhile len(req) and j < len(li):\n\t\t\tcur_freq[li[j]] += 1\n\t\t\tif li[j] in req:\n\t\t\t\treq[li[j]] -= 1\n\t\t\t\tif req[li[j]] <= 0:\n\t\t\t\t\tdel req[li[j]]\n\t\t\tj += 1\n\t\tif len(req):\n\t\t\tbreak\n\t\tflag = True\n\t\tmaxi = min(maxi, j - i)\n\t\tcur_freq[li[i]] -= 1\n\t\tif li[i] in freq and cur_freq[li[i]] < freq[li[i]]:\n\t\t\treq[li[i]] = req.get(li[i], 0) + 1\n\t\ti += 1\n\tif not flag:\n\t\treturn -1\n\treturn maxi - sum(li1)\n\n\n\n# Function to take input\ndef input_test():\n\t# for _ in range(int(input())):\n\t\t# n = int(input())\n\t\ta, b = map(int, input().strip().split(\" \"))\n\t\t# a, b, c = map(int, input().strip().split(\" \"))\n\t\tli = list(map(int, input().strip().split(\" \")))\n\t\tli1 = list(map(int, input().strip().split(\" \")))\n\t\tout = solution(li, li1)\n\t\tprint(out)\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\np = [0] * m\r\nc = [i -1 for i in c]\r\ns = sum(k)\r\ncnt = k.count(0)\r\nl = 0\r\nr = 0\r\nwhile r < n and cnt < m:\r\n p[c[r]] += 1\r\n if p[c[r]] == k[c[r]]:\r\n cnt += 1\r\n r += 1\r\nif cnt != m:\r\n print(-1)\r\n exit(0)\r\nans = r-l\r\nwhile l < n:\r\n p[c[l]] -= 1\r\n while r < n and p[c[l]] < k[c[l]]:\r\n p[c[r]] += 1\r\n r += 1\r\n if p[c[l]] >= k[c[l]]:\r\n ans = min(ans, r-l-1)\r\n elif r == n:\r\n break\r\n l += 1\r\nprint(ans-s)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\ncntOfZero = 0\r\ntotal = 0\r\nfor ele in k:\r\n if ele == 0:\r\n cntOfZero+=1\r\n total += ele\r\n\r\nans = 10000000000000\r\ni = j = 0\r\ntemp = [0]*m\r\nfor i in range(n):\r\n while(cntOfZero < m and j<n):\r\n temp[arr[j]-1] += 1\r\n if(temp[arr[j]-1] == k[arr[j]-1]):\r\n cntOfZero += 1\r\n j += 1\r\n if cntOfZero < m and j == n:\r\n break\r\n if cntOfZero == m:\r\n ans = min(ans, j-i-total)\r\n if(temp[arr[i]-1] == k[arr[i]-1]):\r\n cntOfZero -= 1\r\n temp[arr[i]-1] -= 1\r\n\r\nif ans == 10000000000000:\r\n ans = -1\r\n\r\nprint(ans)", "from sys import stdin \r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=max):\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 \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n\r\n res_left = res_right = self._default\r\n while start < stop:\r\n if start & 1:\r\n res_left = self._func(res_left, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res_right = self._func(self.data[stop], res_right)\r\n start >>= 1\r\n stop >>= 1\r\n\r\n return self._func(res_left, res_right)\r\ninput=stdin.readline\r\ndef f(a,b):\r\n lo=0\r\n b=[0]+b\r\n cnt=[0]*(len(b))\r\n delta=list(map(lambda s:-1*s,b))\r\n s=sum(delta)\r\n delta=SegmentTree(delta,func=min,default=float(\"inf\"))\r\n mn=min(delta)\r\n ans=float(\"inf\")\r\n for i in range(len(a)):\r\n id=a[i]\r\n hi=i\r\n cnt[id]+=1\r\n delta[id]=delta[id]+1\r\n s+=1\r\n while lo<=hi:\r\n if cnt[a[lo]]-1>=b[a[lo]]:\r\n cnt[a[lo]]-=1\r\n delta[a[lo]]=delta[a[lo]]-1\r\n s-=1\r\n lo+=1\r\n else:\r\n break\r\n # print(delta.query(0,len(b)))\r\n if delta.query(0,len(b))>=0:\r\n ans=min(ans,s)\r\n return [ans,-1][ans==float(\"inf\")]\r\n\r\n'''\r\n4 4\r\n4 4 2 2\r\n1 1 1 1\r\n4 4\r\n4 2 1 2\r\n1 2 0 1\r\n\r\n'''\r\nn,k=map(int,input().strip().split())\r\na=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\nprint(f(a,b))" ]

[ "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, = readln()\nans = []\nfor x, y in sorted([readln() for _ in range(n)], key=lambda x: abs(x[0]) + abs(x[1])):\n if x > 0:\n ans.append('1 %d R' % x)\n if x < 0:\n ans.append('1 %d L' % -x)\n if y > 0:\n ans.append('1 %d U' % y)\n if y < 0:\n ans.append('1 %d D' % -y)\n ans.append('2')\n if x > 0:\n ans.append('1 %d L' % x)\n if x < 0:\n ans.append('1 %d R' % -x)\n if y > 0:\n ans.append('1 %d D' % y)\n if y < 0:\n ans.append('1 %d U' % -y)\n ans.append('3')\nprint(len(ans))\nprint('\\n'.join(ans))\n", "def dist(p):\r\n return abs(p[0]) + abs(p[1])\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\n \r\npoints.sort(key = dist)\r\n\r\nans = []\r\nfor x,y in points:\r\n if x > 0:\r\n ans.append(f'1 {x} R')\r\n if x < 0:\r\n ans.append(f'1 {-x} L')\r\n if y > 0:\r\n ans.append(f'1 {y} U')\r\n if y < 0:\r\n ans.append(f'1 {-y} D')\r\n ans.append('2')\r\n if x > 0:\r\n ans.append(f'1 {x} L')\r\n if x < 0:\r\n ans.append(f'1 {-x} R')\r\n if y > 0:\r\n ans.append(f'1 {y} D')\r\n if y < 0:\r\n ans.append(f'1 {-y} U')\r\n ans.append('3')\r\n\r\nprint(len(ans))\r\nprint('\\n'.join(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na1 = []\r\na2 = []\r\na3 = []\r\na4 = []\r\nd = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a >= 0:\r\n if b >= 0:\r\n a1.append((a, b))\r\n else:\r\n a2.append((a, -b))\r\n else:\r\n if b >= 0:\r\n a3.append((-a, b))\r\n else:\r\n a4.append((-a, -b))\r\na1.sort()\r\nfor i, j in a1:\r\n if i != 0:\r\n d.append((1, i, 'R'))\r\n if j != 0:\r\n d.append((1, j, 'U'))\r\n d.append(2)\r\n if j != 0:\r\n d.append((1, j, 'D'))\r\n if i != 0:\r\n d.append((1, i, 'L'))\r\n d.append(3)\r\n\r\na2.sort()\r\nfor i, j in a2:\r\n if i != 0:\r\n d.append((1, i, 'R'))\r\n if j != 0:\r\n d.append((1, j, 'D'))\r\n d.append(2)\r\n if j != 0:\r\n d.append((1, j, 'U'))\r\n if i != 0:\r\n d.append((1, i, 'L'))\r\n d.append(3)\r\n\r\na3.sort()\r\nfor i, j in a3:\r\n if i != 0:\r\n d.append((1, i, 'L'))\r\n if j != 0:\r\n d.append((1, j, 'U'))\r\n d.append(2)\r\n if j != 0:\r\n d.append((1, j, 'D'))\r\n if i != 0:\r\n d.append((1, i, 'R'))\r\n d.append(3)\r\n\r\na4.sort()\r\nfor i, j in a4:\r\n if i != 0:\r\n d.append((1, i, 'L'))\r\n if j != 0:\r\n d.append((1, j, 'D'))\r\n d.append(2)\r\n if j != 0:\r\n d.append((1, j, 'U'))\r\n if i != 0:\r\n d.append((1, i, 'R'))\r\n d.append(3)\r\n\r\nprint(len(d))\r\nfor i in d:\r\n if i in [2, 3]:\r\n print(i)\r\n else:\r\n print(*i)", "def f(i, j):\r\n x, y = str(abs(i)), str(abs(j))\r\n l, r, u, d = ' L', ' R', ' U', ' D'\r\n if i < 0: l, r = r, l\r\n if j < 0: u, d = d, u\r\n if i:\r\n if j: return ['1 ' + x + r, '1 ' + y + u, '2', '1 ' + x + l, '1 ' + y + d, '3']\r\n else: return ['1 ' + x + r, '2', '1 ' + x + l, '3']\r\n else: return ['1 ' + y + u, '2', '1 ' + y + d, '3']\r\n\r\np, n = [], int(input())\r\nt = [(abs(i) + abs(j), i, j) for i, j in tuple(map(int, input().split()) for i in range(n))]\r\nt.sort()\r\nfor r, i, j in t:\r\n p += f(i, j)\r\nprint(len(p))\r\nprint('\\n'.join(p))", "from bisect import bisect_left as bl, bisect_right as br, insort\r\nimport sys\r\nimport heapq\r\n#from math import *\r\nfrom collections import defaultdict as dd, deque\r\ndef data(): return sys.stdin.readline().strip()\r\ndef mdata(): return map(int, data().split())\r\n#sys.setrecursionlimit(100000)\r\n\r\n\r\nn=int(data())\r\nA=[]\r\nans=[]\r\nd=dd(list)\r\nfor i in range(n):\r\n x,y=mdata()\r\n A.append((x,y))\r\nA.sort(key=lambda x:abs(x[0])+abs(x[1]))\r\nfor i in A:\r\n x,y=i\r\n if x > 0:\r\n ans.append('1 %d R' % x)\r\n elif x < 0:\r\n ans.append('1 %d L' % -x)\r\n if y > 0:\r\n ans.append('1 %d U' % y)\r\n elif y < 0:\r\n ans.append('1 %d D' % -y)\r\n ans.append('2')\r\n if x > 0:\r\n ans.append('1 %d L' % x)\r\n elif x < 0:\r\n ans.append('1 %d R' % -x)\r\n if y > 0:\r\n ans.append('1 %d D' % y)\r\n elif y < 0:\r\n ans.append('1 %d U' % -y)\r\n ans.append('3')\r\nprint(len(ans))\r\nprint('\\n'.join(ans))\r\n\r\n\r\n", "import os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\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\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\nif(os.path.exists('input.txt')):\r\n sys.stdin = open('input.txt','r') ; sys.stdout = open('output.txt','w')\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef distance(coor):\r\n return abs(coor[0]) + abs(coor[1])\r\n\r\nn = int(input())\r\nbombs = [tuple(map(int, input().split())) for i in range(n)]\r\nbwd = [(i[0],i[1],distance(i)) for i in bombs]\r\nbwd.sort(key=lambda x:x[2],reverse=True)\r\nops = []\r\nfor i in range(len(bwd)-1,-1,-1):\r\n x,y,dist = bwd[i]\r\n if x==0:\r\n if y>0:\r\n ops.append((1,y,'U'))\r\n ops.append(tuple([2]))\r\n ops.append((1,y,'D'))\r\n ops.append(tuple([3]))\r\n else:\r\n ops.append((1,-y,'D'))\r\n ops.append(tuple([2]))\r\n ops.append((1,-y,'U'))\r\n ops.append(tuple([3]))\r\n elif y==0:\r\n if x>0:\r\n ops.append((1,x,'R'))\r\n ops.append(tuple([2]))\r\n ops.append((1,x,'L'))\r\n ops.append(tuple([3]))\r\n else:\r\n ops.append((1,-x,'L'))\r\n ops.append(tuple([2]))\r\n ops.append((1,-x,'R'))\r\n ops.append(tuple([3]))\r\n else:\r\n ops.append((1,abs(x),'R' if x>0 else 'L'))\r\n ops.append((1,abs(y),'U' if y>0 else 'D'))\r\n ops.append(tuple([2]))\r\n ops.append((1,abs(y),'D' if y>0 else 'U'))\r\n ops.append((1,abs(x),'L' if x>0 else 'R'))\r\n ops.append(tuple([3]))\r\nprint(len(ops))\r\nfor i in ops:\r\n print(*i)\r\n\r\n", "import sys\r\nfrom math import log2,floor,ceil,sqrt,gcd\r\n# import bisect\r\n# from collections import deque\r\n# sys.setrecursionlimit(7*10**4)\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\nflag = False\r\n\r\nn = int(ri())\r\nres= []\r\nqq = []\r\nfor i in range(n):\r\n x,y = Ri()\r\n qq.append([x,y])\r\nqq.sort(key = lambda x : abs(x[0])+abs(x[1]))\r\nfor i in range(len(qq)):\r\n x,y = qq[i]\r\n if x > 0: res.append('1 %d %c' % (x, 'R'))\r\n if x < 0: res.append('1 %d %c' % (-x, 'L'))\r\n if y > 0: res.append('1 %d %c' % (y, 'U'))\r\n if y < 0: res.append('1 %d %c' % (-y, 'D'))\r\n res.append('2')\r\n if x > 0: res.append('1 %d %c' % (x, 'L'))\r\n if x < 0: res.append('1 %d %c' % (-x, 'R'))\r\n if y > 0: res.append('1 %d %c' % (y, 'D'))\r\n if y < 0: res.append('1 %d %c' % (-y, 'U'))\r\n res.append('3')\r\nprint(len(res))\r\nprint(\"\\n\".join(res))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\n\r\nn = int(input())\r\nans = []\r\nfor x, y in sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: abs(x[0]) + abs(x[1])):\r\n if x > 0:\r\n ans.append('1 %d R' % x)\r\n if x < 0:\r\n ans.append('1 %d L' % -x)\r\n if y > 0:\r\n ans.append('1 %d U' % y)\r\n if y < 0:\r\n ans.append('1 %d D' % -y)\r\n ans.append('2')\r\n if x > 0:\r\n ans.append('1 %d L' % x)\r\n if x < 0:\r\n ans.append('1 %d R' % -x)\r\n if y > 0:\r\n ans.append('1 %d D' % y)\r\n if y < 0:\r\n ans.append('1 %d U' % -y)\r\n ans.append('3')\r\nprint(len(ans))\r\nprint('\\n'.join(ans))\r\n", "def dist(p):\r\n return abs(p[0]) + abs(p[1])\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\n \r\npoints.sort(key = dist)\r\n\r\nans = []\r\nfor x,y in points:\r\n if x > 0:\r\n ans.append('1 %d R' % x)\r\n if x < 0:\r\n ans.append('1 %d L' % -x)\r\n if y > 0:\r\n ans.append('1 %d U' % y)\r\n if y < 0:\r\n ans.append('1 %d D' % -y)\r\n ans.append('2')\r\n if x > 0:\r\n ans.append('1 %d L' % x)\r\n if x < 0:\r\n ans.append('1 %d R' % -x)\r\n if y > 0:\r\n ans.append('1 %d D' % y)\r\n if y < 0:\r\n ans.append('1 %d U' % -y)\r\n ans.append('3')\r\n\r\nprint(len(ans))\r\nprint('\\n'.join(ans))", "import sys\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\nn,=I()\r\nseg = [I() for _ in range(n)]\r\nseg = sorted(seg, key=lambda x : abs(x[0]) + abs(x[1]))\r\nres = []\r\nfor x, y in seg:\r\n if x > 0: res.append('1 %d %c' % (x, 'R'))\r\n if x < 0: res.append('1 %d %c' % (-x, 'L'))\r\n if y > 0: res.append('1 %d %c' % (y, 'U'))\r\n if y < 0: res.append('1 %d %c' % (-y, 'D'))\r\n res.append('2')\r\n if x > 0: res.append('1 %d %c' % (x, 'L'))\r\n if x < 0: res.append('1 %d %c' % (-x, 'R'))\r\n if y > 0: res.append('1 %d %c' % (y, 'D'))\r\n if y < 0: res.append('1 %d %c' % (-y, 'U'))\r\n res.append('3') \r\nprint(len(res))\r\nprint('\\n'.join(res))\r\n", "import sys\r\n\r\ntestcases = int(input())\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\narr = []\r\ncount_zero = 0 \r\nfor testcase in range(testcases):\r\n x, y = get_ints()\r\n arr.append((x,y))\r\n if x == 0 :\r\n count_zero +=1\r\n if y == 0 :\r\n count_zero +=1\r\narr.sort(key=lambda x: abs(x[0]) + abs(x[1]))\r\nprint(6*testcases - 2* count_zero)\r\n\r\nfor tup in arr:\r\n x = tup[0]\r\n y = tup[1]\r\n \r\n if x < 0 :\r\n print( \"1 \" + str(abs(x)) + \" L\")\r\n if x > 0 :\r\n print(\"1 \" + str(x) + \" R\")\r\n if y < 0 :\r\n print( \"1 \" + str(abs(y)) + \" D\")\r\n if y > 0:\r\n print( \"1 \" + str(abs(y)) + \" U\")\r\n \r\n print(\"2\")\r\n \r\n if x < 0 :\r\n print(\"1 \" + str(abs(x)) + \" R\")\r\n if x > 0 :\r\n print(\"1 \" + str(x) + \" L\")\r\n if y < 0 :\r\n print( \"1 \" + str(abs(y)) + \" U\")\r\n if y > 0:\r\n print( \"1 \" + str(y) + \" D\")\r\n print(\"3\")\r\n\r\n" ]

[ "def solve(n, k, As):\r\n As.sort()\r\n m, r = divmod(n, k)\r\n dp = [0] * (r + 1)\r\n for i in range(1, k):\r\n im = i * m\r\n new_dp = [0] * (r + 1)\r\n new_dp[0] = dp[0] + As[im] - As[im - 1]\r\n for h in range(1, min(i, r) + 1):\r\n new_dp[h] = max(dp[h], dp[h - 1]) + As[im + h] - As[im + h - 1]\r\n dp = new_dp\r\n return As[-1] - As[0] - max(dp[r], dp[r-1])\r\n\r\nn, k = map(int, input().split())\r\nAs = list(map(int, input().split()))\r\nprint(solve(n, k, As))", "inf = 10 ** 10\r\nn, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nL, M = n // k, n % k\r\ndp = [[0] * (k - M + 1) for i in range(M + 1)]\r\nfor i in range(M + 1):\r\n for j in range(k - M + 1):\r\n pos = i * (L + 1) + j * L\r\n dp[i][j] = min((dp[i - 1][j] + a[pos - 1] - a[pos - L - 1] if i else inf), \\\r\n (dp[i][j - 1] + a[pos - 1] - a[pos - L] if j else inf)) if (i or j) else 0\r\nprint(dp[M][k - M])\r\n" ]

[ "def main():\r\n def sumofdigit(n):\r\n temp=0\r\n while(n>0):\r\n temp+=n%10\r\n n=n//10\r\n return temp\r\n\r\n def F(x):\r\n return x-sumofdigit(x)\r\n\r\n def findout(s):\r\n test=s-s%10+10\r\n while(1):\r\n if F(test)>=s:\r\n break\r\n else:\r\n test+=10\r\n return test\r\n\r\n n,s=list(map(int,input().strip().split(' ')))\r\n L=findout(s)\r\n ans=n-L+1\r\n if ans<0:\r\n print(0)\r\n else:\r\n print(ans)\r\nmain() ", "def main():\n n, s = map(int,input().split())\n a = BS(1,n,s)\n print(n-a+1)\n \ndef BS(f,l,d):\n if(f>l): \n return f\n mi = (f+l)//2\n if(mi-sum([int(j) for j in str(mi)]) >= d):\n return BS(f,mi-1,d)\n else:\n return BS(mi+1,l,d)\n\nif __name__ == \"__main__\":\n main()\n", "n,s=map(int,input().split())\r\nif s>=n:\r\n print(\"0\")\r\n exit()\r\nfor i in range(s,n+2):\r\n cur=int(0)\r\n for j in str(i):\r\n cur+=int(j)\r\n if i-cur>=s:\r\n break\r\nprint(n-i+1)\r\n", "n,s = input().split()\n\ni = int(s)\nd_sum = sum(list(map(int,str(i))))\nwhile i - d_sum < int(s):\n i += 1\n d_sum = sum(list(map(int,str(i)))) \n\nprint((max(0,int(n)-i+1)))\n\t\t\t \t \t \t\t\t\t\t \t\t \t\t", "n, s = map(int, input().split())\n\nans = 0\np = s\nfor i in range(163):\n\tp = s + i\n\tif p > n:\n\t\tbreak\n\tif p >= s + sum(map(int, str(p))):\n\t\tans += 1\n\nif p <= n:\n\tans += n - p\n\nprint(ans)", "n, s = map(int, input().split())\r\n\r\ndef binsearch(n, s):\r\n left = 0\r\n right = n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n digits = sum([int(i) for i in list(str(mid))])\r\n if mid - digits >= s:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n return right\r\n#print(binsearch(n, s))\r\nprint(max(0, n - binsearch(n, s)))\r\n\r\n", "def search(l,r,s,g):\r\n if l>r:\r\n return [-1,g]\r\n mid=(l+r)//2\r\n sum=0\r\n temp=mid\r\n while temp>0:\r\n sum+=temp%10\r\n temp//=10\r\n if mid-sum==s:\r\n return [mid-mid%10,g]\r\n elif mid-sum>s:\r\n g=mid-mid%10\r\n return search(l,mid-1,s,g)\r\n else:\r\n return search(mid+1,r,s,g)\r\nn,s=map(int,input().split())\r\ng=0\r\n[num,g]=search(1,n,s,g)\r\nif num==-1 and g==0:\r\n print(0)\r\nelif num!=-1:\r\n if num==0:\r\n print(n-num)\r\n else:\r\n print(n-num+1)\r\nelse:\r\n print(n-g+1)\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\ndef ok(x):\r\n y = sum(map(int, list(str(x))))\r\n return x-y >= s\r\n\r\nn, s = map(int, input().split())\r\nl, h = 0, n\r\na = n\r\nwhile l <= h:\r\n m = (l+h)>>1\r\n if ok(m):\r\n a = m-1\r\n h = m-1\r\n else:\r\n l = m+1\r\nprint(n-a)", "import sys\r\ninput=sys.stdin.readline\r\nn,s=map(int,input().split())\r\nl=0;r=n+1\r\nwhile r-l>1:\r\n x=(l+r)//2\r\n cs=0\r\n m=x\r\n while m>0:\r\n cs+=m%10\r\n m//=10\r\n if x-cs>=s:\r\n r=x\r\n else:\r\n l=x\r\nprint(n-l)", "import sys\r\n#import random\r\nfrom bisect import bisect_right 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\nn,s = il()\r\n\r\nl = s\r\nh = n\r\nans = n+1\r\n\r\nwhile (l<=h) :\r\n m = (l+h)//2\r\n\r\n t = 0\r\n\r\n for i in str(m) :\r\n t += int(i)\r\n\r\n if (m-t >= s) :\r\n ans = m\r\n h = m-1\r\n else :\r\n l = m+1\r\n\r\nprint(n-ans+1)\r\n \r\n", "n,s = map(int,input().split())\r\nif s>=n:\r\n print('0')\r\nelse:\r\n for i in range(s,n+2):\r\n l=0\r\n for j in str(i):\r\n l+=int(j)\r\n if i-l>=s:\r\n break\r\n print(n-i+1)", "n,s = map(int, input().split())\r\ndef func(x):\r\n x = str(x)\r\n y = 0\r\n for c in x:\r\n y += int(c)\r\n return y\r\n\r\nif n-func(n) < s:\r\n print(0)\r\n exit()\r\n\r\nng = 0\r\nok = n\r\nwhile ng+1 < ok:\r\n c = (ng+ok)//2\r\n if c-func(c) >= s:\r\n ok = c\r\n else:\r\n ng = c\r\nprint(n-ng)\r\n", "import math\r\n\r\n\r\ndef digit_sum(n):\r\n return sum(map(int, str(n)))\r\n\r\n\r\ndef main():\r\n n, s = map(int, input().split())\r\n if n - digit_sum(n) < s:\r\n return print(0)\r\n l = 1\r\n r = n + 1\r\n while l < r:\r\n mid = (l + r) // 2\r\n if mid - digit_sum(mid) < s:\r\n l = mid + 1\r\n else:\r\n r = mid\r\n print(n - l + 1)\r\n\r\n\r\nmain()\r\n", "from sys import stdin\r\ninput=stdin.readline\r\n\r\ndef check(x,s):\r\n if x-sum(int(i) for i in str(x))>=s:return True\r\n return False\r\nn,s=map(int, input().split())\r\nl=0\r\nr=n+1\r\nwhile r-l>1:\r\n m=(l+r)//2\r\n if check(m,s):r=m\r\n else:l=m\r\nprint(n-r+1)", "n,s=input().split()\r\nl=1\r\nh=int(n)\r\nwhile h-l>1:\r\n\tm=(h+l)//2\r\n\tif m-sum(map(int,list(str(m))))>=int(s):\r\n\t\th=m\r\n\telse:\r\n\t\tl=m\r\nif h-sum(map(int,list(str(h))))<int(s):\r\n\tprint(0)\r\nelse:\r\n\tprint(int(n)-h+1) ", "def check(x):\r\n summ=0\r\n a=str(x)\r\n for i in a:\r\n summ+=int(i)\r\n return summ\r\n\r\nn,s=map(int,input().split()) ; r=n ; l=1 ; ans=n\r\nif ans-check(ans)<s:\r\n print(0)\r\nelse: \r\n while l<=r:\r\n mid=(r+l)//2\r\n if mid-check(mid)>=s:\r\n r=mid-1 ; ans=mid\r\n else:\r\n l=mid+1\r\n print(n-ans+1)\r\n \r\n \r\n \r\n", "def check(n,p):\r\n k=str(n)\r\n k=k[::-1]\r\n s=0\r\n for j in range(len(k)):\r\n s+=(int(k[j])*(10**j-1))\r\n if s>=p:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn,s=map(int,input().split())\r\nl=1\r\nh=n\r\nk=0\r\nwhile(l<=h):\r\n m=(l+h)//2\r\n if check(m,s)==0:\r\n l=m+1\r\n else:\r\n h=m-1\r\n k+=1\r\nprint(n-l+1)\r\n", "def summing(number):\r\n summa = 0\r\n while number > 0:\r\n summa += number % 10\r\n number = number // 10\r\n return summa\r\n\r\n\r\ndef result(n, s):\r\n z = min(s, n)\r\n while z <= n and z - summing(z) < s:\r\n z += 1\r\n return n - z + 1\r\n\r\n\r\na, b = [int(i) for i in input().split()]\r\nprint(result(a, b))\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\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\n\nN,M = map(int,input().split())\nl,r = 1,N+1\n\nans = N+1\nwhile l<r:\n mid = (l+r)//2\n x = sum([int(x) for x in str(mid)])\n if mid-x<M:\n l = mid+1\n else:\n r = mid\n ans = min(ans,mid)\nprint(N-ans+1)\n", "n,s=map(int,input().split())\nt=s\nwhile 1:\n su=sum([int(x) for x in str(t)])\n if t-su<s:\n t+=1\n else:break\n \nprint(n-t+1 if n>=t else 0)\n \t\t \t\t \t\t \t \t \t \t\t", "n, s = map(int, input().split())\r\nr = 0\r\nv = min(n+1, s+19*9)\r\nfor i in range(s, v):\r\n zz = f'{i}'\r\n sm = i\r\n for z in zz:\r\n sm -= int(z)\r\n\r\n if(sm >= s):\r\n r += 1\r\n\r\nprint(r + n-v + 1)\r\n", "import sys\r\nimport math\r\nfrom bisect import bisect_right as br\r\n#from decimal import Decimal \r\n \r\n#from statistics import mode\r\n \r\nfrom itertools import combinations as cb\r\n \r\ndef int_arr(): return list(map(int, sys.stdin.readline().strip().split()))\r\n \r\ndef str_arr(): return list(map(str, sys.stdin.readline().strip().split()))\r\n \r\ndef input(): return sys.stdin.readline().strip()\r\n \r\n \r\n\r\n\r\n# sys.stdin = open('Really Big Numbers/input.txt', 'r')\r\n# sys.stdout = open('Really Big Numbers/output.txt', 'w')\r\n\r\n\r\nn,k=int_arr()\r\nstart=1\r\nlast=n\r\nmnm=-1\r\nwhile(start<=last):\r\n mid=(start+last)//2\r\n \r\n\r\n sm=0\r\n for i in str(mid):\r\n sm+=int(i)\r\n \r\n if(mid-sm)>=k:\r\n mnm=mid\r\n last=mid-1\r\n else:\r\n start=mid+1\r\nif mnm==-1:\r\n print(0)\r\nelse:\r\n print(n-mnm+1)\r\n\r\n", "def BIG(NUM):\r\n X=NUM\r\n SM=0\r\n while X!=0:\r\n M=X%10\r\n SM+=M\r\n X//=10\r\n if NUM-SM>=S:\r\n return True\r\n\r\nimport sys\r\nsys.setrecursionlimit(int(1e5))\r\ninput=sys.stdin.readline\r\nN,S=map(int,input().split())\r\nF=0;L=N+1;MN=1<<64\r\nwhile L>=F:\r\n M=(L+F)>>1\r\n if BIG(M):L=M-1;MN=min(MN,M)\r\n else:F=M+1\r\nif MN==1<<64:\r\n print(0)\r\nelse:\r\n print(N-MN+1)", "n,s = map(int,input().split())\r\nif s > n:\r\n print('0')\r\nelse:\r\n for i in range(s,n+2):\r\n l = 0\r\n for j in str(i):\r\n l += int(j)\r\n if i - l >= s:\r\n break\r\n print(n - i+1)\r\n", "n,s=[int(e) for e in input().split()]\r\ndef f(x):\r\n return x-sum(int(e) for e in str(x))\r\nL=1\r\nR=n\r\nif f(R)<s:\r\n print(0)\r\nelse:\r\n while R>L+1:\r\n M=(L+R)//2\r\n if f(M)>=s:\r\n R=M\r\n else:\r\n L=M\r\n if f(L)>=s:\r\n print(n-L+1)\r\n else:\r\n print(n-R+1)", "n, s = map(int, input().split())\r\n\r\nans = 0\r\np = s\r\nfor i in range(163):\r\n\tp = s + i\r\n\tif p > n:\r\n\t\tbreak\r\n\tif p >= s + sum(map(int, str(p))):\r\n\t\tans += 1\r\n\r\nif p <= n:\r\n\tans += n - p\r\n\r\nprint(ans)", "def sum_of_digits(n):\r\n ans = 0\r\n while(n):\r\n ans += n%10\r\n n//=10\r\n return ans\r\n\r\nn,s = map(int,input().split())\r\nlo = 0; hi = n\r\nx = n+1\r\nwhile(lo<=hi):\r\n mid = (lo+hi)//2\r\n if(mid - sum_of_digits(mid) >= s):\r\n x = min(mid,x)\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\nprint(n - x + 1)", "import sys\r\n\r\n\r\ndef debug(*arg, sep=\" \", end=\"\\n\"):\r\n print(*arg, sep=sep, end=end, file=sys.stderr)\r\n\r\n\r\ndef F(n):\r\n res = 0\r\n while n:\r\n res += n % 10\r\n n //= 10\r\n return res\r\n\r\n\r\ndef main():\r\n N, S = map(int, input().split())\r\n\r\n l = 0\r\n r = 10 ** 18 + 10\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n if m - F(m) >= S:\r\n r = m\r\n else:\r\n l = m\r\n print(max(0, N - l))\r\n\r\n\r\nmain()\r\n", "if __name__ == \"__main__\":\n n, s = input().split(\" \")\n n = int(n)\n s = int(s)\n \n sol = 0\n l = 1\n r = n\n while l <= r:\n sum = 0\n i = (l + r)//2\n a = i\n while (a > 0):\n sum += a % 10\n a = a // 10\n\n if i - sum >= s:\n sol = n - i + 1\n r = i - 1\n else:\n l = i + 1\n \n print(sol)\n\t\t\t \t\t\t \t \t \t \t \t\t\t\t\t\t\t\t \t", "R = lambda: map(int, input().split())\r\nn, s = R()\r\nl, r = s, 10**18 + 7\r\n\r\ndef digit(x):\r\n res = 0\r\n while x:\r\n res += x % 10\r\n x //= 10\r\n return res\r\n\r\nwhile l < r:\r\n m = (l + r) // 2\r\n if m - digit(m) < s:\r\n l = m + 1\r\n else:\r\n r = m\r\nprint(max(0, n - l + 1))", "(n,s)=map(int,input().split())\r\ndef comp(p):\r\n a=p\r\n sum=0\r\n while(a!=0):\r\n sum+=a%10\r\n a//=10\r\n return p-sum>=s\r\nl=0\r\nr=n\r\nwhile (r - l > 1):\r\n\tp = (l + r) // 2;\r\n\tif (comp(p)):\r\n\t r = p\r\n\telse:\r\n\t l = p\r\nif(comp(n)):\r\n print(n-l)\r\nelse:\r\n print(0)\r\n\t", "n,s=map(int,input().split())\r\nt=s\r\nwhile 1:\r\n su=sum([int(x) for x in str(t)])\r\n if t-su<s:\r\n t+=1\r\n else:break\r\n\r\nprint(n-t+1 if n>=t else 0)", "def find(curr_pos, max_pos, curr_s, choose):\r\n if curr_pos == 0:\r\n if curr_s <= 0:\r\n return True\r\n else:\r\n return False\r\n if curr_pos == max_pos:\r\n low = 1\r\n else:\r\n low = 0\r\n high = 9\r\n for d in range(low, high + 1):\r\n curr_val = d * (10 ** curr_pos - 1)\r\n if curr_val + p[curr_pos - 1] < curr_s:\r\n continue\r\n choose[curr_pos] = d\r\n return find(curr_pos - 1, max_pos, curr_s - curr_val, choose)\r\n return False\r\n\r\n\r\nn, s = map(int, input().split())\r\np = [0]\r\nfor i in range(1, 19):\r\n p.append(p[-1] + 9 * (10 ** i - 1))\r\nchoose = [0] * 19\r\nans = n + 1\r\nfor num_digit in range(1, 19):\r\n for i in range(1, num_digit + 1):\r\n choose[i] = 0\r\n if find(num_digit, num_digit, s, choose):\r\n res = 0\r\n for i in range(num_digit, -1, -1):\r\n res = res * 10 + choose[i]\r\n ans = min(ans, res)\r\n break\r\nprint(n - ans + 1)", "def f(n):\r\n tmp = 0\r\n while n>0:\r\n tmp+=n%10\r\n n//=10\r\n return tmp\r\n\r\ndef solve(m,r):\r\n ans = min(m, r-1)\r\n for i in range(200):\r\n if r + i <= m and i<f(i+r):\r\n ans+=1\r\n ans = m - ans\r\n return ans\r\n\r\nm,r=map(int,input().split())\r\nprint(solve(m,r))\r\n", "import math;\r\nfrom math import log2,sqrt;\r\nfrom bisect import bisect_left,bisect_right\r\nimport bisect;\r\nimport sys;\r\nfrom sys import stdin,stdout\r\nimport os\r\nsys.setrecursionlimit(pow(10,6))\r\nimport collections\r\nfrom collections import defaultdict\r\nfrom statistics import median\r\n# input=stdin.readline\r\n# print=stdout.write\r\ninf = float(\"inf\")\r\ndef sum_of_no(n):\r\n suma=0\r\n while(n):\r\n suma+=n%10;\r\n n//=10;\r\n return suma;\r\ndef get_forward(start,diff):\r\n if(diff==0):\r\n return [start+1,diff]\r\n diff=diff//2\r\n start+=diff;\r\n return [start,diff]\r\ndef get_backward(start,diff):\r\n if(diff==0):\r\n return [start-1,diff]\r\n diff = diff // 2\r\n start -= diff;\r\n return [start, diff]\r\n\r\n\r\nn,s=map(int,input().split())\r\nstart=1\r\nend=n;\r\ndiff=(n-1)\r\nans=0\r\nwhile 1:\r\n sub=start-sum_of_no(start)\r\n sub_prev=start-1-sum_of_no(start-1)\r\n\r\n if sub>=s and sub_prev<s:\r\n ans=start\r\n break;\r\n\r\n if sub>=s:\r\n start,diff=get_backward(start,diff)\r\n elif sub<s:\r\n start,diff=get_forward(start,diff)\r\n\r\nreal_ans=n-ans+1\r\nif real_ans<0:\r\n real_ans=0\r\nprint(real_ans)\r\n", "def f(n):\n rtn = n\n while 0 < n:\n rtn -= n % 10\n n //= 10\n return rtn\n\nn, s = map(int, input().split())\nl = 0\nr = 10**18 + 1\ncnt = 0\nwhile 1 < r - l:\n m = (l + r) // 2\n if s <= f(m):\n r = m\n else:\n l = m\n\nprint(max(n - r + 1, 0))\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import log2\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\nn, s = gil()\r\n\r\nl, r = 1, n\r\nans = r+1\r\n\r\ndef isPos(x):\r\n sm = 0\r\n X = x\r\n while x:\r\n md = x%10\r\n sm += md\r\n x = (x-md)//10\r\n\r\n return X - sm >= s\r\n\r\n\r\nwhile l <= r:\r\n mid = (l+r)//2\r\n if isPos(mid):\r\n # print(mid, 'true')\r\n r = mid - 1\r\n ans = mid\r\n else:\r\n l = mid + 1\r\n\r\n\r\nprint(max(0, n-ans+1))", "n, s = [int(i) for i in input().split()]\r\nprint(max(n - ([i for i in range(s, s + 9 * 18 + 1) if i - sum([int(j) for j in str(i)]) >= s] + [int('1' * 18)])[0] + 1, 0))\r\n", "n, s = [int(i) for i in input().split()]\n\nprint(max(n - [i for i in range(s, s + 180) if i - sum([int(j) for j in str(i)]) >= s][0] + 1, 0))\n\n\n\n\n\n# Made By Mostafa_Khaled", "arr = [int(x) for x in input().split()]\nn = arr[0]\ns = arr[1]\nresp = 0\nleng = len(str(s))\nj = 0\nfor i in range(s, s + leng*9 + 1):\n j = i\n if i > n:\n break\n temp = 0\n c = i\n while c:\n temp += c % 10\n c //= 10\n if i - temp >= s:\n resp += 1\nj += 1\nif j > n:\n print (resp)\nelse:\n print (n - j + 1 + resp)\n\t\t \t\t \t \t\t\t \t\t\t\t\t\t\t \t\t \t\t \t", "n, s = map(int, input().split(' '))\r\n\r\ndef sumDigit(x):\r\n\ts = 0\r\n\twhile x > 0:\r\n\t\ts += x % 10\r\n\t\tx //= 10\r\n\treturn s\r\n\r\ndef lowerBound(l, r):\r\n\twhile l < r:\r\n\t\tmid = (l + r) >> 1\r\n\t\tk = mid - sumDigit(mid)\r\n\t\tif k < s: l = mid+1\r\n\t\telse: r = mid\r\n\treturn l\r\n\r\nfirst = lowerBound(0, n+1) #Search in a bigger range to detect errors, O(log²n)\r\nprint(max(0, n - first + 1))", "def digit_sum(n):\r\n\tcnt = 0\r\n\twhile n:\r\n\t\tcnt += n % 10\r\n\t\tn //= 10\r\n\treturn cnt\r\n\r\n\r\ndef bsearch(low, high, s):\r\n\th = high\r\n\tans = -1\r\n\twhile low <= high:\r\n\t\tmid = (low + high) // 2\r\n\t\tif mid - digit_sum(mid) >= s:\r\n\t\t\tans = mid\r\n\t\t\thigh = mid - 1\r\n\t\telse:\r\n\t\t\tlow = mid + 1\r\n\tif ans == -1:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn h - ans + 1\r\n\r\n\r\nn, s = map(int, input().split())\r\nst = 1\r\nend = 10\r\ncnt = 0\r\ncnt += (bsearch(1, n, s))\r\nprint(cnt)\r\n", "def dsum(n):\n return sum([int(c) for c in str(n)])\n\n\nn, s = map(int, input().split(' '))\nl = 1\nr = n\nwhile l <= r:\n mid = (l + r) // 2\n delta = mid - dsum(mid)\n if delta >= s:\n r = mid - 1\n else:\n l = mid + 1\nprint(n - l + 1)\n", "f = lambda x: x - sum(int(i) for i in str(x)) >= s\r\nn, s = map(int, input().split())\r\nl = 0\r\nr = n + 1\r\nwhile r - l > 1:\r\n m = (l + r) >> 1\r\n if f(m): r = m\r\n else: l = m\r\nprint(n - r + 1)", "def digitsum(n):\r\n init=0\r\n for item in str(n):\r\n init+=int(item)\r\n return init\r\nn,s=map(int,input().split())\r\nif n-digitsum(n)<s:\r\n print(0)\r\nelse:\r\n i=0\r\n j=n\r\n while i<j:\r\n mid=(i+j)//2\r\n if mid-digitsum(mid)<s:\r\n i=mid+1\r\n else:\r\n j=mid\r\n else:\r\n print(n-i+1)", "n, s = input().split()\n\n\n\ndef valid(md):\n sum = 0\n md=str(md)\n for i in md:\n sum += int(i)\n md=int(md)\n if md-sum >= s:\n return True\n else:\n return False\n\n\nn = int(n)\ns = int(s)\n\nl = 0\nr = n+1\n\nwhile r-l>1:\n mid = (l+r)//2\n if valid(mid):\n r=mid\n else:\n l=mid\n\nprint(n-l)\n\t \t \t \t\t \t\t\t\t \t \t \t \t", "def qtd(u):\n ans = 0\n while(u > 0):\n u//=10\n ans += 1\n return ans\n\ndef digitos(u):\n ans = 0\n while(u > 0):\n ans += u%10\n u//=10\n return ans\n\nn, m = input().split()\nm = int(m)\nnumber = int(n)\nans = 0\nsize_n = qtd(m)\ni = m\n\nwhile(i < m+(size_n*9) + 1): \n if(i > number): #n não pode ser maior que m\n break\n if(i - digitos(i) >= m): #verificar digitos\n ans += 1\n i += 1\n\n \nif(i > number):\n print(ans)\nelse:\n print(number-i+1+ans)\n\n \t\t\t\t \t\t\t \t\t\t \t\t \t \t", "def f(x):\r\n return x - sum(map(int, list(str(x))))\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n\r\n l, r = 0, n+1\r\n while l+1 < r:\r\n mid = (l+r)//2\r\n if f(mid) < m:\r\n l = mid\r\n else:\r\n r = mid\r\n print(n-r+1)", "n, s = map(int, input().split())\r\nprint(max(n-min(i for i in range(s, s+200)\r\n if i-sum(map(int, str(i))) >= s)+1, 0))\r\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\ndef sum(a):\r\n s = 0 \r\n while(a > 0):\r\n s += a % 10 \r\n a //= 10\r\n return s\r\n\r\nn, s = map(int, input().split()) \r\nl, r = 1, n \r\nwhile(l <= r):\r\n m = (l + r) // 2 \r\n f = sum(m)\r\n if(m - f >= s):\r\n r = m - 1\r\n else:\r\n l = m + 1 \r\n \r\nprint(n - r) ", "\r\ndef d(n):\r\n ret = 0\r\n n = list(str(n))\r\n for i in range(len(n)):\r\n ret += int(n[i])\r\n return ret\r\n\r\n\r\ndef main():\r\n n, s = map(int, input().split())\r\n\r\n l, h = 0, n\r\n for i in range(2000):\r\n #print(l, h)\r\n m = (l + h) // 2\r\n if m - d(m) >= s:\r\n h = m\r\n else:\r\n l = m\r\n # print(m)\r\n for i in range(-100, 100):\r\n t = m + i\r\n # print(t)\r\n if t < 0 or t > n:\r\n continue\r\n if abs(t - d(t)) >= s:\r\n print(n - t + 1)\r\n exit()\r\n print(0)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def sum_dig(num):\r\n num = str(num)\r\n ans = 0\r\n for i in range(len(num)):\r\n ans += int(num[i])\r\n return ans\r\n\r\nn,s = map(int,input().split())\r\nans = 0\r\nfor i in range(s,n+1):\r\n if i - sum_dig(i) >= s:\r\n ans = n - i + 1\r\n break\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n if ok(m):\r\n c2 = m\r\n else:\r\n c1 = m\r\n ans = check(m)\r\n return ans\r\n\r\ndef ok(m):\r\n s0 = m\r\n for i in list(str(m)):\r\n s0 -= int(i)\r\n return True if s0 > s else False\r\n\r\ndef check(m):\r\n for i in range(max(0, m - 5), m + 6):\r\n if ok(i):\r\n return max(0, n - i + 1)\r\n return 0\r\n\r\nn, s = map(int, input().split())\r\nif not s % 9:\r\n s -= 1\r\nans = binary_search(0, n + 1)\r\nprint(ans)", "n, s = map(int, input().split())\r\ndem = max(0, n - (s + 162) + 1)\r\nfor x in range(s, min(n, s+161) + 1):\r\n if x - sum([int(u) for u in str(x)]) >= s:\r\n dem += 1\r\nprint(dem)\r\n", "def f(x):\r\n return (x if x < 10 else f(x // 10) + x % 10)\r\nn, s = map(int, input().split())\r\nx = s\r\nwhile x - f(x) < s:\r\n x += 1\r\nprint(max(0, n - x + 1))", "def digit(a):\r\n s=0\r\n while a:\r\n s+=a%10\r\n a//=10\r\n return s\r\n\r\ndef big(n,s):\r\n # lst=[[i,i-digit(i)] for i in range(1,n+1)]\r\n lo=1\r\n hi=n\r\n while lo<=hi:\r\n mid=(lo+hi)//2\r\n if mid-digit(mid)<s:\r\n # print(digit(mid))\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\n # hi=mid-1\r\n return n-lo+1\r\n\r\na,b=map(int,input().strip().split())\r\nprint(big(a,b))", "\nn, s = map(int, input().split())\n\ndef R(n):\n ans = 0\n while True:\n ans += n % 10\n n = n // 10\n if n == 0:\n return ans\n\ncurrent = n - R(n)\nif current < s: print(\"0\")\nelse:\n extra = n % 10 + 1\n lo,hi = 0, n\n while lo < hi - 1:\n mid = lo + (hi - lo)//2\n if mid - R(mid) < s:\n lo = mid\n else:\n hi = mid\n print(n - hi + 1)\n", "def main():\n\tn, s = input().split()\n\tn = int(n)\n\ts = int(s)\n\n\tans = n\n\tans -= (s-1)\n\tcount = 0\n\tfor i in range(s, n+1):\n\t\ti_str = list(str(i))\n\t\ttotal = 0\n\t\tfor j in i_str:\n\t\t\ttotal += int(j)\n\n\t\tif(i-total >= s):\n\t\t\tbreak\n\t\tcount += 1\n\tans -= count\n\t\n\tif ans < 0:\n\t\tprint(0)\n\telse:\n\t\tprint(ans)\nmain()\n", "\r\nn,s=map(int,input().split())\r\n\r\ndef ver(i):\r\n\tt=str(i)\r\n\tans=0\r\n\tfor j in t:\r\n\t\tans+=int(j)\r\n\treturn(ans)\r\nl=len(str(s))\r\nif n<s:\r\n\tprint(0)\r\n\texit()\r\nif s+10*(l**2+1)<=n:\r\n\tans=n-s+1-10*(l**2+1)\r\n\tfor i in range(s,s+10*(l**2+1)):\r\n\t\tif s+ver(i)<=i:ans+=1\r\nelse:\r\n\tans=0\r\n\tfor i in range(s,n+1):\r\n\t\tif s+ver(i)<=i:ans+=1\r\nprint(ans)", "\r\n\r\nn,s = map(int,input().split())\r\nl = 0\r\nh = n\r\nans = 0\r\n\r\ndef check(value):\r\n\tstring = str(value)\r\n\tsumm = 0\r\n\tfor ele in string:\r\n\t\tsumm+=int(ele)\r\n\treturn abs(summ-value)>=s\r\nwhile l<=h:\r\n\tmid = l+(h-l)//2\r\n\tif check(mid):\r\n\t\tans = n-mid+1\r\n\t\th = mid-1\r\n\telse:\r\n\t\tl = mid+1\r\nprint(ans)\r\n", "def read_ints():\n return list(map(int, input().split()))\n\n\nn, s = read_ints()\n\n\ndef judge(x):\n return x - sum(map(int, str(x))) >= s\n\n\nresult = len([x for x in range(s, min(n, s + 180) + 1) if judge(x)]) + max(0, n - s - 180)\n\nprint(result)\n", "def works(mid, s):\n return mid - sum(list(map(int, list(str(mid))))) >= s\n\ndef main():\n n, s = map(int, input().strip().split())\n low = 0\n high = n + 1\n while low + 1 < high:\n mid = (low + high) // 2\n if works(mid, s):\n high = mid\n else:\n low = mid\n print(n - low)\n\nmain()\n", "n,m = map(int,input().split())\r\nans = 0\r\nl,r = 0,n\r\nwhile l<=r:\r\n mid = (r+l)//2\r\n if((mid - sum(int(i) for i in str(mid)))>=m):\r\n r = mid-1\r\n else : l = mid+1\r\nr = max(0,r)\r\nprint(n-r)", "from math import ceil\r\nn, s = [int(i) for i in input().split()]\r\n\r\nl = 0\r\nr = 10000000000000000000\r\n\r\nwhile l < r:\r\n cur = (l + r) // 2\r\n sm = sum([int(i) for i in str(cur)])\r\n if cur - sm >= s:\r\n r = cur\r\n else:\r\n l = cur + 1\r\n\r\nprint(max(0, n - l + 1))\r\n", "n,s = map(int,input().split())\r\n \r\nc=0\r\nfor i in range(s,n+1):\r\n x = i - sum(int(t) for t in str(i))\r\n if x>=s:\r\n c = n-i+1\r\n break\r\nprint(c)", "def possible(mid,s):\r\n st,tot=str(mid),0\r\n for i in st:\r\n tot+=int(i)\r\n return abs(tot-mid)>=s\r\n \r\nn,s=list(map(int,input().split()))\r\nl,r,ans=1,n,n+1\r\nwhile l<=r:\r\n mid=(l+r)//2\r\n # print(l,r,mid,possible(mid,s))\r\n if possible(mid,s):\r\n ans=mid\r\n r=mid-1\r\n else:\r\n l=mid+1\r\nprint(n-ans+1)", "n, s = map(int, input().split())\r\nl = 1\r\nr = n + 1\r\nwhile r > l + 1:\r\n m = (l + r) // 2\r\n #print(m)\r\n line = str(m)\r\n if m - sum(int(k) for k in line) >= s:\r\n r = m\r\n else:\r\n l = m\r\nline = str(l)\r\nif l - sum(int(k) for k in line) >= s:\r\n r = l\r\nprint(max(n - r + 1, 0))", "def func(mid,s):\r\n p=0\r\n q=mid\r\n while (mid>0):\r\n p+=mid%10\r\n mid=mid//10\r\n\r\n if (q-p)>=s:\r\n return True\r\n else:\r\n return False\r\nn,s=map(int,input().split())\r\ndo=1\r\nup=10**18\r\nan=n+1\r\nwhile (up>=do):\r\n mid=(up+do)//2\r\n if func(mid,s):\r\n up=mid-1\r\n an=mid\r\n else:\r\n do=mid+1\r\nif an>n:\r\n print(0)\r\nelse:\r\n print(n-an+1)", "n, s = list(map(int, input().split()))\n\ndef sum_of_digits(n):\n\tans = 0\n\tfor c in str(n):\n\t\tans += int(c)\n\treturn ans\nm = s + 10 - s%10\n\nwhile m - sum_of_digits(m) < s:\n\tm += 10\nif m <= n:\n\tprint(n - m + 1)\nelse:\n\tprint(0)\n", "\n\nn, s = map(int, input().split())\n\na, b, c = 0, n + 1, 0\n\nwhile a < b:\n c = (a + b) // 2\n if c - sum([int(x) for x in str(c)]) < s:\n a = c + 1\n else:\n b = c\n\nprint(n - b + 1)\n", "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,k=map(int,input().split())\r\nx,y=1,n\r\nf=0\r\nwhile(x<=y):\r\n m=(x+y)//2\r\n s=0\r\n p=m\r\n while(p>0):\r\n s+=p%10\r\n p=p//10\r\n m1=m-1\r\n s1=0\r\n p=m1\r\n while(p>0):\r\n s1+=p%10\r\n p=p//10\r\n if m==0 or (m-s>=k and m1-s1<k):\r\n f=1\r\n break\r\n elif m-s<k:\r\n x=m+1\r\n else:\r\n y=m-1\r\nif f:\r\n print(n-m+1)\r\nelse:\r\n print(0)\r\n ", "def count_really_big_numbers(n, s):\r\n low, high = 1, n\r\n count = 0\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if mid - sum(map(int, str(mid))) >= s:\r\n count = n - mid + 1\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return count\r\n\r\nn, s = map(int, input().split())\r\nresult = count_really_big_numbers(n, s)\r\nprint(result)", "def getSum(n):\r\n ans=0;\r\n while(n>0):\r\n ans=ans+n%10;\r\n n=n//10;\r\n return ans;\r\nn,s=(int(x) for x in input().split(\" \"));\r\nl,h=1,n;\r\nwhile(l<h):\r\n mid=l+((h-l)>>1);\r\n sum=(int)(getSum(mid));\r\n if(mid-sum>=s): h=mid;\r\n else:l=mid+1;\r\n\r\nsum=(int)(getSum(l));\r\nif(l-sum>=s): print(n-l+1);\r\nelse: print(0);\r\n", "inp=input().split()\nn=int(inp[0])\ns=int(inp[1])\nstart=s+1\nthresh=s+500\nans=0\nif(n>thresh):\n\tans+=n-thresh\nelse:\n\tthresh=n\nval=0\nfor i in range(start,thresh+1):\n\tval=i\n\twhile(i>0):\n\t\tval-=i%10\n\t\ti=i//10\n\tif(val>=s):\n\t\tans+=1\nprint(ans)", "n,s = [int(x) for x in input().split()]\r\n\r\nlbound = 1\r\nubound = n + 1\r\nnum = (ubound + lbound)//2\r\ndef getSum(n):\r\n sum = 0\r\n for digit in str(n):\r\n sum += int(digit)\r\n return sum\r\nwhile num != lbound or num!= ubound:\r\n if num - getSum(num) >= s:\r\n ubound = num\r\n if num-1 - getSum(num-1) < s:\r\n break\r\n else:\r\n lbound = num\r\n if num == n:\r\n print(0)\r\n exit()\r\n num = (ubound + lbound)//2\r\nprint(n - num + 1)", "def sd(n):\n acc = 0\n while n:\n acc += n % 10\n n //= 10\n return acc\n\ndef rb(n, s):\n return n - sd(n) >= s\n\nn, s = map(int, input().split(' '))\n\nleft = 1\nright = n+1\n\nwhile left != right:\n mid = (left + right) // 2\n if rb(mid, s):\n right = mid\n else:\n left = mid + 1\n\nprint(n - left + 1)\n", "n,s=map(int,input().split())\r\ndef cal(x):\r\n global s\r\n ls=list(map(int,str(x)))\r\n if (int(x)-sum(ls))>=s:\r\n return True\r\n return False\r\nl=1\r\nr=10**18\r\nwhile l<=r:\r\n mid=(l+r)//2\r\n if cal(mid):\r\n r=mid-1\r\n else:\r\n l=mid+1\r\nif l>n:\r\n print(0)\r\nelse:\r\n print(n-l+1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, s = map(int, input().split())\r\nif s > n:\r\n print(0)\r\nelse:\r\n c = 0\r\n for i in range(s, min(s+200, n)+1):\r\n a = sum(int(j) for j in str(i))\r\n if i-s >= a:\r\n c += 1\r\n print(n-min(s+200, n)+c)\r\n", "def check(x, s):\r\n k = 0\r\n for i in str(x):\r\n k += int(i)\r\n return x - k >= s\r\n\r\n\r\nn, s = map(int, input().split())\r\nl = 0\r\nr = n\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n if check(m, s):\r\n r = m\r\n else:\r\n l = m\r\nif check(r, s):\r\n print(n - r + 1)\r\nelse:\r\n print(0)", "def f(x):\n\tans = x\n\twhile x > 0:\n\t\tans -= x % 10\n\t\tx //= 10\n\treturn ans\nn, s = map(int, input().split())\nif f(n) < s:\n\tprint(0)\n\texit(0)\nl, r = 1, n\nwhile l < r:\n\tm = (l + r) // 2\n\tif f(m) >= s:\n\t\tr = (m // 10) * 10\n\telse:\n\t\tl = m + 1\nprint(n - l + 1)\n", "#!/usr/bin/env python3\n\n[n, s] = map(int, input().strip().split())\n\ndef sumdigit(x):\n\treturn sum(map(int, str(x)))\n\ndef fsum(x):\n\treturn x - sumdigit(x)\n\n# first x in (xmin, xmax] that fsum(x) >= s\ndef binsearch(s, xmin, xmax):\n\twhile xmax - xmin > 1:\n\t\txmid = (xmax + xmin) // 2\n\t\tif fsum(xmid) >= s:\n\t\t\txmax = xmid\n\t\telse:\n\t\t\txmin = xmid\n\treturn xmax\n\nxmin = 0\nxmax = 1\nwhile fsum(xmax) < s:\n\txmin = xmax\n\txmax *= 2\nx = binsearch(s, xmin, xmax)\nprint (max(n - x + 1, 0))\n", "n, s = map(int, input().split())\nmult_10 = s if not (s%10) else s+10-(s%10)\nfor i in range(mult_10, mult_10+100000, 10):\n\tif i - sum([int(c) for c in str(i)]) >= s:\n\t\tlow = i\n\t\tbreak\nprint(max(n-low+1, 0))\n\t\t \t\t \t \t \t \t \t\t\t \t\t\t\t", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef check(val,s):\r\n w = str(val)\r\n som = 0\r\n for i in w:\r\n som += int(i)\r\n \r\n if val-som < s:\r\n return 0\r\n \r\n return 1\r\n\r\nn,s = map(int,input().split())\r\nlow = 0\r\nhigh = (n//10)*10\r\nans = n\r\ncnt = 0\r\nflag = 0\r\nwhile cnt <= 200:\r\n mid = low+((high-low)//2)\r\n mid = (mid//10)*10\r\n if check(mid,s):\r\n ans = mid\r\n flag = 1\r\n high = mid-10\r\n \r\n else:\r\n low = mid+10\r\n \r\n cnt += 1\r\n\r\nif not flag:\r\n print(0)\r\n exit()\r\n \r\nprint(n-ans+1)", "def case(mid):\r\n res=0\r\n for k,x in enumerate(str(mid)):\r\n res+=int(x)\r\n return res\r\nn,s=map(int,input().split())\r\ni,j=0,n\r\nwhile i+1<j:\r\n mid=(i+j)//2\r\n result=case(mid)\r\n if mid-case(mid)<s:i=mid\r\n else:j=mid\r\nif i-case(i)>=s:print(n-i+1)\r\nelse:\r\n if j==n:\r\n if j-case(j)>=s:print(1)\r\n else:print(0)\r\n else:print(n-j+1)", "def readints():\n return [int(item) for item in input().strip().split()]\n\n\ndef f(n):\n return n - sum(map(int, str(n)))\n\n\nclass Solver:\n def main(self):\n n, s = readints()\n if f(n) < s:\n print('0')\n return\n\n l, r = 1, n\n while l <= r:\n mid = (l + r) // 2\n\n if f(mid) < s:\n l = mid + 1\n\n if f(mid) >= s:\n r = mid - 1\n\n print(n - r)\n\n\nSolver().main()\n", "def bigNumber(n, s):\n for i in range(s, n + 1):\n sumVal = 0\n num = i\n while num:\n sumVal += num % 10\n num //= 10\n if i - sumVal >= s:\n print(n - i + 1)\n return\n print(0)\n\nn, s = (int(x) for x in input().split())\nbigNumber(n,s)\n \t \t\t \t\t \t\t\t\t\t\t \t\t", "n, k = [int(x) for x in input().strip().split(\" \")]\r\ns, e = 1, n + 1\r\nwhile(s < e):\r\n mid = (s + e) // 2\r\n if mid - sum([int(x) for x in str(mid)]) < k:\r\n s = mid + 1\r\n else:\r\n e = mid\r\nprint(n - s + 1)\r\n", "(n, s) = [int(x) for x in input().split()]\n\ndef is_really_big(n):\n digit_sum = sum([int(x) for x in str(n)])\n return n - digit_sum >= s\n\nimport sys\n\nif is_really_big(n) == False:\n print(0)\n sys.exit()\n\nlower_bound = 1\nupper_bound = n\na = 0\n\nimport pdb\n\nwhile(upper_bound - lower_bound > 1):\n a = (lower_bound + upper_bound) // 2\n if is_really_big(a):\n upper_bound = a\n else:\n lower_bound = a\n\nprint(n - lower_bound)\n", "n, s = map(int, input().rstrip().split())\nif n <= s:\n print(0)\n exit()\nfor i in range(s, n + 2):\n l = 0\n for j in str(i):\n l += int(j)\n if i - l >= s:\n break\nprint(max(n - i + 1, 0))" ]

[ "import math\r\nn,m = input().split(' ')\r\nn,m = int(n),int(m)\r\nfix = [[1],[3,4],[1,2,2],[1,1,3,5],[1,1,1,2,3]]\r\n\r\na = n\r\nparts = list()\r\nb = a\r\nwhile b > 0:\r\n parts.append(math.floor(b**0.5))\r\n b-=math.floor(b**0.5)**2\r\nlcm = math.lcm(*parts)\r\na_out = list()\r\nfor i in range(len(parts)):\r\n part = parts[i]\r\n for j in range(part**2):\r\n a_out.append(int(lcm*fix[len(parts)-1][i]/part))\r\n\r\na = m\r\nparts = list()\r\nb = a\r\nwhile b > 0:\r\n parts.append(math.floor(b**0.5))\r\n b-=math.floor(b**0.5)**2\r\nlcm = math.lcm(*parts)\r\nb_out = list()\r\nfor i in range(len(parts)):\r\n part = parts[i]\r\n for j in range(part**2):\r\n b_out.append(int(lcm*fix[len(parts)-1][i]/part))\r\nfor i in range(n):\r\n tp = ''\r\n for j in range(m):\r\n tp += str(a_out[i]*b_out[j]) +' '\r\n print(tp.strip())\r\n\r\n", "a, b = map(int, input().split())\r\nn = []\r\nm = []\r\nif a == 1:\r\n n = [1]\r\nelif a == 2:\r\n n = [3, 4]\r\nelif a % 2 == 0:\r\n n = [a // 2 - 1] + [1] * (a - 1)\r\nelse:\r\n n = [a // 2 + 1, 2] + [1] * (a - 2)\r\nif b == 1:\r\n m = [1]\r\nelif b == 2:\r\n m = [3, 4]\r\nelif b % 2 == 0:\r\n m = [b // 2 - 1] + [1] * (b - 1)\r\nelse:\r\n m = [b // 2 + 1, 2] + [1] * (b - 2)\r\nfor el1 in n:\r\n for el2 in m:\r\n print(el1 * el2, end=\" \")\r\n print()# 1698210845.3963275", "\"\"\"\r\nCodeforces Round 241 Div 1 Problem E\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\nclass InputHandlerObject(object):\r\n inputs = []\r\n\r\n def getInput(self, n = 0):\r\n res = \"\"\r\n inputs = self.inputs\r\n if not inputs: inputs.extend(input().split(\" \"))\r\n if n == 0:\r\n res = inputs[:]\r\n inputs[:] = []\r\n while n > len(inputs):\r\n inputs.extend(input().split(\" \"))\r\n if n > 0:\r\n res = inputs[:n]\r\n inputs[:n] = []\r\n return res\r\nInputHandler = InputHandlerObject()\r\ng = InputHandler.getInput\r\n\r\n############################## SOLUTION ##############################\r\nn,m = [int(x) for x in g()]\r\n\r\ndef sqr(n):\r\n if n == 1:\r\n return [1]\r\n if n == 2:\r\n return [4,3]\r\n if n % 2:\r\n return [(n+1)//2, 2] + [1] * (n-2)\r\n return [(n-2)//2] + [1] * (n-1)\r\n\r\na = sqr(n)\r\nb = sqr(m)\r\nfor i in range(n):\r\n res = [str(a[i]*x) for x in b]\r\n print(\" \".join(res))" ]

[ "n = int(input())\r\nnum = map(int, input().rstrip().split())\r\nif 1 in num:\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)", "n, a = int(input()), (int(i) for i in input().split())\nres = -1 if 1 in a else 1\nprint(res)\n", "'''input\n5\n1 2 3 4 5\n'''\nn = int(input())\nl = list(map(int, input().split()))\nprint(-1 if 1 in l else 1)", "b=int(input())\r\na=list(input().split())\r\nif \"1\" in a:\r\n print(-1)\r\n exit()\r\nprint(1)", "input()\r\nti = [ int(x) for x in input().split()]\r\nif 1 in ti:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\nx=input().split()\r\nx=[int(i) for i in x]\r\nif 1 in x:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nif 1 not in l1:\r\n print(1)\r\nelse:\r\n print(-1)", "n=input()\r\na=sorted(map(int,input().split()))\r\nprint(-1 if a[0]==1 else 1)", "input()\r\nprint(1-2*('1' in input().split()))", "class solu:\r\n def __init__(self):\r\n self.n = int(input())\r\n self.st = map(int, input().split())\r\n self.res = 0\r\n\r\n def main(self):\r\n if 1 in self.st:\r\n return -1\r\n else:\r\n return 1\r\n\r\nif __name__ == \"__main__\":\r\n c = solu()\r\n print(c.main())", "input()\r\n*a,=map(int,input().split())\r\nif 1 in a:print(-1)\r\nelse:print(1)", "n= int(input())\na = input()\nA = []\nx =0 \nfor i in a.split():\n A.append(int(i))\n if int(i) == 1:\n print(-1)\n x = 1\n break\nif x != 1:\n print(1) \n \n\n \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 = list(map(int, input().split()))\r\nans = 1 if min(a) ^ 1 else -1\r\nprint(ans)", "t = input()\r\nn = list(map(int, input().split()))\r\nif 1 in n:\r\n print(-1)\r\nelse:\r\n print(1)", "#!/usr/bin/python3\nn=int(input())\na=map(int,input().split())\nif 1 in a:\n print (-1)\nelse:\n print (1)\n", "n = int(input())\nnums = input().split(' ')\n\nif '1' in nums:\n print(\"-1\")\nelse:\n print(\"1\")\n\t\t \t\t\t\t\t \t \t\t\t \t \t \t\t\t\t\t\t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif a.count(1) > 0:\r\n print(-1)\r\nelse:\r\n print(1)", "x=int(input())\r\ny=[int(a) for a in input().split()]\r\nif 1 in y:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "a = int(input())\r\nb = [int(x) for x in input().split()]\r\nflag = 0 \r\nfor i in b :\r\n if(i==1):\r\n flag = 1 \r\n break \r\nif flag :\r\n print(\"-1\")\r\nelse :\r\n print(\"1\")", "qtd = input()\nnotas = input().split()\n\nif '1' in notas:\n print(\"-1\")\nelse:\n print(\"1\")\n\t\t\t \t\t \t \t \t \t \t \t\t\t \t\t \t\t", "n = int(input())\r\nar = [int(i) for i in input().split()]\r\nif min(ar) == 1:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ninput()\r\nw = sorted(input().split())\r\nif w[0] == '1':\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nl = input().split(' ')\r\nprint(-1 if '1' in l else 1)", "input()\r\nnotes = sorted([int(x) for x in input().split()])\r\n\r\nsums = set(notes)\r\nbad = False\r\n\r\nif 1 in notes:\r\n print(-1)\r\nelse:\r\n print(1)\r\n\r\n\r\n \r\n \r\n", "\nn = int(input())\nchecker = False\na = list(map(int, input().split()))\n\nfor i in range(len(a)):\n if a[i] == 1:\n checker = True\n break\n\nif checker:\n print(-1)\nelse:\n print(1)\n \t \t\t\t\t \t \t\t\t \t\t\t\t \t \t\t \t \t", "_ = input()\nbns = set(map(int, input().split()))\nprint(-1 if 1 in bns else 1)\n\n", "n=input()\r\nif \"1\" in input().split():\r\n print(\"-1\")\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nif a[0]==1:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nprint(-1 if '1' in input().split(' ') else 1)", "n = int(input()) \nvalues = list(map(int,input().split(\" \")))\nvalues.sort()\nif(values[0] == 1):\n print('-1')\nelse:\n print('1')\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())\ns = input().split()\nif s.count('1') > 0:\n print(-1)\nelse:\n print(1)\n \t\t \t\t \t \t\t\t \t\t \t \t", "n = int(input())\nnota = list(map(int,input().split(\" \")))\nnota.sort(reverse = False)\nfor x in nota:\n if x == 1:\n print(-1)\n break\n else:\n print(1)\n break\n break\n\t \t\t\t\t \t \t \t\t \t \t\t \t \t", "a = input(), print(\"-1\" if '1' in input().split() else 1)", "size = int(input())\r\narr = input().split()\r\narr = [int(x) for x in arr]\r\n\r\ni = 0\r\nwhile(i < size):\r\n if(arr[i] == 1):\r\n print(-1)\r\n break\r\n \r\n i+= 1\r\n if(i == size):\r\n print(1)", "n = int(input())\r\na = input().strip().split()\r\nfor index,item in enumerate(a):\r\n a[index] = int(item)\r\nif min(a) != 1:\r\n print(1)\r\nelse:\r\n print(-1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nif arr[0] == 1:\r\n print(-1)\r\nelse:\r\n if arr[0] > 1:\r\n print(1)", "\n\n\nn = input()\na = input()\narr = a.split(' ')\n# print(arr)\nflag = 1\nfor i in range(0, len(arr)):\n \n if arr[i] == '1':\n flag = -1\n\nprint(flag)\n\n", "n=input()\nprint([1,-1]['1' in input().split()])\n\n\n\"\"\"\n pppppppppppppppppppp\n ppppp ppppppppppppppppppp\n ppppppp ppppppppppppppppppppp\n pppppppp pppppppppppppppppppppp\n pppppppppppppppppppppppppppppppp\n pppppppppppppppppppppppp\n ppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppp\n pppppppppppppppppppppppppppppppppppppppppppppppp ppppppppppppppppppppp\n ppppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppp\n ppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppp\n pppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppppp\n ppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppppppp\n pppppppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppp\n pppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppp\n ppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppppp\n pppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppppppp\n ppppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppppppp\n pppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppppp\n ppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppp\n pppppppppppppppppppppppp\n pppppppppppppppppppppppppppppppp\n pppppppppppppppppppppp pppppppp\n ppppppppppppppppppppp ppppppp\n ppppppppppppppppppp ppppp\n pppppppppppppppppppp\n \n\"\"\" \n\t \t\t\t \t\t \t\t \t\t\t \t \t \t \t", "n = int(input())\nL = list(map(int, input().split()))\nL.sort()\nif L[0] == 1:\n print(-1)\nelse:\n print(1)\n", "n = int(input())\r\ninput = list(map(int, input().split()))\r\n\r\ninput.sort()\r\n\r\nif input[0] > 1:\r\n print(1)\r\nelse:\r\n print(-1)", "def solve():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n if 1 in arr:\r\n print(-1)\r\n return\r\n print(1)\r\nsolve()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nif l[0]==1 :\r\n print(-1)\r\nelse :\r\n print(1)\r\n \r\n", "n= int(input())\narr=[int(i)for i in input().split()]\n\nif 1 in arr:\n print(-1)\nelse:\n print(1) \n\n\t\t \t\t \t\t \t \t\t \t\t \t\t\t \t \t", "#!/usr/bin/env python3\n\nn=int(input())\na=[int(i) for i in input().split()]\nans=1\nfor x in a:\n if x==1:\n ans=-1\nprint(ans)\n", "n = int(input())\na = map(int, input().split())\na = list(a)\na.sort()\nprint(-1 if a[0] == 1 else 1)\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(sorted(map(int, input().split())))\r\nif a[0] is 1:\r\n print(-1)\r\nelse:\r\n print(1)", "n1=int(input())\r\na=input().split()\r\nfor x in range(n1):\r\n a[x]=int(a[x])\r\na=sorted(a)\r\nsoma=0\r\nif(a[0]==1):\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n", "N = int(input())\nA = list(map(int, input().split()))\nmina = min(A)\nif mina == 1:\n print(-1)\nelse:\n print(1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif min(a)==1:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\narr = [int(i)for (i) in input().split()]\n\nflag = False\nfor i in arr:\n if i == 1:\n flag = True\n break\n\nif flag:\n print(-1)\nelse:\n print(1)\n\n\t \t\t\t\t\t \t\t\t\t\t\t \t\t\t \t\t\t\t\t", "import sys\r\nn= int(input())\r\nbanknotes= list(map(int,input().split()))\r\nfor i in banknotes:\r\n if i == 1:\r\n print(-1);\r\n sys.exit(0);\r\nprint(1);", "def solution(values):\n if 1 in values:\n return -1\n return 1\n\nif __name__ == '__main__':\n n = int(input())\n values = [int(i) for i in input().split()]\n print(solution(values))\n\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\nif 1 in a:\r\n print(-1)\r\nelse:\r\n i=1\r\n while i in a:\r\n i+=1\r\n print(i)", "n = int(input())\na = [int(i) for i in input().split()]\nif min(a) == 1:\n print(-1)\nelse:\n print(1)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nf1=0\r\nf2=0\r\nif 1 in a:\r\n print(-1)\r\nelse:\r\n print(1)\r\n# for i in a:\r\n# if i%2==1:\r\n# f1=1\r\n# else:\r\n# f2=1\r\n# if f1==1 and f2==1:\r\n# break\r\n#if f1==1 and f2==1:\r\n \r\n \r\n", "n=int(input())\narr=[int(i) for i in input().split()]\narr.sort()\nif arr[0]==1:\n print(-1)\nelse :\n print(1)\n\n\t\t\t\t \t \t \t\t\t\t \t \t\t \t \t\t", "R = lambda : map(int, input().split())\r\n\r\nn = int(input())\r\nx = R()\r\nprint(-1 if 1 in x else 1)\r\n", "n=int(input())\r\nl=input().split(\" \")\r\nif \"1\" in l: print(\"-1\")\r\nelse: print(\"1\")", "import math\n\nn = int(input())\n\nnotes = input().split()\n\nnotes_set = set()\n\nfor i in notes:\n notes_set.add(int(i))\n\nif 1 in notes_set:\n print(\"-1\")\nelse:\n print(\"1\")\n\t\t\t \t \t \t\t\t \t\t\t \t \t \t \t \t \t\t\t", "input()\r\nprint(-1 if 1 in list(map(int,input().split())) else 1)\r\n\r\n# UB_CodeForces\r\n# Advice: The best view comes after the hardest climb\r\n# Location: At home behind my desk\r\n# Caption: Should prepared for final exams but I am submitting codes\r\n# CodeNumber: 476\r\n", "n = int(input())\r\nnotes = list(map(int, input().split(' ')))\r\n\r\nprint(-1) if 1 in notes else print(1)\r\n", "I =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\na=LI()\r\nif 1 in a:\r\n print(-1)\r\nelse:\r\n print(1)", "import sys\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nl = sorted(l)\r\n\r\nmin = l[0]\r\nif(min == 1):\r\n print(-1)\r\n sys.exit()\r\nelse:\r\n print(1)", "import time,sys,io,math\r\ninp=sys.stdin.readline\r\npr=sys.stdout.write\r\n\r\ndef solve():\r\n n=int(inp())\r\n a=[int(i) for i in inp().split()]\r\n if 1 in a:\r\n pr(\"-1\\n\")\r\n else:\r\n pr(\"1\\n\")\r\n\r\nstart=time.time()\r\nt=1\r\n#t=int(inp())\r\nfor _ in range(t):\r\n solve()\r\n#pr(f\"Time lapsed: {time.time()-start}\")", "n = int(input())\nlst=list(map(int,input().split()))\nx=lst.count(1)\nif x==0 :\n print(\"1\")\nelse:\n print(\"-1\")\n \t \t \t\t \t \t\t\t \t \t \t \t\t\t \t", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nflag=0\r\nfor x in arr:\r\n if x==1:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(-1)\r\nelse:\r\n print(1)", "a=input()\r\nb=sorted(list(map(int,input().split())))\r\nprint(-1 if b[0]==1 else 1)", "n = int(input())\r\n#k, m = map(int, input().split()) \r\n#s = input()\r\nc = list(map(int, input().split()))\r\nif 1 in c:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nf1 = 0\r\nyo = input().split()\r\nfor i in range(0,n) :\r\n\tx = int(yo[i])\r\n\tif x == 1 :\r\n\t\tf1 = 1\r\n\r\nf=0\r\nif f1 == 0 :\r\n\tprint(1)\r\n\tf=1\r\nif f == 0 :\r\n\tprint(-1)\r\n", "input()\r\nprint(-1 if '1'in input().split()else 1)", "s = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\na = min(a)\r\nif a == 1:\r\n print(-1)\r\nelse:\r\n print(1)", "input()\r\na = list(map(int, input().split()))\r\nprint(-1 if min(a) == 1 else 1)", "input().split()\r\nprint(\"-1\" if \"1\" in input().split() else \"1\")", "N = input()\r\nnumber_list = input().strip().split(\" \")\r\nprint(-1) if \"1\" in number_list else print(1)", "n = int(input())\nl = list(map(int, input().split()))\n\nok = [False for _ in range(5000)]\nok[0] = True\n\nfor i in range(1, 5000):\n\tfor j in l:\n\t\tif i - j >= 0 and ok[i - j]:\n\t\t\tok[i] = True\n\t\t\tbreak\n\telse:\n\t\tprint(i)\n\t\tbreak\nelse:\n\tprint(-1)\n", "n = input()\nn = int(n)\na = [int(i) for i in input().split()]\nif 1 in a:\n print(-1)\nelse:\n print(1)\n\t\t \t\t\t \t \t \t\t \t \t\t \t \t\t", "n=int(input());s=input().split()\nif '1'in s:\n print(-1)\nelse:\n print(1)", "input()\r\nprint(-1 if '1' in input().split() else 1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nif 1 in a:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nif 1 in l: print(-1)\r\nelse: print(1)", "n= int(input())\r\nx=set(list(map(int, input().split())))\r\nif 1 in x: print(-1)\r\nelse: print(1)\r\n", "from math import ceil\r\ndef 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 listring(l): return ' '.join([str(x) for x in l])\r\ndef printlist(l): print(' '.join([str(x) for x in l]))\r\n\r\nclass Stack(object):\r\n def __init__(self):\r\n self.items = []\r\n def push(self,new):\r\n self.items.append(new)\r\n def pop(self):\r\n return self.items.pop()\r\n def empty(self):\r\n return self.items == []\r\n \r\nn = it()\r\na = lt()\r\n\r\nif 1 in a:\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\nnotes=[int(x) for x in input().split()]\nnotes.sort()\ni=1\nj=len(notes)-1\nflag=1\nwhile i<notes[len(notes)-1] and j>=0:\n mod=i%notes[j]\n if 0<mod<notes[0]:\n flag=0\n print(i)\n break\n i+=1\n j-=1\nif flag==1:\n print(-1)\n \n", "n = input()\r\nnotes = input().split()\r\nnotes.sort()\r\nif int(notes[0]) > 1:\r\n print(1)\r\nelse:\r\n print(-1)", "\nn = int(input())\na = list(map(int,input().split()))\nbln = True\n\nfor i in range(len(a)):\n if a[i] == 1:\n print(-1)\n bln = False\n\nif bln:\n print(1)\n\t \t \t \t \t \t \t \t \t \t \t\t", "n=int(input())\r\nl=list(map(int,input().split()));print(1 if 1 not in l else -1)\r\n", "input()\r\nL = list(map(int, input().split()))\r\nif 1 in L:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n# FUCK YOU BEEESHOY\n#\n##\n#\n##\n#\n##\n#\n#\nn=input()\nlst=[int(i) for i in input().split()]\nif 1 in lst:\n print(-1)\nelse:\n print(1)\n\n\t \t\t \t\t \t \t\t\t \t\t\t \t \t\t\t\t\t", "import sys\n\nif 'PyPy' in sys.version:\n from _continuation import continulet\nelse:\n import threading\n\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef in_list():\n return(list(map(int,input().split())))\ndef in_str():\n s = input()\n return(list(s[:len(s) - 1]))\ndef in_ints():\n return(map(int,input().split()))\n\n############ ------------------------- ############\n\nMAXN = 1e3 + 10\n\ndef main():\n n = inp()\n a = in_list()\n x = min(a)\n if (x == 1):\n print(-1)\n else:\n print(1)\n\n\n\nif __name__ == '__main__':\n if 'PyPy' in sys.version:\n\n def bootstrap(cont):\n call, arg = cont.switch()\n while True:\n call, arg = cont.switch(to=continulet(lambda _, f, args: f(*args), call, arg))\n\n cont = continulet(bootstrap)\n cont.switch()\n\n main()\n\n else:\n sys.setrecursionlimit(1 << 30)\n threading.stack_size(1 << 27)\n\n main_thread = threading.Thread(target=main)\n main_thread.start()\n main_thread.join()\n\n", "n=int(input())\nl=list(map(int,input().split(\" \")))\nif l.count(1)>0:\n\tprint(\"-1\")\nelse:\n\tprint(\"1\")", "\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nbln = True\r\n\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n print(-1)\r\n bln = False\r\n\r\nif bln:\r\n print(1)", "# Nome: Matheus de Souza Oliveira RA: 203407\n\nnumberN = input()\nbankNotesValues = input().split(\" \")\n\nif \"1\" in bankNotesValues:\n print(-1)\nelse:\n print(1)\n\t\t\t\t\t \t \t \t \t \t \t", "n=int(input())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\nif(A[0]==1):\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "a = input()\r\nb = input() .split() \r\nif \"1\" in b :\r\n print (\"-1\")\r\nelse :\r\n print (\"1\")", "no=int(input())\nnotes=input()\nnotes=notes.split(' ')\nnotes=[int(x) for x in notes]\nnotes.sort()\nif(notes[0]==1):\n print(-1)\nelse: \n print(1)\n\n\t \t \t \t \t \t \t \t \t \t\t\t", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-30 23:35:59\nLastEditTime: 2021-11-30 23:38:02\nDescription: Currency System in Geraldion\nFilePath: CF560A.py\n'''\n\n\ndef func():\n n = int(input())\n banknotes = input().strip().split()\n if \"1\" in banknotes:\n print(-1)\n else:\n print(1)\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\nnota = list(map(int,input().split(\" \")))\nnota.sort(reverse = False)\nr = False\nfor x in nota:\n if x == 1:\n r = True\n break\n\nif r is False:\n\tprint(1)\nelif r is not False:\n\tprint(-1)\n", "t = int(input())\r\na = [int(_) for _ in input().split()]\r\nif 1 in a:\r\n print(-1)\r\n exit()\r\nprint(1)\r\n", "a = int(input())\nlinha = input()\nlinhaLista = linha.split()\naux = 0\nfor i in range (a):\n if linhaLista[i] == \"1\":\n aux = 1\nif(aux == 1):\n print(\"-1\")\nelse:\n print(\"1\")\n\t \t\t\t\t \t \t \t \t \t \t \t\t", "def main():\n input()\n aa = sorted(map(int, input().split()))\n print(1 if aa[0] > 1 else -1)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nbanknotes = set(map(int, input().split()))\n\nif 1 in banknotes:\n print(-1)\nelse:\n print(1)\n", "n = int(input())\n\nif '1' in input().split():\n\tprint('-1')\nelse:\n\tprint('1')\n \t \t\t\t \t\t\t \t \t\t\t \t \t\t", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n input()\r\n print(-1 if any(map(lambda x: x == 1, map(int, input().split()))) else 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "if __name__ == \"__main__\":\n n = input()\n numbers = input().split(\" \")\n aux = \"1\"\n for number in numbers:\n if number == \"1\":\n aux = \"-1\"\n print(aux)\n \n\n \t\t\t \t \t\t \t\t\t \t \t\t \t", "n=int(input())\na=[int(i) for i in input().split()]\nif 1 in a:\n print(-1)\nelse:\n print(1)\n \t \t\t\t\t \t\t\t \t\t \t \t\t\t\t \t", "n1=int(input())\na=input().split()\nfor x in range(n1):\n a[x]=int(a[x])\na=sorted(a)\nsoma=0\nif(a[0]==1):\n print(\"-1\")\nelse:\n print(\"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\nlst = list(map(int , input().split()))\r\nlst.sort()\r\na = lst[0]\r\nif a == 1:\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\nlst=list(map(int,input().split(\" \")))\r\n\r\nif 1 not in lst:\r\n print(1)\r\nelse:\r\n print(-1)", "n = int(input())\narr = [int(x) for x in input().split()]\nif(1 in arr):\n\tprint(-1)\nelse:\n\tprint(1)", "n = int(input().strip())\narr = list(map(int, input().strip().split()))\nprint(-1 if 1 in arr else 1)", "notes = int(input())\r\nmoney = list(map(int,input().split()))\r\nmoney.sort()\r\nif money[0] == 1:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nm = sorted(list(map(int, input().split())))\r\nif m[0] == 1:\r\n print(-1)\r\nelse:\r\n print(1)\r\n\r\n\r\n\r\n", "input()\r\nvalues = map(int, input().split())\r\nprint(-1 if 1 in values else 1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif 1 not in a:\r\n print(\"1\")\r\nelse:\r\n print(\"-1\")\r\n", "def check(a):\r\n if \"1\" in a:\r\n return -1\r\n else:\r\n return 1\r\n \r\n \r\n\r\n\r\nn = int(input())\r\na = input().split()\r\nprint(check(a))\r\n", "def isEven(n):\n if n%2 == 0:\n return True\n else:\n return False\n\ndef isOdd(n):\n if n%2 != 0:\n return True\n else:\n return False\n \nnumvalues = int(input())\nbanknotes = input().split(' ')\nhasEven = False\nhasOdd = False\nfor i in banknotes:\n if (i == '1'):\n print('-1')\n exit()\n\n\n\nprint('1')\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\n\r\nb = min(a)\r\n\r\nif b == 1: print(-1)\r\nelse: print(1) \r\n", "n = int(input())\r\nnotes = list(map(int, input().split()))\r\n\r\nflag = False\r\n\r\nfor i in range(n):\r\n if(notes[i] == 1):\r\n flag = True\r\n \r\n\r\nif(flag):\r\n print('-1')\r\nelse:\r\n print('1')", "def currency(n,a):\r\n if 1 in a:\r\n print(-1)\r\n else:\r\n print(1)\r\n\r\n\r\nn=int(input(''))\r\na=list(map(int,input('').split()))\r\ncurrency(n,a)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nif any([num == 1 for num in nums]):\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)", "n = int(input())\r\nb = False\r\nk = input().split(' ')\r\nfor i in range(n):\r\n if(k[i] == '1'):\r\n b = True\r\nif(b):\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif a[0]==1:\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(n):\r\n if(arr[i]==1):\r\n flag=1\r\nif(flag==1):\r\n print(-1)\r\nelse:\r\n print(1)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nif m==1:\r\n print(-1)\r\nelse:\r\n print(1)", "tam = int(input())\nlista = list(map(int,input().split()))\nif(1 not in lista):\n print(1)\nelse:\n print(-1)", "input(); l=sorted(map(int,input().split())); print([1,-1][l[0]==1])", "n=int(input())\nk = list(input().split(' '))\nkk=0\nfor i in k:\n if int(i)==1:\n kk=1\n\nif kk==1:\n print(-1)\nelse:\n print(1)\n\t\t\t\t\t \t \t \t\t \t \t \t\t", "n,a=input(),input().split()\nprint(-1 if \"1\" in a else 1)\n", "input()\r\nprint(('1' in input().split())*-2+1)", "\nn = int(input())\nnominals = [int(i) for i in input().split()]\nnominals.sort()\nif nominals[0] == 1:\n\tprint(-1)\nelse:\n\tprint(1)\n", "n = int(input())\r\nvalues = list(map(int, input().split()))\r\nvalues = sorted(values)\r\n\r\n\r\nvalues_dict = {}\r\nfor a in values:\r\n values_dict[a] = 1\r\n\r\nif values_dict.get(1) is not None:\r\n print(-1)\r\n\r\nelse: print(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())\nnotes = input().split(' ')\n\navailable_nums = set()\n\nfor i in range (n):\n available_nums.add(notes[i])\n\nif '1' in notes:\n print(-1)\nelse:\n print(1)", "n=int(input())\r\nprint(-1 if min(list(map(int,input().split())))==1 else 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nl.sort()\r\n\r\nif(1 in l):\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\nbill=list(map(int, input().split()))\r\nif(bill.count(1)>0):\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n = int(input())\r\n\r\nm = set(input().split())\r\n\r\nif '1' in m:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n = int(input())\r\nline = input().split(sep=\" \")\r\nnums = []\r\nfoundOne = False\r\nfor i in range(len(line)):\r\n if(int(line[i]) == 1):\r\n foundOne=True\r\n break\r\nif(foundOne):\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "n = int(input())\r\nmoney = list(map(int,input().split()))\r\nif 1 in money: print(-1)\r\nelse: print(1)", "input()\r\nX = list(map(int, input().split()))\r\nif 1 in X:\r\n print(-1)\r\nelse:\r\n print(1)", "N=int(input())\r\narr=[int(i) for i in input().split(\" \")][:N]\r\n \r\narr.sort()\r\nif arr[0]==1:\r\n print(-1)\r\nelse:\r\n print(1)", "a = input(); print(-1 if ('1' in input().split()) else 1)", "n = input()\r\na = list(map(int, input().split()))\r\nprint(-1 if 1 in a else 1)\r\n", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef solve():\n n = int(input())\n a = map(int, input().split())\n if 1 in a:\n return -1\n else:\n return 1\n\nif __name__ == '__main__':\n print(solve())\n\n", "import sys\nimport collections\n\ninfile = sys.stdin.buffer\ndef gs() : return infile.readline().rstrip()\ndef gi() : return int(gs())\ndef gss() : return gs().split()\ndef gis() : return [int(x) for x in gss()]\n\nMOD = 10 ** 9 + 7\nINF = 10 ** 12\nN = 10 ** 5\n'''\ndivisors = [[] for i in range(N+1)]\n\nfor u in range(2, len(divisors)):\n cur = u\n while(cur < len(divisors)):\n divisors[cur].append(u)\n cur += u\n'''\n\ndef main(infn=\"\") :\n global infile\n infile = open(infn,\"r\") if infn else open(sys.argv[1],\"r\") if len(sys.argv) > 1 else sys.stdin\n ######################################################################\n n = gi()\n a = gis()\n print (-1 if 1 in a else 1)\n ######################################################################\nif __name__ == '__main__' :\n main()", "n=int(input())\r\na=list(map(int, input().split()))\r\nx=min(a)\r\nif x==1:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\nlst = list(map(int, input().split()))\nif lst.count(1)<1:\n print(1)\nelse:\n print(-1)\n \t \t \t\t\t\t \t\t\t \t \t \t \t\t \t", "a = int(input())\r\narr = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in arr:\r\n if i == 1:\r\n k = 1\r\n break\r\nprint(\"-1\" if k else \"1\")", "n = int(input())\nbanknotes = list(map(int, input().split()))\n\nflag = False\n\nfor bn in banknotes: \n if bn == 1:\n flag = True\n\n\nprint (-1 if flag else 1)\n\t\t\t \t \t\t\t \t\t\t\t\t\t \t \t\t\t\t", "size = int(input())\narr = input().split()\narr = [int(x) for x in arr]\n\ni = 0\nwhile(i < size):\n if(arr[i] == 1):\n print(-1)\n break\n \n i+= 1\n if(i == size):\n print(1)\n \t \t \t\t\t\t\t\t\t\t\t\t \t \t\t\t \t \t\t \t", "def Geralt(arr):\r\n if 1 in arr:\r\n return -1\r\n else:\r\n return 1\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(Geralt(arr))\r\n", "n=int(input())\narr=[int(i) for i in input().split()]\nans = 1\nfor i in range(n):\n if arr[i]==1:\n ans= -1\n\nprint(ans)\n\t\t \t\t \t\t \t \t \t \t\t \t\t\t \t\t \t\t", "input()\r\na = input().split()\r\nif '1' in a:\r\n print(-1)\r\nelse:\r\n print (1)\r\n", "input()\r\nla=list(map(int, input().split()))\r\n\r\na=min(la)\r\nif a==1:\r\n print(-1)\r\nelse:\r\n print(1)", "n = input()\r\na=input()\r\ns=[int(i) for i in a.split()]\r\nif 1 in s:\r\n print(-1)\r\nelse:\r\n print(1)", "_ = input()\r\nlst = list(map(int, input().split()))\r\nprint(-1 if 1 in lst else 1)", "no=int(input())\nnotes=input()\nnotes=notes.split(' ')\nnotes=[int(x) for x in notes]\nif(1 in notes):\n print(-1)\nelse: \n print(1)\n\n\t\t \t\t \t\t \t \t \t\t\t \t\t\t\t\t", "input();print(-1 if \"1\" in [i for i in input().split()] else 1)\n\t\t \t\t\t\t\t \t \t \t\t \t \t\t\t", "n = int(input())\r\nprint(('1' in input().split())*-2+1)", "x=input()\r\na = input().split()\r\na.sort()\r\nif a[0]=='1':\r\n print('-1')\r\nelse:\r\n print('1')\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nprint([1,-1][1 in L])\r\n", "n = int(input())\nmas = list(map(int, input().split()))\nif 1 in mas:\n print(-1)\nelse:\n print(1)\n", "banknotes = int(input())\nvalues = list(map(int, input().split(' ')))\nvalues.sort()\n\nif 1 in values:\n print(-1)\nelse:\n for i in range(1, max(values) + 1):\n if i not in values:\n print(i)\n break\n else:\n print(-1)", "\nn = int(input())\na = list(map(int,input().split()))\nans = 1\nfor i in a:\n if i == 1:\n ans = -1\n\nprint(ans)\n \t\t \t\t \t\t \t \t\t\t\t \t\t\t \t", "a = int(input())\nlst = list(map(int,input().split()))\nif 1 in lst :\n print(-1)\nelse:\n print(1)\n\t \t \t\t\t \t\t\t\t \t \t\t\t\t\t \t", "def unfortunate(arr):\r\n if 1 in arr:\r\n return -1\r\n else:\r\n return 1\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nprint(unfortunate(arr))", "# your code goes here\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\nx=1\r\nif x in arr:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(\"1\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 14 08:39:33 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nif arr[0]==1:\r\n print(-1)\r\nelse:\r\n print(1)", "r=input()\nn=input().split()\nif '1' in n:\n\tprint(-1)\nelse :\n\tprint(1)\t", "input()\r\na = [int(x)==1 for x in input().split()]\r\nif any(a):\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\nl=list(map(int,input().strip().split()[:n]))\r\nif min(l)!=1:\r\n\tprint(1)\r\nelse:\r\n\tprint(-1)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nfor i in a:\r\n if i ==1:\r\n print(-1)\r\n break\r\nelse:\r\n print(1)", "eL = input(\"\")\r\ndL = input(\"\").split()\r\ndLI = [int(x) for x in dL]\r\n\r\nif 1 in dLI:\r\n print(-1)\r\nelse:\r\n print(1)\r\n \r\n", "\nn = input()\nnumbers = [int(i) for i in input().split()]\n\nif (1 in numbers):\n print(str(-1))\nelse:\n print(\"1\")\n\n\t\t \t\t \t \t\t \t \t\t \t \t\t \t\t\t\t \t", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nif l[0]!=1: print(1)\r\nelse: print(-1)", "input()\r\nprint(1-2*('1'in input().split()))", "n = int(input())\nv = list(map(int, input().split()))\nv.sort()\nif n == 1:\n if v[0] > 1:\n print(1)\n else:\n print(-1)\n\nelif v[0] != 1:\n print(1)\nelse:\n for i in range(n):\n if v[i] + 1 == v[i] + v[0] or v[i] + 1 == v[i + 1]:\n print(-1)\n break\n else:\n print(v[i] + 1)\n break\n\n \t \t\t\t \t \t \t \t \t \t \t \t\t\t", "input()\r\nx=False\r\nfor i in map(int,input().split()):\r\n if i==1:x=True\r\nif x:print('-1')\r\nelse:print('1')", "def to_int(string):\r\n output = string.split()\r\n for i in range( len(output) ):\r\n output[i] = int(output[i])\r\n return output\r\n\r\ndef main():\r\n n = int( input() )\r\n notes = sorted( to_int( input() ) )\r\n unlucky = -1\r\n\r\n if min(notes) != 1:\r\n unlucky = 1\r\n\r\n print(unlucky)\r\n\r\nmain()", "n = int(input())\nx = input().split(\" \")\na = []\nfor i in range(n):\n a.append(int(x[i]))\nif 1 in a:\n print(-1)\nif 1 not in a:\n print(1)\n\t \t\t\t\t\t\t\t \t\t\t \t\t \t \t \t\t\t\t", "input()\r\nprint( -1 if min([int(x) for x in input().split()]) == 1 else 1)", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\nprint(-1 if(1 in arr) else 1)", "# LUOGU_RID: 101605333\nn, *a = map(int, open(0).read().split())\r\nprint(-1 if min(a) == 1 else min(1, min(a) - 1))", "n=int(input())\r\nl=list(input().split())\r\nif \"1\" in l:\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)", "from sys import stdin, stdout\n\ndef read_input(): \n #inputfile = open( \"A.in\" ) \n #input_string_array = inputfile.readlines()\n input_string_array = stdin.readlines()\n n = int (input_string_array[0])\n Q = input_string_array[1].strip().split(' ')\n return [n, Q]\n\n\n\ndef main():\n [ n , Q ] = read_input()\n if '1' in Q :\n stdout.write('-1\\n')\n else:\n stdout.write('1\\n')\nif __name__ == \"__main__\":\n main()", "n = int(input())\r\nli = list(map(int,input().split()))\r\nif 1 in li: print(-1)\r\nelse: print(1)", "n = int(input())\r\nnota = list(map(int,input().split(\" \")))\r\nnota.sort(reverse = False)\r\nr = False\r\nfor x in nota:\r\n if x == 1:\r\n r = True\r\n break\r\n\r\nif r is False:\r\n\tprint(1)\r\nelif r is not False:\r\n\tprint(-1)\r\n", "def inp(s):\r\n j = 0\r\n a = []\r\n for i in range(len(s)):\r\n if s[i] == \" \":\r\n a.append(int(s[j:i]))\r\n j = i+1\r\n if i == len(s)-1:\r\n a.append(int(s[j:]))\r\n return a\r\n\r\nn = int(input())\r\ns = input()\r\na = inp(s)\r\nif 1 in a:\r\n print (\"-1\")\r\nelse:\r\n print (\"1\")\r\n", "n = int(input())\r\nnotes = list(map(int, input().split(' ')))\r\n\r\nnotes.sort()\r\n\r\nif notes[0] != 1:\r\n print(1)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nif 1 in l:\r\n\tprint(-1)\r\nelse:print(1)\t", "bank_notes = int(input())\r\nnote_value = [ int(x) for x in input().split() ]\r\n\r\nif 1 in note_value:\r\n\tprint (-1)\r\n\r\nelse:\r\n\tprint (1)", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nif 1 in li:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "input()\r\nprint(-1 if 1 in map(int, input().split()) else 1)", "input()\r\nl = list(input().split())\r\nif '1' in l:\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nx=0\r\nfor i in range(n):\r\n if(a[i]<2):\r\n x=1\r\n break\r\nif(x):\r\n print(-1)\r\nelse:\r\n print(1)", "n=eval(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nif (a[0]==1):\r\n print (-1)\r\nelse:\r\n print (1)\r\n\r\n \r\n ", "n=int(input())\r\nx=list(map(int,input().split()))\r\nif( 1 in x):\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nflag=0\r\nif (1 in a):\r\n flag=1\r\nif(flag==1):\r\n print(-1)\r\nelse:\r\n print(1)", "n=input()\r\nlst=[int(i) for i in input().split()]\r\nif 1 in lst:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfound = False\r\nfor ele in arr:\r\n if(ele == 1):\r\n found = True\r\n break\r\nif(found):\r\n print(-1)\r\nelse:\r\n print(1)", "input();z=min(map(int,input().split()));print(['1','-1'][z==1])", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\ninput()\r\nprint(('1' in input().split())*-2+1)", "input()\r\nif \"1\" in input().split(): print(-1)\r\nelse: print(1)", "n=int(input())\na=[int(i) for i in input().split()]\nif min(a)==1:\n print(-1)\nelse:\n print(1)\n", "n=int (input())\narr=[int(i) for i in input().split()]\narr.sort() \nif arr[0]==1:\n print(-1)\nelse:\n print(1)\n \t\t \t \t\t\t\t\t \t \t \t\t\t\t \t\t \t", "n = int(input())\r\nal = list(map(int, input().split()))\r\nprint(\"-1\" if min(al) == 1 else \"1\")", "input()\r\na=list(map(int,input().split()))\r\nprint(-1 if 1 in a else 1)", "n=int(input())\nflag=0\nx=input().split()\nif \"1\" in x:\n print(-1)\nelse:\n print(1)\n \t \t\t \t \t \t \t \t", "n = input()\r\nm = min(map(int, input().split()))\r\nprint(-1 if m == 1 else 1)", "# 560A\r\nn = int(input())\r\na = input().split()\r\na = list(map(int,a))\r\na.sort()\r\nif a[0] > 1:\r\n print(1)\r\nelse:\r\n print(-1)", "n = input()\r\na = map(int,input().split())\r\nif 1 in a:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "n = int(input())\narr = [int(i) for i in input().split()]\nfor i in arr:\n if i == 1:\n print(-1)\n exit(0)\nprint(1)\n\n\t \t \t\t \t \t\t \t \t \t \t\t \t\t \t", "import sys\nn = int(input())\nalist = list(map(int, sys.stdin.readline().split()))\nif min(alist) == 1:\n print(-1)\nelse:\n print(1)\n", "a=int(input())\r\nx=1\r\ni=0\r\nb=input().split(' ')\r\nfor i in range (a):\r\n b[i] = int (b[i])\r\n #print(b[i])\r\n\r\nfor i in range(a):\r\n if b[i] == 1: \r\n x = -1\r\n#print (b[3] == 1)\r\nprint (x) \r\n", "a,b=input(),input().split()\r\nprint('-1' if '1' in b else '1')", "n=int(input())\r\nb=list(map(int,input().split()))\r\nif b.count(1)>=1:\r\n print(-1)\r\nelse:\r\n print(1)", "\r\n\r\n\r\na = input()\r\nx = [int(x) for x in input().split()]\r\n\r\nprint(-1 if 1 in x else 1)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nif 1 in arr:\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nprint(-1) if 1 in a else print(1)\r\n", "n = input()\nnumbers = input()\nnotes = numbers.split()\nnotes = set(notes)\n\nif \"1\" in notes:\n print(\"-1\")\nelse:\n print(\"1\")\n\t \t \t\t\t \t\t \t\t \t\t \t\t \t\t\t\t\t", "'''input\n5\n1 2 3 4 5\n'''\nn = int(input())\nl = list(map(int, input().split()))\nif 1 in l:\n\tprint(-1)\nelse:\n\tprint(1)", "n = int(input())\narr = [int(i) for i in input().split()]\nif min(arr) == 1:\n print(-1)\nelse:\n print(1)", "a=int(input())\r\nl=[int(i) for i in input().split(' ')]\r\nif 1 in l:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "n = int(input())\nl = [int(i) for i in input().split()]\nif l.count(1) >= 1:\n print(-1)\nelse:\n print(1)", "N = int( input() )\n\nA = input().split()\nA = [ int( x ) for x in A ]\n\nfor x in A:\n\tif( x == 1 ):\n\t\tprint( -1 )\n\t\texit()\n\nprint( 1 ) ", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\nprint(-1 if 1 in data else 1)\r\n\r\n", "n = int(input())\r\ns = input().split()\r\nprint(1 if '1' not in s else -1)", "n=input()\r\nprint([1,-1][sorted(map(int,input().split()))[0]==1])", "#!/usr/bin/env python3\n\"\"\"\nCodeForces\n\nProblem A. Currency System in Geraldion\nhttp://codeforces.com/problemset/problem/560/A\n\n@author yamaton\n@date 2015-07-28\n\"\"\"\nimport sys\n\n\ndef solve(n, xs):\n if 1 in xs:\n return -1\n else:\n return 1\n\n\ndef print_stderr(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n xs = [int(s) for s in input().strip().split()]\n result = solve(n, xs)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "input();*v,=map(int,input().split())\nprint(-1 if 1 in v else 1)", "t=int(input())\r\nli=list(map(int,input().split()))\r\nif 1 in li:\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)", "n = int(input())\r\nlt = list(map(int, input().split()))\r\n\r\nfor it in lt:\r\n if it == 1:\r\n print(-1)\r\n break\r\nelse:\r\n print(1)\r\n", "\r\ninput()\r\nar = sorted(map(int,input().split()))\r\nif ar[0]==1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)\r\n\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "#https://codeforces.com/blog/entry/71884\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom math import inf, gcd, log, log2, floor, ceil, sqrt\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heappush, heappop, heapify\r\nfrom functools import lru_cache\r\nfrom itertools import permutations, accumulate\r\nfrom bisect import insort, bisect_left, bisect_right\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\r\ndef solve(n,arr):\r\n \r\n if 1 not in arr:\r\n return 1\r\n \r\n return -1\r\n \r\n \r\nn = inp()\r\narr = inlt()\r\nprint(solve(n,arr))\r\n ", "n=int(input())\r\nz=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in z :\r\n if i==1 :\r\n count+=1\r\n\r\nif count==1 :\r\n print(-1)\r\nelse :\r\n print(1)", "input()\r\n\r\na = input().split()\r\n\r\nif \"1\" in a:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n", "# @author Matheus Alves dos Santos\n\nn_notes = int(input())\nnotes = input().split()\nnotes.sort()\n\nif (notes[0] == '1'):\n print(-1)\nelse:\n print(1)\n", "n = int(input())\r\nans = 1\r\ninputs = [int(x) for x in input().split()]\r\nfor x in inputs:\r\n if x == 1:\r\n ans = -1\r\n break\r\nprint(ans)", "trash = int(input());\r\nsecondLine = [int(x) for x in input().split()];\r\nsecondLine.sort();\r\nif(secondLine[0]==1):\r\n print(-1);\r\nelse:\r\n print(1);", "numero = input()\r\nx = map(int, input().split())\r\n\r\nif 1 in x:\r\n print (\"-1\")\r\nelse:\r\n print (\"1\")", "input()\r\nnotes = [int(z) for z in input().split()]\r\nif(notes.count(1) > 0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)\r\n", "input()\r\nkey_list = [int(key) for key in input().split()]\r\nresult = 1\r\nif 1 in key_list:\r\n result = -1\r\nprint(result)\r\n ", "n = int(input())\nx = input().split()\nl = [int(i, 10) for i in x]\nif(1 in l):\n print(-1)\nelse:\n print(1)\n \n", "n = input()\r\na = input().split()\r\nans = 1\r\nfor x in a:\r\n if x == \"1\":\r\n ans = -1\r\n break\r\nprint(ans)\r\n", "\r\nn = int(input())\r\n\r\narr = list(map(int,input().strip().split()))\r\n\r\narr = sorted(arr)\r\n\r\nif arr[0]==1:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\nif(l[0]==1):\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\nnotes = input()\n\nnotes_array = list(map(int, notes.split(' ')))\num = False\nfor note in notes_array:\n if note == 1:\n um = True\n\nif um:\n print(-1)\nelse:\n print(1)\n \t\t\t \t\t \t \t\t\t\t \t\t \t\t\t\t \t\t\t", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\nif a[0]==1:\r\n\tprint('-1')\r\nelse:\r\n\tprint('1')\t", "n=int(input())\r\nvalues=[int(x) for x in input().split()]\r\nif 1 in values:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\n\r\n\r\n\r\nt=list(map(int,input().split()))\r\nt.sort()\r\n\r\n\r\n\r\nif 1 in t:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\n\r\nif lst[0] == 1:\r\n print(-1)\r\nelse:\r\n print(1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jan 14 12:02:06 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\ns = sorted(s)\r\n\r\nif 1 in s:\r\n print(-1)\r\nelse:\r\n print(1)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nprint('-1' if 1 in l else '1')", "import math\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nif a.count(1)!=0:\r\n print(-1)\r\nelse:\r\n print(1)", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\nflag = 0\r\nfor i in range(0,len(a)):\r\n if(a[i]==1):\r\n flag = 1\r\nif(flag):\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "\"\"\"\nhttps://codeforces.com/problemset/problem/560/A\n\"\"\"\nx=int(input())\nmonnaie=[int(x) for x in input().split()]\n\nif min(monnaie)>1:\n print(1)\nelse:\n print(-1)\n \n \n", "## D - Currency System in Geraldion\n\nn_values = int(input())\n\nbanknotes_values = [int(n) for n in input().split(\" \")]\n\nsorted_bank_notes = sorted(banknotes_values)\n\nif (sorted_bank_notes[0] > 1):\n print(1)\nelse:\n print(-1)\n \t \t\t\t\t \t\t \t\t\t \t \t \t\t\t\t\t\t\t\t", "input()\r\nj = input().split()\r\nk = [int(i) for i in j]\r\nprint(-1 if 1 in k else 1)\r\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n if '1' in line:\r\n print(-1)\r\n else:\r\n print(1)\r\n", "n = int(input())\nnotes = input().split(\" \")\ntotal = 0\nflag = 0\nfor i in range(n):\n notes[i] = int(notes[i])\n if notes[i] == 1:\n print(-1)\n flag = 1\n break\nif flag == 0:\n print(1)\n \t\t \t\t\t \t\t\t \t\t \t \t\t\t", "def main():\n n = int(input())\n a = set(list(map(int, input().split(' '))))\n if 1 in a:\n return \"-1\"\n return \"1\"\nprint(main())\n", "a =input()\nb =list(map(int,input().split()))\n\nif 1 in b:\n print(-1)\nelse:\n print(1)\n\t \t \t\t\t\t \t \t\t \t\t\t\t\t \t\t\t \t\t", "def currency(L):\r\n if 1 in L:\r\n return -1\r\n else:\r\n return 1\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nprint(currency(L))", "n = int(input())\r\nnotes = input().split(\" \")\r\ntotal = 0\r\nflag = 0\r\nfor i in range(n):\r\n notes[i] = int(notes[i])\r\n if notes[i] == 1:\r\n print(-1)\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(1)", "n=int(input())\r\nl=input().split()\r\nif \"1\" in l:\r\n print(-1)\r\nelse:\r\n print(1)\r\n ", "n=int(input())\r\nc=list(map(int,input().split()))\r\ni=1\r\nif i in c:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "a = int(input())\r\nb = list(map(int, input().split()))[:a]\r\nif 1 in b:\r\n print(-1)\r\nelse:\r\n print(1)\r\n\r\n\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\na=0\r\nfor x in list1:\r\n if x==1:\r\n print(-1)\r\n a+=1\r\n break\r\nif a==0:\r\n print(1)", "n, a = int(input()), list(map(int, input().split()))\r\na.sort()\r\nprint(-1) if a[0] == 1 else print(1)", "_ = input()\nnotes = list(map(int, input().split()))\nif 1 in notes:\n\tprint(-1)\nelse:\n\tprint(1)\n", "n = int(input())\r\nline = [int(i) for i in input().split()]\r\nif 1 in line:\r\n print(-1)\r\nelse:print(1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nif 1 in s:\r\n print(-1)\r\nelse:\r\n print(1)", "a = int(input())\r\ns = input().split()\r\nfor i in range(a):\r\n s[i]=int(s[i])\r\nif 1 in s:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n = int(input())\r\nb=input().split()\r\na = list(map(int,b))\r\na.sort()\r\nif(a[0]==1):\r\n print(-1)\r\nelse:\r\n print(1)", "def money(lst):\r\n if 1 in lst:\r\n return -1\r\n return 1\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(money(a))", "n = int(input())\na = input().split()\nans = -1\n\nif not '1' in a:\n ans = 1\n\nprint(ans)\n\t \t\t\t\t \t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\na = input().split()\r\nif str(1) in a: print(-1)\r\nelse:print(1)", "n = input()\r\nbanknotes = [int(x) for x in input().split()]\r\nprint('-1') if 1 in banknotes else print('1')", "n = int(input())\r\nnums = [int(s) for s in input().split()]\r\n\r\nif 1 in nums:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "# Wadea #\r\n\r\ns = int(input())\r\nnums = list(map(int,input().split()))\r\nif nums.count(1) > 0:\r\n print(-1)\r\nelse:\r\n print(1)", "input()\r\n\r\nprint(1 if min(map(int, input().split())) > 1 else -1)", "n = int(input())\r\na = map(int, input().split())\r\nprint(\"-1\" if 1 in a else \"1\")\r\n", "s = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\na.sort()\r\nif a[0] == 1:\r\n print(-1)\r\nelse:\r\n print(1)", "#f=open('pe.in','r')\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nif min(a)==1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(1)", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nprint([-1, 1][1 not in A])\r\n", "def main():\n n = int(input())\n a = input().split()\n for c in a:\n if c == \"1\":\n return -1\n return 1\n\nprint(main())\n\t \t\t\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t \t", "a=int(input())\r\na=input().split()\r\ns=0\r\nfor i in a:\r\n if int(i) == 1:\r\n print(-1)\r\n s=1\r\n break\r\nif s == 0:\r\n print(1)\r\n\r\n\r\n", "n=int(input())\ncurr=input().strip().split(' ')\ncurr=[int(x) for x in curr]\n\nif 1 in curr:\n\tprint(-1)\nelse: \n\tprint(1)", "n = int(input())\r\nmin_c = min(list(map(int,input().split())))\r\nif min_c == 1:\r\n print(-1)\r\nelse:\r\n print(1)", "input()\r\nx = list(map(int,input().split()))\r\nprint(-1 if 1 in x else 1)\r\n", "input()\r\nprint((1, -1)[\"1\" in input().split()])\r\n", "N = int(input())\r\nA = list(map(int, input().split()))\r\n\r\n\r\nif min(A) != 1:\r\n print(1)\r\nelse:\r\n print(-1)", "#!/usr/bin/env python3\n\nn = input()\na = map(int, input().split())\nif 1 in a:\n print(\"-1\")\nelse:\n print(\"1\")\n", "\"\"\"\nTitle: A. Currency System in Geraldion\n\nTime Limit: time limit per test2 seconds\nMemory Limit: memory limit per test256 megabytes\n\nA magic island Geraldion, where Gerald lives, has its own currency system. It\nuses banknotes of several values. But the problem is, the system is not\nperfect and sometimes it happens that Geraldionians cannot express a certain\nsum of money with any set of banknotes. Of course, they can use any number of\nbanknotes of each value. Such sum is called unfortunate. Gerald wondered: what\nis the minimum unfortunate sum?\n\n\n\nTest Cases:\n\n 5 \n 1 2 3 4 5 \n \n\n\n\n -1 \n \n\n\n====================================\n\n\"\"\"\n\n# Input Scanners\nimport sys\n\nclass Scanner:\n\n def __init__(self):\n self.current_tokens = []\n\n def remaining_tokens(self):\n return len(self.current_tokens)\n\n def nextline(self):\n assert self.remaining_tokens() == 0, \"Reading next line with remaining tokens\"\n return input()\n\n def nexttokens(self):\n return self.nextline().split()\n \n def nexttoken(self):\n if len(self.current_tokens) == 0:\n self.current_tokens = self.nexttokens()\n assert self.remaining_tokens() > 0, \"Not enough tokens to parse.\"\n return self.current_tokens.pop(0)\n\n def nextints(self, n=-1):\n if n == -1:\n return list(map(int, self.nexttokens()))\n else:\n return [self.nextint() for i in range(n)]\n \n def nextint(self):\n return int(self.nexttoken())\n\ndef quit():\n sys.exit(0)\n\nstdin = Scanner()\nnextint = stdin.nextint\nnextints = stdin.nextints\nnextline = stdin.nextline\n\n# Useful Constants\nEPS = 1e-7\n\nn = nextint()\na = nextints()\na.sort()\n\nif a[0] == 1:\n print(-1)\nelse:\n print(1)\n", "n = int(input())\nx =[int(x) for x in input().split()]\nif 1 in x:\n print(-1)\nelse:\n print(1)\n\n\t\t\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\nq = [int(x) for x in input().split()]\r\nprint(-1 if 1 in q else 1)", "n = input()\nn = int(n)\nj = [int(i) for i in input().split()]\nif 1 in j:\n print(-1)\nelse:\n print(1)\n\t\t \t\t \t\t\t \t\t\t\t \t\t\t\t\t\t\t\t \t", "n,m=input(),input().split()\r\nif '1' in m:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\na= list(map(int, input().split()))\r\na.sort()\r\nif a[0]==1:print(-1)\r\nelse:print(1)\r\n", "n = int(input())\nl = list(map(int, input().split()))\n\nif 1 in l:\n\tprint(\"-1\")\nelse:\n\tprint(\"1\")\n \t \t\t\t \t \t\t \t \t \t \t \t \t \t \t", "def main():\n n = int(input())\n a = set(map(int, input().split()))\n if 1 in a:\n print(-1)\n else:\n print(1)\n\nmain()\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\na.sort()\r\nif a[0] == 1:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n, a = int(input()), sorted(list(map(int, input().split())))\r\nprint(1 if a[0] > 1 else -1)", "input();print(-1 if list(map(int,input().split())).count(1)>0 else 1)\n#Khoda && me : Hame chi ,Mitune hata doros Beshe ^_^:)\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\ninput()\r\nn = min(list(map(int, input().split())))\r\nif n==1: print(-1)\r\nelse: print(1)" ]

[ "def cocktail_sort(a):\r\n n = len(a)\r\n swapped = True\r\n start = 0\r\n end = n-1\r\n while (swapped == True):\r\n \r\n # reset the swapped flag on entering the loop,\r\n # because it might be true from a previous\r\n # iteration.\r\n swapped = False\r\n \r\n # loop from left to right same as the bubble\r\n # sort\r\n for i in range (start, end):\r\n if (a[i] > a[i + 1]) :\r\n a[i], a[i + 1]= a[i + 1], a[i]\r\n swapped = True\r\n \r\n # if nothing moved, then array is sorted.\r\n if (swapped == False):\r\n break\r\n \r\n # otherwise, reset the swapped flag so that it\r\n # can be used in the next stage\r\n swapped = False\r\n \r\n # move the end point back by one, because\r\n # item at the end is in its rightful spot\r\n end = end-1\r\n \r\n # from right to left, doing the same\r\n # comparison as in the previous stage\r\n for i in range(end-1, start-1, -1):\r\n if (a[i] > a[i + 1]):\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n swapped = True\r\n \r\n # increase the starting point, because\r\n # the last stage would have moved the next\r\n # smallest number to its rightful spot.\r\n start = start + 1\r\n\r\n\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nanswer = 0\r\n\r\ncocktail_sort(x)\r\n\r\nfor i in range(len(x)-1):\r\n\tif (i+2)>= n:\r\n\t\tif (x[i] == x[i+1]) and (x[i] != 0):\r\n\t\t\tanswer = answer + 1\r\n\t\t\ti = i+1\r\n\telse:\r\n\t\r\n\t\tif x[i] == x[i+1] and x[i] != 0 and x[i] !=x[i+2]:\r\n\t\t\tanswer = answer + 1\r\n\t\t\ti = i + 1\r\n\t\t\t\r\n\t\telif x[i] == x[i+1] and x[i] == x[i+2] and x[i]!= 0:\r\n\t\t\tanswer = -1\r\n\t\t\tbreak\r\n\t\r\nprint(answer)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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())\ns = list(map(int, input().split()))\nx = set(s)\n\nr = 0\n\nfor i in x:\n if i != 0:\n p = s.count(i)\n if p == 2:\n r += 1\n elif p > 2:\n print(-1)\n exit()\n\nprint(r)\n", "n = int(input())\r\nsessions = {}\r\ncounter = 0\r\nfor i in input().split():\r\n i = int(i)\r\n if i == 0:\r\n continue\r\n if i not in sessions:\r\n sessions[i] = 0\r\n sessions[i] += 1\r\n if sessions[i] == 2:\r\n counter += 1\r\n elif sessions[i] == 3:\r\n counter = -1\r\n break\r\nprint(counter)\r\n", "import collections\r\n\r\nn = int(input())\r\ntemp = list(map(int, input().split()))\r\nl = [i for i in temp if i!=0]\r\nx = collections.Counter(l)\r\ny = x.values()\r\nans = 0\r\nfor i in y:\r\n if i==2:\r\n ans = ans +1\r\n elif i>2:\r\n ans = -1\r\n break\r\nprint(ans)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nb=list(set(a))\r\nfor i in b:\r\n\td=a.count(i)\r\n\tif i==0:\r\n\t\tpass\r\n\telif d==2:\r\n\t\tc+=1\r\n\telif d>=3:\r\n\t\tprint('-1')\r\n\t\texit()\t\r\nprint(c)\t\t", "# LUOGU_RID: 101474037\nfrom collections import Counter\r\nn, *a = map(int, open(0).read().split())\r\nc = Counter([x for x in a if x])\r\nif a.count(0) == n:\r\n exit(print(0))\r\nprint(c.most_common()[0][1] > 2 and -1 or sum(v == 2 for k, v in c.items()))", "from collections import defaultdict\r\nn=int(input())\r\narr=[int(i) for i in input().split(\" \")]\r\nd=defaultdict(int)\r\nfor i in arr:\r\n if i!=0:\r\n d[i]+=1\r\nflag=True\r\ncount=0\r\nfor i in d.values():\r\n if(i>2):\r\n flag=False\r\n break \r\n elif(i==2):\r\n count+=1 \r\nif(flag):\r\n print(count)\r\nelse:\r\n print(-1)", "cases = int(input())\r\narr = list(map(int, input().split()))\r\ndiction = {}\r\nfor i in range(cases):\r\n tk = arr[i]\r\n if(tk != 0):\r\n if tk not in diction:\r\n diction[tk] = 1\r\n else:\r\n diction[tk] = diction[tk] + 1\r\nans = 0\r\nfor j in diction:\r\n tv = diction[j]\r\n if(tv > 2):\r\n ans = -1\r\n break\r\n elif(tv == 2):\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {0:0}\r\nfor x in a:\r\n if x > 0:\r\n d[x] = d.get(x, 0) + 1\r\nif max(d.values()) > 2:\r\n print(-1)\r\nelse:\r\n ans = list(d.values()).count(2)\r\n print(ans)", "input()\r\ndata = sorted(filter(lambda v: v != 0, map(int, input().split())))\r\n\r\nif any(v1 == v2 for v1, v2 in zip(data, data[2:])):\r\n print(-1)\r\nelse:\r\n print(sum(v1 == v2 for v1, v2 in zip(data, data[1:])))\r\n\r\n", "n = int(input())\r\ncalls = list(map(int, input().split()))\r\npeople = {}\r\nfor x in calls:\r\n if x != 0:\r\n if not x in people:\r\n people[x] = 0\r\n people[x] += 1\r\na = 0\r\nfor x in people.values():\r\n if x > 2:\r\n print(-1)\r\n break\r\n if x == 2:\r\n a += 1\r\nelse:\r\n print(a)", "from collections import Counter as C\r\na = int(input())\r\nl = list(map(int, input().split()))\r\nA = C(l)\r\nA.pop(0, None)\r\ncount = A.values()\r\nprint(list(count).count(2) if not count or max(count) <= 2 else -1)\r\n\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 A = sorted(map(int, wtf[1].split()))\r\n ans = 0\r\n D = dict()\r\n for a in A:\r\n if a not in D:\r\n D[a] = 1\r\n else:\r\n D[a] += 1\r\n for k,v in D.items():\r\n if k==0:\r\n continue\r\n if v>2:\r\n ans = -1\r\n break\r\n elif v==2:\r\n ans +=1\r\n print(ans)", "n = int(input())\r\nids = list(map(int, input().split()))\r\n\r\nids.sort()\r\n\r\n# create a list counting occurence\r\nids = [ids.count(x) for x in {*ids}-{0}]\r\nif max(ids+[0]) > 2 :\r\n\tprint(-1)\r\nelse:\r\n\tprint(ids.count(2))\r\n # print pair with only two occurence", "n = int(input())\r\nli = list(map(int,input().rstrip().split()))\r\ncnt = 0\r\nb = set(li)-{0}\r\nfor i in b:\r\n p = li.count(i)\r\n if p > 2:\r\n print(-1)\r\n exit()\r\n elif p == 2:\r\n cnt +=1\r\nprint(cnt)", "from collections import Counter\nn = int(input())\ncnt = Counter(int(x) for x in input().split())\nans = 0\nfor (a, b) in cnt.items():\n\tif a:\n\t\tif b == 2:\n\t\t\tans += 1\n\t\tif b > 2:\n\t\t\tprint(-1)\n\t\t\texit(0)\nprint(ans)\n", "input();l=list(map(int, input().split()))\r\na=[l.count(i) for i in set(l) if i>0]\r\nprint([a.count(2),-1][max(a+[0])>2])", "def solve():\r\n _ = int(input())\r\n a = [int(x) for x in input().split()]\r\n\r\n d = {}\r\n\r\n for x in a:\r\n if x != 0:\r\n if x in d:\r\n if d[x] == 2:\r\n return -1\r\n d[x] = 2\r\n else:\r\n d[x] = 1\r\n \r\n ret = 0\r\n for v in d.values():\r\n if v == 2:\r\n ret += 1\r\n\r\n return ret\r\n \r\n\r\n\r\n\r\n\r\nprint(solve())", "input()\r\nlst = map(int, input().split())\r\n\r\ndct = {}\r\nfor i in lst:\r\n if i > 0:\r\n dct[i] = dct.get(i, 0) + 1\r\n\r\ntotal = 0\r\nfor v in dct.values():\r\n if v == 2:\r\n total += 1\r\n elif v > 2:\r\n total = -1\r\n break\r\n\r\nprint(total)\r\n", "n=int(input())\r\nd={}\r\nk=0\r\nl1=list(map(int,input().split()))\r\nfor x in l1 :\r\n if x :\r\n d[x]=d.get(x,0)+1\r\n if d[x]==2 :\r\n k+=1\r\n if d[x]==3 :\r\n print(-1)\r\n exit()\r\nprint(k)\r\n \r\n \r\n \r\n", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\ni = 0\r\nans = 0\r\nwhile i < n:\r\n if i < n-2 and a[i] == a[i+1] and a[i] != a[i+2] and a[i] != 0:\r\n ans += 1\r\n i += 2\r\n elif i < n-2 and a[i] == a[i+1] and a[i] == a[i+2] and a[i] != 0:\r\n ans = -1\r\n break\r\n elif i < n-1 and a[i] == a[i+1] and a[i] != 0:\r\n ans += 1\r\n i += 1\r\n else:\r\n i += 1\r\nprint(ans)\r\n\r\n", "n=int(input())\r\nid_=list(map(int,input().split()))\r\nhashm={}\r\ncount=0\r\nflag=True\r\nfor num in id_:\r\n if num not in hashm:\r\n hashm[num]=1\r\n else:\r\n hashm[num]+=1\r\nfor ele in hashm:\r\n if ele==0:\r\n if hashm.get(ele)==n:\r\n count=0\r\n break\r\n else:\r\n continue\r\n else:\r\n if hashm.get(ele)==2:\r\n count+=1\r\n elif hashm.get(ele)>2:\r\n flag=False\r\n break\r\nif flag==True:\r\n print(count)\r\nelse:\r\n print(-1)", "n = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nb = set(ar)-{0}\r\ncount = 0\r\nfor i in b:\r\n\tif(ar.count(i)>2):\r\n\t\tprint('-1')\r\n\t\texit(0)\r\n\telif(ar.count(i)==2):\r\n\t\tcount+=1\r\nprint(count)\r\n", "def shellSort(arr):\r\n gap = n//2\r\n while gap > 0:\r\n for i in range(gap,n):\r\n temp = arr[i]\r\n j = i\r\n while j >= gap and arr[j-gap] >temp:\r\n arr[j] = arr[j-gap]\r\n j -= gap\r\n arr[j] = temp\r\n gap //= 2\r\nn = int(input())\r\nsecretaryID = [int(x) for x in input().split()]\r\nshellSort(secretaryID)\r\nans = 0\r\nif n == 1:\r\n\tprint(0)\r\n\tquit()\r\nelse:\r\n\tfor i in range(n-2):\r\n\t\tif secretaryID[i] == 0: continue\r\n\t\tif secretaryID[i] == secretaryID[i+1]:\r\n\t\t\tif secretaryID[i+1] == secretaryID[i+2]:\r\n\t \t\t\tans = -1\r\n\t \t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tans += 1\r\nif ans == -1:\r\n\tprint(ans)\r\nelse:\r\n\tprint(ans if secretaryID[n-2] != secretaryID[n-1] or secretaryID[n-2] == 0 else ans+1)", "a=int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\ny= list(set(t))\r\nh=0\r\nu=0\r\n\r\nif y==[0]:\r\n print(0)\r\nelse:\r\n for k in y:\r\n if k==0:\r\n pass\r\n else:\r\n if t.count(k)==2:\r\n u+=1\r\n elif t.count(k)>2:\r\n print(-1)\r\n h+=1\r\n break\r\n\r\n if h==0:\r\n print(u)\r\n", "n = int(input())\r\nl = sorted([int(x) for x in input().split()])\r\nl = [l.count(x) for x in {*l}-{0}]\r\nif max(l+[0]) > 2 :\r\n\tprint(-1)\r\nelse:\r\n\tprint(l.count(2))", "n=int(input());l=list(map(int,input().split()));s=set(l);a=[0]*1005;i=0\r\nfor x in s:\r\n if x!=0:a[i]=l.count(x)\r\n else:a[i]=0\r\n i+=1\r\nif max(a)>2:print('-1')\r\nelse:print(a.count(2))", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n temp_dict = dict()\r\n for element in arr:\r\n if element in temp_dict:\r\n temp_dict[element] += 1\r\n else:\r\n temp_dict[element] = 1\r\n if temp_dict[element] > 2 and element != 0:\r\n print(-1)\r\n return\r\n\r\n counter = 0\r\n for key in temp_dict:\r\n if temp_dict[key] == 2 and key != 0:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def split(string, length):\r\n arr = [0] * length\r\n elem = ''\r\n arr_i = 0\r\n for i in string:\r\n if i == \" \":\r\n arr[arr_i] = int(elem)\r\n elem = \"\"\r\n arr_i += 1\r\n continue\r\n elem += i\r\n if i == string[len(string) - 1]:\r\n arr[arr_i] = int(elem)\r\n return arr\r\n\r\nn = int(input())\r\nid_str = input()\r\nid_arr = split(id_str, n)\r\n\r\npair = 0\r\nanomaly = False\r\nfor x in range(0, len(id_arr)):\r\n if id_arr[x] == 0:\r\n continue\r\n id_count = 1\r\n for y in range(x + 1, len(id_arr)):\r\n if id_arr[x] == id_arr[y]:\r\n id_count += 1\r\n if id_count > 2:\r\n anomaly = True\r\n break\r\n \r\n if anomaly: break\r\n elif id_count == 2:\r\n pair += 1\r\n\r\nif anomaly:\r\n print(-1)\r\nelse:\r\n print(pair)", "n = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = set(a)-{0}\r\nresult = 0\r\nfor i in b:\r\n\tif a.count(i)>2:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\telif a.count(i)==2:\r\n\t\tresult+=1\r\nprint(result)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef invr():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn = inp()\r\n\r\nids = invr()\r\n\r\nids.sort()\r\n\r\nv = {}\r\n\r\nfor x in ids:\r\n if not x in v:\r\n v[x] = 0\r\n # print(v[x])\r\n # try:\r\n v[x] += 1\r\nv[0] = 0\r\nc = 0\r\nfor i in v:\r\n x = v[i]\r\n if x == 2:\r\n c += 1\r\n elif x > 2:\r\n c = -1\r\n break\r\n\r\nprint(c)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nans = 0\r\na = {}\r\ninf = float('inf')\r\n\r\nfor x in l:\r\n if x == 0:\r\n continue\r\n if x in a:\r\n a[x] += 1\r\n if a[x] == 2:\r\n ans += 1\r\n if a[x] > 2:\r\n ans = -inf\r\n else:\r\n a[x] = 1\r\n\r\nif ans < 0:\r\n ans = -1\r\n\r\nprint(ans)", "n=int(input())\ns=input().split()\nfor i in range(n):\n s[i]=int(s[i])\nans=0\ndone=False\nfor i in range(n):\n if(s[i]==0):\n continue\n n=s[i+1:].count(s[i])\n if(n==1):\n ans+=1\n elif(n>1):\n print(-1)\n done=True\n break\n\nif(not done):\n print(ans)\n", "def solve(z, n):\r\n z = [int(z) for z in z.split()]\r\n c = 0\r\n r = 0\r\n x = []\r\n for i in range(n):\r\n if z[i] != 0:\r\n x.append(z[i])\r\n for i in x:\r\n c = 0\r\n for j in x:\r\n if i == j:\r\n c = c + 1\r\n if c > 2:\r\n return -1\r\n if c == 2:\r\n r = r + 1\r\n return int(r/2)\r\n\r\n\r\nn = int(input())\r\nr1 = input()\r\nprint(solve(r1, n))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\ns=0\r\nfor i in range(n):\r\n if(l[i]!=0):\r\n if(l[i] not in d):\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]+=1\r\n if(d[l[i]]>2):\r\n s=1\r\n print('-1')\r\n break\r\nif(s==0):\r\n c=0\r\n for i in d:\r\n if(d[i]==2):\r\n c+=1\r\n print(c)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ndc = dict()\r\nfor k, s in enumerate(lst):\r\n if s == 0:\r\n continue\r\n if not s in dc: \r\n dc[s] = [k]\r\n else:\r\n if len(dc[s]) == 2:\r\n print(-1)\r\n break\r\n else:\r\n dc[s].append(k)\r\nelse:\r\n print(sum(1 for k, v in dc.items() if len(v) == 2))", "n = int(input())\r\ns = input().split()\r\nd = {}\r\nfor i in s:\r\n d[i] = d.get(i, 0) + 1\r\nans = 0\r\nfor i in d:\r\n if i == '0':\r\n continue\r\n if d[i] == 2:\r\n ans += 1\r\n elif d[i] > 2:\r\n print('-1')\r\n break\r\nelse:\r\n print(ans)", "from cmath import *\r\nfrom decimal import *\r\nfrom collections import *\r\nimport sys\r\nfrom typing import Collection\r\nfrom warnings import filters\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\ndef _int(): return int(input())\r\n\r\n\r\ndef solves():\r\n n=_int()\r\n lst=_list()\r\n lst = list(filter(lambda x: x>0,lst))\r\n c=list(Counter(lst).values())\r\n if any([i>2 for i in c]):\r\n print(-1)\r\n else:\r\n print (c.count(2))\r\n\r\n \r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ns=list(set(l))\r\nc=0\r\nx3=0\r\nfor i in range(len(s)):\r\n if(int(s[i])==0):\r\n i=i+1\r\n else:\r\n x=l.count(s[i])\r\n if(x>2):\r\n x3=1\r\n break\r\n else:\r\n if(x==2):\r\n c=c+1\r\n \r\nif(x3==1):\r\n print(\"-1\")\r\nelse:\r\n print(c)\r\n", "n = int(input())\r\nb = input().split() \r\nl1 = [int(x) for x in b if int(x) and b.count(x)>=2]\r\ndone =0\r\nfor x in l1:\r\n if l1.count(x)>2: done =1 \r\nif not done:\r\n print(len(set(l1)))\r\nelse:\r\n print(-1)\r\n\r\n", "##########################\r\n# @-21st June 2019.\r\n##########################\r\n\r\n################################################################################\r\n# Getting Problem Data from Codeforces.\r\nsecretaryCount = int(input())\r\ncallSessionIDs = list(map(int,input().split(' ')))\r\n# Making a Hashmap from callSessionIDs.\r\ncallsHashMap = {}\r\nfor i in range(secretaryCount):\r\n # Skipping in the event Secretary is not Active.\r\n if callSessionIDs[i] == 0: continue\r\n # Adding CallID to HashMap.\r\n key = callSessionIDs[i]\r\n if key in callsHashMap:\r\n callsHashMap[key] = callsHashMap[key]+1\r\n else: callsHashMap[callSessionIDs[i]] = 1\r\n# Counting secretary pairs.\r\npairCount,callIDCounts = 0,list(callsHashMap.values())\r\nfound,index = False,0\r\nwhile(not found and index<len(callIDCounts)):\r\n if callIDCounts[index]>2:\r\n found = not found\r\n elif callIDCounts[index] == 2:\r\n pairCount = pairCount+1\r\n index = index + 1\r\n# Determining Verdict.\r\nprint('-1') if found else print(pairCount)\r\n################################################################################\r\n\r\n ########################################\r\n # Programming-Credits-atifcppprogrammer.\r\n ########################################\r\n", "def main(n, nums):\r\n\tdata = {}\r\n\tRn = range(n)\r\n\tanswer = 0\r\n\r\n\tfor i in Rn:\r\n\t\titem = str(nums[i])\r\n\t\tif item!='0':\r\n\t\t\tif item not in data:\r\n\t\t\t\tdata[item]=0\r\n\t\t\tdata[item]+=1\r\n\r\n\tfor item in data.keys():\r\n\t\tval = data[item]\r\n\t\tif val==2:\r\n\t\t\tanswer+=1\r\n\t\telif val>2:\r\n\t\t\treturn -1\r\n\r\n\treturn answer\r\n\r\ndef init():\r\n\tn = int(input())\r\n\tnums = list(map(int, input().split()))\r\n\r\n\tprint(main(n, nums))\r\n\r\ninit()", "def spyke_talks(spyke):\r\n connected = 0\r\n sort_spyke = sorted(spyke)\r\n for i in range(1, len(sort_spyke)):\r\n if sort_spyke[i] != 0 and sort_spyke[i] == sort_spyke[i - 1]:\r\n connected += 1\r\n if i + 1 < len(spyke) and sort_spyke[i] == sort_spyke[i + 1]:\r\n connected = -1\r\n print(connected)\r\n return\r\n print(connected)\r\n\r\n\r\nn = input()\r\nspyke = list(map(int, input().split()))\r\nspyke_talks(spyke)\r\n", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/7/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\n\nN = int(input())\nA = [int(x) for x in input().split()]\nwc = collections.Counter([v for v in A if v != 0])\n\nif any([c > 2 for c in wc.values()]):\n print(-1)\nelse:\n print(len([c for c in wc.values() if c == 2]))", "def read_tokens():\n return input().strip().split(' ')\n\n\ndef read_ints():\n return [int(s) for s in read_tokens()]\n\n\nn = int(input())\narr = read_ints()\n\n\ndef solve(arr: list) -> int:\n n = len(arr)\n d = {}\n for el in arr:\n if el == 0:\n continue\n if el in d:\n d[el] += 1\n else:\n d[el] = 1\n cnt = 0\n for k, v in d.items():\n if v > 2:\n return -1\n if v == 2:\n cnt += 1\n return cnt\n\nprint(solve(arr))", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nk.sort()\r\nans = []\r\nm = 0\r\nc = 0\r\nfor i in k:\r\n if i == 0:\r\n continue\r\n if k.count(i) > 2:\r\n\r\n print(-1)\r\n exit()\r\n if k.count(i) == 2 and i not in ans:\r\n c+=1\r\n ans.append(i)\r\nprint(c)", "import collections\n\ninput()\ncounter = collections.Counter(map(int, input().split()))\ncounter.pop(0, None)\nv = counter.values()\nprint(list(v).count(2) if not v or max(v) <= 2 else -1)\n", "def cocktail_sort(a):\r\n n = len(a)\r\n swapped = True\r\n start = 0\r\n end = n-1\r\n while (swapped == True):\r\n swapped = False\r\n for i in range (start, end):\r\n if (a[i] > a[i + 1]) :\r\n a[i], a[i + 1]= a[i + 1], a[i]\r\n swapped = True\r\n if (swapped == False):\r\n break\r\n swapped = False\r\n end = end-1\r\n for i in range(end-1, start-1, -1):\r\n if (a[i] > a[i + 1]):\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n swapped = True\r\n start = start + 1\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nanswer = 0\r\n\r\ncocktail_sort(x)\r\n\r\nfor i in range(len(x)-1):\r\n\tif (i+2)>= n:\r\n\t\tif (x[i] == x[i+1]) and (x[i] != 0):\r\n\t\t\tanswer = answer + 1\r\n\t\t\ti = i+1\r\n\telse:\r\n\t\r\n\t\tif x[i] == x[i+1] and x[i] != 0 and x[i] !=x[i+2]:\r\n\t\t\tanswer = answer + 1\r\n\t\t\ti = i + 1\r\n\t\t\t\r\n\t\telif x[i] == x[i+1] and x[i] == x[i+2] and x[i]!= 0:\r\n\t\t\tanswer = -1\r\n\t\t\tbreak\r\n\t\r\nprint(answer)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=[*open(0)][1].split()\r\na=[a.count(x)for x in {*a}-{'0'}]\r\nprint([a.count(2),-1][max(a+[0])>2])", "n = int(input())\r\nd = list(map(int, input().split()))\r\ncalls = dict()\r\ninvalid = False\r\nc = 0\r\nfor i in range(n):\r\n if d[i] > 0:\r\n if d[i] in calls.keys() : calls[d[i]] += 1\r\n else : calls[d[i]] = 1\r\n if calls[d[i]] == 2:\r\n c += 1\r\n elif calls[d[i]] == 3:\r\n invalid = True\r\n break\r\n \r\nif invalid: print(-1)\r\nelse: print(c)", "# A. Spyke Talks\r\n\r\nfrom typing import Counter\r\n\r\n\r\nn = int(input())\r\nids = Counter(map(int, input().split()))\r\n\r\nans = 0\r\nfor key, value in ids.items():\r\n if key == 0:\r\n continue\r\n if value > 2:\r\n ans = -1\r\n break\r\n elif value == 2:\r\n ans += 1\r\n \r\nprint(ans)\r\n", "n=int(input())\r\nli=list(map(int,input().rstrip().split()))\r\nli.sort()\r\ncnt=0\r\n\r\ni=0\r\nwhile i<n :\r\n if li[i]==0:\r\n i+=1\r\n else:\r\n p=li[i]\r\n cnt1=1\r\n j=i+1\r\n while j<n and li[j]==p:\r\n cnt1 +=1\r\n j+=1\r\n #print(li[i],cnt1,cnt)\r\n if cnt1>2:\r\n print(-1)\r\n exit()\r\n elif cnt1==2:\r\n cnt+=1\r\n i=i+cnt1\r\n\r\nprint(cnt)", "from collections import Counter\n\nn, a = int(input()), (int(i) for i in input().split())\nc = Counter(i for i in a if i > 0)\nres = sum(v == 2 for _, v in c.items())\nres = res if all(v <= 2 for _, v in c.items()) else -1\nprint(res)\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nb=set((a))-{0}\r\nb=list(b)\r\nc=0\r\nd=0\r\nfor i in b:\r\n if(a.count(i)==2):\r\n c=c+1\r\n elif(a.count(i)>2):\r\n d=d+1\r\nif(d>0):\r\n print(-1)\r\nelse:\r\n print(c)\r\n", "from collections import Counter\r\n\r\nN, Answer = int(input()), 0\r\nX = Counter(list(map(int, input().split())))\r\nfor key in X:\r\n if key != 0:\r\n if X[key] == 2:\r\n Answer += 1\r\n elif X[key] > 2:\r\n print(-1)\r\n exit()\r\nprint(Answer)\r\n\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "import collections\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\ncnts = dict(collections.Counter(data))\r\n\r\nif any([True if cnts[i] > 2 else False for i in cnts if i != 0]):\r\n print(-1)\r\nelse:\r\n print(len([1 for i in cnts if i != 0 and cnts[i] == 2]))", "n=int(input())\n\nC={}\n\nL=list(map(int,input().split()))\n\nfor i in range(n):\n item=L[i]\n if(item in C):\n C[item].append(i)\n else:\n C[item]=[i]\nvalid=True\nans=0\nfor item in C:\n if(item==0):\n continue\n if(len(C[item])>2):\n valid=False\n ans=-1\n break\n if(len(C[item])==2):\n ans+=1\n\nprint(ans)\n", "n = int(input())\r\ncons = list(map(int, input().split()))\r\ncons.sort()\r\ni = 0\r\nwhile i < len(cons) and cons[i] == 0:\r\n i += 1\r\n\r\nr = 0\r\nif i != len(cons):\r\n old = 0\r\n for j in range(i, len(cons)):\r\n if cons[j] == old:\r\n r += 1\r\n if flag:\r\n r = -1\r\n break\r\n flag = True\r\n else:\r\n flag = False\r\n old = cons[j]\r\nprint(r)\r\n", "\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ncc = Counter(l)\r\n\r\ndel cc[0]\r\n\r\nvals = list(cc.values())\r\nif len(vals) > 0 and max(vals) > 2:\r\n\tprint(-1)\r\nelse:\r\n\tprint(vals.count(2))\r\n", "import sys\nmy_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nmy_file.readline()\nnums = [int(i) for i in my_file.readline().split(\" \")]\nspeaking = 0\nfor i in nums:\n if i > 0:\n if nums.count(i) == 2:\n speaking += 1\n elif nums.count(i) > 2:\n speaking = -1\n break\nif speaking > 0:\n print(int(speaking/2))\nelse:\n print(speaking)", "from collections import Counter\r\ninput();d=Counter([*map(int,input().split())]);pairs=0\r\nfor i in d:\r\n if i:\r\n if d[i]==2:pairs+=1\r\n elif d[i]>2:pairs=-1;break\r\nprint(pairs)" ]

[ "n, m = map(int, input().split())\r\npuzzles = sorted(list(map(int, input().split())))\r\nmin_diff = float('inf')\r\ndiff = 0\r\nfor a, _ in enumerate(range(m - n + 1 )):\r\n diff = puzzles[n-1] - puzzles[a]\r\n min_diff = min(min_diff, diff)\r\n # print(diff)\r\n\r\n n+=1\r\nmin_diff = min(min_diff, diff)\r\n\r\nprint(min_diff)\r\n\r\n", "n,m = map(int, input().split())\nlst = list(map(int, input().split()))\nlst.sort()\ni = 0\nj = n-1\nmn = 1000000000\nwhile j<m:\n mn = min(mn, lst[j]-lst[i])\n i += 1\n j += 1\nprint(mn)\n \t\t \t\t\t \t \t\t\t\t\t \t \t\t \t\t", "n,m = map(int,input().split())\r\nf = list(map(int,input().split()))\r\nf.sort()\r\nbest = 1000\r\nfor i in range(m-n+1):\r\n best = min(best , f[n+i-1] - f[i])\r\nprint(best)", "# ^^\r\n\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n ans = 1000000000000\r\n data = sorted(map(int, input().split()))\r\n for i in range(0, m-n+1):\r\n ans = min(ans, data[i+n-1] - data[i])\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n t = 1\r\n # t = int(input())\r\n for i in range(t):\r\n solve()", "n, m= map(int, input().split())\r\na= list(map(int, input().split()))\r\na.sort()\r\n\r\nif n == m:\r\n print(a[m-1]- a[0])\r\nelse:\r\n minn= a[m-1]\r\n i= 0\r\n j= n-1\r\n\r\n while j < m:\r\n u= a[j]- a[i]\r\n minn= min(u, minn)\r\n i += 1\r\n j += 1\r\n\r\n print(minn)", "def intmaker(list1):\r\n for i in range(len(list1)):\r\n list1[i]=int(list1[i])\r\n return list1\r\nnm=input().split(' ')\r\nn,m=intmaker(nm)\r\nlist_puzzle=input().split(' ')\r\npuzzle=intmaker(list_puzzle)\r\npuzzle=sorted(puzzle)\r\nmin=puzzle[n-1]-puzzle[0]\r\nfor i in range(1,(m-n)+1,1):\r\n if puzzle[i+n-1] - puzzle[i] < min:\r\n min = puzzle[i+n-1] - puzzle[i]\r\nprint(min)", "n,m = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nlst.sort()\r\nleast = lst[n-1] - lst[0]\r\nfor i in range(1,m-n+1):\r\n if lst[i+n-1] - lst[i] < least:\r\n least = lst[i+n-1] - lst[i]\r\nprint(least)", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nc.sort()\r\nd = 996\r\nfor i in range(b - a + 1):\r\n t = c[i + a - 1] - c[i]\r\n if t < d:\r\n d = t\r\nprint(d)\r\n", "n,m = map(int,input().split())\nl1 = list(map(int,input().split()))\nl1.sort()\n\na = 0\nsumf = 9999\nb = n - 1\n\nwhile b < m:\n if l1[b] - l1[a] < sumf:\n sumf = min(l1[b] - l1[a] , sumf)\n a += 1\n b += 1\n\nprint(sumf)", "n, m = map(int, input().split())\r\npieces = list(map(int, input().split()))\r\n\r\npieces.sort()\r\nbest=999999\r\nfor i in range (m-n+1):\r\n best=min(best, pieces[i+n-1]-pieces[i])\r\n\r\nprint(best)\r\n", "m, n = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nk = max(arr)\r\ni = 0\r\nwhile i <= n-m:\r\n if arr[i+m-1] - arr[i] < k:\r\n k = arr[i+m-1] - arr[i]\r\n i += 1\r\nprint(k)", "# n, m = map(int, input().split(' '))\r\n# li = list(map(int, input().split(' ')))\r\n# li.sort()\r\n# a = li[:n]\r\n# # print(a)\r\n# print(max(a)-min(a))\r\n\r\n# n, m = map(int, input().split(' '))\r\n# li = list(map(int, input().split(' ')))\r\n# a = []\r\n# li.sort()\r\n# print(li)\r\n# for i in range(0, len(li)-n+1):\r\n# a.append(li[i:n+i])\r\n# print(a)\r\n# val = 1000000000\r\n# for i in a:\r\n# if(max(i)-min(i) < val):\r\n# val = max(i)-min(i)\r\n# # print(val)\r\n# print(val)\r\n\r\nn, m = map(int, input().split(' '))\r\nli = list(map(int, input().split(' ')))\r\na = []\r\nval = 1000000000\r\nli.sort()\r\n# print(li)\r\nfor i in range(0, len(li)-n+1):\r\n if(max(li[i:n+i])-min(li[i:n+i]) < val):\r\n val = max(li[i:n+i])-min(li[i:n+i])\r\n # a.append(li[i:n+i])\r\n # if()\r\n# print(a)\r\n\r\n# for i in a:\r\n # if(max(i)-min(i) < val):\r\n # val = max(i)-min(i)\r\n # print(val)\r\nprint(val)\r\n", "n,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\ng=sorted(f)\r\nx=g[0:n]\r\ny=m-len(x)+1\r\nz=[]\r\nfor i in range(y):\r\n y=g[i:i+n]\r\n z.append(y[-1]-y[0])\r\nprint(min(z)) \r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))[:m]\r\nl.sort()\r\nmin1=2147483647\r\nfor i in range(m-n+1):\r\n diff=l[i+n-1]-l[i]\r\n if diff<min1:\r\n min1=diff\r\nprint(min1)\r\n \r\n", "m, n = map(int, input().split())\r\nk = sorted([int(i) for i in input().split()])\r\ntl = []\r\nfor i in range(n-m+1):\r\n tl.append(max(k[i:m+i])-min(k[i:m+i]))\r\nprint(min(tl))", "n,m=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nf.sort()\r\nl=[]\r\nfor j in range(m-n+1):\r\n z=f[n+j-1]-f[j]\r\n l.append(z)\r\nprint(min(l))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = 1e9\r\nfor i in range(k - n + 1):\r\n ans = min(ans, arr[i + n - 1] - arr[i])\r\nprint(ans)\r\n", "a = int(input().split()[0])\r\ndata = list(map(int, input().split()))\r\ndata.sort()\r\ndata_D = [data[i:i + a] for i in range(len(data) - a + 1)]\r\nk = sorted(data_D, key=lambda x: x[-1] - x[0])[0]\r\nprint(k[-1] - k[0])", "n,m = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nq = a[n-1:]\r\nw = a[:-n+1]\r\nprint(min(map(lambda x,y:x-y,q,w)))", "n,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\nl=[]\r\nfor i in range(m-n+1):\r\n l.append(li[i+n-1]-li[i])\r\nprint(min(l))", "def find_min_difference(n, m, puzzle_pieces):\r\n puzzle_pieces.sort() \r\n min_difference = float('inf')\r\n\r\n for i in range(m - n + 1):\r\n min_difference = min(min_difference, puzzle_pieces[i + n - 1] - puzzle_pieces[i])\r\n\r\n return min_difference\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n puzzle_pieces = list(map(int, input().split()))\r\n result = find_min_difference(n, m, puzzle_pieces)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m = list(map(int,input().split()))\r\nm1 = sorted(list(map(int,input().split())))\r\nq=[]\r\nfor i in range(m-n+1):\r\n q.append(m1[i+n-1] - m1[i])\r\nprint(min(q))", "a, b = input().split(), input().split()\r\nuch = int(a[0])\r\npaz = int(a[1])\r\nb = [int(i) for i in b]\r\nb.sort()\r\nmin = 1000000000000\r\nfor i in range(uch - 1, paz):\r\n if b[i] - b[i - uch + 1] < min:\r\n min = b[i] - b[i - uch + 1]\r\nprint(min)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=1001\r\nif m==2:\r\n print(a[1]-a[0])\r\nelse:\r\n for i in range(m-n+1):\r\n k=a[i+n-1]-a[i]\r\n if k<ans:\r\n ans=k\r\n print(ans)", "m, n = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nlst =sorted(l)\r\nval =1000\r\nfor i in range(n-m+1):\r\n\td = lst[i+m-1] - lst[i]\r\n\tif d <val:\r\n\t\tval = d\r\nprint(val)", "n , m = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nleast = l[n-1] - l[0]\r\nfor i in range(m-n + 1):\r\n min = l[i+n-1] - l[i]\r\n if min <= least : \r\n least = min\r\nprint(least)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=100000\r\nfor k in range(m-n+1):\r\n b=min(b,(a[k+n-1]-a[k]))\r\nprint(b)", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\ndiff = 996\r\n\r\nf.sort()\r\nfor i in range(n-1, m):\r\n a = f[i]-f[i-(n-1)]\r\n if a<diff:\r\n diff = a\r\n\r\nprint(diff)", "n,m = map(int, input().split())\r\n\r\nxs = sorted(map(int, input().split()))\r\n\r\nres = float('inf')\r\n\r\nfor i in range(m-n+1):\r\n res = min(res, xs[i+n-1] - xs[i])\r\n \r\nprint(res)", "I = lambda: map(int, input().split())\r\nn, m = I()\r\na = sorted(I())\r\nsm = 0\r\nprint(min(a[i + n - 1] - a[i] for i in range(m - n + 1)))\r\n", "n,m=[int(x) for x in input().split()]\r\nL=[int(x) for x in input().split()]\r\nL.sort()\r\ni=0\r\nM=[]\r\nwhile (i+n<=m):\r\n M.append(max(L[i:i+n])-min(L[i:i+n]))\r\n i+=1\r\nprint(min(M))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jan 24 13:22:03 2023\r\n\r\n@author: amill212\r\n\"\"\"\r\n\r\n#Problem 377A Codeforces: Puzzles\r\nn, m = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\n\r\nsorted_sizes = sorted(sizes)\r\nend = m-n\r\ndifferences = []\r\nfor i in range(end+1):\r\n window = sorted_sizes[i:i+n]\r\n differences.append(window[-1] - window[0])\r\n\r\nprint(min(differences))\r\n", "n,m = map(int,input().split())\r\ntc = list(map(int,input().split()))\r\ntc.sort()\r\nmi = tc[n-1] - tc[0]\r\nfor i in range(1,m-n+1):\r\n if(tc[i+n-1] - tc[i] < mi):\r\n mi = tc[i+n-1] - tc[i]\r\nprint(mi)\r\n \r\n\r\n\r\n", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort(reverse=True)\r\ndiff=[]\r\ni=0\r\nwhile(i+(n-1)<m):\r\n d=abs(lst[i]-lst[i+(n-1)])\r\n diff.append(d)\r\n i+=1\r\nprint(min(diff))", "b,a=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\ni=b-1\r\nm=10**6\r\nwhile i<a:\r\n m=min(m,l[i]-l[i-b+1])\r\n i+=1\r\nprint(m)", "a, b = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nc = float('inf')\r\nfor i in range(b-a+1):\r\n dif = max(l[i:i+a]) - min(l[i:i+a])\r\n if c > dif:\r\n c = dif\r\nprint(c)\r\n", "A=input().split()\r\nB=input().split()\r\nn=int(A[0])\r\nm=int(A[1])\r\nM=[]\r\nfor x in B:\r\n M.append(int(x))\r\nM.sort()\r\nN=[]\r\nk=1\r\nfor x in range(m-n+1):\r\n N.append(M[x+n-1]-M[x])\r\n if M[x+n-1]-M[x]==0:\r\n k=0\r\nif N:\r\n if k==1:\r\n print(min(N))\r\n elif k==0:\r\n print(k)\r\nelse:\r\n print(max(M)-min(M))", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\n\r\nf.sort() # Sort the list of puzzle sizes\r\n\r\nbest = float(\"inf\") # Set initial best difference to infinity\r\n\r\nfor k in range(m - n + 1):\r\n diff = f[k+n-1] - f[k] # Calculate the difference for the current k\r\n best = min(best, diff) # Update best if the current difference is smaller\r\n\r\nprint(best)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = float('inf')\n#print(a)\nx = [a[i:i+n] for i in range(m-n+1)]\nfor i in x:\n if i[-1] - i[0] < ans:\n ans = i[-1] - i[0]\nprint(ans)", "n, m = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli.sort()\r\ni = 0\r\nj = n-1\r\ntmp = 0\r\nres = 99999999999999\r\nwhile j != m:\r\n tmp = abs(li[i]-li[j])\r\n res = min(tmp,res)\r\n i += 1\r\n j += 1\r\nprint(res)", "w, N = map(int, input().split())\nS = sorted(list(map(int, input().split())))\n\nans = S[-1] - S[0]\nfor i in range(len(S) - w + 1):\n ans = min(S[i + w - 1] - S[i], ans)\nprint(ans)", "n,k = map(int,input().split())\r\nnumbers = list(map(int,input().split()))\r\nnumbers = sorted(numbers)\r\nbest=0\r\nli=[]\r\ni=0\r\nwhile i<=len(numbers)-n:\r\n best = numbers[i+n-1]-numbers[i]\r\n li.append(best)\r\n i+=1\r\nprint(min(li))", "from math import inf\r\nn, m = map(int, input().split())\r\nlst = sorted(map(int, input().split()))\r\nres = inf\r\nfor i in range(m-n+1):\r\n res = min((res, lst[i+n-1]-lst[i]))\r\nprint(res)", "stud, puz = map(int, input().split())\nlist = [int(x) for x in input().split()][:puz]\nlist.sort()\n# print(list)\nminDif = 1000\n# print(puz - stud + 1)\nfor i in range(puz - stud + 1):\n\tcurDif = list[stud + i - 1] - list[i]\n\t# print(list[stud + i - 1], end = ' ')\n\t# print(list[i])\n\tif curDif < minDif:\n\t\tminDif = curDif\nprint(minDif)\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\na = list(map(int,input().split()))\r\na.sort()\r\nk = max(a)\r\nfor i in range(m-n+1):\r\n x = min(a[i:i+n])\r\n y = max(a[i:i+n])\r\n if abs(x-y) < k:\r\n k = abs(x-y)\r\nprint(k)\r\n", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=[]\r\nfor i in range(m-n+1):\r\n k.append(l[i+n-1]-l[i])\r\nprint(min(k))", "k,n = list(map(int,input().split()))\r\npuz = list(map(int,input().split()))\r\npuz.sort()\r\nmini = float('inf')\r\nstart = 0\r\nend = k\r\nlength = len(puz)+1\r\nwhile end<length:\r\n ar = puz[start:end]\r\n mini = min(mini,(max(ar)-min(ar)))\r\n start+=1\r\n end+=1\r\nprint(mini)", "n, m=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\na.sort()\r\nl=0\r\nr=n-1\r\nmint=a[-1]\r\nwhile r!=len(a):\r\n if mint>a[r]-a[l]:\r\n mint=a[r]-a[l]\r\n r+=1\r\n l+=1\r\nprint(mint)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ndiff=[]\r\nfor i in range(m):\r\n\r\n if i+(n-1)<=m-1:\r\n\r\n diff.append(l[i+(n-1)]-l[i])\r\n\r\n else:break\r\n\r\nprint(min(diff))\r\n", "n,m=map(int,input().split())\r\nlist=list(map(int,input().split()))\r\nlist.sort()\r\nk=[]\r\nfor i in range(0,m-n+1):\r\n l=[]\r\n l=list[i:i+n]\r\n k.append(l[n-1]-l[0])\r\nprint(min(k))", "n, m = map(int, input().split())\r\npuzzles = sorted([int(x) for x in input().split()])\r\n\r\nA_minus_B = puzzles[n-1] - puzzles[0]\r\n\r\nfor i, p in enumerate(puzzles[:len(puzzles) - n+1]):\r\n values = puzzles[i:i+n]\r\n difference = max(values) - min(values)\r\n A_minus_B = difference if difference < A_minus_B else A_minus_B\r\n\r\nprint(A_minus_B)", "n, _ = map(int, input().split())\r\n\r\nn-=1\r\nmin = None\r\npuzzles = list(map(int, input().split()))\r\npuzzles.sort()\r\n\r\nfor i in range(len(puzzles) - n):\r\n if min == None or min > puzzles[i + n] - puzzles[i]:\r\n min = puzzles[i+n] - puzzles[i]\r\n\r\nprint(min)", "n, m = map(int, input().split())\r\npuzzle_sizes = list(map(int, input().split()))\r\n\r\npuzzle_sizes.sort() \r\n\r\nmin_diff = float('inf') \r\n\r\nfor i in range(m - n + 1):\r\n curr_diff = puzzle_sizes[i + n - 1] - puzzle_sizes[i] \r\n min_diff = min(min_diff, curr_diff) \r\nprint(min_diff)\r\n", "n, m = map(int, input().split())\r\nmas = sorted([int(el) for el in input().split()])\r\n\r\nans = mas[-1] - mas[0]\r\nfor i in range(m - n + 1):\r\n ans = min(mas[i + n - 1] - mas[i], ans)\r\nprint(ans)", "a,b=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nd=lst[a-1]-lst[0]\r\nfor i in range(a,b):\r\n e=lst[i]-lst[i-a+1]\r\n if e<d:\r\n d=e\r\nprint(d)", "x,y = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl =sorted(l)\r\nm =1000\r\nfor i in range(y-x+1):\r\n\td = l[i+x-1] - l[i]\r\n\tif d <m:\r\n\t\tm =d\r\nprint(m)\r\n", "entradasnm = input().split()\r\nn = int(entradasnm[0])\r\nm = int(entradasnm[1])\r\n\r\ndatosF = input().split()\r\nF = []\r\n\r\nfor i in datosF:\r\n F.append(int(i))\r\n\r\nF.sort()\r\n\r\nx=0\r\ny=n\r\nj=F[y-1]-F[x]\r\nwhile(x <= (len(F)-n)):\r\n\r\n t=F[y-1]-F[x]\r\n if(t<=j):\r\n j=t \r\n x=x+1\r\n y=y+1\r\n \r\nprint(j)\r\n", "n,m = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nprint(min(l[i+n-1]-l[i] for i in range(m-n+1)))", "n, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns = sorted(s, reverse=True)\r\nminim = None\r\nfor i in range(m-n+1):\r\n if minim is None or minim >= (s[i] - s[i + n - 1]):\r\n minim = (s[i] - s[i + n - 1])\r\nprint(minim)", "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n k,n=[int(i) for i in input().split()]\r\n l=sorted([int(i) for i in input().split()])\r\n print(min([l[i]-l[i-k+1] for i in range(k-1,n)]))\r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\n\r\nf.sort()\r\nans = f[-1] - f[0]\r\n\r\nfor i in range(n-1, m):\r\n ans = min(f[i]-f[i-n+1], ans)\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\npuzzle_pieces = list(map(int, input().split()))\r\n\r\n# Sort the list of puzzle piece quantities in ascending order\r\npuzzle_pieces.sort()\r\n\r\nmin_diff = float('inf')\r\n\r\n# Iterate through the sorted list of puzzle piece quantities\r\nfor i in range(m - n + 1):\r\n diff = puzzle_pieces[i + n - 1] - puzzle_pieces[i]\r\n min_diff = min(min_diff, diff)\r\n\r\nprint(min_diff)\r\n", "a=list(map(int,input().rstrip().split()))\r\nn=a[0]\r\nm=a[1]\r\nlis=list(map(int,input().rstrip().split()))\r\nlis.sort()\r\nj=n-1\r\ns=0\r\nmi=lis[j]-lis[0]\r\nwhile j<m:\r\n c=lis[j]-lis[s]\r\n if c<mi:\r\n mi=c\r\n s=s+1\r\n j=j+1\r\nprint(mi)\r\n", "i = lambda: list(map(int, input().split()))\r\nn, m = i()\r\na = sorted(i())\r\nminimum = float('inf')\r\nfor i in range(m-n+1):\r\n\tminimum = min(minimum, max(list(map(lambda x: abs(a[i]-x), a[i:n+i]))))\r\nprint(minimum)\r\n", "# Read input\r\nn, m = map(int, input().split())\r\npuzzle_sizes = sorted(map(int, input().split()))\r\n\r\nmin_difference = float('inf')\r\nleft, right = 0, n - 1\r\n\r\nwhile right < m:\r\n current_difference = puzzle_sizes[right] - puzzle_sizes[left]\r\n min_difference = min(min_difference, current_difference)\r\n left += 1\r\n right += 1\r\n\r\nprint(min_difference)\r\n\r\n", "n, m = map(int, input().split())\r\npieces = list(map(int, input().split()))\r\npieces.sort()\r\nmin_diff = float('inf')\r\nfor i in range(n, m+1):\r\n diff = pieces[i-1] - pieces[i-n]\r\n if diff < min_diff:\r\n min_diff = diff\r\nprint(min_diff)\r\n", "n, m = map(int, input().split())\r\npuzzle_pieces = list(map(int, input().split()))\r\npuzzle_pieces.sort()\r\n\r\nminDifference = float('inf')\r\nfor i in range(m - n + 1):\r\n currentDifference = puzzle_pieces[i + n - 1] - puzzle_pieces[i]\r\n minDifference = min(minDifference, currentDifference)\r\n\r\nprint(minDifference)\r\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 Puzzles():\r\n n,m = invr()\r\n pieceSequence = inlt()\r\n pieceSequence_sorted = sorted(pieceSequence)\r\n\r\n firstPtr = 0\r\n secondPtr = firstPtr + (n-1)\r\n smallestDiff = pieceSequence_sorted[secondPtr] - pieceSequence_sorted[firstPtr]\r\n # print(smallestDiff)\r\n # print(pieceSequence_sorted)\r\n\r\n while secondPtr <= (m-1):\r\n currentDiff = pieceSequence_sorted[secondPtr] - pieceSequence_sorted[firstPtr]\r\n if currentDiff < smallestDiff:\r\n smallestDiff = currentDiff\r\n firstPtr += 1\r\n secondPtr = firstPtr + (n-1) \r\n \r\n print(smallestDiff)\r\n return\r\n\r\nPuzzles()", "n, m = map(int, input().split())\r\nl = sorted(map(int, input().split()))\r\n \r\nv = float('inf')\r\nfor i in range(n-1, m):\r\n diff = l[i] - l[i-n+1]\r\n v = min(v, diff)\r\n \r\nprint(v)", "n,m=tuple(map(int,input().split()))\r\nlst= list(map(int,input().split()))\r\nlst.sort()\r\nbest=lst[-1]\r\nfor i in range(0,m-n+1):\r\n best=min(best,lst[i+n-1] - lst[i])\r\nprint(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\r\n\r\n\r\n\r\n\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 = list(map(int,input().split()))\r\na.sort()\r\nb = []\r\nfor i in range(m-n+1):\r\n c = a[i+n-1]-a[i]\r\n b.append(c)\r\nprint(min(b))", "n, m = map(int, input().split()) \r\na = list(map(int, input().split())) \r\na.sort() \r\nmin_diff = 100000000\r\n\r\nfor i in range(m-n+1): \r\n min_diff = min(min_diff, a[i+n-1]-a[i])\r\n\r\nprint(min_diff)", "s = int(input().split(\" \")[0])\r\np = list(map(int, input().split(\" \")))\r\np.sort()\r\nd = p[-1] - p[0]\r\nfor i in range(len(p)-s+1):\r\n d = min(d, p[i+s-1]-p[i])\r\nprint(d)\r\n", "n,m=map(int,input().split())\r\nsp=[int(i) for i in input().split()]\r\nsp.sort()\r\nmn=1001\r\nfor k in range(m-n+1):\r\n mn=min(mn,sp[k+n-1]-sp[k])\r\nprint(mn)", "ilosc,dl = input().split()\r\nilosc = int(ilosc)\r\ndl = int(dl)\r\npuzzle = input().split()\r\nfor i in range(dl):\r\n puzzle[i] = int(puzzle[i])\r\npuzzle.sort()\r\n\r\n# 0 1 2 3 4\r\nroznica = 10000\r\nfor i in range(dl - ilosc + 1):\r\n roznica = min(abs(puzzle[i] - puzzle[i + ilosc - 1]),roznica)\r\nprint(roznica)", "n, m = map(int, input().split())\r\npuzzle_sizes = list(map(int, input().split()))\r\npuzzle_sizes.sort()\r\nmin_difference = float('inf')\r\nfor i in range(m - n + 1):\r\n selected_puzzles = puzzle_sizes[i:i+n]\r\n difference = selected_puzzles[-1] - selected_puzzles[0]\r\n min_difference = min(min_difference, difference)\r\nprint(min_difference)\r\n", "n,p=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\n\r\narr.sort()\r\ncurr_best=float('inf')\r\nfor index in range(0,p-n+1):\r\n mini=arr[index]\r\n maxi=arr[index+n-1]\r\n curr_best=min(curr_best,maxi-mini)\r\nprint(curr_best)\r\n \r\n ", "import math\r\ndef newyearpresent(n,s):\r\n alist=[int(d) for d in s.split()]\r\n alist.sort()\r\n blist=[]\r\n i=0\r\n while i+n<=len(alist):\r\n blist.append(alist[i+n-1]-alist[i])\r\n i+=1\r\n return min(blist)\r\nd=input()\r\nalist=[int(x) for x in d.split()]\r\ns=input()\r\nprint(newyearpresent(alist[0],s))\r\n", "(children, puzzle_count) = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\npuzzles.sort()\r\n\r\ni = 0\r\nmin_diff = 100000\r\nwhile i <= puzzle_count-children:\r\n max_am = max(puzzles[i:i+children])\r\n min_am = min(puzzles[i:i+children])\r\n\r\n if max_am-min_am < min_diff:\r\n min_diff = max_am-min_am\r\n i += 1\r\nprint(min_diff)", "n, m = list(map(int, input().split()))\npieces = sorted(list(map(int, input().split())))\nmin_diff = 100000000000000000000000\nfor i in range(m-n+1):\n diff = pieces[i+n-1] - pieces[i]\n min_diff = min(min_diff,diff)\nprint(min_diff)\n\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmn = float('inf')\r\na.sort()\r\ni = 0\r\nj = n-1\r\nwhile j < m:\r\n mn = min(mn, a[j] - a[i])\r\n i += 1\r\n j += 1\r\n\r\nprint(mn if mn != float('inf') else 0)", "# https://codeforces.com/problemset/problem/337/A\r\n\r\ndef main():\r\n student, puzzle = map(int, input().split(' '))\r\n A = sorted(list(map(int, input().split(' '))))\r\n diff = 10 ** 10\r\n for i in range(0, len(A) - student + 1):\r\n new_diff = A[i + student - 1] - A[i]\r\n if diff > new_diff:\r\n diff = new_diff\r\n print(diff)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=list(map(int,input().split(' ')))\r\nf=list(map(int,input().split(' ')))\r\nf.sort()\r\nmnsf=f[n-1]-f[0]\r\nmn=mnsf\r\nfor i in range(n,m):\r\n mnsf=f[i]-f[i-n+1]\r\n mn=min(mn,mnsf)\r\n if mn==0:\r\n break\r\nprint(mn)", "n,m=map(int,input().split())\r\na=sorted([int(x) for x in input().split()])\r\nbig=a[n-1]-a[0]\r\nfor i in range(m-n+1): \r\n if a[i+n-1]-a[i]<big:big=a[i+n-1]-a[i] # noqa: E701\r\nprint(big)", "if __name__ == '__main__':\n n, m = map(int, input().split())\n f = list(map(int, input().split()))\n \n f.sort()\n aux = f[n-1]-f[0]\n for i in range(m-n+1):\n aux = min(f[i+n-1]-f[i], aux)\n print(aux)\n\t\t\t\t \t\t \t \t \t\t \t \t \t\t\t \t \t", "z = []\r\nz[:] = map(int,input().split())\r\ny = []\r\ny[:] = map(int, input().split())\r\ny.sort()\r\nsumm = []\r\nfor i in range(z[1]-z[0] + 1):\r\n summ.append(y[z[0]-1 + i] - y[i])\r\n\r\nsumm.sort()\r\nprint(summ[0])", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\npuzzles.sort() # Sort the puzzle sizes in ascending order\r\n\r\nmin_difference = float('inf') # Initialize the minimum difference with a large value\r\n\r\nfor i in range(n-1, m):\r\n difference = puzzles[i] - puzzles[i - n + 1]\r\n min_difference = min(min_difference, difference)\r\n\r\nprint(min_difference)\r\n", "n, m = map(int, input().split())\r\npuzzle_pieces = list(map(int, input().split()))\r\n\r\npuzzle_pieces.sort()\r\n\r\nmin_diff = float('inf')\r\n\r\nfor i in range(m - n + 1):\r\n max_pieces = puzzle_pieces[i + n - 1] \r\n min_pieces = puzzle_pieces[i] \r\n diff = max_pieces - min_pieces\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)\r\n", "n, m = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nmin_diff = float('inf')\r\nfor i in range(m-n+1):\r\n diff = a[i+n-1] - a[i]\r\n if diff < min_diff:\r\n min_diff = diff\r\nprint(min_diff)\r\n", "application=lambda:map(int,input().split());\r\n\r\nanalaysis,arrow=application();\r\n\r\no=sorted(application());\r\n\r\nprint(min(p-k for k,p in zip(o,o[analaysis-1:])))", "import math\r\ndef readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\n\r\nn, m = readarray(int)\r\npuzzles = readarray(int)\r\npuzzles.sort()\r\n\r\np1, p2 = 0, n-1\r\nminDif = float(\"inf\")\r\n\r\n\r\nwhile p2 < m:\r\n dif = puzzles[p2] - puzzles[p1]\r\n minDif = min(minDif, dif)\r\n\r\n p1 += 1\r\n p2 += 1\r\n\r\nprint(minDif)", "I= lambda:map(int,input().split()); c,m=I(); b=sorted(I());print(min(y-z for z,y in zip( b, b[c-1:])) )", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\n\r\nf.sort() # Сортируем пазлы по возрастанию\r\n\r\nmin_diff = float('inf') # Инициализируем минимальную разницу\r\n\r\nleft = 0\r\nright = n - 1\r\n\r\nwhile right < m:\r\n diff = f[right] - f[left] # Вычисляем текущую разницу\r\n min_diff = min(min_diff, diff) # Обновляем минимальную разницу\r\n left += 1\r\n right += 1\r\n\r\nprint(min_diff) # Выводим минимальную разницу", "from functools import lru_cache\r\nlru_cache(maxsize=None)\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\noutput=a[n-1]-a[0]\r\nfor i in range(1,m-n+1):\r\n if a[i+n-1]-a[i]<output:\r\n output=a[i+n-1]-a[i]\r\nprint(output)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 28 01:21:41 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\np1=sorted(p,reverse=True)\r\nminimum=p1[0]\r\nfor i in range(n[1]-n[0]+1):\r\n for j in range(i+n[0]-1,n[1]):\r\n minimum=min((p1[i]-p1[j]),minimum)\r\n\r\nprint(minimum)", "n,m= map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nans= int(1e9)\r\nans2=0\r\ncnt= 0\r\nfor i in range(m-n+1):\r\n for j in range(i,min(m,n+i)):\r\n for l in range(i,min(m,n+i)):\r\n if j!=l:\r\n cnt = max(cnt,abs(a[j]-a[l]))\r\n #print(abs(a[j]-a[l]) ,end = ' ')\r\n #print()\r\n ans2 = max(cnt,ans2)\r\n cnt = 0\r\n ans =min(ans,ans2)\r\n ans2= 0\r\nprint(ans)\r\n ", "N, M = map(int, input().split())\r\nL = sorted(list(map(int, input().split())))\r\nA = 1000\r\nfor i in range(M-N+1):\r\n A = min(A, L[i+N-1] - L[i])\r\nprint(A)", "n , m = [int(x) for x in input().split()]\r\nf = [int(x) for x in input().split()]\r\nf.sort()\r\ndif = []\r\nfor i in range(0,m - n + 1):\r\n dif.append(f[i+n-1] -f[i])\r\nprint(min(dif))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nbest = float('inf')\r\nfor i in range(len(a) - n + 1):\r\n best = min(best, a[i + n - 1] - a[i])\r\nprint(best)\r\n", "n, m = map(int, input().split(' '))\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\na = sorted(a)\r\n# print(a)\r\n\r\nm1 = a[n-1] - a[0]\r\nfor i in range(1, m-n+1):\r\n m1 = min(a[n+i-1] - a[i], m1)\r\n \r\nprint(m1)\r\n ", "n, m = map(int, input().split())\r\npuzzles = [int(x) for x in input().split()]\r\npuzzles.sort()\r\n\r\nbest = float('inf')\r\nfor i in range(m - n + 1):\r\n difference = puzzles[i + n - 1] - puzzles[i]\r\n best = min(best, difference)\r\nprint(best)\r\n", "n,m=map(lambda x: int(x), input().split())\r\narr=sorted(list(map(lambda x: int(x), input().split())))\r\nminn=500000\r\nfor i in range(n-1,m):\r\n minn=min(minn,arr[i]-arr[i-n+1])\r\nprint(minn)", "n,m = list(map(int, input().split(\" \")))\r\ns = sorted(list(map(int, input().split(\" \"))))\r\nrs = s[n-1]-s[0]\r\nfor i in range(0, m-n+1):\r\n k = s[i+n-1]-s[i]\r\n if k < rs:\r\n rs = k\r\nprint(rs)\r\n", "a = input().split(\" \")\r\nn = int(a[0])\r\nm = int(a[1])\r\nar = sorted(list(map(int, input().split())))#sắp xếp\r\nans = 1001 #(4 <= fi <= 1000)\r\nfor i in range(m-n+1):\r\n ans = min(ans, (ar[i+n-1]-ar[i])) #tìm khoảng cách bé nhất\r\nprint(ans)", "n, m = map(int, input().split())\nf = sorted(map(int, input().split()))\nprint(min(f[i + n - 1] - f[i] for i in range(m - n + 1)))\n", "s=input().split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nmi=9999\r\nfor i in range(m-n+1):\r\n\tif l[n-1+i]-l[i]<mi:\r\n\t\tmi=l[n-1+i]-l[i]\r\nprint(mi)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\na=0\r\nb=n-1\r\nma=100000\r\nwhile m>b:\r\n if l[b]-l[a]<ma:\r\n ma=l[b]-l[a]\r\n a+=1\r\n b+=1\r\nprint(ma)", "n,t=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nm=1000\r\nfor i in range(t-n+1):\r\n m=min(m,s[n+i-1]-s[i])\r\nprint(m)\r\n", "n, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\np.sort()\r\nmd = p[n-1]-p[0]\r\nx = m-n+1\r\nfor i in range(x):\r\n d = p[i+n-1]-p[i]\r\n if d<md:\r\n md = d\r\nprint(md)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nm1=l[0]-l[-1]\r\nfor i in range(0,m-n+1):\r\n m1=min(m1,(l[i]-l[i+n-1]))\r\nprint(m1)", "a,b = list(map(int,input().split()))\r\nc = sorted(list(map(int,input().split())))\r\ncount = 0\r\ndict_max = c[0:a]\r\ndicti = []\r\n#print(c)\r\n\r\nwhile count < len(c)-a+1:\r\n dicti = c[count:a+count]\r\n #print(dicti)\r\n if dicti[-1] - dicti[0] < dict_max[-1] - dict_max[0]:\r\n dict_max = dicti\r\n count += 1\r\nprint(dict_max[-1] - dict_max[0])", "n, m = map(int, input().split())\r\nl= list(map(int, input().split()))\r\nl.sort()\r\nr= float('inf')\r\nfor i in range(m - n + 1):\r\n r= min(l[i + n - 1] - l[i], r)\r\nprint(r)\r\n", "x,y=list(map(int,input().split()))\r\nz=sorted(list(map(int,input().split())))\r\na=[]\r\ni=0\r\nif y%2==0:\r\n while True:\r\n a.append(z[i+x-1]-z[i])\r\n i=i+1\r\n if i+x>y:\r\n break\r\nelse:\r\n while True:\r\n a.append(z[i+x-1]-z[i])\r\n i=i+1\r\n if i+x>y:\r\n break\r\nprint(min(a))", "l1=[int(i) for i in input().split(\" \")]\r\nl2=[int(i) for i in input().split(\" \")]\r\n\r\nl2.sort()\r\n\r\nn=l1[0]\r\nm=l1[1]\r\ncount=None\r\nfor i in range (m-n+1):\r\n diff=l2[i+n-1]-l2[i]\r\n if count==None :\r\n count=diff\r\n \r\n\r\n else :\r\n if diff< count :\r\n count=diff\r\nprint(count)", "n,m=input().split()\r\npuzzle0=input().split()\r\nn= int(n)\r\nm= int(m)\r\npuzzle=sorted(list(map(int,puzzle0)))\r\ndiffernce=[]\r\n#print(puzzle)\r\nnew_ind=n-1\r\nfor i in puzzle:\r\n big=puzzle[new_ind]\r\n diff=big-i\r\n differnce.append(diff)\r\n #print(big)\r\n if new_ind+1==m :\r\n break\r\n else:\r\n new_ind+=1\r\n#print(differnce)\r\nprint(min(differnce))\r\n", "n, m = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nx=[]\r\nfor i in range(m-n+1):\r\n x.append((a[i+n-1]-a[i]))\r\nprint(min(x))", "def main():\r\n line=input()\r\n line=line.split()\r\n line2=input()\r\n line2=line2.split()\r\n n=int(line[0])\r\n m=int(line[1])\r\n z=[]\r\n y=1000\r\n for c in line2:\r\n z.append(int(c))\r\n z.sort()\r\n for i in range(m-n+1):\r\n x=z[i:i+n]\r\n min=x[-1]-x[0]\r\n if min<y:\r\n y=min\r\n print(y)\r\nmain()", "# Read input\r\nn, m = map(int, input().split())\r\npuzzle_pieces = list(map(int, input().split()))\r\n\r\n# Sort the puzzles in ascending order\r\npuzzle_pieces.sort()\r\n\r\n# Initialize the minimum difference with a large value\r\nmin_difference = float('inf')\r\n\r\n# Iterate over the puzzles to find the least possible difference\r\nfor i in range(m - n + 1):\r\n current_difference = puzzle_pieces[i + n - 1] - puzzle_pieces[i]\r\n min_difference = min(min_difference, current_difference)\r\n\r\n# Print the least possible difference\r\nprint(min_difference)\r\n", "\n\ndef solve():\n s,n = map(int, input().split())\n p = list(sorted(map(int, input().split())))\n mindiff = p[s-1] - p[0]\n for i in range(s-1,n):\n mindiff = min(mindiff, p[i] - p[i-s+1])\n \n print(mindiff)\n\n \nfor i in range(1):\n solve()", "\n# s = 'a'\n# s1 = '!'\n# s2 = 'a!'\n# print(ord(s), ord(s1))\n# print(ord('b'))\n# print(ord('A'))\n# print(ord('0'))\n# # for i in range(32, 128):\n# # print(i, chr(i))\n\n# c = 'p'\n# c = chr(ord(c) - 32)\n# print(c)\n\n#s = 'v4t2g45gt3b356gt4g45g45g4'\n'''\ns = input()\ns1 = '!!@23'\nprint(s + s1)\nprint(s1 * 3)\nprint(len(s))\ncnt = 0\nfor i in range(len(s)):\n if (s[i] == 'g'):\n cnt += 1\n print(s[i], end = ' ')\nprint()\nprint('g', cnt)\n'''\n\n# a = input()\n# print(a[0], a[-1])\n# print(a.lower())\n# print(a.upper())\n# print(a[2:6])\n# print(a[:6])\n# print(a[6:])\n# print(a[:7:2])\n# print(a[3::2])\n# print(a[7:1:-1])\n# print(a[6::-1])\n# print(a[::-1])\n\n# b = input()\n# print(b.find('a'), b.find('abc'))\n# print(b.rfind('b'), b.rfind('abc'))\n# print(b.replace('a', 'A'))\n# print(b.replace('a', ''))\n\n# s = 'abaya a hvhvb huhu jopp'\n# print(s.split())\n# s1 = 'abcd, cfece, ecr, fce'\n# print(s1.split(', '))\n\n#import string\n#print(string.punctuation)\n\n#k1 = a.find('h')\n#k2 = a.rfind('h')\n#k1 += 1\n#k2 += 1\n\n#n = (a[k1:k2])\n#n = n.replace('h', 'H')\n\n#print(a[:k1], end = '')\n#print(n, end = '')\n#print(a[k2:])\n\n\n# a = [4, 6, 'ghjh', 23]\n# print(a[0])\n# print(a[-1])\n# print(a[1:3])\n# print(len(a))\n# a.append(678)\n# a += [4, 'j', 3]\n# print(a)\n# a.pop()\n# print(a)\n\n# s = '56 234 67 323 889'\n# a = s.split()\n# a = list(map(int, a))\n# print(a)\n# print(*a, sep = ', ')\n\n# a = list(map(int, input().split()))\n# print(a)\n# print(a.count(7))\n# print(a.index(7))\n# for i in range(len(a)):\n# print(a[i])\n\n# s = set()\n# s.add(5)\n# s.add(10)\n# s.add(12)\n# s.add(5)\n# s.add(12)\n# s.add(101)\n# s.add(9)\n# print(s)\n# a = list(s)\n# print(a)\n# print(a[0])\n# s.remove(5)\n# print(s)\n# s1 = {5, 6, 9, 14, 101}\n# print(s1)\n# print('intersection:', s & s1)\n# print('union:', s | s1)\n# print('difference:', s - s1)\n# print('exclusive or:', s ^ s1)\n\n# if (5 in s1):\n# print('yes 5')\n# else:\n# print('no 5')\n# print(len(s1))\n# a = [4, 5, 4, 3, 7, 10, 3, 3, 7]\n# b = set(a)\n# print(b)\n\n# s2 = {i for i in range(1, 11)}\n# print(s2)\n# s2 = {i for i in range(1, 20) if i % 5 == 0}\n# print(s2)\n'''\ns = 'a'\nprint(ord(s))\nprint(chr(98))\n\n# for i in range(32, 128):\n# print(i, chr(i))\n\nprint('a' > 'A')\nprint('abc' > 'ac')\n\nc = 'a'\n\nprint(chr(ord(c) + 3))\n\nprint(c.isalpha())\nprint(c.isdigit())\n'''\nn, m = map(int,input().split())\n\na = list(map(int,input().split()))\n\na.sort()\n\nk = (a[-1]) - (a[0])\n\nfor i in range((len(a) - (n - 1))):\n mix = (a[i + (n - 1)] - a[i])\n if mix < k:\n k = mix\n\nprint(k)", "n, m = map(int,input().split())\r\npieces = list(map(int,input().split()))\r\npieces.sort()\r\ncompare = 0\r\ncompareMin = (max(pieces)- min(pieces))\r\nfor i in range(0,len(pieces)-1,1):\r\n for j in range(i+n-1,len(pieces),n):\r\n compare = pieces[j] - pieces[i]\r\n if compare < compareMin:\r\n compareMin = compare\r\n\r\nprint(compareMin)\r\n\r\n", "a=list(map(int,input().split()))\r\nb=sorted(list(map(int,input().split())))\r\nk=996\r\nfor i in range(a[1]-a[0]+1):\r\n k=min(k,b[i+a[0]-1]-b[i])\r\nprint(k)\r\n", "n,m = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nmin_index = 0\r\nminn = l[-1] - l[0]\r\nfor i in range(m-n+1):\r\n mintemp = l[i+n-1] - l[i]\r\n if mintemp < minn :\r\n minn = mintemp\r\n min_index = i\r\n\r\nprint(l[min_index + n - 1] - l[min_index])", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nans = 1001\r\nfor i in range(m-n+1):\r\n ans = min(ans, ( l[i+n-1] - l[i]))\r\nprint(ans)", "a = input()\r\nl=a.split(' ')\r\nn=int(l[0])\r\nm=int(l[1])\r\na = input()\r\nl=a.split(' ')\r\nfor i in range(m):\r\n l[i]=int(l[i])\r\nl.sort()\r\nl1=[]\r\nfor i in range(0, m-n+1):\r\n l1.append(l[i+n-1]-l[i])\r\nl1.sort()\r\nprint(abs(l1[0]))", "#!/bin/python3\nmin = 1000\n\n#Wczytanie i posortowanie danych\nstudents = int(input().split()[0])\npuzzles = [int(x) for x in input().split()]\npuzzles.sort()\n\n#liczba miejsc między pierwszym a ostatnim studentem\nstudents -= 1\n\n#Szukamy najmniejszą różnicę między liczbą puzzli pierwszego, a ostatniego studenta\nfor i in range(len(puzzles) - students):\n buff = puzzles[i + students] - puzzles[i]\n if(buff < min):\n min = buff\n\nprint(min)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmi=a[n-1]-a[0]\r\nfor i in range(m-n+1):\r\n if(mi>abs(a[i]-a[i+n-1])):\r\n mi=abs(a[i]-a[i+n-1])\r\nprint(mi) \r\n ", "n , m = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nre = []\r\nfor i in range(abs(m-n+1)): \r\n x = arr[i:i+n]\r\n re.append(max(x)-min(x))\r\nprint(min(re))", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\n\r\nA = f[n - 1]\r\nB = f[0]\r\nminDiff = A - B\r\n\r\nfor i in range(m - n + 1):\r\n diff = f[i + n - 1] - f[i]\r\n if diff < minDiff:\r\n minDiff = diff\r\n A = f[i + n - 1]\r\n B = f[i]\r\n\r\nprint(minDiff)\r\n", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nf = input().split()\r\nfor i in range(0,len(f)):\r\n f[i] = int(f[i])\r\nlist = sorted(f)\r\nresult = []\r\ni = 0\r\nwhile (i+n-1) < m:\r\n result.append(list[i+n-1] - list[i])\r\n i += 1\r\nprint(min(result))", "a=input().split()\r\nb=input().split()\r\nc=[]\r\nfor i in a:\r\n c.append(int(i))\r\nd=[]\r\nfor j in b:\r\n d.append(int(j))\r\nd.sort()\r\nl=[]\r\nfor k in range(c[-1]-c[0]+1):\r\n l.append(max(d[k:c[0]+k])-min(d[k:c[0]+k]))\r\nprint(min(l))", "n, m = map(int, input().split())\npuzzle = list(map(int, input().split()))\npuzzle = sorted(puzzle)\ndiff = 1001\n# min, max = 1001, 0\nfor i in range(m-n+1):\n # min = puzzle[i]\n # max = puzzle[i+n-1]\n # print(\"i = \", i)\n # for j in range(n):\n # print(\"j = \", j)\n # if puzzle[i+j] < min:\n # min = puzzle[i+j]\n # print(\"Min: \", min)\n # if puzzle[i+j] > max:\n # max = puzzle[i+j]\n # print(\"Max: \", max)\n if (puzzle[i+n-1] - puzzle[i]) < diff:\n diff = puzzle[i+n-1] - puzzle[i] \nprint(diff)", "def solve():\n n, m = map(int, input().split())\n f = list(sorted(map(int, input().split())))\n\n best = f[n-1] - f[0]\n for i in range(n-1, m):\n best = min(best, f[i] - f[i-n+1])\n\n return best\n\nif __name__ == \"__main__\":\n print(solve())\n", "n, m = map(int, input().split())\r\npieces = list(map(int, input().split()))\r\n\r\n# Sort the array of puzzle pieces\r\npieces.sort()\r\n\r\n# Initialize the minimum difference\r\nmin_difference = float('inf')\r\n\r\n# Calculate the minimum difference for each contiguous subarray of size n\r\nfor i in range(m - n + 1):\r\n difference = pieces[i + n - 1] - pieces[i]\r\n min_difference = min(min_difference, difference)\r\n\r\n# Print the result\r\nprint(min_difference)\r\n", "n,m=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nf.sort()\r\nans=1e10\r\nfor i in range(m-n+1):\r\n x=f[i:i+n]\r\n ans=min(max(x)-min(x),ans)\r\nprint(ans)", "n, m = map(int, input().split())\r\nmas = list(map(int, input().split()))\r\nmas = sorted(mas)\r\nc = mas[n - 1] - mas[0]\r\nmas = mas[1:]\r\ndef f(mas, n):\r\n global c\r\n if len(mas) == n - 1:\r\n return c\r\n else:\r\n if mas[n - 1] - mas[0] < c:\r\n c = mas[n - 1] - mas[0]\r\n return f(mas[1:], n)\r\n \r\nprint(f(mas, n))", "n, m = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\nx.sort()\r\ndifflist = []\r\nnewlist = []\r\nfor i in range(0, len(x)-n+1) :\r\n newlist = x[i:i+n]\r\n difflist.append(max(newlist)-min(newlist))\r\nprint(min(difflist))\r\n ", "n, m = map(int, input().split())\r\nnumbers = list(sorted(map(int, input().split())))\r\nans = max(numbers) - min(numbers)\r\nfor i in range(m - n + 1):\r\n seq = numbers[i : i + n]\r\n ans = min(ans, max(seq) - min(seq))\r\nprint(ans)", "\ndef solution(arr, n):\n arr.sort()\n p1 = 0\n p2 = p1 + n - 1\n\n\n min_diff = float('inf')\n\n while p2 < len(arr):\n diff = arr[p2] - arr[p1]\n if diff < min_diff:\n min_diff = diff\n \n p1 += 1\n p2 += 1\n\n return min_diff\n\n\n\n\n\n\nif __name__ == \"__main__\":\n n, m = [int(i) for i in input().split()]\n arr = [int(i) for i in input().split()]\n print(solution(arr, n))\n\t\t\t\t \t \t \t\t\t\t\t\t\t \t \t\t\t", "students, puzzles = map(int, input().split())\r\n# Sem a função map(), seria impressa uma lista de strings\r\n\r\npieces = list(map(int, input().split()))\r\npieces.sort()\r\n\r\nsub_pieces = []\r\n\r\n# São criadas sublistas deslocando-se um elemento de cada vez\r\nfor i in range(len(pieces) - students + 1):\r\n x = pieces[i:i + students]\r\n # Divide uma lista em sublistas de tamanho fixo\r\n sub_pieces.append(x)\r\n\r\n# Agora, é necessário iterar por todas as sublistas e calcular a diferença de cada uma delas\r\nmenor_diferenca = float('inf') # Inicializar com um valor infinitamente grande\r\nfor y in sub_pieces:\r\n diferenca = y[-1] - y[0]\r\n\r\n if diferenca < menor_diferenca:\r\n menor_diferenca = diferenca\r\n\r\nprint(menor_diferenca)", "a,b= map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nx=1001\r\nfor i in range(0,b-a+1):\r\n t=arr[i+a-1]-arr[i]\r\n if t<x:\r\n x=t\r\nprint(x)", "p, q = map(int, input().split())\r\npuzzles = sorted(list(map(int, input().split())))\r\n\r\nmin_diff = float('inf')\r\nfor i in range(p-1, q):\r\n diff = puzzles[i] - puzzles[i-p+1]\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)\r\n", "n,m=list(map(int,input().split(' ')))\r\nf=list(map(int,input().split(' ')))\r\nf.sort()\r\nmnsf=f[n-1]-f[0]\r\nmn=mnsf\r\nfor i in range(n,m):\r\n mnsf=f[i]-f[i-n+1]\r\n mn=min(mn,mnsf)\r\nprint(mn)", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nminRazn = float(\"inf\")\r\nfor i in range(m - n + 1):\r\n minRazn = min(minRazn, lst[i + n - 1] - lst[i])\r\n\r\nprint(minRazn)", "n,p=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\n\r\narr.sort()\r\ncurr_best=float('inf')\r\nfor index in range(0,p-n+1):\r\n # end=index+(n-1)\r\n # if end<p:\r\n mini=arr[index:index+n][0]\r\n maxi=arr[index:index+n][-1]\r\n curr_best=min(curr_best,maxi-mini)\r\n \r\n \r\nprint(curr_best)\r\n \r\n ", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# Sort the puzzles by the number of pieces in ascending order\r\npuzzles.sort()\r\n\r\n# Initialize the minimum difference to a large value\r\nmin_difference = float('inf')\r\n\r\n# Iterate through the puzzles and find the best combination\r\nfor i in range(n - 1, m):\r\n min_difference = min(min_difference, puzzles[i] - puzzles[i - n + 1])\r\n\r\nprint(min_difference)\r\n", "n, m = map(int, input().split()) # Read n and m\r\npuzzles = list(map(int, input().split())) # Read puzzle piece quantities\r\n\r\npuzzles.sort() # Sort the puzzle piece quantities in ascending order\r\n\r\nmin_difference = float('inf') # Initialize minimum difference as positive infinity\r\n\r\n# Find the minimum difference between adjacent quantities\r\nfor i in range(m - n + 1):\r\n min_difference = min(min_difference, puzzles[i + n - 1] - puzzles[i])\r\n\r\nprint(min_difference)", "n,m=map(int,input().split())\r\nf=sorted(map(int,input().split()))\r\ndif = []\r\nfor i in range(m-n+1):\r\n dif.append(f[i+n-1]-f[i])\r\nprint(sorted(dif)[0])\r\n", "import sys\r\ndef f():\r\n n,m=list(map(int,input().split(\" \")))\r\n p=list(map(int,input().split(\" \")))\r\n p.sort()\r\n i=0\r\n j=0\r\n mini=sys.maxsize\r\n while j<len(p):\r\n if j-i+1<n:\r\n j=j+1\r\n elif j-i+1==n:\r\n mini=min(mini,p[j]-p[i])\r\n i=i+1\r\n j=j+1\r\n return mini\r\nprint(f())\r\n", "n,m = map(int,input().split())\r\nc = sorted(list(map(int,input().split())))\r\nmin_raznica = 1000000000000000000000000000\r\nfor x in range(m-n+1):\r\n diff = c[x+n-1] - c[x]\r\n if diff<min_raznica:\r\n min_raznica = diff\r\nprint(min_raznica)\r\n\r\n", "n, m = map(int, input().split())\r\npuzzle_pieces = list(map(int, input().split()))\r\npuzzle_pieces.sort()\r\n\r\nleft = 0\r\nright = n - 1\r\nmin_diff = float('inf')\r\n\r\nwhile right < m:\r\n diff = puzzle_pieces[right] - puzzle_pieces[left]\r\n if diff < min_diff:\r\n min_diff = diff\r\n left += 1\r\n right += 1\r\n\r\nprint(min_diff)\r\n", "n, m = map(int, input().split()) # Number of students and puzzles\r\npuzzle_sizes = sorted(map(int, input().split())) # Sorted puzzle sizes\r\n\r\nmin_difference = float('inf')\r\n\r\n# Calculate the minimum difference by comparing consecutive puzzle sizes\r\nfor i in range(n - 1, m):\r\n min_difference = min(min_difference, puzzle_sizes[i] - puzzle_sizes[i - n + 1])\r\n\r\nprint(min_difference)\r\n", "y=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nx.sort()\r\np=[]\r\nfor i in range (y[0]-1,len(x)):\r\n p.append(x[i]-x[i-(y[0]-1)])\r\nprint(min(p))\r\n", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\nm1 = float('inf')\r\nfor i in range(m - n + 1):\r\n d = f[i+n-1] - f[i]\r\n m1 = min(m1, d)\r\nprint(m1)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nq=[]\r\nfor i in range(len(l)-n+1):\r\n a=l[i+n-1]-l[i]\r\n q.append(a)\r\nprint(min(q))", "n, m = [int(num) for num in input().split()]\r\npieces = sorted([int(num) for num in input().split()])\r\nmin_diff = float('inf')\r\nfor i in range(len(pieces)-n+1):\r\n min_diff = min(min_diff, pieces[i+n-1]-pieces[i])\r\nprint(min_diff)", "n,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\ni=0\r\nli1=[]\r\nwhile (i+(n-1))<m:\r\n c=li[i+(n-1)]-li[i]\r\n li1.append(c)\r\n i+=1\r\nprint(min(li1))\r\n", "m,n=input().split()\r\nm,n=int(m),int(n)\r\npuzzle=list(map(int,input().split()))\r\npuzzle.sort()\r\nminimum=puzzle[(m-1)]- puzzle[0]\r\nfor i in range(1,len(puzzle)-(m-1)):\r\n diff=puzzle[i+(m-1)]- puzzle[i]\r\n if(diff<minimum):\r\n minimum=diff\r\nprint(minimum)", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\n\r\nf.sort()\r\nleft = 0\r\nright = n-1\r\nbest = 1000\r\nwhile right < m:\r\n best = min(best, f[right] - f[left])\r\n left += 1\r\n right += 1\r\nprint(best)\r\n \r\n\r\n\r\n", "def least_possible_difference(n, m, puzzles):\r\n puzzles.sort() \r\n\r\n min_difference = float('inf')\r\n for i in range(m - n + 1):\r\n difference = puzzles[i + n - 1] - puzzles[i]\r\n min_difference = min(min_difference, difference)\r\n\r\n return min_difference\r\n\r\nn, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\nresult = least_possible_difference(n, m, puzzles)\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\npieces = sorted(list(map(int, input().split())))\r\n\r\nmin_diff = float('inf')\r\n\r\nfor i in range(m-n+1):\r\n diff = pieces[i+n-1] - pieces[i]\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)\r\n", "n,m=map(int,input().split())\r\nK=list(map(int,input().split()))\r\nK.sort()\r\ndp=[0]*(len(K)-n+1)\r\nfor i in range(len(K)-n+1):\r\n dp[i]=K[i+n-1]-K[i]\r\nprint(min(dp))", "input1 = input().split()\r\nn = int(input1[0])\r\nm = int(input1[1])\r\nmin_result = float('inf')\r\n\r\ninput2 = input().split()\r\ninput2 = [int(ele) for ele in input2]\r\ninput2.sort()\r\n\r\nfor i in range(0,m):\r\n try:\r\n result = input2[i+n-1] - input2[i]\r\n min_result = min(min_result,result)\r\n except:\r\n break\r\n\r\nprint(min_result)", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\nleast = f[n-1] - f[0]\r\nfor i in range(1, m-n+1):\r\n least = min(least, f[i+n-1] - f[i])\r\nprint(least)", "n,_ = input().split()\r\nn = int(n)\r\nn-=1\r\nmin_difference = None\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nfor i in range(len(l) - n):\r\n if min_difference == None or min_difference > l[i + n] - l[i]:\r\n min_difference = l[i+n] - l[i]\r\n\r\nprint(min_difference)", "y,e=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.sort() \r\ns=d[y-1]-d[0]\r\nfor i in range(e):\r\n if i+y-1<=e-1: \r\n if d[i+y-1]-d[i]<s:\r\n s=d[i+y-1]-d[i]\r\nprint(s) ", "n, m = (int(i) for i in input().split())\nf = sorted(int(i) for i in input().split())\nres = f[n - 1] - f[0]\nfor i in range(n, m):\n res = min(res, f[i] - f[i - n + 1])\nprint(res)\n", "def main (np, p, k):\r\n\tp = sorted(p)\r\n\tprefixSumArray = []\r\n\ttemp = 0\r\n\tfor i in range(np):\r\n\t\ttemp += p[i]\r\n\t\tprefixSumArray.append(temp)\r\n\tcurrentMin = float('inf')\r\n\tfor i in range(np-k+1):\r\n\t\tif p[i+k-1] - p[i] < currentMin:\r\n\t\t\tcurrentMin = p[i+k-1] - p[i]\r\n\treturn currentMin\r\n\r\nk, np = [int(i) for i in input().split()]\r\np = [int(i) for i in input().split()]\r\nprint(main(np, p, k))", "n ,m = map(int ,input() .split())\r\na = list(map(int ,input() .split()))\r\nq = sorted(a)\r\ns = [ ]\r\nd = (n - 1)\r\nd1 = 0\r\n \r\nfor i in range(m - n + 1):\r\n s += [q[d] - q[d1]]\r\n d += 1\r\n d1 += 1\r\nprint(min(s))", "n, m = [int(x) for x in input().split(\" \")]\r\nx = [int(x) for x in input().split(\" \")]\r\nx = sorted(x)\r\nmin_differ = 996\r\nfor i in range(n - 1, len(x)):\r\n differ = x[i] - x[i - (n - 1)]\r\n min_differ = min(min_differ, differ)\r\nprint(min_differ)", "n,m=[int(x) for x in input().split()]\r\n\r\nv=sorted([int(x) for x in input().split()])\r\ns=n\r\nmv=1001\r\nfor i in range(len(v)):\r\n k=v[0+i:n+i]\r\n if len(k)>=n:\r\n # print(k,mv) \r\n mv=min(mv,k[-1]-k[0])\r\n else:\r\n break\r\n\r\nprint(mv)", "n, m = map(int, input().split())\r\npieces = sorted(map(int, input().split()))\r\n\r\nmin_diff = float('inf')\r\nfor i in range(n-1, m):\r\n diff = pieces[i] - pieces[i-n+1]\r\n min_diff = min(min_diff, diff)\r\n\r\nprint(min_diff)\r\n", "n,m = map(int,input().split())\r\npuzzles = list(map(int,input().split()))\r\npuzzles.sort()\r\ndiff = 997\r\nfor i in range(n-1,m):\r\n q = i\r\n p = i - (n-1)\r\n if puzzles[q]-puzzles[p] < diff:\r\n diff = puzzles[q]-puzzles[p]\r\nprint(diff) \r\n ", "I=lambda:map(int,input().split());n,m=I();a=sorted(I());print(min(j-i for i,j in zip(a,a[n-1:])))", "m, n = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nv = []\r\nfor i in range(n - m+1):\r\n v.append(l[i+m-1]-l[i])\r\nprint(min(v))\r\n", "q, w = map(int, input().split())\r\ne = list(map(int, input().split()))\r\ne.sort()\r\nr = 10000000000000000000\r\nfor i in range(w - q + 1):\r\n x = e[i + q - 1] - e[i]\r\n r = min(r, x)\r\nprint(r)", "def solve(ls, n):\n\n s = sorted(ls)\n diff = float('inf')\n\n for i,j in zip(s[:-(n-1)], s[n-1:]):\n #print(i,j)\n\n if abs(j-i) < diff:\n diff = abs(j-i)\n\n return diff\n\n\nbas = input()\nn = int(bas.split(\" \")[0])\n\nls = [int(y) for y in input().split(\" \")]\n\nprint(solve(ls,n))\n\t \t \t\t \t\t\t\t \t\t \t\t\t \t\t \t", "n , m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\n\r\nminDiff = float('inf')\r\n\r\nfor i in range(n-1, m):\r\n diff = f[i] - f[i-n+1]\r\n minDiff = min(minDiff, diff)\r\n\r\nprint(minDiff)\r\n ", "n,m = list(input().split())\nn = int(n)\nm = int(m)\n\nf = list(input().split())\nfor i in range(len(f)):\n f[i]=int(f[i])\n\nf.sort()\n\nleast_diff = -1\nfor i in range(len(f)-n+1):\n if least_diff == -1:\n least_diff = int(f[i+n-1])-int(f[i])\n elif int(f[i+n-1])-int(f[i])< least_diff:\n least_diff = int(f[i+n-1])-int(f[i])\n\nprint(least_diff)\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=1000000\r\nfor x in range(m-n+1):\r\n s=a[x:x+n]\r\n ans=min(ans,s[len(s)-1]-s[0])\r\nprint(ans)\r\n", "\r\nn, m = map(int, input().split())\r\n\r\n\r\np_arr = [int(i) for i in input().split()]\r\n\r\np_arr.sort()\r\n\r\nr = n -1\r\nl = 0 \r\ndiff = 1e9\r\n\r\n\r\nwhile r < m : \r\n diff= min(diff, p_arr[r] - p_arr[l])\r\n r += 1 \r\n l += 1 \r\n\r\nprint(diff)", "n, m = [int(i) for i in input().split()]\nf = [int(i) for i in input().split()]\nf.sort()\nans = 1e18\nfor i in range(m):\n if (i + n - 1 >= m):\n break\n ans = min(ans, f[i + n - 1] - f[i])\nprint(ans)", "n, m = tuple(map(int,input().split()))\r\na = list(map(int,input().split()))\r\na.sort()\r\nb = []\r\nfor i in range(m-n+1):\r\n b += [a[i+n-1] - a[i]]\r\nprint(min(b))", "n, m = map(int, input().split())\r\nf = sorted(list(map(int, input().split())))\r\nval = 1000\r\n\r\nfor i in range(m - n + 1):\r\n temp = f[i+n-1] - f[i]\r\n if temp < val:\r\n val = temp\r\n\r\nprint(val)\r\n", "m, n = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nres = a[m - 1] - a[0]\r\n\r\nfor i in range(n - m + 1):\r\n res = min(res, a[i + m - 1] - a[i])\r\n\r\nprint(res)\r\n", "k, n = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = [a[-1]]*(n - k + 1)\r\nfor i in range(n - k + 1):\r\n b[i] = a[k + i - 1] - a[i]\r\nprint(min(b))", "a,b=list(map(int,input().rstrip().split()))\r\nlst=list(map(int,input().rstrip().split()))\r\nlst.sort(reverse=True)\r\nmix=lst[0]-lst[a-1]\r\nfor i in range(b-a+1):\r\n A=lst[i]\r\n B=lst[i+a-1]\r\n if A-B < mix:\r\n mix=A-B\r\nprint(mix)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\ns = sorted(map(int, input().split())) \r\n\r\n\r\nmin_diff = min(s[i+n-1] - s[i] for i in range(m-n+1)) \r\n\r\nprint(min_diff)", "n,m = [int(i) for i in input().split()]\r\nvals = [int(i) for i in input().split()]\r\n\r\ndef qSort(listt):\r\n n = len(listt)\r\n if n <= 1:\r\n return listt\r\n x = listt[n//2]\r\n b1 = [b for b in listt if b > x]\r\n bx = [b for b in listt if b == x]\r\n b2 = [b for b in listt if b < x]\r\n return qSort(b1) + bx + qSort(b2)\r\n\r\nvals = qSort(vals)\r\ndifference = vals[0]\r\n\r\nfor i in range (len(vals)-n+1):\r\n detraction = vals[i] - vals[i+n-1]\r\n if detraction <= difference:\r\n difference = detraction\r\n\r\nprint(difference)\r\n", "n, m = list(map(int, input().split()))\r\nf = sorted(list(map(int, input().split())))\r\nprint(min(f[i+n-1] - f[i] for i in range(m - n + 1)))", "s,t=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nsmallst=11111111111111111111111111111111111110\r\nf=h=0\r\nfor i in range(t-s+1):\r\n m=abs(l[i]-l[i+s-1])\r\n smallst=min(m,smallst)\r\nprint(smallst)", "n,m = map(int,input().split())\r\nlst = sorted(list(map(int,input().split())))\r\nsu1=lst[n-1]-lst[0]\r\nfor i in range(1,m-n+1):\r\n if lst[i+n-1]-lst[i]<su1:\r\n su1 = lst[i+n-1]-lst[i]\r\nprint(su1)", "\"\"\"\r\nRUSTAMBEKRUSTAMBEKRUSTAMBEKRUSTAMBEKRUSTAMBEKRUSTAMBEK\r\n ____ _ _____ RRR\r\n / ___|___ __| | ___| ___|__ _ __ ___ ___ ___ UUU\r\n| | / _ \\ / _` |/ _ \\ |_ / _ \\| '__/ __/ _ \\/ __|SSS\r\n| |__| (_) | (_| | __/ _| (_) | | | (_| __/\\__ \\TTT\r\n \\____\\___/ \\__,_|\\___|_| \\___/|_| \\___\\___||___/AAA\r\n MMM \r\nRUSTAMBEKRUSTAMBEKRUSTAMBEKRUSTAMBEKRUSTAMBEKRUSTAMBEK\r\n\"\"\"\r\nn, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(min(a[i + n - 1] - a[i] for i in range(m - n + 1)))\r\n", "def min_puzzle_difference(n, m, pieces):\r\n pieces.sort()\r\n min_difference = float('inf')\r\n \r\n for i in range(n-1, m):\r\n min_difference = min(min_difference, pieces[i] - pieces[i-n+1])\r\n \r\n return min_difference\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\npieces = list(map(int, input().split()))\r\n\r\n# Calculate the least possible difference\r\nresult = min_puzzle_difference(n, m, pieces)\r\n\r\n# Print the result\r\nprint(result)\r\n", "n,s=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nm=abs(l[0]-l[n-1])\r\nfor i in range(s-n+1):\r\n t=abs(l[i]-l[i+n-1])\r\n if t<m:\r\n m=t\r\nprint(m)\r\n", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\ni = 0\nres = float(\"inf\")\nwhile i < m-n+1:\n res = min(res, arr[i+n-1]-arr[i])\n i+= 1\nprint(res)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nminim = 1000\r\nfor i in range(m - n + 1):\r\n if a[i + n - 1] - a[i] < minim:\r\n minim = a[i + n - 1] - a[i]\r\nprint(minim)", "# your code goes here\r\ndef main():\r\n no_of_students, no_of_puzzles = map(int, input().split())\r\n no_of_pieces = list(map(int, input().split()))\r\n no_of_pieces.sort()\r\n\r\n oo = 10**9\r\n minimum_difference = oo\r\n for i in range(no_of_students - 1, no_of_puzzles):\r\n minimum_difference = min(minimum_difference, no_of_pieces[i] - no_of_pieces[i - (no_of_students - 1)])\r\n\r\n print(minimum_difference)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nmino=float('inf')\r\nn-=1\r\nm-=n\r\nfor i in range(m):\r\n e=a[i+n]-a[i]\r\n if e<mino:mino=e\r\nprint(mino)\r\n\r\n\r\n", "n, m = map(int, input().split())\r\npuzzle_pieces = sorted(map(int, input().split()))\r\n\r\nmin_diff = float('inf')\r\n\r\nfor i in range(m - n + 1):\r\n diff = puzzle_pieces[i + n - 1] - puzzle_pieces[i]\r\n min_diff = min(min_diff, diff)\r\n\r\nprint(min_diff)\r\n", "def solve():\r\n n, m = map(int, input().split())\r\n f = sorted([int(i) for i in input().split()])\r\n mn = 10**9\r\n for i in range(m-n+1):\r\n mn = min(mn, f[i+n-1]-f[i])\r\n print(mn)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "##########\nn, m = map(int, input().split())\nf = list(map(int, input().split()))\n\nf.sort()\nleast = f[n-1] - f[0]\n\nfor i in range(1, m - n + 1):\n if f[i+n-1] - f[i] < least:\n least = f[i+n-1] - f[i]\n\nprint(least)\n\n\t \t\t \t \t\t \t\t\t\t \t\t\t\t \t", "def find_min_puzzle_difference(a,b, puzzle_sizes):\n if a > b:\n return 0\n\n puzzle_sizes.sort()\n min_difference = float('inf')\n\n for i in range(b - a + 1):\n difference = puzzle_sizes[i + a - 1] - puzzle_sizes[i]\n min_difference = min(min_difference, difference)\n\n return min_difference\n\n\n\na,b = map(int,input().split())\npuzzle_sizes = list(map(int, input().split()))\n\nresult = find_min_puzzle_difference(a,b, puzzle_sizes)\nprint(result)\n\n\t\t\t \t\t \t\t \t\t\t \t\t\t \t \t\t", "n,m=map(int,input().split())\r\nl=sorted([int(x) for x in input().split()])\r\nprint(min(j-i for i,j in zip(l,l[n-1:])))", "n,a=map(int,input().split())\narr=list(map(int,input().split()))\narr.sort()\np1=0\np2=n-1\nmin=arr[p2]-arr[p1]\nwhile p2!=len(arr)-1:\n p1 +=1\n p2 +=1 \n dif= arr[p2]-arr[p1]\n if dif<min:\n min=dif\nprint(min)", "n, m = map(int, input().split())\r\nlst=list(map(int, input().split()))\r\nlst.sort()\r\ndif=0\r\nldif=lst[m-1]-lst[0]\r\nfor i in range (m-n+1):\r\n dif=lst[i+n-1]-lst[i]\r\n if dif<ldif:\r\n ldif=dif\r\nprint(ldif)", "n,m = tuple(map(int,input().split()))\r\narr = [int(x) for x in input().split()]\r\narr = sorted(arr)\r\nmin = 100000000\r\ni,j=0,n-1\r\n\r\nwhile j<m:\r\n diff = arr[j] - arr[i]\r\n if diff<min:\r\n min = diff\r\n i += 1\r\n j += 1\r\n\r\nprint(min)\r\n", "n, m = map(int, input().split(' '))\r\n*l, = map(int, input().split(' '))\r\nl.sort()\r\ns = []\r\nfor i in range(m - n + 1):\r\n s.append(l[i + n - 1] - l[i])\r\nprint(min(s))\r\n", "def pd(n, m, puzzles):\r\n puzzles.sort()\r\n md = 999999999999999\r\n for i in range(m-n+1):\r\n diff = puzzles[i+n-1] - puzzles[i]\r\n md = min(md, diff)\r\n return md\r\nn,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nprint(pd(n,m,a))", "n, m = map(int, input().split())\r\nsizes_list = list(map(int, input().split()))\r\nsizes_list.sort()\r\nmin_diff = float('inf')\r\n\r\nfor i in range(m - n + 1):\r\n diff = sizes_list[i + n - 1] - sizes_list[i]\r\n min_diff = min(min_diff, diff)\r\n\r\nprint(min_diff)\r\n", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\npuzzles.sort()\r\nleft = 0\r\nright = n - 1\r\nminDifference = float('inf')\r\nwhile(right < m):\r\n difference = puzzles[right] - puzzles[left]\r\n if(difference < minDifference):\r\n minDifference = difference\r\n left += 1\r\n right += 1\r\nprint(minDifference)\r\n", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nbest=s[m-1]-s[0]\r\nmin=0\r\nfor i in range(m-n+1):\r\n min=s[i+n-1]-s[i]\r\n if best>min:\r\n best=min\r\nprint(best)", "chir,ris=map(int,input().split(' '))\r\nvan=sorted(list(map(int,input().split(' '))))\r\ns0l=van[ris-1]-van[0]\r\nfor gee in range(ris-chir+1):\r\n\ts0l=min(s0l,van[chir-1+gee]-van[gee])\r\nprint(s0l)", "n,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nf.sort()\r\narr=[]\r\nfor i in range(m-n+1):\r\n l=f[i:i+n]\r\n arr.append(l[n-1]-l[0])\r\nprint(min(arr))", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=l[x-1]-l[0]\r\nfor i in range (1,y-x+1):\r\n if l[i+x-1]-l[i]<c:\r\n c=l[i+x-1]-l[i]\r\n # print(l,c)\r\nprint(c)\r\n\r\n# 1 4 9 10 10 10 16 19 20", "ini=lambda:map(int,input().split())\r\nn,m=ini()\r\nb=sorted(ini())\r\nprint(min(j-i for i,j in zip(b,b[n-1:])))\r\n", "nm=input()\r\nn=int(nm.split()[0])\r\nm=int(nm.split()[1])\r\nline=input()\r\nline=line.split()\r\nline=[int(i) for i in line]\r\nsorted_line=sorted(line,reverse=True)\r\ni=0\r\nmin_diff=1000\r\nwhile(i<=m-n):\r\n diff=sorted_line[i]-sorted_line[i+n-1]\r\n min_diff=min(min_diff,diff)\r\n i+=1\r\nprint(min_diff)\r\n", "# Read input values\r\nn, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# Sort the list of puzzle pieces in ascending order\r\npuzzles.sort()\r\n\r\n# Initialize min_diff to a large value\r\nmin_diff = float('inf')\r\n\r\n# Iterate through the list of puzzles using a sliding window of size n\r\nfor i in range(m - n + 1):\r\n # Calculate the difference between the largest and smallest puzzles within the window\r\n diff = puzzles[i + n - 1] - puzzles[i]\r\n \r\n # Update min_diff with the minimum difference found\r\n min_diff = min(min_diff, diff)\r\n\r\n# Print the minimum possible difference\r\nprint(min_diff)", "n,m=map(int,input().split(' '))\r\npazz=sorted(list(map(int,input().split(' '))))\r\nmin_diff=float('inf')\r\nfor i in range(n-1,m):\r\n diff=pazz[i]-pazz[i-n+1]\r\n if diff<min_diff:\r\n min_diff=diff\r\nprint(min_diff)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 9 12:41:34 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nx=list(map(int,input().split()))\r\nn = x[0]\r\nm = x[1]\r\n\r\nf = list(map(int,input().split()))\r\nf = sorted(f)\r\nk = m-n\r\nj = n-1\r\ndif=[]\r\nfor i in range(k+1):\r\n dif.append(f[j]-f[i])\r\n j+=1\r\n\r\nprint(min(dif))\r\n \r\n \r\n\r\n\r\n\r\n \r\n ", "n, m = map(int, input().split())\r\npuzzles = sorted(list(map(int, input().split())))\r\nprint(min(puzzles[i + n - 1] - puzzles[i] for i in range(m - n + 1)))\r\n", "n, m = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nl, r = 0, n - 1 \r\nminn = float(\"inf\")\r\nwhile r < m:\r\n minn = min(minn,lst[r] - lst[l])\r\n l += 1\r\n r += 1\r\nprint(minn)\r\n ", "n,k=([int(x) for x in input().split()])\r\nl2=[]\r\nl2.append([int(x) for x in input().split()])\r\nl1=l2[0]\r\nl1.sort()\r\nl3=[]\r\nfor i in range(k-n+1):\r\n l3.append(l1[i+n-1]-l1[i])\r\nprint(min(l3))", "def min_puzzle_difference(n, m, fragments):\r\n fragments.sort() # Сортируем массив с количеством фрагментов\r\n min_difference = float('inf') # Инициализируем минимальную разницу как бесконечность\r\n\r\n # Проходим по всем возможным подмножествам из n пазлов\r\n for i in range(m - n + 1):\r\n difference = fragments[i + n - 1] - fragments[i] # Разница между максимальным и минимальным в текущем подмножестве\r\n min_difference = min(min_difference, difference) # Обновляем минимальную разницу\r\n\r\n return min_difference\r\n\r\n# Чтение входных данных\r\nn, m = map(int, input().split())\r\nfragments = list(map(int, input().split()))\r\n\r\n# Вызов функции и вывод результата\r\nresult = min_puzzle_difference(n, m, fragments)\r\nprint(result)", "\r\n\r\ndef solve(n,m,a):\r\n min=1000000000\r\n for i in range(m-n+1):\r\n temp=0\r\n temp= a[i+(n-1)] - a[i]\r\n if temp<min:\r\n min=temp\r\n return min\r\n\r\ndef main():\r\n a=[]\r\n b=[]\r\n a=input().split(\" \")\r\n n=int(a[0])\r\n k=int(a[1])\r\n a=input().split(\" \")\r\n for i in a:\r\n b.append(int(i))\r\n b.sort()\r\n print(solve(n,k,b))\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "n,m =[int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = []\r\na.sort()\r\nfor i in range(m-n+1):\r\n b.append(a[i+n-1]-a[i])\r\nprint(min(b))", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nf = input().split()\r\nfor i in range(m):\r\n f[i] = int(f[i])\r\n\r\nf.sort()\r\nsmallest = 1000\r\nfor i in range(m - n + 1):\r\n if (f[i + n - 1] - f[i]) < smallest:\r\n smallest = f[i + n - 1] - f[i]\r\n\r\nprint(smallest)", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n\nif __name__ == '__main__':\n\ta = [int(x) for x in input().strip().split(\" \")]\n\tb = [int(x) for x in input().strip().split(\" \")]\n\tn = a[0]\n\tb.sort()\n\tx, y = 0, n-1\n\tm = float(\"inf\")\t\n\twhile y < a[1]:\n\t\tif b[y]-b[x] < m:\n\t\t\tm = b[y]-b[x]\n\t\tx += 1\n\t\ty += 1\n\tprint(m)\n\t\t \t\t \t\t \t\t\t \t\t\t\t\t\t \t", "init = [int (x) for x in input().split()]\nn = init[0]\nm = init[1]\npuzzles = sorted([int (x) for x in input().split()])\nmindif = 100000\nfor i in range(m-n+1):\n #print((puzzles[i+n-1]), puzzles[i])\n if ((puzzles[i+n-1]) - (puzzles[i])) < mindif:\n mindif = ((puzzles[i+n-1]) - (puzzles[i]))\nprint(mindif)\n", "n, m = map(int, input().split())\r\npuzzle_quantities = list(map(int, input().split()))\r\n\r\npuzzle_quantities.sort()\r\n\r\nmin_difference = 1001\r\n\r\nfor i in range(m - n + 1):\r\n difference = puzzle_quantities[i + n - 1] - puzzle_quantities[i]\r\n min_difference = min(min_difference, difference)\r\n\r\nprint(min_difference)", "n, m = map(int, input().split())\r\npuz = [int(i) for i in input().split()]\r\npuz.sort()\r\nminDif = puz[m-1] - puz[0]\r\nn -= 1\r\nfor i in range(0, m-n):\r\n if puz[i+n] - puz[i] < minDif:\r\n minDif = puz[i+n] - puz[i]\r\nprint(minDif)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 16:28:37 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, m = map(int,input().split())\r\ns = sorted(list(map(int,input().split())))\r\ndiffs = [] #存储各种可能的极差\r\nfor i in range(m - n + 1):\r\n diffs.append(s[i + n - 1] - s[i])\r\nprint(min(diffs))", "from sys import stdin\r\ninput = lambda: stdin.readline().strip()\r\nn,m = map(int,input().split())\r\nf = sorted(list(map(int,input().split())))\r\nmn = float('inf')\r\nfor i in range(m - n + 1):\r\n d = f[i + n - 1] - f[i]\r\n if d < mn:\r\n mn = d\r\nprint(mn)\r\n \r\n", "n,m = map(int,input().split())\r\nline = list(map(int,input().split()))\r\nline.sort()\r\nl = 0\r\nr = n\r\n\r\nmin_ = None\r\nwhile r <= m:\r\n if min_ != None:\r\n min_ = min(min_,max(line[l:r])-min(line[l:r]))\r\n \r\n else:\r\n \r\n min_ = max(line[l:r])-min(line[l:r])\r\n \r\n l+=1\r\n r+=1\r\n\r\nprint(min_)\r\n", "n,m = map(int,input().split(\" \"))\r\narr = list(map(int,input().split(\" \")))\r\n\r\narr.sort()\r\nmi = 1000\r\nfor i in range(m-n+1):\r\n mi = min(mi,arr[i+n-1]-arr[i])\r\nprint(mi)", "import sys\r\nINF = 2e18 + 99\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nres = 1000000\r\nfor i in range(m - n + 1):\r\n if((arr[n + i - 1] - arr[i]) < res):\r\n res = (arr[i+n-1] - arr[i])\r\nprint(res)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nmini = float('inf')\r\nfor i in range(m-n+1):\r\n mini = min(mini, (arr[i+n-1]) - (arr[i]))\r\nprint(mini)", "n, m = map(int, input().split())\r\np = (list(map(int, input().split())))\r\np=sorted(p)\r\n\r\n\r\nd = 1000000\r\nfor i in range(m-n+1):\r\n di = p[i+n-1] - p[i]\r\n if di < d:\r\n d = di\r\n\r\nprint(d)\r\n", "n,m=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nf.sort()\r\nans=1e10\r\nfor i in range(m-n+1):\r\n x=f[i:i+n]\r\n ans=min(x[-1]-x[0],ans)\r\nprint(ans)", "n, m = map(int, input().split())\r\nn = n - 1\r\n\r\nmin_difference = None\r\n\r\npuzzles = list(map(int, input().split()))\r\npuzzles.sort()\r\n\r\nfor index in range(len(puzzles) - n):\r\n if min_difference == None or min_difference > puzzles[index + n] - puzzles[index]:\r\n min_difference = puzzles[index + n] - puzzles[index]\r\n\r\nprint(min_difference)\r\n", "n, m = map(int, input().split())\r\npuzzle_pieces = list(map(int, input().split()))\r\n\r\npuzzle_pieces.sort() # Sort the puzzle pieces in ascending order\r\n\r\nmin_difference = float('inf') # Initialize min_difference with a large value\r\n\r\nfor i in range(m - n + 1):\r\n difference = puzzle_pieces[i + n - 1] - puzzle_pieces[i] # Calculate the difference\r\n min_difference = min(min_difference, difference) # Update min_difference if necessary\r\n\r\nprint(min_difference)\r\n", "import math\r\n\r\n\r\ndef main() -> None :\r\n print(min_Teacher_Obtain_Diff(*user_Inputs()))\r\n\r\n\r\ndef min_Teacher_Obtain_Diff(chidren_count: int, puzzle_counts: list[int]) -> int :\r\n SORTED_PUZZLE_COUNTS = sorted(puzzle_counts)\r\n result = math.inf\r\n for group_index in range(0, len(SORTED_PUZZLE_COUNTS)-chidren_count+1) :\r\n result = min(result, group_Max_Diff(SORTED_PUZZLE_COUNTS[group_index:group_index+chidren_count]))\r\n return result\r\n\r\ndef group_Max_Diff(selected_group: list[int]) -> int :\r\n return max(selected_group) - min(selected_group)\r\n\r\n\r\n\r\ndef user_Inputs() -> tuple[int, list[int]] :\r\n return (input_Children_Count(), input_Puzzle_Counts())\r\n\r\ndef input_Children_Count() -> int :\r\n return input_Array()[0]\r\n\r\ndef input_Puzzle_Counts() -> list[int] :\r\n return input_Array()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "n, m = [int(i)for i in input().split()]\r\narr = input().split()\r\narr = [int(items) for items in arr]\r\narr.sort()\r\ntemp = float('inf')\r\nfor i in range(m-n+1):\r\n temp = min(arr[i+n-1]-arr[i], temp)\r\nprint(temp)", "#https://codeforces.com/problemset/problem/337/A\r\n\r\nn,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nfsort=sorted(f)\r\ni=0\r\nmin=0\r\nwhile i+n-1<m:\r\n mi=fsort[i+n-1]-fsort[i]\r\n if i==0:\r\n min=mi\r\n elif mi<min:\r\n min=mi\r\n i+=1\r\nprint(min)", "n, m = map(int, input().split())\r\nlst = [int(item) for item in input().split()]\r\nlst.sort()\r\nmn = 20000\r\nfor i in range(m - n + 1):\r\n mn = min(mn, lst[i + n - 1] - lst[i])\r\nprint(mn)\r\n", "n,m=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nw=[]\r\nk=0\r\nwhile k+n<=m:\r\n w.append(a[k+n-1]-a[k])\r\n k+=1\r\nprint(min(w))", "stu, num_piece = map(int, input().split())\r\n\r\npieces = list(map(int, input().split()))\r\n\r\npieces.sort()\r\n\r\nmin_diff = 1000000000\r\n\r\n\r\n# Two pointer version\r\nl = 0\r\nr = stu - 1\r\n\r\n# while r < num_piece:\r\n# diff = pieces[r] - pieces[l]\r\n# if diff < min_diff:\r\n# min_diff = diff\r\n# l += 1\r\n# r += 1\r\n\r\n# print(min_diff)\r\n\r\n# Non-two pointer version\r\nfor i in range(num_piece - stu + 1): # Since this part basically replaces the logic of whee to stop,\r\n # we know that the amount of movements of the right pointer before reaching the end is num_piece - stu\r\n # However, the number of CHECKS will be num_piece - stu + 1 as we also check at the initial position of the right pointer\r\n diff = pieces[i + stu - 1] - pieces[i] # i + stu - 1 is the position of the right pointer as the -1 accounts for o indexing\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nf=[]\r\nfor i in range(0,len(l)-n+1):\r\n f.append(l[i+n-1]-l[i])\r\nprint(min(f))", "n,m=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\ndef f():\r\n nums.sort()\r\n mini=1e18\r\n for i in range(m-n+1):\r\n mini=min(mini,abs(nums[i]-nums[i+n-1]))\r\n return mini\r\nprint(f())\r\n", "n , m = map(int,input().split())\r\nma = list(map(int,input().split()))\r\nma.sort()\r\nmini = float('inf')\r\nl = 0\r\nr = n-1\r\nwhile r < m:\r\n mini = min(mini,ma[r]-ma[l])\r\n l+=1\r\n r+=1\r\nprint(mini)", "n , k = map(int,input().split());x = list(map(int,input().split()));x.sort();b = x[n-1] - x[0]\r\nfor i in range(1,(k-n) + 1, 1):\r\n if x[i+n-1] - x[i] < b :b = x[i+n-1] - x[i]\r\nprint(b)", "n,m = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = max(arr) - min(arr)\r\nfor i in range(0, m-n+1):\r\n ans = min(ans, arr[i+n-1] - arr[i])\r\nprint(ans)", "k,n=list(map(int,input().split()))\nlist=list(map(int,input().split()))\nlist.sort()\n# 5 7 10 10 12 22\n# 0 1 2 3 4 5\nmn=9999999999999\nfor i in range(n-(k-1)):\n j=i+(k-1)\n mn=min(mn,list[j]-list[i])\n\nprint(mn)\n\n\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\npieces = list(map(int, input().split()))\r\npieces.sort()\r\nmin_diff = 1000\r\nfor i in range(m - n + 1):\r\n diff = pieces[i + n - 1] - pieces[i]\r\n min_diff = min(min_diff, diff)\r\nprint(min_diff)", "n, m = map(int, input().split())\r\nmseq = list(map(int, input().split()))\r\nmseq.sort()\r\nanswer = 10000\r\nzzz = m - n + 1\r\nfor i in range(zzz):\r\n temp = mseq[i + n - 1] - mseq[i]\r\n if temp < answer:\r\n answer = temp\r\nprint(answer)", "num_st , m_inshop = map(int,input().split())\r\nd = list(map(int,input().split()))\r\nd.sort()\r\nMIN = 10000\r\nfor i in range ( m_inshop - num_st + 1) :\r\n if ( d[i+num_st-1] - d[i] ) < MIN :\r\n MIN = d[i+num_st-1] - d[i]\r\nprint(MIN)", "def Puzzles( number_of_students , number_of_puzzles , quantities_of_pieces):\r\n quantities_of_pieces.sort()\r\n min_diff = float(\"inf\")\r\n for i in range(number_of_puzzles - number_of_students + 1):\r\n diff = quantities_of_pieces[i + number_of_students - 1] - quantities_of_pieces[i]\r\n min_diff = min(min_diff , diff)\r\n return min_diff\r\n\r\n\r\nif __name__ == \"__main__\":\r\n number_of_students , number_of_puzzles = map(int , input().split())\r\n quantities_of_pieces = list(map(int , input().split()[:number_of_puzzles]))\r\n print(Puzzles(number_of_students , number_of_puzzles , quantities_of_pieces))", "# Read input\r\nn, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# Sort the puzzles in ascending order of pieces\r\npuzzles.sort()\r\n\r\n# Initialize the minimum difference as a large number\r\nmin_diff = float('inf')\r\n\r\n# Iterate through the puzzles and find the minimum difference\r\nfor i in range(m - n + 1):\r\n diff = puzzles[i + n - 1] - puzzles[i]\r\n min_diff = min(min_diff, diff)\r\n\r\n# Print the minimum difference\r\nprint(min_diff)\r\n", "'''\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 :A. Puzzles\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\n\r\nn,m = map(int,input().split())\r\nf = []\r\nl = list(map(int,input().split()))\r\nfor i in range(m-n+1):\r\n l.sort()\r\n f.append(l[i+n-1]-l[i])\r\n \r\nprint(min(f))", "m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nmin1=10000\r\ni=0\r\nj=m[0]-1\r\nwhile j!=m[1]:\r\n min1=min(a[j]-a[i],min1)\r\n j+=1\r\n i+=1\r\nprint(min1)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=l[n-1]-l[0]\r\ni=0\r\nwhile i<m-(n-1) :\r\n if l[i+n-1]-l[i]<k :\r\n k=l[i+n-1]-l[i]\r\n i+=1\r\n\r\nprint(k)", "students, puzzles = map(int, input().split())\r\nsize = list(map(int, input().split()))\r\nsize.sort() # sort the puzzles by size\r\nans = 1000 # the answer (min diff), which we're setting to some large value\r\n\r\nL, R = 0, students-1\r\n# L and R represent pointers that determine the boundary of our window\r\n\r\nwhile R < puzzles: # don't want to get an out of bounds\r\n cur_diff = size[R] - size[L] # difference in the current window\r\n ans = min(ans, cur_diff) # update ans\r\n \r\n L += 1\r\n R += 1\r\n # make sure to shift the pointers 1 to the right to test the next window\r\n # or else you're going to TLE!!\r\n \r\nprint(ans) # woot", "n,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nf.sort()\r\nleast=f[n-1]-f[0]\r\nfor i in range(1,m-n+1):\r\n dif=f[i+n-1]-f[i]\r\n if dif<least:\r\n least=dif\r\nprint(least)", "n,m=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\ni=0\r\nj=n-1\r\ntemp=0\r\nres=99999999999999\r\nwhile j!=m:\r\n temp=abs(li[i]-li[j])\r\n res=min(temp,res)\r\n i+=1\r\n j+=1\r\nprint(res)", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nmin = l[n-1] - l[0]\r\nfor i in range(1, m-n+1):\r\n if l[i+n-1] - l[i] < min:\r\n min = l[i+n-1] - l[i]\r\nprint(min)\r\n", "n,m = map(int,input().split())\r\nf = list(map(int,input().split()))\r\nf.sort()\r\ncounter = 100000\r\nfor i in range(m-n+1):\r\n counter = min(counter,f[i+n-1]-f[i])\r\nprint(counter)", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf = sorted(f)\r\nMin = float(\"inf\")\r\nfor i in range(m + 1 - n):\r\n d = f[i + n - 1] - f[i]\r\n if d < Min:\r\n Min = d\r\nprint(Min)", "nm = list(map(int, input().split()))\r\nnumbers = sorted(list(map(int, input().split())), reverse=True)\r\nj = len(numbers)\r\ncount = 1000\r\nn, m = nm\r\nl = 0\r\nr = n - 1\r\n\r\nwhile r < j:\r\n if numbers[l] - numbers[r] < count:\r\n count = numbers[l] - numbers[r]\r\n\r\n l += 1\r\n r += 1\r\n\r\nprint(count)", "n,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nans=1001\r\nfor i in range(m-n+1):\r\n if l[i+n-1]-l[i]<ans:\r\n ans=l[i+n-1]-l[i]\r\nprint(ans)", "if __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n f = list(map(int, input().split()))\r\n f.sort()\r\n \r\n print(min(j-i for i,j in zip(f,f[n-1:])))", "n,m = map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nmin=lst[n-1]-lst[0]\r\nfor i in range(len(lst)-(n-1)):\r\n if lst[i+n-1]-lst[i]<min:\r\n min=lst[i+n-1]-lst[i]\r\nprint(min)\r\n \r\n \r\n ", "a=input().split()\r\nb=[int(i) for i in a]\r\nn=b[0]\r\nm=b[1]\r\nc=input().split()\r\nd=[int(i) for i in c]\r\nif n==m:\r\n print(max(d)-min(d))\r\nelse:\r\n min1=float('inf')\r\n d.sort()\r\n min1=float('inf')\r\n for i in range(len(d)):\r\n if i+n<=len(d):\r\n k=d[i:i+n][-1]-d[i:i+n][0]\r\n if k<min1:\r\n min1=k\r\n print(min1)\r\n", "\r\nimport math as mth\r\nimport sys\r\n#input=sys.stdin.readline\r\n\r\n\r\n\r\ndef solve():\r\n \r\n #n=int(input())\r\n n,m=list(map(int,input().split()))\r\n f=list(map(int,input().split()))\r\n s=0\r\n sm=1000\r\n f.sort()\r\n for i in range(m-n+1):\r\n s=f[i+n-1]-f[i]\r\n sm=min(s,sm) \r\n print(sm) \r\n return\r\n\r\ndef main():\r\n #for _ in range(int(input())):\r\n solve()\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = list(map(int, input().split(\" \")))\r\narr = list(map(int, input().split(\" \")))\r\n \r\narr.sort()\r\nres = arr[-1] + 1\r\nfor i in range(n - 1, len(arr)):\r\n res = min(res, arr[i] - arr[i - n + 1])\r\nprint(res)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 26 jan 2022\r\ndef exe():\r\n l=[]\r\n lst.sort()\r\n #print(lst)\r\n for i in range(m-n+1):\r\n x=lst[i]\r\n y=lst[i+n-1]\r\n z=y-x\r\n l+=[z]\r\n return min(l)\r\n \r\nn,m=map(int,input().split())\r\nlst=list(map(int,input().split())) \r\nprint(exe())", "n, m = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nd.sort()\r\nmin_num = 1000\r\nstart = 0\r\nfinish = n\r\nwhile finish <= m:\r\n c = max(d[start:finish])-min(d[start:finish])\r\n if c < min_num:\r\n min_num = c\r\n start += 1\r\n finish += 1\r\nprint(min_num)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nmi=999999\r\nfor i in range(m-n+1):\r\n mi= min(mi,a[i+n-1]-a[i])\r\nprint(mi)", "n,m = map(int, input().split())\nlst = list(map(int, input().split()))\n\nlst.sort()\n\nbest = 1e9\n\nfor i in range(len(lst) - n + 1):\n if lst[i + n - 1] - lst[i] < best:\n best = lst[i + n - 1] - lst[i]\nprint(best)", "n, m = map(int, input().split()); c = \"\"\r\na = sorted(list(map(int, input().split())))\r\nfor i in range(n-1, m):\r\n if c == \"\":\r\n c = abs(a[i] - a[i-(n-1)])\r\n elif c > abs(a[i] - a[i-(n-1)]):\r\n c = abs(a[i] - a[i-(n-1)])\r\nprint(c)", "n,m=map(int,input().strip().split())\r\nli=list(map(int,input().strip().split()))\r\nli.sort()\r\ni=0\r\nj=n-1\r\nans=li[j]-li[i]\r\n\r\nwhile j<m:\r\n an=li[j]-li[i]\r\n ans=min(ans,an)\r\n j+=1\r\n i+=1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nf = sorted(list(map(int, input().split())))\r\n\r\nmin_d = float('inf')\r\nfor i in range(m - n + 1):\r\n dif = f[i+n-1] - f[i]\r\n if dif < min_d:\r\n min_d = dif\r\n\r\nprint(min_d)", "# https://codeforces.com/problemset/problem/337/A\r\n\r\nn, m = map(int, input().split())\r\npuzzels = list(map(int, input().split()))\r\n\r\npuzzels.sort()\r\nmin_diff = 1000\r\nfor i in range(m-n+1):\r\n diff = puzzels[i+n-1] - puzzels[i]\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)", "def main():\r\n n, _ = map(int, input().split())\r\n numbers = sorted(list(map(int, input().split())))\r\n print(parts(numbers, n))\r\n\r\ndef parts(numbers, n):\r\n minimum = 999999999\r\n for i in range(len(numbers) - n + 1):\r\n if minimum > max(numbers[i:i + n]) - min(numbers[i:i + 2]):\r\n minimum = max(numbers[i:i + n]) - min(numbers[i:i + 2])\r\n return minimum\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nnx=x[n-1]-x[0]\r\nfor i in range(1, m - n + 1):\r\n if x[i+n-1] - x[i] < nx:\r\n nx = x[i+n-1] - x[i]\r\nprint(nx)", "sAndp = list(map(int, input().split(' ')))\r\nn = sAndp[0]\r\nm = sAndp[1]\r\n\r\nm_list = list(map(int, input().split(' ')))\r\nm_list.sort()\r\nitN = m - n + 1\r\nmin_dist = m_list[n-1] - m_list[0]\r\nfor i in range(itN):\r\n dist = m_list[i+n-1] - m_list[i]\r\n if min_dist > dist:\r\n min_dist = dist\r\n\r\nprint(min_dist)", "\r\ndef momey(n,m):\r\n answer = []\r\n b = []\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n for i in range(len(a)):\r\n c = a[i:i+n]\r\n if len(c) == n:\r\n b.append(c)\r\n for el in b:\r\n raz = max(el) - min(el)\r\n answer.append(raz)\r\n return min(answer)\r\n\r\nn,m = list(map(int,input().split()))\r\nprint(momey(n,m))\r\n\r\n", "n, m = map(int,input().split())\r\npuzzle = list(map(int,input().split()))\r\n\r\npuzzle.sort()\r\narreglo_diferencias = []\r\n\r\nfor i in range(m-n+1):\r\n resta_dife = puzzle[i+n-1] - puzzle[i]\r\n arreglo_diferencias.append(resta_dife)\r\n \r\nprint(min(arreglo_diferencias))", "\r\nnum_of_std,num_of_puz=map(int,input().split())\r\npuzs=sorted(list(map(int,input().split())))\r\nmn=99999999\r\nfor i in range(num_of_std-1,num_of_puz):\r\n gap=puzs[i]-puzs[i-(num_of_std-1)]\r\n if gap<mn:\r\n mn=gap\r\nprint(mn)", "# Read input values\r\nn, m = map(int, input().split())\r\npuzzle_sizes = list(map(int, input().split()))\r\n\r\n# Sort the puzzle sizes\r\npuzzle_sizes.sort()\r\n\r\n# Initialize pointers and variables\r\nleft = 0\r\nright = n - 1\r\nminDifference = float('inf') # Initialize with a large value\r\n\r\n# Iterate over the sorted puzzle sizes\r\nwhile right < m:\r\n difference = puzzle_sizes[right] - puzzle_sizes[left]\r\n minDifference = min(minDifference, difference)\r\n left += 1\r\n right += 1\r\n\r\n# Print the result\r\nprint(minDifference)\r\n", "entrada = [int(x) for x in input().split(' ')]\r\nentrada2 = [int(x) for x in input().split(' ')]\r\nentrada2.sort()\r\n\r\nn = entrada[0]\r\nm = entrada[1]\r\n\r\nminimo = -1\r\nfor i in range(m-n+1):\r\n diferenca = entrada2[i+n-1] - entrada2[i]\r\n if minimo < 0 or diferenca < minimo:\r\n minimo = diferenca\r\n\r\nprint(minimo)", "I = lambda:map(int, input().split())\r\nn, m = I(); a = sorted(I())\r\nprint(min(f-i for i, f in zip(a, a[n-1:])))", "n, m = list(map(int,input().split()))\r\nf = list(map(int,input().split()))\r\n\r\nf.sort()\r\ni = n-1\r\nanswer = -1\r\nwhile i < m :\r\n j = f[i]-f[i-n+1]\r\n if j<answer or answer==-1:\r\n answer = j\r\n i+=1\r\nprint(answer)\r\n\r\n\r\n\r\n", "\r\n\r\ndef uber():\r\n n , m = [int(x) for x in input().split()]\r\n piece = [int(x) for x in input().split()]\r\n\r\n piece.sort()\r\n a = 0\r\n b = n-1\r\n\r\n small = piece[n-1]-piece[0]\r\n while b <= m-1:\r\n if (piece[b]-piece[a]) < small:\r\n small = piece[b]-piece[a]\r\n \r\n a += 1\r\n b += 1\r\n\r\n print(small)\r\nuber()", "n,m=map(int,input().split())\r\nf=list (map(int,input().split()))\r\nf.sort()\r\nl=[]\r\ni=0\r\nj=n+1\r\nfor _ in range (m-n+1):\r\n l.append(f[i:j][n-1]-f[i:j][0])\r\n i+=1\r\n j+=1\r\n\r\nprint(min(l))", "n, m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\nminDiff = float('inf')\r\nfor i in range(m - n + 1):\r\n diff = f[i+n-1] - f[i]\r\n if diff < minDiff:\r\n minDiff = diff\r\nprint(minDiff)", "chldrin , present = map(int , input().split()) \r\nl = sorted(list(map(int , input().split())))\r\nponter1 , pointer2 = 0 , chldrin -1\r\nmn = None \r\nwhile pointer2 != present : \r\n diff = abs(l[pointer2] - l[ponter1]) \r\n if mn is None or mn > diff : \r\n mn = diff \r\n pointer2 += 1\r\n ponter1 += 1 \r\nprint(mn)\r\n", "line1 = input().strip().split()\r\nline2 = sorted([int(x) for x in input().strip().split()])\r\n\r\nn, m = int(line1[0]), int(line1[1])\r\nlis = []\r\nfor i in range(m-n+1):\r\n\tarr = line2[i:n+i]\r\n\tlis.append(arr[-1] - arr[0])\r\nprint(min(lis))", "# To find the least possible difference between the number of pieces in the largest and smallest puzzles that the\n# teacher buys, we can sort the array of puzzle pieces and iterate over it to find the smallest possible difference.\n#\n# Here's how we can solve this problem:\n#\n# Read the values of n and m.\n# Read the array of m puzzle pieces.\n# Sort the puzzle pieces in non-decreasing order.\n# Initialize the minimum difference (min_diff) to be a large value, such as infinity.\n# Iterate from i = 0 to m - n:\n# a. Calculate the difference between the puzzle at index i + n - 1 and the puzzle at index i.\n# b. If the calculated difference is smaller than min_diff, update min_diff with the new value.\n# Print the value of min_diff.\nn, m = map(int, input().split())\npuzzle_pieces = list(map(int, input().split()))\n\npuzzle_pieces.sort()\n\nmin_diff = float('inf')\n\nfor i in range(m - n + 1):\n diff = puzzle_pieces[i + n - 1] - puzzle_pieces[i]\n min_diff = min(min_diff, diff)\n\nprint(min_diff)\n", "n,m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\nq = []\r\ndef difference(x1, x2):\r\n global maxim\r\n global minim\r\n global n1\r\n \r\n if len(f[x1:x2]) == n:\r\n maxim = max(f[x1:x2])\r\n minim = min(f[x1:x2])\r\n else:\r\n n1 = f[x1::] + f[0:(n-len(f[x1:x2]))]\r\n \r\n maxim = max(n1)\r\n minim = min(n1)\r\n return(maxim - minim)\r\n \r\nfor i in range(m):\r\n d = difference(i, n+i)\r\n q.append(d)\r\n \r\nprint(min(q))\r\n", "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 = get_list()\r\nar = sorted(ar)\r\nmx = ar[n-1]-ar[0]\r\nfor i in range(1,m-n+1):\r\n mx = min(ar[i+n-1]-ar[i],mx)\r\nprint(mx)", "n,m=map(int,input().split(\" \"))\r\narr=list(map(int,input().split(\" \")))\r\ndiff=10000\r\narr.sort()\r\nfor k,v in enumerate(arr):\r\n\tif k+n-1<m and arr[k+n-1]-arr[k]<diff:\r\n\t\tdiff=arr[k+n-1]-arr[k]\r\nprint (diff)", "n, m = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narray.sort()\r\n\r\nleast_value = array[n - 1] - array[0]\r\nfor i in range(1, m - n + 1):\r\n if least_value > array[i + n - 1] - array[i]:\r\n least_value = array[i + n - 1] - array[i]\r\n\r\nprint(least_value)\r\n", "def traveller(a,b,maxminus):\r\n if b == m:\r\n print(maxminus)\r\n return\r\n elif a == 0 or f[b]-f[a] < maxminus:\r\n maxminus = f[b]-f[a]\r\n traveller(a+1,b+1,maxminus)\r\n\r\n#sortedlist=[1,2,3,4,5,6,7]\r\n#go from 1-4, 2-5, 3-6, 4-7. and compare\r\n\r\nn, m = [int(i) for i in input().split()]\r\nf = [int(i) for i in input().split()]\r\n\r\nf.sort()\r\ntraveller(0,n-1,0)\r\n\r\n", "import math\r\n#n, m, a = int(input())\r\na = list(map(int, input().split(\" \")))\r\nb = list(map(int, input().split(\" \")))\r\nsortedArr = sorted(b)\r\nl, r = 0, a[0]-1\r\nminimum = 1000000\r\nwhile r < a[1]:\r\n gap = sortedArr[r] - sortedArr[l]\r\n r += 1\r\n l += 1\r\n minimum = min(gap, minimum)\r\nprint(minimum)", "I = lambda: map(int, input().split())\r\nn, m = I()\r\na = sorted(I())\r\nprint(min(j-i for i,j in zip(a,a[n-1:])))", "n, m = [int(i) for i in input().split()]\r\npieces = [int(i) for i in input().split()]\r\n\r\npieces.sort()\r\n\r\ndiff = 1e10\r\nfor i in range(len(pieces)-n+1):\r\n\r\n diff = min(diff, pieces[i+n-1]-pieces[i])\r\n\r\nprint(diff)\r\n", "# Input\r\nn, m = map(int, input().split())\r\npuzzle_quantities = list(map(int, input().split()))\r\n\r\n# Sort the puzzle quantities in ascending order\r\npuzzle_quantities.sort()\r\n\r\n# Initialize min_difference to a large value\r\nmin_difference = 1001\r\n\r\n# Iterate through the array of puzzle quantities\r\nfor i in range(m - n + 1):\r\n difference = puzzle_quantities[i + n - 1] - puzzle_quantities[i]\r\n min_difference = min(min_difference, difference)\r\n\r\n# Output the minimum difference\r\nprint(min_difference)\r\n", "a, b = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\na -= 1\r\nprint(min([lst[i+a] - n for i, n in enumerate(lst[:-a])]))", "n,m=map(int, input().split())\r\narr=[int(arr) for arr in input().split()]\r\narr=sorted(arr)\r\ni=0\r\nj=n-1\r\nm=arr[j]-arr[i]\r\nwhile j <len(arr):\r\n if(arr[j]-arr[i]<m):\r\n m=arr[j]-arr[i]\r\n i=i+1\r\n j=j+1\r\nprint(m)", "n, m = [int(x) for x in input().split()]\r\nf = [int(x) for x in input().split()]\r\nf.sort()\r\n\r\nmin_diff = 1000\r\n\r\nfor i in range(m-n+1):\r\n min_diff = min(min_diff, f[i+n-1]-f[i])\r\nprint(min_diff)", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# Sort the puzzle sizes in ascending order\r\npuzzles.sort()\r\n\r\n# Initialize the minimum difference with a large value\r\nmin_difference = float('inf')\r\n\r\n# Iterate through the puzzle sizes to find the minimum difference\r\nfor i in range(m - n + 1):\r\n difference = puzzles[i + n - 1] - puzzles[i]\r\n min_difference = min(min_difference, difference)\r\n\r\n# Print the least possible difference\r\nprint(min_difference)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ni=0\r\nj=n-1\r\nk=[]\r\nwhile j < m:\r\n k.append(a[j]-a[i])\r\n i+=1\r\n j+=1\r\nprint(min(k))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nmin_diff=10000\r\nfor i in range(m-n+1):\r\n diff=l[i+n-1]-l[i] \r\n min_diff=min(diff,min_diff)\r\nprint(min_diff)", "user = list(map(int, input().split()))\r\nm = user[0]\r\nn = user[1]\r\nnumbers = list(map(int, input().split()))\r\nnumbers.sort()\r\ndifferences = []\r\ni = 0\r\nwhile i < (n-m+1):\r\n differences.append(numbers[i+m-1] - numbers[i])\r\n i += 1\r\n\r\nprint(min(differences))", "n,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nmin_diff=float('inf')\r\nfor i in range(m-n+1):\r\n diff =a[i+n-1]-a[i]\r\n if diff<min_diff:\r\n min_diff=diff\r\nprint(min_diff)", "'''\r\n4 6\r\n10 12 10 7 5 22\r\n'''\r\n\r\na,b= map(int, input().split())\r\nn = list(map(int, input().split()))\r\n\r\nn.sort()\r\nout = 1001\r\nfor i in range(b-a+1):\r\n\tout = min(out, n[i+a-1] - n[i])\r\n\t# print(i, i+a-1, out, n)\r\nprint(out)", "n, m = list(map(int, input().split()))\n\njigsaws = list(map(int, input().split()))\njigsaws.sort()\n\nleft_idx = 0\nright_idx = n-1\nmin_diff = jigsaws[right_idx] - jigsaws[left_idx]\n\nwhile(right_idx < m):\n act_diff = jigsaws[right_idx] - jigsaws[left_idx]\n if (act_diff < min_diff):\n min_diff = act_diff\n right_idx +=1\n left_idx +=1\nprint (min_diff)\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\npuzzle = list(map(int, input().split()))\r\npuzzle.sort()\r\ndiff = []\r\nans = []\r\nfor i in range(m - n + 1):\r\n ans.append(puzzle[i:(i+n)])\r\nfor i in ans:\r\n diff.append(max(i) - min(i))\r\nprint(min(diff))", "buy_count, total_count = [int(x) for x in input().split()]\r\nsizes = [int(x) for x in input().split()]\r\nsizes.sort()\r\n\r\ncandidate = -1\r\nfor i in range(total_count - buy_count + 1):\r\n difference = sizes[i + buy_count - 1] - sizes[i]\r\n if candidate == -1 or difference < candidate:\r\n candidate = difference\r\nprint(candidate)\r\n", "import sys\r\ndef solve(n,m,l):\r\n res=sys.maxsize\r\n l.sort()\r\n for i in range(m-n+1):\r\n res=min(res,l[i+n-1]-l[i])\r\n\r\n return res\r\n\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(solve(n,m,l))", "n, m = map(int, input().split())\r\nls = sorted(list(map(int, input().split())))\r\nmin = 1000\r\n\r\nfor i in range(m - n + 1):\r\n if ls[i + n - 1] - ls[i] < min:\r\n min = ls[i + n - 1] - ls[i]\r\n\r\nprint(min)", "n, m = map(int, input().split())\r\ndata = [int(x) for x in input().split()]\r\nminNum = 1000\r\n\r\ndata.sort()\r\n\r\nfor i in range(n - 1, m):\r\n if data[i] - data[i - n + 1] < minNum:\r\n minNum = data[i] - data[i - n + 1]\r\n\r\nprint(minNum)\r\n\r\n\r\n", "# ЖАДНЫЕ АЛГОРИТМЫ\r\n\r\nFUN = lambda : map(int, input().split())\r\n\r\nn, m = FUN()\r\nf = sorted(FUN())\r\n\r\nsearch = min( j - i for i,j in zip (f, f[n-1:]))\r\n# n - 1 - \r\nprint(search)\r\n", "n, m = map(int, input().split())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nleast = l[n-1] - l[0]\r\n\r\nfor i in range(1, m-n+1):\r\n if l[i+n-1] - l[i] < least:\r\n least = l[i+n-1] - l[i]\r\n \r\nprint(least)", "n, m = (map(int, input().split()))\r\nf = sorted(map(int, input().split()))\r\nx = []\r\nfor i, j in zip(f, f[n - 1:]):\r\n x.append(j - i)\r\nprint(min(x))", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nprev = l[0]\r\nr = []\r\nc = max(l) - min(l)\r\nfor i in range(m-n+1):\r\n for j in range(n):\r\n r.append(l[i+j])\r\n #print(r)\r\n c = min((max(r) - min(r)), c)\r\n r = []\r\nprint(c)", "value = list(map(int, input().split(' ')))\r\nm, n = value[0], value[1]\r\nf = list(map(int, input().split(' ')))\r\nf.sort()\r\nmn = -1\r\nfor i in range(n - m + 1):\r\n if mn == -1 or f[i + m - 1] - f[i] < mn:\r\n mn = f[i + m - 1] - f[i]\r\nprint(mn)", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ni = 0\r\nj = n-1\r\nt = 0\r\nres = 99999999999999\r\nwhile j != m:\r\n t = abs(l[i]-l[j])\r\n res = min(t,res)\r\n i += 1\r\n j += 1\r\nprint(res)", "n,m=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nf.sort()\r\na=f[n-1]-f[0]\r\nfor i in range (1,m-n+1):\r\n if f[i+n-1]-f[i]<a:\r\n a=f[i+n-1]-f[i]\r\nprint(a)\r\n", "n, m = [int(x) for x in input().split()]\r\nx = [int(x) for x in input().split()]\r\ny = []\r\nx.sort()\r\n\r\ni = 0\r\nj = n - 1\r\nwhile j < len(x):\r\n y.append(x[j] - x[i])\r\n i += 1\r\n j += 1\r\nprint(min(y))\r\n", "\r\nn, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# Сортируем массив с количеством фрагментов в пазлах\r\npuzzles.sort()\r\n\r\n# Инициализируем минимальную разницу значением первого и последнего пазла\r\nmin_diff = puzzles[n-1] - puzzles[0]\r\n\r\n# Проверяем остальные возможные комбинации пазлов\r\nfor i in range(1, m-n+1):\r\n diff = puzzles[i+n-1] - puzzles[i]\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\n# Выводим минимальную разницу\r\nprint(min_diff)\r\n\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\nres = 1000\r\nfor i in range(n - 1, m):\r\n res = min(res, a[i] - a[i - n + 1])\r\n\r\nprint(res)\r\n", "students,puzzles=map(int,input().split())\r\npieces=list(map(int,input().split()))\r\npieces.sort()\r\noutput=abs(pieces[0]-pieces[students-1])\r\nfor i in range(1,puzzles-students+1):\r\n output=min(abs(pieces[students-1+i]-pieces[i]),output)\r\nprint(output)", "def main():\n n, m = (int(_) for _ in input().split())\n pieces = list(int(_) for _ in input().split())\n pieces.sort()\n\n least_diff = 1e9\n\n for i in range(n - 1, len(pieces)):\n if least_diff > pieces[i] - pieces[i - n + 1]:\n least_diff = pieces[i] - pieces[i - n + 1]\n\n print(least_diff)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nd = max(l) - min(l)\r\nfor i in range(m - n + 1):\r\n k = l[i:i + n]\r\n if max(k) - min(k) < d:\r\n d = max(k) - min(k)\r\nprint(d)", "n,m = map(int,input().split())\r\npuzz = sorted(list(map(int,input().split())))\r\nans = 100000\r\nfor i in range(n,m+1):\r\n ans = min(ans,puzz[i-1]-puzz[i-n])\r\nprint(ans)", "I=lambda:map(int,input().split());\r\nn, m = map(int, input().split())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\nprint(min(j-i for i,j in zip(a,a[n-1:])))", "n, m = map(int, input().split()) \r\nf = list(map(int, input().split()))\r\n\r\nf.sort()\r\nmin_diff = f[n-1] - f[0]\r\n\r\nfor i in range(1, m-n+1):\r\n diff = f[i+n-1] - f[i] \r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)\r\n", "input_ls = [int(a) for a in input().split(\" \")]\r\nn = input_ls[0]\r\nm = input_ls[1]\r\npieces = [int(a) for a in input().split(\" \")]\r\npieces.sort()\r\ndiff = []\r\nfor i in range(n-1, m):\r\n diff.append(pieces[i]-pieces[i-n+1])\r\nprint(min(diff))", "n, k = [int(x) for x in input().split()]\nf = [int(x) for x in input().split()]\nf.sort()\nans = 10001\nfor i in range(0, len(f) - n + 1):\n # i ... i + n - 1\n s = f[i + n - 1] - f[i]\n if s < ans:\n ans = s\nprint(ans)", "n,m = map(int, input().split())\r\nf = sorted(map(int, input().split()))\r\n\r\nmin_diff = float('inf')\r\nmax_diff = float('-inf')\r\n\r\nfor i in range(m - n + 1):\r\n diff = f[i + n - 1] - f[i]\r\n min_diff = min(min_diff, diff)\r\n max_diff = max(max_diff, diff)\r\n\r\nprint(min_diff)\r\n", "import sys\r\ninp = sys.stdin.readline\r\n\r\ndef puzzles(a, b, c):\r\n c.sort()\r\n min1 = float('inf')\r\n for i in range(b-a+1):\r\n min1 = min(min1, c[i+a-1] - c[i])\r\n return min1\r\n\r\ndef main():\r\n a, b = map(int, inp().strip().split())\r\n c = list(map(int, inp().strip().split()))\r\n result = puzzles(a, b, c)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input().split())\nqtd = sorted(map(int, input().split()))\nprint(min(j-i for i, j in zip(qtd, qtd[n-1:])))\n\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\npuzzle_pieces = list(map(int, input().split()))\r\n\r\n# Sort the list of puzzle pieces\r\npuzzle_pieces.sort()\r\n\r\n# Initialize the minimum difference with a large value\r\nmin_difference = float('inf')\r\n\r\n# Iterate through all possible sequences of n puzzles\r\nfor i in range(m - n + 1):\r\n difference = puzzle_pieces[i + n - 1] - puzzle_pieces[i]\r\n min_difference = min(min_difference, difference)\r\n\r\nprint(min_difference)\r\n", "n, m = map(int, input().split(\" \"))\r\nf = list(map(int, input().split(\" \")))\r\n\r\nf.sort() # Sort the list in ascending order\r\n\r\nmin_diff = float('inf') # Initialize with a large value\r\n\r\nfor right in range(n, m + 1):\r\n min_diff = min(min_diff, f[right - 1] - f[right - n])\r\n\r\nprint(min_diff)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nc, mc = 0, 10000\r\nwhile len(a) >= n:\r\n c = a[n-1] - a[0]\r\n mc = min(mc, c)\r\n a = a[1:]\r\nprint(mc)\r\n", "n, m = map(int,input().split())\r\nA = input().split()\r\nfor i in range(m):\r\n A[i] = int(A[i])\r\nA.sort()\r\nB = []\r\nfor i in range(m-n+1):\r\n B.append(A[i+n-1]-A[i])\r\nprint(min(B))\r\n", "n,m=map(int,input().split())\r\na=sorted([int(i) for i in input().split()])\r\nc=[]\r\nfor i in range(m-n+1):\r\n c.append(a[i+n-1]-a[i])\r\nprint(min(c))\r\n", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# sort the puzzles in non-decreasing order\r\npuzzles.sort()\r\n\r\n# initialize the minimum difference with a large value\r\nmin_diff = float('inf')\r\n\r\n# iterate through all possible pairs of puzzles\r\nfor i in range(m - n + 1):\r\n diff = puzzles[i+n-1] - puzzles[i]\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)\r\n", "n,m = list(map(int,input().split(' ')))\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\nds = []\r\n\r\nfor i in range(m+1-n):\r\n ds.append(l[i+n-1]-l[i])\r\n\r\nprint(min(ds))", "n, m = [int(i) for i in input().split(' ')]\r\nA = [int(i) for i in input().split(' ')]\r\n\r\nA.sort()\r\nres = []\r\nfor item in range(m-n+1):\r\n res.append(abs(A[item] - A[item+n-1]))\r\nprint(min(res))\r\n", "s,n = list(map(int, input().split()))\nprices = list(map(int, input().split()))\nprices.sort()\ndif = 999\n\nfor i in range(n-s+1):\n if prices[i+(s-1)] - prices[i] < dif:\n dif = prices[i+(s-1)] - prices[i]\nprint(dif)", "nm = input().split()\r\nnm = [int(x) for x in nm]\r\nn = nm[0]\r\nm = nm[1]\r\narray = input().split()\r\narray = [int(x) for x in array]\r\n\r\ndef task(n,m,array):\r\n results = []\r\n result = 0\r\n array.sort()\r\n for i in range(m):\r\n try:\r\n result = array[i+n-1] - array[i]\r\n results.append(result)\r\n except:\r\n pass\r\n return min(results)\r\n\r\nprint(task(n,m,array))", "import math\r\nn,m=map(int,input().split())\r\na=sorted([int(x) for x in input().split()])\r\nbest=math.inf\r\nfor i in range(m):\r\n if n+i-1>=m:break\r\n best=min(best,a[n+i-1]-a[i])\r\nprint(best)", "def f():\r\n L=[]\r\n n,m=list(map(int,input().split()))\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n d=l[-1]\r\n for a in range(m-n+1):\r\n if d>l[a+n-1]-l[a]:\r\n d=l[a+n-1]-l[a]\r\n print(d)\r\n \r\n\r\nf()\r\n\r\n", "n,m = map(int,input().strip().split())\r\nl = list(map(int,input().strip().split()))\r\nl.sort()\r\nans = l[n - 1] - l[0]\r\nfor i in range(1,(m-n) + 1):\r\n ans = min(ans,l[i+n-1] - l[i])\r\nprint(ans)", "inp1 = input(\"\")\r\ninp1_lst = [int(i) for i in inp1.split()]\r\nn = inp1_lst[0]\r\nm = inp1_lst[1]\r\nmth = input(\"\")\r\nm_lst = [int(i) for i in mth.split()]\r\nm_lst.sort()\r\nlowest = None\r\nj = n-1\r\nfor i in range(len(m_lst)-1):\r\n if j >= len(m_lst):\r\n break\r\n dif = m_lst[j] - m_lst[i]\r\n j += 1\r\n if i == 0:\r\n lowest = dif\r\n elif dif < lowest:\r\n lowest = dif\r\n\r\nprint(lowest)", "n, m = map(int, input().split(\" \"))\r\np = list(map(int, input().split(\" \")))\r\np.sort()\r\nd = p[len(p)-1]\r\nfor i in range((m-n)+1):\r\n d = min(d, p[(i + n)-1] - p[i])\r\n\r\nprint(d)\r\n", "q,qq = input().split()\r\nq = int(q)\r\nqq = int(qq)\r\nrow = input().split()\r\nrow_x = []\r\nfor _ in row:\r\n row_x.append(int(_))\r\n\r\ndef foobar(row):\r\n row = sorted(row)\r\n res = []\r\n r = q\r\n g = 0\r\n for _ in range(qq-q+1):\r\n d = row[r-1]-row[g]\r\n r = r +1\r\n g = g +1\r\n res.append(d)\r\n return min(res)\r\nprint(foobar(row_x))", "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\np.sort()\r\nmi=float('inf')\r\nfor i in range(m-n+1):\r\n d=p[i+n-1]-p[i]\r\n mi=min(mi,d)\r\nprint(mi)", "n , m = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\nx = arr[-1]\r\nfor i in range(m-n+1) :\r\n if arr[i+n-1] - arr[i] < x :\r\n x = arr[i+n-1] - arr[i]\r\nprint(x)", "n, m = map(int, input().split())\r\npieces = sorted(map(int, input().split()))\r\n\r\nminDiff = float('inf')\r\n\r\nfor i in range(m - n + 1):\r\n diff = pieces[i + n - 1] - pieces[i]\r\n minDiff = min(minDiff, diff)\r\n\r\nprint(minDiff)\r\n", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\npuzzles.sort()\r\navg_pieces = sum(puzzles) / m\r\n\r\nmin_diff = float('inf')\r\nfor i in range(m - n + 1):\r\n max_pieces = puzzles[i + n - 1]\r\n min_pieces = puzzles[i]\r\n diff = max_pieces - min_pieces\r\n if diff < min_diff:\r\n min_diff = diff\r\n\r\nprint(min_diff)", "n, m = [int(x) for x in input().split(\" \")]\r\nx = [int(x) for x in input().split(\" \")]\r\nx = sorted(x)\r\ny = list()\r\nfor i in range(n - 1, len(x)):\r\n differ = x[i] - x[i - (n - 1)]\r\n y.append(differ)\r\ny = sorted(y)\r\nprint(y[0])", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))[:m]\r\nlst.sort()\r\nans=lst[-1]\r\nfor i in range(0,m-n+1):\r\n ans=min(ans,lst[i:i+n][-1]-lst[i:i+n][0])\r\nprint(ans)\r\n\r\n", "add,num = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nt = add-1\r\nminim =ls[t]-ls[0]\r\nfor i in range(num-t):\r\n\t if ls[i+t]-ls[i] < minim:\r\n\t \tminim = ls[i+t]-ls[i]\r\n\t \r\nprint(minim)", "n,m = map(int,input().split())\r\nlst = sorted(list(map(int,input().split())))\r\njudge_lst = []\r\nfor i in range(len(lst)-(n-1)):\r\n num = lst[i+n-1] - lst[i]\r\n judge_lst.append(num)\r\nanswer = min(judge_lst)\r\nprint(answer)", "n, m = map(int, input().split())\r\np = sorted(map(int, input().split()))\r\nprint(min(p[i+n-1]-p[i] for i in range(m-n+1)))", "a,b=map(int,input().split())\r\nc=[int (i) for i in input().split()]\r\nc.sort()\r\nm=[]\r\nfor n in range(b-a+1):\r\n m.append(c[n+a-1]-c[n]) \r\nprint (min(m))", "raw_a = input()\nraw_b = input()\n\ndelim_a = raw_a.split()\n\nn = int(delim_a[0])\n\n# print(\"n is: \", n)\n\ndelim_b = raw_b.split()\n\npuzzles = []\n\nfor entry in delim_b:\n\n puzzles.append(int(entry))\n\npuzzles.sort()\n\n# print(\"sorted puzzles is: \", puzzles)\n\nminimum_diff = puzzles[-1] - puzzles[0]\n\n# print(\"minimum_diff to beat is \", minimum_diff)\n\n# 6 - 4 + 1\nfor i in range(len(puzzles)-(n)+1):\n\n # print(\"currently on index \", i)\n\n _slice = puzzles[i:i+n]\n\n # print('Slice is: ', _slice)\n\n result = _slice[-1] - _slice[0]\n\n # print(\"slice diff is: \", result)\n\n if result < minimum_diff:\n\n # print(\"Found smaller diff, setting new\")\n\n minimum_diff = result\n\nprint(minimum_diff)\n\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmin = 2000\r\nfor i in range(n-1, m):\r\n if a[i] - a[i-n+1] < min:\r\n min = a[i] - a[i-n+1]\r\nprint(min)\r\n", "n,m=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nr=0\r\nl=0\r\nc=0\r\noo=[]\r\npp=[]\r\nwhile r!=m:\r\n if c!=n:\r\n oo+=[b[r]]\r\n c+=1\r\n r+=1\r\n elif c==n:\r\n oo.remove(b[l])\r\n c-=1\r\n l+=1\r\n if len(oo)==n:\r\n pp+=[oo[-1]-oo[0]]\r\nprint(min(pp))\r\n\r\n\r\n\r\n", "a,s=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nk=19999988888\r\nb.sort()\r\nfor x in range(s-a+1):\r\n if b[a+x-1]-b[x]<k:\r\n k=b[a+x-1]-b[x]\r\nprint(k)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nc = 1e9\r\ni = 0\r\nj = n-1\r\nwhile j<m :\r\n c = min(max(a[i:j+1])-min(a[i:j+1]),c)\r\n i += 1\r\n j += 1\r\nprint(c)", "x, y = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns.sort()\r\nless = []\r\nfor i in range(y-x+1):\r\n dif = s[x+i-1]-s[i]\r\n less.append(dif)\r\nprint(min(less))\r\n", "def main():\r\n n, m = [int(x) for x in input().split()]\r\n a = sorted([int(x) for x in input().split()])\r\n r, l, d = a[n - 1], a[0], a[n - 1] - a[0]\r\n for i in range(m - n):\r\n if a[n + i] - a[i + 1] < d:\r\n r, l, d = a[n + i], a[i + 1], a[n + i] - a[i + 1]\r\n print(d)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\nlist1 = sorted(list(map(int, input().split())))\r\nmin_val = 10000000\r\nfor i in range(0, m - n + 1):\r\n min_val = min(min_val, list1[i + n - 1] - list1[i])\r\nprint(min_val)", "s = list(input().split())\r\nn = int(s[0]) - 1\r\nm = int(s[1])\r\ns = list(input().split())\r\nfor i in range(m):\r\n s[i] = int(s[i])\r\n \r\ns.sort()\r\nans = s[-1]-s[0]\r\nfor i in range(m-n):\r\n ans = min(ans,s[i+n]-s[i])\r\nprint(ans)", "n, m = map(int, input().split())\r\npuzzles = list(map(int, input().split()))\r\n\r\n# Sort the puzzles in non-decreasing order of their number of pieces\r\npuzzles.sort()\r\n\r\n# Initialize the minimum difference as the difference between the last two puzzles\r\nmin_diff = puzzles[n-1] - puzzles[0]\r\n\r\n# Iterate over all possible sets of n puzzles\r\nfor i in range(1, m - n + 1):\r\n diff = puzzles[i+n-1] - puzzles[i]\r\n min_diff = min(min_diff, diff)\r\n\r\n# Print the minimum difference\r\nprint(min_diff)\r\n", "number_of_student, number_of_puzzles = input().split()\r\nnumber_of_pieces = input().split()\r\npuzzle_pieces = [int(num) for num in number_of_pieces]\r\npuzzle_pieces.sort()\r\ni_min = 0\r\ni_max = int(number_of_student) - 1\r\ndiff = float('inf')\r\nwhile i_max < int(number_of_puzzles):\r\n difference = puzzle_pieces[i_max] - puzzle_pieces[i_min]\r\n if difference < diff:\r\n diff = difference\r\n i_max += 1; i_min += 1\r\nprint(diff)", "n , m = map ( int , input().split())\r\na =sorted( list(map ( int , input().split())))\r\nmins= a[-1]\r\nfor i in range(m-n+1):\r\n mins = min(mins,a[i+n-1]-a[i])\r\nprint(mins)", "n,p=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\n\r\n\r\narr.sort()\r\ncurr_best=float('inf')\r\nfor index in range(len(arr)):\r\n end=index+(n-1)\r\n if end<p:\r\n mini=arr[index:end+1][0]\r\n maxi=arr[index:end+1][-1]\r\n curr_best=min(curr_best,maxi-mini)\r\n else:\r\n break\r\nprint(curr_best)", "n,m = [int(num) for num in input().split(' ')]\r\narr = [int(num) for num in input().split(' ')]\r\narr.sort()\r\nstart = 0\r\nend = n-1\r\nans = arr[end]-arr[start]\r\nwhile end < len(arr):\r\n ans = min(ans, arr[end]-arr[start])\r\n start += 1\r\n end += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ni=0\r\nj=n-1\r\nt=0\r\nr=99999999999999\r\nwhile j!=m:\r\n t=abs(l[i]-l[j])\r\n r=min(t,r)\r\n i+=1\r\n j+=1\r\nprint(r)", "n, m = map(int, input().split())\r\nlist0 = list(map(int, input().split()))\r\nlist0.sort()\r\n\r\nmin_diff = float('inf')\r\nfor i in range(m - n + 1):\r\n diff = list0[i + n - 1] - list0[i]\r\n min_diff = min(min_diff, diff)\r\n\r\nprint(min_diff)" ]

[ "q = 10001\r\nn, a = int(input()), list(map(int, input().split()))\r\na.sort()\r\nfor i in range(40000 // (n - 1) + 1):\r\n b = [a[j] - j * i for j in range(n)]\r\n u, v = max(b), min(b)\r\n p = (u - v + 1) // 2\r\n if p < q: q, s, d = p, v + p, i\r\nprint(q)\r\nprint(s, d)\r\n\n", "q=10001\r\nn,a=int(input()),list(map(int,input().split()))\r\na.sort()\r\nfor i in range(40000//(n-1)+1):\r\n b=[a[j]-j*i for j in range(n)]\r\n u,v=max(b),min(b)\r\n p=(u-v+1)//2\r\n if p<q: q,s,d=p,v+p,i\r\nprint(q)\r\nprint(s,d)" ]

[ "from operator import itemgetter\r\nn=int(input().strip())\r\nans=0\r\nl=[]\r\nfor i in range(n):\r\n\tl.append([int(x) for x in input().strip().split()])\r\n \r\nl.sort(key=itemgetter(1))\r\nx=l[0][1]\r\ny=1\r\nfor i in range(1,len(l)):\r\n\tif l[i][1]!=x:\r\n\t\tans=ans+(y*(y-1))//2\r\n\t\tx=l[i][1]\r\n\t\ty=1\r\n\telse:\r\n\t\ty=y+1\r\nans=ans+(y*(y-1))//2\r\n \r\nl.sort()\r\nx=l[0][0]\r\ny=1\r\nfor i in range(1,len(l)):\r\n\tif l[i][0]!=x:\r\n\t\tans=ans+(y*(y-1))//2\r\n\t\tx=l[i][0]\r\n\t\ty=1\r\n\telse:\r\n\t\ty=y+1\r\nans=ans+(y*(y-1))//2\r\n \r\nx0,x1=l[0][0],l[0][1]\r\ny=1\r\nfor i in range(1,len(l)):\r\n\tif l[i][0]!=x0 or l[i][1]!=x1:\r\n\t\tans=ans-(y*(y-1))//2\r\n\t\tx0,x1=l[i][0],l[i][1]\r\n\t\ty=1\r\n\telse:\r\n\t\ty=y+1\r\nans=ans-(y*(y-1))//2\r\n \r\nprint(ans)", "from collections import defaultdict as DD\nimport sys\ninput = sys.stdin.readline\nn, = map(int, input().split())\n\nseen_x = DD(int)\nseen_y = DD(int)\nseen = DD(int)\n\nsame = 0\nfor _ in range(n):\n x,y = map(int, input().split())\n\n same += seen_x[x]\n same += seen_y[y]\n same -= seen[x,y]\n\n seen_x[x] += 1\n seen_y[y] += 1\n seen[x,y] += 1\n\nprint(same)\n\n", "import collections\r\n\r\nxx = collections.Counter()\r\nyy = collections.Counter()\r\nzz = collections.Counter()\r\n\r\nans = 0\r\n\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n ans += xx[x] + yy[y] - zz[(x, y)]\r\n xx[x] += 1\r\n yy[y] += 1\r\n zz[(x, y)] += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nX_axis = {}\r\nY_axis = {}\r\nXY_axis = {}\r\n\r\nfor i in range(n):\r\n a,b = [ int(x) for x in input().split()]\r\n pair = (a,b)\r\n X_axis[a] = X_axis.get(a,0) +1\r\n Y_axis[b] = Y_axis.get(b,0) +1\r\n XY_axis[pair] = XY_axis.get(pair,0) + 1\r\n\r\nsum = 0\r\nfor i in X_axis:\r\n var = X_axis[i]\r\n if var>0:\r\n sum = sum + (var*(var-1))//2\r\n \r\nfor i in Y_axis:\r\n var = Y_axis[i]\r\n if var>0:\r\n sum = sum + (var*(var-1))//2\r\n \r\nfor i in XY_axis:\r\n var = XY_axis[i]\r\n sum = sum - (var*(var-1))//2\r\n \r\nprint(sum)\r\n\r\n\r\n", "from collections import defaultdict\r\nimport sys\r\ninput=sys.stdin.readline\r\ndx,dy,dxy=defaultdict(int),defaultdict(int),defaultdict(int)\r\nn=int(input())\r\n\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n dx[x]+=1\r\n dy[y]+=1\r\n dxy[(x,y)]+=1\r\nans=0\r\nfor x in dx:\r\n ans+=(dx[x]*(dx[x]-1))//2\r\nfor y in dy:\r\n ans+=(dy[y]*(dy[y]-1))//2\r\nfor p in dxy:\r\n ans-=(dxy[p]*(dxy[p]-1))//2\r\nprint(ans)", "import math,collections as C\r\nn,i,m,s=input,int,map,sorted\r\ng=[tuple(m(i,n().split()))for _ in range(i(n()))]\r\nc=lambda q:sum(m(lambda v:math.comb(v,2),C.Counter(q).values()))\r\nprint(c(s(m(lambda a:a[0],g)))+c(s(m(lambda a:a[1],g)))-c(g))\r\n", "dx={} \r\ndy={}\r\ndxy={}\r\nans=0 \r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split()) \r\n if x not in dx:\r\n dx[x]=0 \r\n if y not in dy:\r\n dy[y]=0 \r\n if (x,y) not in dxy:\r\n dxy[(x,y)]=0 \r\n \r\n ans+=dx[x]+dy[y]-dxy[(x,y)] \r\n dx[x]+=1 \r\n dy[y]+=1 \r\n dxy[(x,y)]+=1 \r\nprint(ans)", "n = int(input())\na = sorted([[int(x) for x in input().split()] for _ in range(n)])\n\n\nax = [a[i][0] for i in range(n)]\nay = sorted([a[i][1] for i in range(n)])\n\n\ncnt = 0\n\n\n#1 \naux = 1\nfor i in range(n-1):\n\tif(ax[i]==ax[i+1]):\n\t\taux+=1\n\n\telse:\n\t\tcnt+= aux*(aux-1)//2\n\t\taux= 1\ncnt+= aux*(aux-1)//2\n\n\naux = 1\nfor i in range(n-1):\n\tif(ay[i]==ay[i+1]):\n\t\taux+=1\n\n\telse:\n\t\tcnt+= aux*(aux-1)//2\n\t\taux= 1\ncnt+= aux*(aux-1)//2\n\n\naux = 1\nfor i in range(n-1):\n\tif(a[i]==a[i+1]):\n\t\taux+=1\n\n\telse:\n\n\t\tcnt-= aux*(aux-1)//2\n\t\taux= 1\ncnt-= aux*(aux-1)//2\n\nprint(cnt)", "n = int(input())\r\ncrack = []\r\nfor i in range(n) :\r\n x,y = map(int,input().split())\r\n crack.append((x,y))\r\ncount = 0\r\ncrack_x = {}\r\ncrack_y = {}\r\ncrack_xy = {}\r\nfor i in range(len(crack)) :\r\n if crack[i][0] not in crack_x.keys() :\r\n crack_x[crack[i][0]] =1\r\n else:\r\n crack_x[crack[i][0]] +=1\r\n if crack[i][1] not in crack_y.keys() :\r\n crack_y[crack[i][1]] = 1\r\n else:\r\n crack_y[crack[i][1]] +=1\r\n if crack[i] not in crack_xy.keys() :\r\n crack_xy[crack[i]] = 1\r\n else :\r\n crack_xy[crack[i]] +=1\r\n\r\nfor i in crack_x.keys() :\r\n count += (crack_x[i]*(crack_x[i]-1))//2\r\nfor i in crack_y.keys() :\r\n count += (crack_y[i]*(crack_y[i]-1))//2\r\nfor i in crack_xy.keys() :\r\n count -= (crack_xy[i]*(crack_xy[i]-1))//2\r\nprint(count)", "# unihernandez22\n\nn = int(input())\ndict_x = {}\ndict_y = {}\ndict_xy = {}\n\nfor _ in range(n):\n x, y = map(int, input().split())\n dict_xy[(x, y)] = dict_xy.get((x, y), 0) + 1\n dict_x[x] = dict_x.get(x, 0) + 1\n dict_y[y] = dict_y.get(y, 0) + 1\n\nans = 0\nfor i in (*dict_x.values(), *dict_y.values()):\n ans += i*(i-1)//2\n\nfor i in dict_xy.values():\n ans -= i*(i-1)//2\n\nprint(ans)\n", "from collections import Counter\nc = Counter\nx = c()\ny = c()\nxy = c()\nans=0\nfor _ in range(int(input())):\n\ta,b = map(int,input().split())\n\tans += x[a]+y[b]-xy[(a,b)]\n\tx[a]+=1\n\ty[b]+=1\n\txy[(a,b)]+=1\nprint(ans)\t", "from collections import defaultdict\nfrom math import comb\n\n\nn = int(input())\nxs = defaultdict(int)\nys = defaultdict(int)\nxys = defaultdict(int)\nfor _ in range(n):\n x, y = map(int, input().split(' '))\n xs[x] += 1\n ys[y] += 1\n xys[(x, y)] += 1\n\n\ntotal = 0\nfor x in xs:\n total += comb(xs[x], 2)\nfor y in ys:\n total += comb(ys[y], 2)\nfor xy in xys:\n total -= comb(xys[xy], 2)\n\nprint(total)", "dx={}\r\ndy={}\r\ndxy={}\r\n\r\nans=0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n ans+=dx.get(x,0)+dy.get(y,0)-dxy.get((x,y),0)\r\n dx[x]=dx.get(x,0)+1\r\n dy[y]=dy.get(y,0)+1\r\n dxy[(x,y)]=dxy.get((x,y),0)+1\r\n\r\nprint (ans)", "a = int(input())\r\ndic = dict()\r\narr_cal = []\r\narr_x = dict()\r\narr_y = dict()\r\nres = 0\r\ndup = 0\r\nfor i in range(0,a):\r\n x,y = [int(num) for num in input().split()]\r\n if (x,y) in dic:\r\n dic[(x,y)] +=1\r\n else:\r\n dic[(x,y)] = 1\r\n if x in arr_x:\r\n arr_x[x]+=1\r\n else:\r\n arr_x[x]=1\r\n\r\n if y in arr_y:\r\n arr_y[y]+=1\r\n else:\r\n arr_y[y]=1\r\n \r\nfor k in dic:\r\n dup += (dic[k]*(dic[k]-1))/2\r\nfor k in arr_x:\r\n if arr_x[k] > 1:\r\n res+=(arr_x[k]*(arr_x[k]-1))/2\r\nfor k in arr_y:\r\n if arr_y[k] > 1:\r\n res+=(arr_y[k]*(arr_y[k]-1))/2\r\nprint(int(res-dup))", "from sys import stdin\r\nfrom collections import Counter\r\n\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\npoints = []\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 points.append((a, b))\r\n\r\ntotal = 0\r\ncountX = Counter(x)\r\ncountY = Counter(y)\r\n\r\nfor i in countX:\r\n total += countX[i]*(countX[i] - 1)/2\r\n\r\nfor i in countY:\r\n total += countY[i]*(countY[i] - 1)/2\r\n\r\ncountXY = Counter(points)\r\n# print(total)\r\nfor i in countXY:\r\n total -= countXY[i]*(countXY[i] - 1)/2\r\n\r\nprint(int(total))", "\r\nfrom math import comb\r\nfrom collections import Counter\r\n\r\nxy = [tuple(map(int, input().split())) for _ in range(int(input()))]\r\n\r\nxs = [i[0] for i in xy]\r\nys = [i[1] for i in xy]\r\n\r\nxy_count = Counter(xy)\r\n\r\ndictx = Counter(xs)\r\ndicty = Counter(ys)\r\n\r\ncombins = 0\r\n \r\ncombins += sum([comb(value, 2) for key, value in dictx.items()])\r\n\r\ncombins += sum([comb(value, 2) for key, value in dicty.items()])\r\n\r\ncombins -= sum([comb(value, 2) for key, value in xy_count.items()])\r\n\r\nprint(combins)\r\n", "from collections import *\r\nC=Counter\r\na=0\r\ncx=C()\r\ncy=C()\r\ncp=C()\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a+=cx[x]+cy[y]-cp[(x,y)]\r\n cx[x]+=1\r\n cy[y]+=1\r\n cp[(x,y)]+=1\r\nprint(a)\r\n", "from collections import Counter\r\nn = int(input())\r\nx_c = Counter()\r\ny_c = Counter()\r\ncoords_c = Counter()\r\nans = 0\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n ans += x_c[x]\r\n ans += y_c[y]\r\n ans -= coords_c[(x, y)]\r\n x_c[x] += 1\r\n y_c[y] += 1\r\n coords_c[(x, y)] += 1\r\nprint(ans)", "n = int(input())\r\npairs = {}\r\nq_x = {}\r\nq_y = {}\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if pairs.get((a, b)):\r\n pairs[(a, b)] += 1\r\n else:\r\n pairs[(a, b)] = 1\r\n if q_x.get(a):\r\n q_x[a] += 1\r\n else:\r\n q_x[a] = 1\r\n if q_y.get(b):\r\n q_y[b] += 1\r\n else:\r\n q_y[b] = 1\r\nk = 0\r\nfor i in q_x.keys():\r\n k += q_x[i] * (q_x[i] - 1) // 2\r\nfor i in q_y.keys():\r\n k += q_y[i] * (q_y[i] - 1) // 2\r\nfor i in pairs.keys():\r\n k -= pairs[i] * (pairs[i] - 1) // 2\r\nprint(k)\r\n", "def count(q):\r\n q.sort()\r\n r=0\r\n i=0\r\n for j in range(1,len(q)):\r\n if q[j]==q[i]: continue\r\n r=r+(j-i)*(j-i-1)//2\r\n i=j\r\n r=r+(n-i)*(n-i-1)//2\r\n return r\r\nn=int(input())\r\nx,y,xy=[],[],[]\r\nfor i in range(n):\r\n c1,c2=map(int,input().split())\r\n x.append(c1)\r\n y.append(c2)\r\n xy.append([c1,c2])\r\nprint(count(x)+count(y)-count(xy))\r\n ", "from sys import stdin,stdout\n# from sys import setrecursionlimit\nfrom collections import defaultdict\n# from math import gcd,ceil,sqrt\n# setrecursionlimit(int(1e5))\ninput,print = stdin.readline,stdout.write\n# t = 1\nn = int(input())\ndx = defaultdict(int)\ndy = defaultdict(int)\nd = defaultdict(int)\nans = 0\nfor _ in range(n):\n\tx,y = list(map(int,input().split()))\n\tans+=dx[x]\n\tans+=dy[y]\n\tdx[x]+=1\n\tdy[y]+=1\n\tk = hash(str(x)+str(y))\n\tans-=d[k]\n\td[k]+=1\nprint(str(ans)+\"\\n\")\n\n \t \t\t\t \t\t\t\t \t \t \t\t \t\t\t\t\t \t\t", "if __name__ == \"__main__\":\r\n n=int(input())\r\n x_hm={}\r\n y_hm={}\r\n # there could be same points as well\r\n same_point_count={}\r\n for j in range(n):\r\n x,y=input().split()\r\n same_point_count[(x,y)]=same_point_count.get((x,y),0)+1\r\n x_hm[x]=x_hm.get(x,0)+1\r\n y_hm[y]=y_hm.get(y,0)+1\r\n ans=0\r\n for key,val in x_hm.items():\r\n ans+=(val*(val-1))//2\r\n for key,val in y_hm.items():\r\n ans+=(val*(val-1))//2\r\n for _,val in same_point_count.items():\r\n ans-=(val*(val-1))//2\r\n print(ans)", "def findPairs(points):\r\n xMap = {}; yMap = {}; pairs = 0; pointMap = {}\r\n for x,y in points:\r\n if x not in xMap:\r\n xMap[x] = 0\r\n if y not in yMap:\r\n yMap[y] = 0\r\n if (x,y) not in pointMap:\r\n pointMap[(x,y)] = 0\r\n\r\n pairs += xMap[x]\r\n pairs += yMap[y]\r\n pairs -= pointMap[(x,y)]\r\n xMap[x] += 1\r\n yMap[y] += 1\r\n pointMap[(x,y)] += 1\r\n return pairs\r\n\r\nn = int(input())\r\npoints = []\r\nfor i in range(n):\r\n points.append(list(map(int, input().split(' '))))\r\nprint(findPairs(points))\r\n", "from collections import defaultdict\nimport math\nx = int(input())\nsum = 0\narray = []\nfor i in range(x):\n temp = input().split(\" \")\n array.append([int(temp[0]), int(temp[1])])\nx_freq = defaultdict(lambda:0)\ny_freq = defaultdict(lambda:0)\nxy_freq = defaultdict(lambda:0)\nfor i in range(len(array)):\n x1 = array[i][0]\n y1 = array[i][1]\n x_freq[x1] += 1\n y_freq[y1] += 1\n xy_freq[tuple(array[i])] += 1\nx_result = 0\ny_result = 0\nxy_result = 0\nfor i in x_freq:\n temp = x_freq[i]\n x_result += (temp * (temp - 1)) // 2\nfor i in y_freq:\n temp = y_freq[i]\n y_result += (temp * (temp - 1)) // 2\nfor i in xy_freq:\n temp = xy_freq[i]\n xy_result += (temp * (temp - 1)) // 2\nprint(x_result + y_result - xy_result)\n\t\t \t \t\t \t \t \t \t \t", "x1={}\r\ny1={}\r\np1={}\r\n\r\ndef f(key, Dict):\r\n if Dict.get(key,-1)==-1:\r\n Dict[key]=0\r\n\r\nret=0\r\n\r\nfor i in range(int(input())):\r\n xy =input()\r\n x,y = xy.split()\r\n f(x,x1)\r\n f(y,y1)\r\n f(xy,p1)\r\n ret+=x1[x]+y1[y]-p1[xy]\r\n x1[x]+=1\r\n y1[y]+=1\r\n p1[xy]+=1\r\nprint(ret)\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 = \"Watchmen\"\r\n# Class: C\r\n\r\nimport sys\r\nfrom collections import defaultdict\r\n\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef printf(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n ans = 0 ; x = defaultdict(int) ; y = defaultdict(int) ; xy = defaultdict(int)\r\n for n in range(int(input())):\r\n v = tuple(map(int, input().split()))\r\n ans+=x[v[0]]+y[v[1]]-xy[v]\r\n x[v[0]]+=1\r\n y[v[1]]+=1\r\n xy[v]+=1\r\n\r\n printf(ans)\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [tuple([int(x) for x in input().split()]) for _ in range(n)]\r\n\r\nd = defaultdict(int)\r\nfor v in a:\r\n d[v] += 1\r\n \r\nans = 0\r\nfor c in d.values():\r\n ans -= c * (c - 1) // 2\r\n \r\nx = defaultdict(int)\r\ny = defaultdict(int)\r\n\r\nfor xx, yy in a:\r\n x[xx] += 1\r\n y[yy] += 1\r\n\r\nfor c in x.values():\r\n ans += c * (c - 1) // 2\r\nfor c in y.values():\r\n ans += c * (c - 1) // 2\r\n\r\nprint(ans)", "def ncr(n, r):\r\n ret = 1\r\n j = 2\r\n for i in range(n - r + 1, n + 1):\r\n ret *= i\r\n if j <= r and ret % j == 0:\r\n ret //= j\r\n j += 1\r\n while j <= r:\r\n ret //= j\r\n j += 1\r\n\r\n return ret\r\n\r\nn = int(input())\r\n\r\na = [tuple(map(int, input().split(' '))) for i in range(n)]\r\n\r\nxs = {}\r\nys = {}\r\nintersec = {}\r\nfor x, y in a:\r\n if x not in xs:\r\n xs[x] = 0\r\n if y not in ys:\r\n ys[y] = 0\r\n if (x, y) not in intersec:\r\n intersec[(x, y)] = 0\r\n xs[x] += 1\r\n ys[y] += 1\r\n intersec[(x, y)] += 1\r\n\r\n\r\nret = 0\r\n\r\nfor value in xs.values():\r\n ret += ncr(value, 2)\r\nfor value in ys.values():\r\n ret += ncr(value, 2)\r\nfor value in intersec.values():\r\n ret -= ncr(value, 2)\r\n\r\nprint(ret)", "n = int(input())\r\ncols = dict()\r\nrows = dict()\r\ntotal = 0\r\nseen = dict()\r\nfor _ in range(n):\r\n c,r = input().split()\r\n seen_get = seen.get((c,r),0)\r\n total -= seen_get\r\n seen[(c,r)] = seen_get + 1\r\n \r\n \r\n c_get = cols.get(c,0)\r\n total += c_get\r\n r_get = rows.get(r,0)\r\n total += r_get\r\n cols[c] = c_get+1\r\n rows[r] = r_get+1\r\nprint (total)", "import math\r\nfrom decimal import Decimal\r\ndef na():\r\n\tn = int(input())\r\n\tb = [int(x) for x in input().split()]\r\n\treturn n,b\r\n \r\n \r\ndef nab():\r\n\tn = int(input())\r\n\tb = [int(x) for x in input().split()]\r\n\tc = [int(x) for x in input().split()]\r\n\treturn n,b,c\r\n \r\n \r\ndef dv():\r\n\tn, m = map(int, input().split())\r\n\treturn n,m\r\n \r\n \r\ndef dva():\r\n\tn, m = map(int, input().split())\r\n\ta = [int(x) for x in input().split()]\r\n\tb = [int(x) for x in input().split()]\r\n\treturn n,m,b\r\n \r\n \r\ndef eratosthenes(n): \r\n\tsieve = list(range(n + 1))\r\n\tfor i in sieve:\r\n\t\tif i > 1:\r\n\t\t\tfor j in range(i + i, len(sieve), i):\r\n\t\t\t\tsieve[j] = 0\r\n\treturn sorted(set(sieve))\r\n \r\n \r\n \r\ndef nm():\r\n\tn = int(input())\r\n\tb = [int(x) for x in input().split()]\r\n\tm = int(input())\r\n\tc = [int(x) for x in input().split()]\r\n\treturn n,b,m,c\r\n \r\n \r\ndef dvs():\r\n\tn = int(input())\r\n\tm = int(input())\r\n\treturn n, m\r\n \r\n\r\nn = int(input())\r\nd1 = {}\r\nd2 = {}\r\nd3 = {}\r\nans = 0\r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\td1[x] = d1.get(x, 0) + 1\r\n\td2[y] = d2.get(y, 0) + 1\r\n\td3[(x, y)] = d3.get((x, y), 0) + 1\r\n\tans += d1[x] + d2[y] - d3[(x, y)]\r\nprint(ans - n)\r\n\r\n", "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 (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\nn=I()\nx=defaultdict(int)\nx2=defaultdict(int)\ny=defaultdict(int)\ny2=defaultdict(int)\npair=defaultdict(int)\npair2=defaultdict(int)\nd=[]\nfor i in range(n):\n a,b=M()\n d.append([a,b])\n x[a]+=1\n if(x[a]>=2):\n x2[a]=x[a]\n y[b]+=1\n if(y[b]>=2):\n y2[b]=y[b]\n pair[(a,b)]+=1\n if(pair[(a,b)]>=2):\n pair2[(a,b)]=pair[(a,b)]\nsum=0\nr=x2.values()\nfor i in r:\n sum+=((i)*(i-1))//2\nsum2=0\nr=y2.values()\nfor i in r:\n sum2+=((i)*(i-1))//2\nr=pair2.values()\nsum3=0\nfor i in r:\n sum3+=((i)*(i-1))//2\nprint(sum+sum2-sum3)\n", "import sys\n\n# The Manhattan distance and Euclidean distance are equal iff either the\n# x or y coordinate are equal\nxdict = dict()\nydict = dict()\nxydict = dict()\nn = int(sys.stdin.readline())\nfor i in range(0,n):\n nums = list(map(int,sys.stdin.readline().split()))\n x = nums[0]\n y = nums[1]\n if xdict.get(x):\n xdict[x] += 1\n else:\n xdict[x] = 1\n if ydict.get(y):\n ydict[y] += 1\n else:\n ydict[y] = 1\n if xydict.get((x,y)):\n xydict[(x,y)] += 1\n else:\n xydict[(x,y)] = 1\n\n# If n numbers have the same coordinate, then there are n choose 2 pairs\npairs = 0\nfor x in xdict.values():\n pairs += (x * (x-1))//2\nfor y in ydict.values():\n pairs += (y * (y-1))//2\nfor xy in xydict.values():\n pairs -= (xy * (xy-1))//2\nprint(pairs)\n", "from collections import Counter\r\n\r\nn = int(input())\r\nresult = 0\r\ncache = {}\r\nallX = {}\r\nallY = {}\r\n\r\nfor i in range(n):\r\n pair = tuple(map(int, input().split()))\r\n\r\n dx = allX.setdefault(pair[0], 0)\r\n dy = allY.setdefault(pair[1], 0)\r\n\r\n allX[pair[0]] += 1\r\n allY[pair[1]] += 1\r\n\r\n found = cache.setdefault(pair, 0)\r\n \r\n cache[pair] += 1\r\n \r\n result += dx + dy - found\r\n\r\nprint(result)\r\n", "from math import *\r\nfrom collections import *\r\nfrom bisect import *\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations\r\n\r\ndef is_prime(n):\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(n%i==0):\r\n return False\r\n return True\r\n\r\ndef sieve(n):\r\n arr=[True for _ in range(n+1)]\r\n\r\n for i in range(2,math.ceil(math.sqrt(n))):\r\n if(arr[i]==True):\r\n for j in range(i*i,n+1,i):\r\n arr[j]=False\r\n\r\n return arr\r\n\r\n\r\ndef power(x, y, p):\r\n res = 1 # Initialize result\r\n\r\n # Update x if it is more\r\n # than or equal to p\r\n x = x % p\r\n\r\n if (x == 0):\r\n return 0\r\n\r\n while (y > 0):\r\n\r\n # If y is odd, multiply\r\n # x with result\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n\r\n # y must be even now\r\n y = y >> 1 # y = y/2\r\n x = (x * x) % p\r\n\r\n return res\r\n\r\ndef euclidean_distance(x1,y1,x2,y2):\r\n return sqrt(abs(x1-x2)**2+abs(y1-y2)**2)\r\n\r\ndef get_permutations(lo=0,hi=10):\r\n return list(permutations(range(lo,hi)))\r\n\r\n\r\ndef solve():\r\n # s=input()\r\n n=int(input())\r\n # lis=list(map(int,input().split()))\r\n # lis2 = list(map(int, input().split()))\r\n lis=[]\r\n x=defaultdict(int)\r\n y=defaultdict(int)\r\n xy=defaultdict(int)\r\n ans=0\r\n for _ in range(n):\r\n x1,y1=list(map(int, input().split()))\r\n ans+=x[x1]+y[y1]-xy[str(x1)+' '+str(y1)]\r\n x[x1]+=1\r\n y[y1]+=1\r\n xy[str(x1)+' '+str(y1)]+=1\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n=1\r\n # n=int(input())\r\n while(n):\r\n n-=1\r\n solve()\r\n\r\n\r\n\r\n\r\n", "import math\r\nfrom math import sqrt, inf, gcd, ceil, tan, pi, sin, cos\r\nimport queue\r\n\r\n\r\n# -------- info --------\r\n\r\n# https://codeforces.com/profile/Wolxy\r\n\r\n# -------- sys --------\r\n\r\ndef next_int() -> int:\r\n return int(input())\r\n\r\ndef next_ints() -> map:\r\n return map(int, input().split(' '))\r\n\r\ndef next_list() -> list:\r\n return list(map(int, input().split(' ')))\r\n\r\ndef dis(from_loc, to_loc, euclidean = True) -> int:\r\n result = 0\r\n if euclidean:\r\n for i in range(min(len(from_loc), len(to_loc))):\r\n result += (from_loc[i] - to_loc[i]) * (from_loc[i] - to_loc[i])\r\n else:\r\n for i in range(min(len(from_loc), len(to_loc))):\r\n result += from_loc[i] - to_loc[i]\r\n return result\r\n\r\n\r\ndef product(from_loc, first_loc, second_loc) -> int:\r\n vector1 = (first_loc[0] - from_loc[0], first_loc[1] - from_loc[1])\r\n vector2 = (second_loc[0] - from_loc[0], second_loc[1] - from_loc[1])\r\n return vector1[0] * vector2[1] - vector2[0] * vector1[1]\r\n\r\n# -------- functions[clearable] --------\r\n\r\n\r\n# -------- solve[clearable] --------\r\n\r\ndef solve() -> None:\r\n n = next_int()\r\n dic_x = dict()\r\n dic_y = dict()\r\n d = dict()\r\n for _ in range(n):\r\n x, y = next_ints()\r\n if x not in dic_x.keys():\r\n dic_x[x] = 1\r\n else:\r\n dic_x[x] += 1\r\n if y not in dic_y.keys():\r\n dic_y[y] = 1\r\n else:\r\n dic_y[y] += 1\r\n if (x, y) not in d.keys():\r\n d[(x, y)] = 1\r\n else:\r\n d[(x, y)] += 1\r\n count = 0\r\n for each in dic_x.values():\r\n count += (each - 1) * each // 2\r\n for each in dic_y.values():\r\n count += (each - 1) * each // 2\r\n # print(count)\r\n # print(d.items())\r\n for each in d.values():\r\n count -= (each - 1) * each // 2\r\n print(count)\r\n\r\n\r\n# -------- main --------\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "a=int(input())\r\nb=dict()\r\nc=dict()\r\nd=dict()\r\nfor i in range(a):\r\n e,f=map(int, input().split())\r\n if e in c:\r\n c[e]+=1\r\n else:\r\n c[e]=1\r\n if f in d:\r\n d[f]+=1\r\n else:\r\n d[f]=1\r\n if (e, f) in b:\r\n b[(e,f)]+=1\r\n else:\r\n b[(e,f)]=1\r\nans=0\r\nfor i in c:\r\n ans+=c[i]*(c[i]-1)//2\r\nfor i in d:\r\n ans += d[i] * (d[i] - 1) // 2\r\nfor i in b:\r\n ans-=b[i]*(b[i]-1)//2\r\nprint(ans)", "p = int(input())\r\n\r\na = {}\r\nb = {}\r\nc = {}\r\n\r\nt = 0\r\n\r\nfor h in range(p):\r\n x, y = map(int, input().split())\r\n if x in a:\r\n t += a[x]\r\n a[x] += 1\r\n else:\r\n a[x] = 1\r\n if y in b:\r\n t += b[y]\r\n b[y] += 1\r\n else:\r\n b[y] = 1\r\n \r\n s = (\"%d,%d\" % (x, y))\r\n if s in c:\r\n t -= c[s]\r\n c[s] += 1\r\n else:\r\n c[s] = 1\r\n\r\nprint(t)", "\r\nI=lambda :map(int,input().split())\r\n\r\nfrom collections import defaultdict\r\npoints=[]\r\nx_p=defaultdict(int)\r\ny_p=defaultdict(int)\r\npoint_map=defaultdict(int)\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=I()\r\n x_p[x]+=1\r\n y_p[y]+=1\r\n point_map[(x,y)]+=1\r\n points+=[[x,y]]\r\n\r\nans=0\r\nfor p in points:\r\n # print(point_map)\r\n ans+=x_p[p[0]]+y_p[p[1]]-point_map[tuple(p)]-1\r\n x_p[p[0]]-=1\r\n y_p[p[1]]-=1\r\n point_map[tuple(p)]-=1\r\n\r\nprint(ans)\r\n\r\n ", "import re\r\n\r\nc = 0\r\nds = [{},{}]\r\ncoords = {}\r\ndup = 0\r\nn = int(input())\r\nfor i in range(0, n):\r\n t = re.split(' ', input())\r\n T = tuple(t)\r\n coords[T] = 1 + (0 if (T not in coords) else (coords[T]))\r\n dup += coords[T]-1\r\n for j in range(0, len(ds)):\r\n ds[j][t[j]] = 1 + (0 if (t[j] not in ds[j]) else (ds[j][t[j]]) )\r\n\r\nfor i in range(0, len(ds)):\r\n for k, v in ds[i].items():\r\n c += v*(v-1)/2\r\n\r\nprint(int(c-dup))\r\n \r\n", "from sys import stdin\r\nfrom collections import Counter\r\n\r\nc = Counter\r\nx = c()\r\ny = c()\r\nxy = c()\r\nans = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, stdin.readline().rstrip().split(\" \"))\r\n ans += x[a] + y[b] - xy[(a, b)]\r\n x[a] += 1\r\n y[b] += 1\r\n xy[(a, b)] += 1\r\nprint(ans)", "n=int(input())\r\ns=0\r\nd={}\r\nx,y={},{}\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if (a,b) not in d:\r\n d[(a,b)]=1\r\n \r\n else:\r\n d[(a,b)]+=1\r\n \r\n if a not in x:\r\n x[a]=1\r\n else:\r\n x[a]+=1\r\n \r\n if b not in y:\r\n y[b]=1\r\n else:\r\n y[b]+=1\r\nt=0\r\nfor i in x:\r\n t+=(x[i]*(x[i]-1))//2\r\nfor i in y:\r\n t+=(y[i]*(y[i]-1))//2\r\nfor i in d:\r\n t-=(d[i]*(d[i]-1))//2\r\nprint(t)\r\n ", "# Description of the problem can be found at http://codeforces.com/problemset/problem/650/A\r\n\r\np = int(input())\r\n\r\nd_x = {}\r\nd_y = {}\r\nd_t = {}\r\n\r\nt = 0\r\n\r\nfor _ in range(p):\r\n x, y = map(int, input().split())\r\n if x in d_x:\r\n t += d_x[x]\r\n d_x[x] += 1\r\n else:\r\n d_x[x] = 1\r\n if y in d_y:\r\n t += d_y[y]\r\n d_y[y] += 1\r\n else:\r\n d_y[y] = 1\r\n \r\n s = (\"%d,%d\" % (x, y))\r\n if s in d_t:\r\n t -= d_t[s]\r\n d_t[s] += 1\r\n else:\r\n d_t[s] = 1\r\n\r\nprint(t)", "from math import *\r\n\r\nt=1\r\nfor _ in range(t):\r\n n=int(input())\r\n pts=list()\r\n for i in range(n):\r\n pts.append(list(map(int,input().split())))\r\n axx=dict()\r\n ayy=dict()\r\n visited=dict()\r\n ans=0\r\n for i in pts:\r\n x=i[0]\r\n y=i[1]\r\n visit=visited.get((x,y),-1)\r\n if(visit==-1):\r\n visited[(x,y)]=1\r\n else:\r\n visited[(x,y)]+=1\r\n ax=axx.get(x,None)\r\n ay=ayy.get(y,None)\r\n if(ax==None):\r\n axx[x]=1\r\n else:\r\n axx[x]=axx[x]+1\r\n \r\n if(ay==None):\r\n ayy[y]=1\r\n else:\r\n ayy[y]=ayy[y]+1\r\n #print(ans)\r\n for i in axx.values():\r\n if(i>=2):\r\n ans=ans+i*(i-1)//2\r\n #ans=ans+ncr(i,2)\r\n \r\n for i in ayy.values():\r\n if(i>=2):\r\n ans=ans+i*(i-1)//2\r\n for i in visited.values():\r\n if(i>=2):\r\n ans=ans-i*(i-1)//2\r\n #print(axx)\r\n #print(ayy)\r\n print(ans)\r\n \r\n \r\n ", "from collections import defaultdict\r\n\r\nX, Y, P, k = defaultdict(int), defaultdict(int), defaultdict(int), 0\r\n\r\nfor _ in range(int(input())):\r\n x, y = input().split()\r\n k += X[x] + Y[y] - P[(x, y)]\r\n X[x], Y[y], P[(x, y)] = X[x] + 1, Y[y] + 1, P[(x, y)] + 1\r\n\r\nprint(k)", "from collections import defaultdict, Counter\r\nn = int(input())\r\nd1 = defaultdict(int)\r\nd2 = defaultdict(int)\r\nl = []\r\nc = 0\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n d1[x] += 1\r\n d2[y] += 1\r\n l.append((x, y))\r\nfor i in d1.items():\r\n c += (((i[1])-1) * (i[1]) // 2)\r\nfor i in d2.items():\r\n c += (((i[1])-1) * (i[1]) // 2)\r\ne = Counter(l)\r\no = 0\r\nfor item, count in e.items():\r\n if count > 1:\r\n o += ((count-1)*(count)) // 2\r\nprint(c-o)", "n=int(input())\r\nl=[]\r\nz=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n l.append([x,y])\r\ndi={}\r\na=0\r\nfor x in l:\r\n if x[0] in di:\r\n di[x[0]]+=1\r\n else:\r\n di[x[0]]=1\r\nfor x in di:\r\n a+=((di[x])*(di[x]-1))//2\r\ndi={}\r\nb=0\r\nfor x in l:\r\n if x[1] in di:\r\n di[x[1]]+=1\r\n else:\r\n di[x[1]]=1\r\nfor x in di:\r\n b+=((di[x])*(di[x]-1))//2\r\nc=0\r\ndi={}\r\nfor x in l:\r\n if tuple(x) in di:\r\n di[tuple(x)]+=1\r\n else:\r\n di[tuple(x)]=1\r\nfor x in di:\r\n c+=((di[x])*(di[x]-1))//2\r\nprint(a+b-c)\r\n\r\n", "def calc(n):\r\n return (n*(n-1))//2\r\nn = int(input())\r\narr = []\r\nmapper = {}\r\nxcount = {}\r\nycount = {}\r\nfor i in range(n):\r\n x,y = list(map(int,input().split()))\r\n arr.append((x,y))\r\n if (x,y) not in mapper:\r\n mapper[(x,y)] = 1\r\n else:\r\n mapper[(x,y)]+=1\r\n if x not in xcount:\r\n xcount[x] = 1\r\n else:\r\n xcount[x]+=1\r\n if y not in ycount:\r\n ycount[y] = 1\r\n else:\r\n ycount[y]+=1\r\n \r\nans = 0\r\nfor i in xcount:\r\n ans+=calc(xcount[i])\r\nfor i in ycount:\r\n ans+=calc(ycount[i])\r\nfor i in mapper:\r\n ans-=calc(mapper[i])\r\nprint(ans)", "n = int(input())\nw = [tuple(input().split())for _ in range(n)]\nx = dict()\ny = dict()\nz = dict()\ndef add(e, d):\n if not e in d:\n d[e] = 1\n else:\n d[e] += 1\ndef pr(d):\n return sum(u * (u - 1) / 2 for u in d.values())\nfor a in w:\n add(a[0], x)\n add(a[1], y)\n add(a, z)\ncnt = pr(x) + pr(y) - pr(z)\nprint(int(cnt))\n", "from collections import defaultdict, Counter\n\nn = int(input())\nxs = defaultdict(Counter)\nys = defaultdict(Counter)\n\nfor _ in range(n):\n x, y = map(int, input().split())\n xs[x][(x,y)] += 1\n ys[y][(x,y)] += 1\n\nres = 0\nfor xk, xv in xs.items():\n # xk - given x,\n # xv - counter object\n \n k = sum(v for v in xv.values())\n\n factor = 0\n for cv in xv.values():\n factor += cv * (cv - 1) // 2\n\n res += k * (k-1) // 2 - factor\n\nfor yk, yv in ys.items():\n \n k = sum(v for v in yv.values())\n\n factor = 0\n #for cv in yv.values():\n # factor += cv * (cv - 1) // 2\n\n res += k * (k-1) // 2 - factor\n\nprint(res)\n", "def first_coord(x):\r\n return x[0]\r\ndef second_coord(x):\r\n return x[1]\r\n\r\n\r\n# l = [[1, 1], [7, 5], [1,5], [7, 3],[7, 3], [7,6]]\r\n# n = len(l)\r\n# print(l)\r\n\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\n\r\n# сортируем по первой координате\r\nansw = 0\r\n\r\ny_alike = 1\r\nl.sort(key = second_coord)\r\nfor i in range(n - 1):\r\n if l[i][1] == l[i + 1][1]:\r\n y_alike += 1\r\n else:\r\n answ += y_alike * (y_alike - 1) // 2\r\n y_alike = 1\r\nansw += y_alike * (y_alike - 1) // 2\r\n\r\nl.sort(key = first_coord)\r\n\r\n# для каждого значения первой координаты вычисляем количество пар с совпадающей этой координатой\r\n# попутно вычисляем количество пар с обоими совпадающими координатами\r\n\r\nx_alike = 1\r\nalike = 1\r\n\r\nfor i in range(n - 1):\r\n if l[i][0] == l[i + 1][0]:\r\n x_alike += 1\r\n else:\r\n answ += x_alike * (x_alike - 1) // 2\r\n x_alike = 1\r\n if l[i][0] == l[i + 1][0] and l[i][1] == l[i + 1][1]:\r\n alike += 1\r\n else:\r\n answ -= alike * (alike - 1) // 2\r\n alike = 1\r\n\r\nansw += x_alike * (x_alike - 1) // 2\r\nansw -= alike * (alike - 1) // 2\r\nprint(answ)\r\n", "from collections import defaultdict \r\ndef Pair(arr, n): \r\n X = defaultdict(lambda:0) \r\n Y = defaultdict(lambda:0) \r\n XY = defaultdict(lambda:0) \r\n for i in range(0, n): \r\n x = arr[i][0] \r\n y = arr[i][1] \r\n X[x] += 1\r\n Y[y] += 1\r\n XY[tuple(arr[i])] += 1\r\n xAns, yAns, xyAns = 0, 0, 0\r\n for xPair in X: \r\n xFre = X[xPair] \r\n sameXPairs = (xFre * \r\n (xFre - 1)) // 2\r\n xAns += sameXPairs \r\n \r\n for yCoordinatePair in Y: \r\n yFrequency = Y[yCoordinatePair] \r\n \r\n sameYPairs = (yFrequency * \r\n (yFrequency - 1)) // 2\r\n yAns += sameYPairs \r\n \r\n for XYPair in XY: \r\n xyFrequency = XY[XYPair] \r\n \r\n samePointPairs = (xyFrequency * \r\n (xyFrequency - 1)) // 2\r\n xyAns += samePointPairs \r\n \r\n return (xAns + yAns - xyAns) \r\n\r\nn=int(input())\r\narr=[[int(y) for y in input().split()]for i in range(n)]\r\nprint(Pair(arr, n)) ", "# from decimal import *\r\n# getcontext().prec=16\r\n# from math import sqrt\r\n# from scipy.special import binom\r\nfrom collections import defaultdict\r\nfrom math import sin,pi,sqrt\r\n\r\n############## Inspired by Amores' code #####################\r\nd=defaultdict(int)\r\n\r\na=defaultdict(int)\r\no=defaultdict(int)\r\nr=defaultdict(int)\r\n\r\nans=0\r\n\r\nn=int(input())\r\nfor _ in range(n):\r\n x,y=list(map(int,input().split(\" \")))\r\n ab,ordo,red=a[x],o[y],r[(x,y)]\r\n ans+=ab+ordo-red\r\n a[x],o[y],r[(x,y)]=a[x]+1,o[y]+1,r[(x,y)]+1\r\nprint(ans)", "\"Codeforces Round #345 (Div. 1)\"\r\n\"A. Watchmen\"\r\ny=int(input())\r\nd={}\r\ndy={}\r\ndxy={}\r\nfor i in range(y):\r\n al=input().split()\r\n m=list(map(int,al))\r\n d.setdefault(m[0],[])\r\n d[m[0]].append(m[1])\r\n dy.setdefault(m[1],[])\r\n dy[m[1]].append(m[0])\r\n m=tuple(m)\r\n dxy.setdefault(m,0)\r\n dxy[m]+=1\r\n# print(l)\r\n# print(d) \r\n# print(dy)\r\n# print(dxy)\r\nans=0\r\nfor i in d.values():\r\n n=len(i)\r\n ans+=((n-1)*n)//2\r\nfor i in dy.values():\r\n n=len(i)\r\n ans+=((n-1)*n)//2\r\nfor i in dxy.values():\r\n n=i\r\n ans-=((n-1)*n)//2 \r\nprint(ans) ", "n=int(input())\r\nl=[]\r\nxct={}\r\nyct={}\r\npnct={}\r\nfor i in range (n):\r\n l.append([int(x) for x in input().split()])\r\n try:\r\n xct[l[i][0]]+=1 \r\n except KeyError:\r\n xct[l[i][0]]=1\r\n try:\r\n yct[l[i][1]]+=1 \r\n except KeyError:\r\n yct[l[i][1]]=1\r\n try:\r\n pnct[(l[i][0],l[i][1])]+=1\r\n except KeyError:\r\n pnct[(l[i][0],l[i][1])]=1\r\n \r\nx=list(xct.values())\r\ny=list(yct.values())\r\nz=list(pnct.values())\r\nans=0\r\nfor i in range (len(x)):\r\n ans=ans+(x[i]*(x[i]-1))/2\r\nfor i in range (len(y)):\r\n ans=ans+(y[i]*(y[i]-1))/2\r\nfor i in range (len(z)):\r\n ans=ans-(z[i]*(z[i]-1))/2\r\nprint(int(ans))", "n = int(input())\nDx = dict()\nDy = dict()\nDxy = dict()\nfor _ in range(n):\n x,y = map(int,input().split())\n if x in Dx:\n Dx[x] += 1\n else:\n Dx[x] = 1\n if y in Dy:\n Dy[y] += 1\n else:\n Dy[y] = 1\n if (x,y) in Dxy:\n Dxy[(x,y)] += 1\n else:\n Dxy[(x,y)] = 1\nR = dict()\nfor v in Dx.values():\n if v in R:\n R[v] += 1\n else:\n R[v] = 1\nfor v in Dy.values():\n if v in R:\n R[v] += 1\n else:\n R[v] = 1\nfor v in Dxy.values():\n if v in R:\n R[v] -= 1\n else:\n R[v] = -1\nans = 0\nfor v in R:\n ans += (R[v]*v*(v-1))//2\nprint(ans)\n", "# print(\"Input n\")\nn = int(input())\n\nfirst = {}\nsecond = {}\npairs = {}\n\nfor i in range(n):\n # print(\"Input the next pair\")\n f,s = [int(x) for x in input().split()]\n p = (f, s)\n first[f] = first.get(f,0) + 1\n second[s] = second.get(s,0) + 1\n pairs[p] = pairs.get(p,0) + 1\n\nanswer = 0\nfor f in first:\n value = first[f]\n if value > 1:\n answer += (value * (value-1))//2\n\nfor s in second:\n value = second[s]\n if value > 1:\n answer += (value * (value-1))//2\n\nfor p in pairs:\n value = pairs[p]\n if value > 1:\n answer -= (value * (value-1))//2\n\nprint(answer)\n \n \n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nd = Counter()\r\nd1 = Counter()\r\nd2 = Counter()\r\nfor i in range(n):\r\n a, b = input()[:-1].split()\r\n d[(a,b)] += 1\r\n d1[a] += 1\r\n d2[b] += 1\r\nc = 0\r\nfor i in d1:\r\n if d1[i] != 1:\r\n c += d1[i]*(d1[i]-1)//2\r\nfor i in d2:\r\n if d2[i] != 1:\r\n c += d2[i]*(d2[i]-1)//2\r\nfor i in d:\r\n if d[i] != 1:\r\n c -= d[i]*(d[i]-1)//2\r\n\r\nprint(c)", "def summa(n):\r\n ans = 0\r\n while n > 0:\r\n ans += n\r\n n -= 1\r\n return ans \r\nimport sys\r\nn = int(sys.stdin.readline())\r\na = []\r\nans = 0\r\nfor i in range(n):\r\n a.append(tuple(map(int, sys.stdin.readline().split())))\r\nb = {}\r\nx = {} \r\nfor i in a:\r\n if i[0] not in x:\r\n x[i[0]] = [1, 0]\r\n b[i] = 1\r\n else:\r\n if i not in b:\r\n b[i] = 1\r\n else:\r\n b[i] += 1\r\n x[i[0]][0] += 1\r\n x[i[0]][1] += x[i[0]][0]-1\r\nfor i in x.values():\r\n ans += i[1] \r\ny = {}\r\nfor i in a:\r\n if i[1] not in y:\r\n y[i[1]] = [1, 0]\r\n else:\r\n y[i[1]][0] += 1\r\n y[i[1]][1] += y[i[1]][0]-1\r\nfor i in y.values():\r\n ans += i[1] \r\nfor i in b.values():\r\n if i > 1:\r\n ans -= summa(i-1)\r\nprint(ans) ", "n = int(input())\narr = []\nfor _ in range(n):\n curr = []\n x,y=map(int,input().split())\n curr.append(x)\n curr.append(y)\n arr.append(curr)\nsame_x = {}\nsame_y = {}\nsame_x_y = {}\nfor i in arr:\n if i[0] in same_x:\n same_x[i[0]]+=1\n else:\n same_x[i[0]]=1\n if i[1] in same_y:\n same_y[i[1]]+=1\n else:\n same_y[i[1]]=1\n x = []\n x.append(i[0])\n x.append(i[1])\n x=str(x)\n if x in same_x_y:\n same_x_y[x]+=1\n else:\n same_x_y[x]=1\nans = 0\nsame = 0\nfor i in same_x:\n if same_x[i]>1:\n ans+=same_x[i]*(same_x[i]-1)//2\nfor i in same_y:\n if same_y[i]>1:\n ans+=same_y[i]*(same_y[i]-1)//2\n\nfor i in same_x_y:\n if same_x_y[i]>1:\n same+=same_x_y[i]*(same_x_y[i]-1)//2\nprint (ans-same)\n", "import collections\r\nn=int(input())\r\nfirst=collections.defaultdict(int)\r\nsecond=collections.defaultdict(int)\r\nthird=collections.defaultdict(int)\r\nres=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n first[a]+=1\r\n second[b]+=1\r\n temp=str(a)+str(b)\r\n third[temp]+=1\r\nfor k in first.keys():\r\n res+=(first[k]*(first[k]-1))//2\r\nfor k in second.keys():\r\n res+=(second[k]*(second[k]-1))//2\r\nfor k in third.keys():\r\n res-=(third[k]*(third[k]-1))//2\r\nprint(res)\r\n", "import sys\nimport math\nfrom collections import defaultdict\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 sys.stdout.write()\n pass\n\n\ndef solve(change):\n pass\n\n\ndef readinput():\n w = getInt()\n yDict = defaultdict(int)\n xDict = defaultdict(int)\n overlap = defaultdict(int)\n allWatchmen = sys.stdin.readlines()\n total = 0\n for line in allWatchmen:\n a, b = map(int, line.rstrip().split(\" \"))\n total += xDict[a]\n total += yDict[b]\n total -= overlap[(a, b)]\n xDict[a] += 1\n yDict[b] += 1\n overlap[(a, b)] += 1\n print(total)\n\nreadinput()\n", "def byF(t):\r\n return t[0] * 40000000000 + t[1]\r\ndef byS(t):\r\n return t[1] * 40000000000 + t[1]\r\n\r\nn = int(input())\r\nres = 0\r\npoints = []\r\n\r\nfor i in range(n):\r\n points.append(tuple(map(int, input().split())))\r\n\r\npoints.sort(key=byF)\r\n#print(*points)\r\n\r\ncons = 1\r\nfor i in range(1, n):\r\n if points[i][0] == points[i - 1][0]:\r\n cons += 1\r\n else:\r\n res += (cons - 1) * cons // 2\r\n cons = 1\r\n\r\nres += (cons - 1) * cons // 2\r\ncons = 1\r\n\r\npoints.sort(key=byS)\r\n#print(*points)\r\n\r\nfor i in range(1, n):\r\n if points[i][1] == points[i - 1][1]:\r\n cons += 1\r\n else:\r\n res += (cons - 1) * cons // 2\r\n cons = 1\r\n\r\nres += (cons - 1) * cons // 2\r\n\r\ncons = 1\r\nfor i in range(1, n):\r\n if points[i][1] == points[i - 1][1] and points[i][0] == points[i - 1][0]:\r\n cons += 1\r\n else:\r\n res -= (cons - 1) * cons // 2\r\n cons = 1\r\nres -= (cons - 1) * cons // 2\r\nprint(res)\r\n", "from collections import Counter\r\nn = int(input())\r\na, b, c = [Counter() for i in range(3)]\r\nans = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a[x] += 1\r\n b[y] += 1\r\n c[(x, y)] += 1\r\nfor i in a.values():\r\n ans += ((i - 1) * i) // 2\r\nfor i in b.values():\r\n ans += ((i - 1) * i) // 2\r\nfor i in c.values():\r\n ans -= ((i - 1) * i) // 2\r\n\r\nprint(ans)\r\n\r\n", "d1={}\nd2={}\nd={}\nfor i in range(int(input())):\n\tx,y=map(int,input().split())\n\tif(d.get((x,y))==None):\n\t\td[(x,y)]=1\n\telse:\n\t\td[(x,y)]+=1\n\tif(d1.get(x)==None):\n\t\td1[x]=1\n\telse:\n\t\td1[x]+=1\n\tif(d2.get(y)==None):\n\t\td2[y]=1\n\telse:\n\t\td2[y]+=1\nsum=0\nfor j in d1:\n\tk=d1[j]\n\tsum+=((k)*(k-1))/2\nfor j in d2:\n\tk=d2[j]\n\tsum+=((k)*(k-1))/2\nfor j in d:\n\tif(d[j]>1):\n\t\tk=d[j]\n\t\tsum-=((k)*(k-1))/2\nprint(int(sum))", "#This code is contributed by Siddharth\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n# ---------------------------------------------------------Code---------------------------------------------------------\r\n\r\n\r\nn=int(input())\r\nX=defaultdict(int)\r\nY=defaultdict(int)\r\ndic=defaultdict(int)\r\narr=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n X[x]+=1\r\n Y[y]+=1\r\n dic[(x,y)]+=1\r\n arr.append((x,y))\r\nans=0\r\nfor i in arr:\r\n ans+=X[i[0]]-1+Y[i[1]]-1-(dic[i]-1)\r\n X[i[0]]-=1\r\n Y[i[1]]-=1\r\n dic[i]-=1\r\nprint(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\r\n", "n=int(input())\r\nans=0\r\nvisited={}\r\nf={}\r\ns={}\r\nfor i in range(n):\r\n n=[int(x) for x in input().split()]\r\n if n[0] in f:\r\n ans+=f[n[0]]\r\n f[n[0]]+=1\r\n else:\r\n f[n[0]]=1\r\n if n[1] in s:\r\n ans+=s[n[1]]\r\n s[n[1]]+=1\r\n else:\r\n s[n[1]]=1\r\n if tuple(n) in visited:\r\n ans-=visited[tuple(n)]\r\n visited[tuple(n)]+=1\r\n else:\r\n visited[tuple(n)]=1\r\n \r\n \r\n \r\nprint(ans)", "import collections\r\nimport random\r\nimport math\r\nfrom collections import defaultdict\r\nimport itertools\r\nfrom sys import stdin, stdout\r\nimport sys\r\nimport operator\r\nfrom decimal import Decimal\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\np2D = lambda x: print(*x, sep=\"\\n\")\r\ndef II(): return int(sys.stdin.buffer.readline())\r\ndef MI(): return map(int, sys.stdin.buffer.readline().split())\r\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\ndef BI(): return sys.stdin.buffer.readline().rstrip()\r\ndef SI(): return sys.stdin.buffer.readline().rstrip().decode()\r\ndef li(): return [int(i) for i in input().split()]\r\ndef lli(rows): return [li() for _ in range(rows)]\r\ndef si(): return input()\r\ndef ii(): return int(input())\r\ndef ins(): return input().split()\r\n\r\n\r\ndef main():\r\n # z = ''\r\n # p = lambda *a: print(*a, flush = True)\r\n # mod = 10 ** 9 + 7\r\n n = ii()\r\n points_fin = defaultdict(list)\r\n points_sin = defaultdict(list)\r\n for i in range(n):\r\n tmp = li()\r\n points_fin[tmp[0]].append(tmp[1])\r\n points_sin[tmp[1]].append(tmp[0])\r\n\r\n ans = 0\r\n for p in points_fin:\r\n l = len(points_fin[p])\r\n ans+= l*(l-1)//2\r\n tmp = collections.Counter(points_fin[p])\r\n for val in tmp:\r\n if tmp[val]>1:\r\n ans-= tmp[val]*(tmp[val]-1)//2\r\n\r\n\r\n for p in points_sin:\r\n l = len(points_sin[p])\r\n ans+= l*(l-1)//2\r\n\r\n print(ans)\r\n\r\n # z += str(ans) + '\\n'\r\n # print(len(ans), ' '.join(map(str, ans)), sep='\\n')\r\n # stdout.write(z)\r\n\r\n\r\n# for interactive problems\r\n# print(\"? {} {}\".format(l,m), flush=True)\r\n# or print this after each print statement\r\n# sys.stdout.flush()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\nn = int(input())\r\nk = 0\r\nd_x = {}\r\nd_y = {}\r\nd_x_y = {}\r\ns_x = 0\r\ns_y =0\r\ns_x_y = 0\r\nfor i in range (n) :\r\n\t[x,y] = [int(x) for x in input().split()]\r\n\tif d_x.setdefault(x) == None:\r\n\t\td_x[x] = 0\r\n\telse :\r\n\t\td_x[x] += 1\r\n\t\ts_x += d_x[x]\r\n\r\n\tif d_y.setdefault(y) == None:\r\n\t\td_y[y] = 0\r\n\telse :\r\n\t\td_y[y] += 1\r\n\t\ts_y += d_y[y]\r\n\r\n\tif d_x_y.setdefault((x,y)) == None:\r\n\t\td_x_y[(x,y)] = 0\r\n\telse :\r\n\t\td_x_y[(x,y)] += 1\r\n\t\ts_x_y+= d_x_y[(x,y)]\r\n\r\n\r\n\r\nprint(s_x + s_y -s_x_y)\r\n\r\n", "import operator as op\nfrom functools import reduce\n\ndef ncr(n, r):\n r = min(r, n-r)\n numer = reduce(op.mul, range(n, n-r, -1), 1)\n denom = reduce(op.mul, range(1, r+1), 1)\n return numer / denom\n\n\nif __name__ == '__main__':\n n = int(input())\n x_map = {}\n y_map = {}\n pos_map = {}\n for i in range(n):\n x, y = map(int, input().split())\n if x in x_map:\n x_map[x] += 1\n else:\n x_map[x] = 1\n if y in y_map:\n y_map[y] += 1\n else:\n y_map[y] = 1\n if (x, y) in pos_map:\n pos_map[(x, y)] += 1\n else:\n pos_map[(x, y)] = 1\n pair = 0\n for k in x_map:\n if x_map[k] > 1:\n pair += ncr(x_map[k], 2)\n for k in y_map:\n if y_map[k] > 1:\n pair += ncr(y_map[k], 2)\n for k in pos_map:\n if pos_map[k] > 1:\n pair -= ncr(pos_map[k], 2)\n print(int(pair))\n\n\n", "#650A\r\nn = int(input())\r\ndx = {}\r\ndy = {}\r\ndp = {}\r\np = 0\r\nfor i in range(n):\r\n [x,y] = list(map(int,input().split()))\r\n if x in dx:\r\n dx[x] += 1\r\n else:\r\n dx[x] = 1\r\n if y in dy:\r\n dy[y] += 1\r\n else:\r\n dy[y] = 1\r\n if (x,y) in dp:\r\n dp[(x,y)] += 1\r\n else:\r\n dp[(x,y)] = 1\r\nfor x in dx:\r\n p += dx[x]*(dx[x]-1)//2\r\nfor y in dy:\r\n p += dy[y]*(dy[y]-1)//2\r\nfor z in dp:\r\n p -= dp[z]*(dp[z]-1)//2\r\nprint(p)", "n=int(input())\r\nx={}\r\ny={}\r\nz={}\r\nans=0\r\nfor i in range(n):\r\n q,w=map(int,input().split())\r\n if q in x:\r\n x[q]+=1\r\n else:\r\n x[q]=1\r\n if w in y:\r\n y[w]+=1\r\n else:\r\n y[w]=1\r\n p=str([q,w])\r\n if p in z:\r\n z[p]+=1\r\n else:\r\n z[p]=1\r\nfor i in x:\r\n o=x[i]\r\n ans+=o*(o-1)//2\r\nfor i in y:\r\n o=y[i]\r\n ans+=o*(o-1)//2\r\nfor i in z:\r\n o=z[i]\r\n ans-=o*(o-1)//2\r\nprint(ans)", "from collections import defaultdict\r\n\r\nt = int(input())\r\nx_f = defaultdict(int)\r\ny_f = defaultdict(int)\r\nrep_d = defaultdict(int)\r\ncnt = 0\r\n\r\nfor _ in range(t):\r\n x, y = map(int, input().split())\r\n x_f[x] += 1\r\n y_f[y] += 1\r\n rep_d[(x, y)] += 1\r\n\r\nfor p in x_f.values():\r\n cnt += (p * (p - 1)) // 2\r\n\r\nfor p in y_f.values():\r\n cnt += (p * (p - 1)) // 2\r\n\r\nfor p in rep_d.values():\r\n cnt -= (p * (p - 1)) // 2\r\n\r\nprint(cnt)\r\n", "import math\r\ndef myhash(a,b):\r\n return 'x'+str(a)+'y'+str(b)\r\nn = int(input())\r\nsamesame= {}\r\nx_d = {}\r\ny_d = {}\r\ncopies = 0\r\nans = 0\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n if myhash(x,y) in samesame:\r\n samesame[myhash(x,y)] += 1\r\n else:\r\n samesame[myhash(x,y)] = 1\r\n if x in x_d:\r\n x_d[x] += 1\r\n else:\r\n x_d[x] = 1\r\n if y in y_d:\r\n y_d[y] += 1\r\n else:\r\n y_d[y] = 1\r\nfor i in x_d:\r\n ans += math.comb(x_d[i],2)\r\nfor i in y_d:\r\n ans += math.comb(y_d[i],2)\r\nfor i in samesame:\r\n copies += math.comb(samesame[i],2)\r\nans -= copies\r\nprint(ans)", "def math(x):\r\n return (x*(x-1))//2\r\nn=int(input())\r\nleft={}\r\nright={}\r\nboth={}\r\nfor i in range(n):\r\n t=tuple(map(int,input().split()))\r\n try:\r\n left[t[0]]+=1\r\n except:\r\n left[t[0]]=1\r\n try:\r\n right[t[1]]+=1\r\n except:\r\n right[t[1]]=1\r\n try:\r\n both[t]+=1\r\n except:\r\n both[t]=1\r\nres=0\r\nfor i in left:\r\n el=left[i]\r\n res+=math(el)\r\nfor i in right:\r\n el=right[i]\r\n res+=math(el)\r\nfor i in both:\r\n el=both[i]\r\n res-=math(el)\r\nprint(res)\r\n", "from collections import Counter\r\n\r\nn= int(input())\r\nfull = []\r\nxdict={}\r\nydict = {}\r\nresult = 0\r\nfor _ in range(n):\r\n x,y = map(int, input().split())\r\n full.append((x,y))\r\n try:\r\n xdict[x]+= 1\r\n except:\r\n xdict[x]=1\r\n try:\r\n ydict[y]+= 1\r\n except:\r\n ydict[y]= 1\r\nfor key,value in xdict.items():\r\n if value>1:\r\n result += (value*(value-1))//2\r\nfor key,value in ydict.items():\r\n if value>1:\r\n result += (value*(value-1))//2\r\ncount = Counter(full)\r\nfor key,value in count.items():\r\n if value>1:\r\n result-= (value*(value-1))//2\r\nprint(result)\r\n\r\n", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef solve():\n n = int(input())\n p = [tuple(map(int, input().split())) for _ in range(n)]\n\n cnt = collections.Counter(x for x, _ in p)\n cnt2 = collections.Counter(y for _, y in p)\n cntp = collections.Counter(p)\n\n r = 0\n for k, v in cnt.most_common() + cnt2.most_common():\n r += v * (v - 1)\n for k, v in cntp.most_common():\n r -= v * (v - 1)\n return r//2\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "# A. Watchmen\r\nt=int(input())\r\ndx={}\r\ndy={}\r\ndxy={}\r\na=0\r\nfor i in range(t):\r\n x,y = map(int, input().split())\r\n a+=dx.get(x,0)+dy.get(y,0)-dxy.get((x,y),0)\r\n dxy[(x,y)]=dxy.get((x,y),0)+1\r\n dx[x]=dx.get(x,0)+1\r\n dy[y]=dy.get(y,0)+1\r\n \r\nprint(a)\r\n\r\n \r\n\r\n", "import math\r\n\r\nn=int(input())\r\na=[];b=[]\r\nt=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n t.append([x,y])\r\n a.append(x)\r\n b.append(y)\r\n \r\nt.sort()\r\na.sort()\r\nb.sort()\r\nanswer=0\r\npair=0\r\nlast=t[0];now=1\r\nfor i in range(1,n):\r\n if t[i]==last:\r\n now+=1\r\n else:\r\n pair+=now*(now-1)//2\r\n now=1;last=t[i]\r\npair+=now*(now-1)//2\r\n \r\nlast=a[0];now=1\r\nfor i in range(1,n):\r\n if a[i]==last:\r\n now+=1\r\n else:\r\n answer+=now*(now-1)//2\r\n now=1;last=a[i]\r\n \r\nanswer+=now*(now-1)//2\r\nnow=1;last=b[0]\r\nfor i in range(1,n):\r\n if b[i]==last:\r\n now+=1\r\n else:\r\n answer+=now*(now-1)//2\r\n now=1;last=b[i]\r\nanswer+=now*(now-1)//2\r\nnow=1;last=b[i]\r\n\r\nprint(answer-pair)", "n = int(input())\nx = dict()\ny = dict()\nz = dict()\nt = 0\nfor i in range(n):\n a, b = map(int, input().split())\n p = x.get(a, 0)\n q = y.get(b, 0)\n r = z.get((a, b), 0)\n t += (p + q - r)\n x[a] = p + 1\n y[b] = q + 1\n z[(a, b)] = r + 1\nprint(t)", "from collections import Counter as c\r\nx = c()\r\ny = c()\r\nxy = c()\r\nans = 0\r\nfor i in range(int(input())): \r\n a, b = map(int, input().split())\r\n ans += x[a] + y[b] - xy[(a,b)]\r\n x[a]+=1\r\n y[b]+=1\r\n xy[(a,b)]+=1\r\n \r\nprint(ans)", "'''input\n6\n0 0\n0 1\n0 2\n-1 1\n0 1\n1 1\n'''\n\nfrom sys import stdin\n\n\ndef combination(num, l = 2):\n\tif num < 2:\n\t\treturn 0\n\telse:\n\t\treturn (num * (num - 1)) // 2\n\n\ndef make(first, second):\n\treturn str(first) + ' ' + str(second)\n\n\n# main starts\nn = int(stdin.readline().strip())\npoints = []\nfor _ in range(n):\n\tx, y = list(map(int, stdin.readline().split()))\n\tpoints.append([x, y])\n\npoints = sorted(points, key = lambda x:x[0])\ncount = 1\nans = 0\nfor i in range(1, n):\n\tif points[i][0] == points[i - 1][0]:\n\t\tcount += 1\n\telse:\n\t\tans += combination(count, 2)\n\t\tcount = 1\nans += combination(count, 2)\npoints = sorted(points, key = lambda x:x[1])\ncount = 1\nfor i in range(1, n):\n\tif points[i][1] == points[i - 1][1]:\n\t\tcount += 1\n\telse:\n\t\tans += combination(count, 2)\n\t\tcount = 1\n\nans += combination(count, 2)\n\nunique = dict()\nfor i in range(n):\n\tx, y = points[i]\n\tif make(x, y) in unique:\n\t\tunique[make(x, y)] += 1\n\telse:\n\t\tunique[make(x, y)] = 1\n\nfor i in unique:\n\tans -= combination(unique[i], 2)\nprint(ans)\n", "n=int(input())\r\na =0\r\nb =0\r\ns1 = {}\r\ns2 = {}\r\ns3 = {}\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n s1[a]=s1.get(a,0)+1\r\n s2[b]=s2.get(b,0)+1\r\n tmp = (a,b)\r\n s3[tmp] = s3.get(tmp,0)+1\r\n\r\nsum=0\r\nfor i in s1.values():\r\n sum+=(i-1)*(i)//2\r\n\r\nfor i in s2.values():\r\n sum+=(i-1)*(i)//2\r\n\r\nfor i in s3.values():\r\n sum-=(i-1)*(i)//2\r\n\r\nprint(sum)", "from collections import defaultdict as dd\r\nn = int(input())\r\npts = []\r\nd = dd(int)\r\nx, y = dd(int), dd(int)\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n pts.append([a, b])\r\n d[(a, b)] += 1\r\n x[a] += 1\r\n y[b] += 1\r\n\r\nxkeys = list(x.keys())\r\nykeys = list(y.keys())\r\nans = 0\r\n\r\nfor i in xkeys:\r\n nums = x[i]\r\n ans += ((nums * (nums - 1)) // 2)\r\nfor i in ykeys:\r\n nums = y[i]\r\n ans += ((nums * (nums - 1)) // 2)\r\n\r\nptkeys = list(d.keys())\r\nfor i in ptkeys:\r\n nums = d[i]\r\n if nums > 1:\r\n ans -= ((nums * (nums - 1)) // 2)\r\nprint(ans)\r\n\r\n\r\n\r\n \r\n \r\n", "from collections import defaultdict\r\nn = int(input())\r\ndx = defaultdict(int)\r\ndy = defaultdict(int)\r\nxy = defaultdict(int)\r\nc = 0\r\nfor _ in range(n):\r\n s = input()\r\n x, y = s.split()\r\n c += dx[x] + dy[y] - xy[s]\r\n dx[x] += 1\r\n dy[y] += 1\r\n xy[s] += 1\r\nprint(c)", "\r\nimport math\r\n\r\ndef nCr(n,r):\r\n if n<r:\r\n return 0\r\n return math.factorial(n) // ((math.factorial(r) * math.factorial(n-r)))\r\n \r\nn = int(input())\r\ndict_x ={}\r\ndict_y = {}\r\ndict_x_y = {}\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n dict_x[x] = dict_x.get(x,0)+1\r\n dict_y[y] = dict_y.get(y,0)+1\r\n dict_x_y[(x,y)] = dict_x_y.get((x,y),0)+1\r\n\r\n\r\nval = 0\r\nfor key in dict_x.keys():\r\n val += ((dict_x[key])*(dict_x[key]-1))//2\r\n\r\nfor key in dict_y.keys():\r\n val += ((dict_y[key])*(dict_y[key]-1))//2\r\n\r\nfor key in dict_x_y.keys():\r\n val -= ((dict_x_y[key])*(dict_x_y[key]-1))//2\r\nprint(val)\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn = int(input())\r\nr = Counter()\r\nk = Counter()\r\nu = Counter()\r\na = 0\r\nfor _ in range(n):\r\n x, y = tuple(map(int, input().split()))\r\n a += k[x] + u[y] - r[(x, y)]\r\n k[x] += 1\r\n u[y] += 1\r\n r[(x, y)] += 1\r\nprint(a)\r\n", "d1={}\r\nd2={}\r\nd3={}\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n d1[x]=d1.get(x,0)+1\r\n d2[y]=d2.get(y,0)+1\r\n d3[(x,y)]=d3.get((x,y),0)+1\r\nans=0\r\nfor i in d1.keys():\r\n val=d1[i]\r\n ans+=(val*(val-1))//2\r\nfor i in d2.keys():\r\n val=d2[i]\r\n ans+=(val*(val-1))//2\r\nfor i in d3.keys():\r\n val=d3[i]\r\n ans-=(val*(val-1))//2\r\nprint(ans)\r\n", "from collections import defaultdict\r\n\r\nr=0\r\na,b,c=defaultdict(int),defaultdict(int),defaultdict(int)\r\n\r\nfor _ in range(int(input())):\r\n\tx,y=map(int, input().split())\r\n\tr+=a[x]+b[y]-c[(x,y)]\r\n\ta[x]+=1\r\n\tb[y]+=1\r\n\tc[(x,y)]+=1\r\nprint(r)\r\n", "from collections import defaultdict\r\nn=int(input())\r\ndic,dicx,dicy=defaultdict(int),defaultdict(int),defaultdict(int)\r\nans=0\r\nfor _ in range(n):\r\n x,y=input().split()\r\n x,y=int(x),int(y)\r\n ans += (dicx[x]+dicy[y]-dic[(x,y)])\r\n dicx[x]+=1\r\n dicy[y]+=1\r\n dic[(x,y)]+=1\r\nprint(ans)", "from collections import Counter\r\nn=int(input())\r\na, b, c=[], [], []\r\nfor i in range(n):\r\n x=[int(k) for k in input().split()]\r\n a.append(x[0])\r\n b.append(x[1])\r\n c.append(tuple(x))\r\na=Counter(a)\r\nb=Counter(b)\r\nc=Counter(c)\r\nres=0\r\nfor j in c.keys():\r\n if c[j]>=2:\r\n res-=c[j]*(c[j]-1)//2\r\nfor j in b.keys():\r\n if b[j]>=2:\r\n res+=b[j]*(b[j]-1)//2\r\nfor j in a.keys():\r\n if a[j]>=2:\r\n res+=a[j]*(a[j]-1)//2\r\nprint(res)", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\nx, y, xy = [], [], []\r\nfor i in range(n):\r\n u, v = map(int, stdin.readline().split())\r\n x.append(u)\r\n y.append(v)\r\n xy.append((u, v))\r\n\r\ndef cal_pair(a):\r\n ans = 0\r\n a.sort()\r\n cur = 0\r\n for last in range(1, len(a)):\r\n if a[last] == a[cur]:\r\n continue\r\n ans += (last - cur) * (last - cur - 1) // 2\r\n cur = last\r\n ans += (n - cur) * (n - cur - 1) // 2\r\n return ans\r\nprint(cal_pair(x) + cal_pair(y) - cal_pair(xy))", "n = int(input())\nw = [None]*n\nfor i in range(n):\n\tx,y = map(int,input().split())\n\tw[i] = (x,y)\nw.sort()\neq = 0\nnp = 0\nxeq = 0\nfor i in range(n):\n\teq += 1\n\tif i+1==n or w[i][0] != w[i+1][0]:\n\t\t#print(\"keq\",eq)\n\t\tcomb = eq*(eq-1)//2\n\t\tnp += comb\n\t\teq = 0\n\tif i>0 and w[i][0] == w[i-1][0] and w[i][1]==w[i-1][1]:\n\t\txeq += 1\n\telif xeq>0:\n\t\txcomb = xeq*(xeq+1)//2\n\t\tnp -= xcomb\n\t\txeq = 0\nif xeq>0:\n\txcomb = xeq*(xeq+1)//2\n\tnp -= xcomb\n\txeq = 0\ndef sortSecond(val):\n\treturn val[1]\nw.sort(key=sortSecond)\neq = 0\nfor i in range(n):\n\teq += 1\n\tif i+1==n or w[i][1] != w[i+1][1]:\n\t\t#print(\"eq\",eq)\n\t\tcomb = eq*(eq-1)//2\n\t\tnp += comb\n\t\teq = 0\nprint(np)\n\t\t \t \t\t\t \t\t \t\t\t \t\t \t \t", "n = int(input())\r\nfrom collections import defaultdict\r\np = defaultdict(int)\r\nq = defaultdict(int)\r\ns = defaultdict(int)\r\nans = 0\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n ans += p.get(x, 0)+q.get(y, 0)-s.get((x,y), 0)\r\n p[x] += 1\r\n q[y] += 1\r\n s[x,y] += 1\r\nprint(ans)", "from collections import Counter\r\nx, y, p = Counter(), Counter(), Counter() \r\nfor _ in range(int(input())):\r\n i, j = map(int, input().split())\r\n x[i] += 1\r\n y[j] += 1\r\n p[(i, j)] += 1\r\ndef cnt(n):\r\n return n * (n - 1) // 2\r\nans = sum(map(cnt, x.values())) + sum(map(cnt, y.values())) - sum(map(cnt, p.values()))\r\nprint(ans)", "import sys\n \n# Fast input\ninput = sys.stdin.readline\n \n# Fast output\ndef print(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '')\n file = kwargs.get('file', sys.stdout)\n flush = kwargs.get('flush', False)\n output = sep.join(map(str, args)) + end\n file.write(output)\n if flush:\n file.flush()\nt=int(input())\ndx={}\ndy={}\ndxy={}\ndef c(x):\n return (x**2-x)//2\nl=[]\nfor _ in range(t):\n n,m=map(int,input().split())\n dx[n] = dx.get(n, 0) + 1\n dy[m] = dy.get(m, 0) + 1\n l.append((n,m))\n\ns1=0\ns2=0\ns3=0\nfor i in l:\n dxy[i] = dxy.get(i, 0) + 1\nl1=list(dx.values())\nl2=list(dy.values())\nl3=list(dxy.values())\nfor i in l1:\n s1+=c(i)\nfor i in l2:\n s2+=c(i)\nfor i in l3:\n s3+=c(i)\nprint(s1+s2-s3)\n\t\t \t \t\t \t\t \t \t\t \t \t", "from collections import Counter\r\nn=int(input());x=[];y=[];ans=0;t=[];s={}\r\nfor i in range(n):\r\n a,b=map(int,input().split());x.append(a);y.append(b)\r\ns[(str(x[0]),str(y[0]))]=1\r\nfor i in range(1,n,1):\r\n if (str(x[i]),str(y[i])) in s: s[(str(x[i]),str(y[i]))]+=1\r\n else: s[(str(x[i]),str(y[i]))]=1\r\nfor i in s.values(): ans-=((i-1)*i)//2\r\nx1=Counter(map(str,x));y1=Counter(map(str,y))\r\nfor i in x1.values():\r\n ans+=(int(i)*((int(i))-1))//2\r\nfor i in y1.values():\r\n ans+=(int(i)*((int(i))-1))//2\r\nprint(ans)", "q={}\nw={}\ne={}\nr=0\nfor _ in range(int(input())):\n x,y=map(int,input().split())\n a,s,d=q.get(x,0),w.get(y,0),e.get((x,y),0)\n r+=a+s-d\n q[x],w[y],e[x,y]=a+1,s+1,d+1\nprint(r)\n\n\n \t\t\t \t\t \t \t\t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\ncoordinates = []\r\nX = {}\r\nY = {}\r\npairs = {}\r\n\r\ndef nc2(k):\r\n return (k * (k-1))/2\r\nfor i in range(n):\r\n u, v = map(int, input().split())\r\n coordinates += [(u, v)]\r\n if u not in X: X[u] = 0\r\n if v not in Y: Y[v] = 0\r\n if (u,v) not in pairs: pairs[(u,v)] = 0\r\n X[u] += 1\r\n Y[v] += 1\r\n pairs[(u, v)] += 1\r\n\r\ntotal = 0\r\nfor x in X.keys():\r\n value = X[x]\r\n if value > 1:\r\n total += nc2(value)\r\n\r\nfor y in Y.keys():\r\n value = Y[y]\r\n if value > 1:\r\n total += nc2(value)\r\n\r\nfor p in pairs.keys():\r\n value = pairs[p]\r\n if value > 1:\r\n total -= nc2(value)\r\n\r\nprint(int(total))\r\n", "n = int(input())\r\nx, y, p = {}, {}, {}\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n x[a] = x.get(a, 0) + 1\r\n y[b] = y.get(b, 0) + 1\r\n p[(a, b)] = p.get((a, b), 0) + 1 \r\nres = 0\r\nfor i in x.keys():\r\n res += x[i] * (x[i]-1) // 2\r\nfor i in y.keys():\r\n res += y[i] * (y[i]-1) // 2\r\nfor i in p.keys():\r\n res -= p[i] * (p[i]-1) // 2\r\nprint(res)\r\n", "n = int(input())\nm = [tuple(map(int,input().split())) for _ in range(n)]\ncx = {}\ncy = {}\ncxy = {}\nfor i in m:\n if i[0] in cx:\n cx[i[0]]+=1\n else:\n cx[i[0]]=1\n if i[1] in cy:\n cy[i[1]]+=1\n else:\n cy[i[1]]=1\n if i in cxy:\n cxy[i]+=1\n else:\n cxy[i]=1\ncount = 0\nfor i in m:\n if cx[i[0]]>1:\n cx[i[0]]-=1\n count += cx[i[0]]\n if cy[i[1]]>1:\n cy[i[1]]-=1\n count += cy[i[1]]\n if cxy[i]>1:\n cxy[i]-=1\n count -= cxy[i]\nprint(count)", "# ⢸⣿⣿⣿⣿⠃⠄⢀⣴⡾⠃⠄⠄⠄⠄⠄⠈⠺⠟⠛⠛⠛⠛⠻⢿⣿⣿⣿⣿⣶⣤⡀⠄\r\n# ⢸⣿⣿⣿⡟⢀⣴⣿⡿⠁⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⣸⣿⣿⣿⣿⣿⣿⣿⣷\r\n# ⢸⣿⣿⠟⣴⣿⡿⡟⡼⢹⣷⢲⡶⣖⣾⣶⢄⠄⠄⠄⠄⠄⢀⣼⣿⢿⣿⣿⣿⣿⣿⣿⣿\r\n# ⢸⣿⢫⣾⣿⡟⣾⡸⢠⡿⢳⡿⠍⣼⣿⢏⣿⣷⢄⡀⠄⢠⣾⢻⣿⣸⣿⣿⣿⣿⣿⣿⣿\r\n# ⡿⣡⣿⣿⡟⡼⡁⠁⣰⠂⡾⠉⢨⣿⠃⣿⡿⠍⣾⣟⢤⣿⢇⣿⢇⣿⣿⢿⣿⣿⣿⣿⣿\r\n# ⣱⣿⣿⡟⡐⣰⣧⡷⣿⣴⣧⣤⣼⣯⢸⡿⠁⣰⠟⢀⣼⠏⣲⠏⢸⣿⡟⣿⣿⣿⣿⣿⣿\r\n# ⣿⣿⡟⠁⠄⠟⣁⠄⢡⣿⣿⣿⣿⣿⣿⣦⣼⢟⢀⡼⠃⡹⠃⡀⢸⡿⢸⣿⣿⣿⣿⣿⡟\r\n# ⣿⣿⠃⠄⢀⣾⠋⠓⢰⣿⣿⣿⣿⣿⣿⠿⣿⣿⣾⣅⢔⣕⡇⡇⡼⢁⣿⣿⣿⣿⣿⣿⢣\r\n# ⣿⡟⠄⠄⣾⣇⠷⣢⣿⣿⣿⣿⣿⣿⣿⣭⣀⡈⠙⢿⣿⣿⡇⡧⢁⣾⣿⣿⣿⣿⣿⢏⣾\r\n# ⣿⡇⠄⣼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢻⠇⠄⠄⢿⣿⡇⢡⣾⣿⣿⣿⣿⣿⣏⣼⣿\r\n# ⣿⣷⢰⣿⣿⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⢰⣧⣀⡄⢀⠘⡿⣰⣿⣿⣿⣿⣿⣿⠟⣼⣿⣿\r\n# ⢹⣿⢸⣿⣿⠟⠻⢿⣿⣿⣿⣿⣿⣿⣿⣶⣭⣉⣤⣿⢈⣼⣿⣿⣿⣿⣿⣿⠏⣾⣹⣿⣿\r\n# ⢸⠇⡜⣿⡟⠄⠄⠄⠈⠙⣿⣿⣿⣿⣿⣿⣿⣿⠟⣱⣻⣿⣿⣿⣿⣿⠟⠁⢳⠃⣿⣿⣿\r\n# ⠄⣰⡗⠹⣿⣄⠄⠄⠄⢀⣿⣿⣿⣿⣿⣿⠟⣅⣥⣿⣿⣿⣿⠿⠋⠄⠄⣾⡌⢠⣿⡿⠃\r\n# ⠜⠋⢠⣷⢻⣿⣿⣶⣾⣿⣿⣿⣿⠿⣛⣥⣾⣿⠿⠟⠛⠉⠄⠄\r\n\r\ncnt = 0\r\nfrom collections import defaultdict as d\r\n\r\nxx = d(int)\r\nyy = d(int)\r\nxxyy = d(int)\r\n\r\nfor _ in range(int(input())):\r\n x,y = map(int,input().strip().split())\r\n xx[x] += 1\r\n yy[y] += 1\r\n xxyy[(x,y)] += 1\r\n\r\nfor x in xx: cnt += (xx[x]*xx[x] - xx[x])//2\r\nfor x in yy: cnt += (yy[x]*yy[x] - yy[x])//2\r\n\r\nfor k in xxyy: cnt -= (xxyy[k] * xxyy[k] - xxyy[k])//2\r\n\r\nprint(cnt)", "from collections import Counter\r\n\r\nx,y=[],[]\r\nC=[]\r\nn = int(input())\r\nfor _ in range(n):\r\n c= list(map(int,str.split(input())))\r\n x+=[c[0]]\r\n y+=[c[1]] \r\n C+=[str(c)]\r\nXs=Counter(x)\r\nYs=Counter(y)\r\nCs=Counter(C)\r\npairs=0\r\nfor key in Xs:\r\n _x = Xs[key]\r\n pairs +=(_x*(_x-1)//2)\r\n\r\nfor key in Ys:\r\n _x = Ys[key]\r\n pairs +=(_x*(_x-1)//2)\r\n \r\nfor key in Cs:\r\n _x = Cs[key]\r\n pairs -=(_x*(_x-1)//2) \r\n\r\nprint(pairs)", "from collections import Counter\r\n\r\nn = int(input())\r\ntab = [tuple(map(int, input().split())) for i in range(n)]\r\nx = sum( [((k * (k -1)) // 2) for k in Counter([tab[i][0] for i in range(n)]).values()])\r\ny = sum( [((k * (k -1)) // 2) for k in Counter([tab[i][1] for i in range(n)]).values()])\r\nx_y = sum( [((k * (k -1)) // 2) for k in Counter(tab).values()])\r\nprint(x + y - x_y)", "from sys import stdin, stdout\r\n\r\nclass SOLVE:\r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n xfreq, yfreq, xyfreq = {}, {}, {}\r\n for i in range(int(R())):\r\n p, q = [x for x in R().split()]\r\n \r\n s = ('' if p[0] == '-' else '+') + p + ('' if q[0] == '-' else '+') + q\r\n \r\n if s not in xyfreq:\r\n xyfreq[s] = 1\r\n else:\r\n xyfreq[s] += 1\r\n \r\n if p not in xfreq:\r\n xfreq[p] = 1\r\n else:\r\n xfreq[p] += 1\r\n \r\n if q not in yfreq:\r\n yfreq[q] = 1\r\n else:\r\n yfreq[q] += 1\r\n \r\n pairs = 0\r\n for s in xfreq:\r\n pairs += xfreq[s] * (xfreq[s] - 1) // 2\r\n \r\n for s in yfreq:\r\n pairs += yfreq[s] * (yfreq[s] - 1) // 2\r\n \r\n for s in xyfreq:\r\n pairs -= xyfreq[s] * (xyfreq[s] - 1) // 2 \r\n \r\n W('%d\\n' % pairs)\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\nmain()", "from sys import stdin,stdout\r\n# from sys import setrecursionlimit\r\nfrom collections import defaultdict\r\n# from math import gcd,ceil,sqrt\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n# t = 1\r\nn = int(input())\r\ndx = defaultdict(int)\r\ndy = defaultdict(int)\r\nd = defaultdict(int)\r\nans = 0\r\nfor _ in range(n):\r\n\tx,y = list(map(int,input().split()))\r\n\tans+=dx[x]\r\n\tans+=dy[y]\r\n\tdx[x]+=1\r\n\tdy[y]+=1\r\n\tk = hash(str(x)+str(y))\r\n\tans-=d[k]\r\n\td[k]+=1\r\nprint(str(ans)+\"\\n\")\r\n", "from collections import *\nC=Counter\na=0\ncx=C()\ncy=C()\ncp=C()\nn=int(input())\nfor i in range(n):\n x,y=map(int,input().split())\n a+=cx[x]+cy[y]-cp[(x,y)]\n cx[x]+=1\n cy[y]+=1\n cp[(x,y)]+=1\nprint(a)", "from collections import defaultdict\r\nadic=defaultdict(int)\r\nbdic=defaultdict(int)\r\ncdic=defaultdict(int)\r\nans=0\r\nfor _ in range(int(input())):\r\n\tx,y=map(int, input().split())\r\n\tans+=adic[x]+bdic[y]-cdic[(x,y)]\r\n\tadic[x]+=1\r\n\tbdic[y]+=1\r\n\tcdic[(x,y)]+=1\r\nprint(ans)", "I = lambda: list(map(int, input().split()))\r\nnperm = lambda x: x*(x-1)//2\r\ndef groupby(x, key):\r\n groups = {}\r\n for el in x:\r\n group = key(el)\r\n if group not in groups:\r\n groups[group] = []\r\n groups[group].append(el)\r\n return list(groups.values())\r\n\r\nn = int(input())\r\nw = [I() for i in range(n)]\r\nans = 0\r\nans += sum([nperm(len(i)) for i in groupby(w, key=lambda x: x[0])])\r\nans += sum([nperm(len(i)) for i in groupby(w, key=lambda x: x[1])])\r\nans -= sum([nperm(len(i)) for i in groupby(w, key=lambda x: (x[0], x[1]))])\r\nprint(ans)", "#!/usr/bin/env python\n\nxs={}\nys={}\npairs={}\nn=int(input())\nans=0\nwhile n>0:\n x,y=[int(num) for num in input().split()]\n ans+=(xs.get(x,0)+ys.get(y,0))\n xs[x]=xs.get(x,0)+1\n ys[y]=ys.get(y,0)+1\n ans-=pairs.get((x,y),0)\n pairs[(x,y)]=pairs.get((x,y),0)+1\n n-=1\nprint(ans)\n", "n = int(input())\r\n\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().rsplit())\r\n points.append((x, y))\r\n \r\npoints.sort()\r\nres = 0\r\ni = 0\r\nwhile i < n:\r\n j = i + 1\r\n while j < n and points[i][0] == points[j][0]:\r\n j += 1\r\n nums = j - i\r\n res += (nums - 1) * nums // 2\r\n i = j\r\n \r\n# count duplicates pairs\r\nres_duplicates = 0\r\ni = 0\r\nwhile i < n:\r\n j = i + 1\r\n while j < n and points[i][0] == points[j][0] and points[i][1] == points[j][1]:\r\n j += 1\r\n nums = j - i\r\n res_duplicates += (nums - 1) * nums // 2\r\n i = j\r\n\r\npoints.sort(key=lambda point: (point[1], point[0]))\r\ni = 0\r\nwhile i < n:\r\n j = i + 1\r\n while j < n and points[i][1] == points[j][1]:\r\n j += 1\r\n nums = j - i\r\n res += (nums - 1) * nums // 2\r\n i = j\r\n \r\nprint(res - res_duplicates)\r\n", "def main():\n from collections import Counter\n cx, cy, cxy = Counter(), Counter(), Counter()\n for _ in range(int(input())):\n x, y = map(int, input().split())\n cx[x] += 1\n cy[y] += 1\n cxy[x, y] += 1\n print((sum(x * (x - 1) for x in cx.values()) + sum(x * (x - 1) for x in cy.values()) -\n sum(x * (x - 1) for x in cxy.values())) // 2)\n\n\nif __name__ == '__main__':\n main()\n", "# http://codeforces.com/contest/651/problem/C\nfrom collections import Counter\n\nxs, ys = Counter(), Counter()\npoints = Counter()\nn = int(input())\ntotal = 0\nwhile n:\n\tx,y = [int(n) for n in input().split()]\n\tpaired = xs[x] + ys[y] - points[(x,y)]\n\txs[x] += 1\n\tys[y] += 1\n\tpoints[(x,y)] += 1\n\ttotal += paired\n\tn -= 1\nprint(total)\n", "from collections import Counter\r\nn=int(input());x=[];y=[];ans=0;t=[];s={}\r\nfor i in range(n):\r\n a,b=map(int,input().split());x.append(a);y.append(b)\r\nfor i in range(n):\r\n if (x[i],y[i]) in s: s[(x[i],y[i])]+=1\r\n else: s[(x[i],y[i])]=1\r\nfor i in s.values(): ans-=((i-1)*i)//2\r\nx1=Counter(x);y1=Counter(y)\r\nfor i in x1.values():\r\n ans+=((i-1)*i)//2\r\nfor i in y1.values():\r\n ans+=((i-1)*i)//2\r\nprint(ans)", "import sys\r\n\r\ndef answer(n, x, y):\r\n xd = dict()\r\n yd = dict()\r\n xyd = dict()\r\n num_pairs = 0\r\n for i in range(n):\r\n if x[i] in xd:\r\n xd[x[i]] += 1\r\n else:\r\n xd[x[i]] = 1\r\n if y[i] in yd:\r\n yd[y[i]] += 1\r\n else:\r\n yd[y[i]] = 1\r\n if (x[i], y[i]) in xyd:\r\n xyd[(x[i], y[i])] += 1\r\n else:\r\n xyd[(x[i], y[i])] = 1\r\n \r\n for k in xd:\r\n num_pairs += (xd[k] * (xd[k] - 1)) // 2\r\n for k in yd:\r\n num_pairs += (yd[k] * (yd[k] - 1)) // 2\r\n for k in xyd:\r\n num_pairs -= (xyd[k] * (xyd[k] - 1)) // 2\r\n \r\n\r\n return num_pairs\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\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, sys.stdin.readline().split())\r\n print(answer(n, x, y))\r\n return\r\nmain()", "# import os\n# os.chdir(\"C:/Users/gerchik/Dropbox/courses/algorithms/codeforces\")\n# os.chdir(\"/Users/daniilgerchik/Library/CloudStorage/Dropbox/courses/algorithms/codeforces\")\nfrom collections import defaultdict # , Counter, deque\nfrom sys import stdin\n\n# int(stdin.readline().rstrip())\n# stdin.readline().rstrip()\n# list(map(int, stdin.readline().rstrip().split()))\n\ndef get_solution():\n def is_same(point1, point2):\n if point1[0] == point2[0] or point1[1] == point2[1]:\n return True\n return False\n \n # stdin = open(\"input.txt\")\n n = int(stdin.readline().rstrip())\n arr = [tuple(map(int, stdin.readline().rstrip().split())) for _ in range(n)]\n \n x_dict, y_dict, xy_dict = {}, {}, {}\n for lst in arr:\n x, y = lst\n x_dict[x] = x_dict.get(x, 0) + 1\n y_dict[y] = y_dict.get(y, 0) + 1\n xy_dict[(x, y)] = xy_dict.get((x, y), 0) + 1\n \n a = sum([val * (val - 1) // 2 for val in x_dict.values()])\n b = sum([val * (val - 1) // 2 for val in y_dict.values()])\n c = sum([val * (val - 1) // 2 for val in xy_dict.values()])\n print(a + b - c)\n \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\n\n\n\n\n", "'''input\n10\n46 -55\n46 45\n46 45\n83 -55\n46 45\n83 -55\n46 45\n83 45\n83 45\n46 -55\n'''\nfrom collections import Counter\nn = int(input())\nd1, d2, x = {}, {}, [], \nfor _ in range(n):\n\ti = input()\n\ta, b = i.split()[0], i.split()[1]\n\tif a in d1: d1[a] += 1\n\telse: d1[a] = 1\n\tif b in d2: d2[b] += 1\n\telse: d2[b] = 1\n\tx.append(i)\ns = 0\nfor c1 in d1.values():\n\ts += c1*(c1-1)//2\nfor c2 in d2.values():\n\ts += c2*(c2-1)//2\nfor x1 in Counter(x).values():\n\ts -= x1*(x1-1)//2\nprint(s)\n\n\n\n\n\n\n", "n = int(input())\r\n\r\nxm = {}\r\nym ={}\r\npp = {}\r\n\r\nfor _ in range(n):\r\n x,y = list(map(int,input().split()))\r\n\r\n if x in xm:xm[x]+=1\r\n else : xm[x] = 1\r\n\r\n \r\n if y in ym:ym[y]+=1\r\n else : ym[y] = 1\r\n\r\n if (x,y) in pp:pp[(x,y)]+=1\r\n else : pp[(x,y)] = 1\r\n\r\n\r\nres = 0\r\n\r\nfor i in xm.values():\r\n res += (i*(i-1))//2\r\n\r\n \r\nfor i in ym.values():\r\n res += (i*(i-1))//2\r\n\r\n \r\nfor i in pp.values():\r\n res -= (i*(i-1))//2\r\n\r\nprint(res)", "if __name__ == \"__main__\":\r\n header = int(input())\r\n dict_x = {}\r\n dict_y = {}\r\n dict_xy = {}\r\n output = 0\r\n\r\n for i in range(header):\r\n data = list(map(int, input().split(\" \")))\r\n data_x = data[0]\r\n data_y = data[1]\r\n\r\n if data_x not in dict_x:\r\n dict_x[data_x] = 0\r\n\r\n if data_y not in dict_y:\r\n dict_y[data_y] = 0\r\n\r\n if (data_x, data_y) not in dict_xy:\r\n dict_xy[(data_x, data_y)] = 0\r\n\r\n output += dict_x[data_x]\r\n output += dict_y[data_y]\r\n output -= dict_xy[(data_x, data_y)]\r\n\r\n dict_x[data_x] += 1\r\n dict_y[data_y] += 1\r\n dict_xy[(data_x, data_y)] += 1\r\n\r\n print(output)\r\n", "from collections import Counter\r\nn=int(input())\r\nl=[]\r\nx=[]\r\ny=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\n l.append((a,b))\r\ncountX=Counter(x)\r\ncountY=Counter(y)\r\ntotal=0\r\nfor i in countX:\r\n total+=(countX[i]*(countX[i]-1))//2\r\nfor i in countY:\r\n total+=(countY[i]*(countY[i]-1))//2\r\ncountXY=Counter(l)\r\nfor i in countXY:\r\n total-=(countXY[i]*(countXY[i]-1))//2\r\nprint(total)\r\n", "def f(List):\r\n n=len(List)\r\n List\r\n s=0\r\n i=0\r\n while i<n-1:\r\n if List[i]!=List[i+1]:\r\n i+=1\r\n else:\r\n j=1\r\n d=1\r\n while i+j<=n-2 and List[i+j]==List[i+j+1]:\r\n d+=1\r\n j+=1\r\n else:\r\n s+=(d*(d+1))//2\r\n i+=d+1\r\n else:\r\n return s\r\nn=int(input())\r\nX=[]\r\nY=[]\r\nXY=[]\r\nfor i in range(n):\r\n xy=list(map(int, input().rstrip().split()))\r\n X+=[xy[0]]\r\n Y+=[xy[1]]\r\n XY+=[xy]\r\nX.sort()\r\na = f(X)\r\nY.sort()\r\nb = f(Y)\r\nXY.sort()\r\nc = f(XY)\r\nprint(a+b-c)", "from collections import defaultdict\r\nimport sys\r\nfrom math import gcd, sqrt\r\nfrom typing import Counter, DefaultDict\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\n\r\n\r\ninf = float(\"inf\")\r\nen = lambda x: list(enumerate(x))\r\n\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn = ii()\r\nx = [rr() for _ in range(n)]\r\narr = defaultdict(lambda: 0)\r\nbrr = defaultdict(lambda: 0)\r\ncrr = defaultdict(lambda: 0)\r\n\r\nans = 0\r\nfor i, j in x:\r\n ans += arr[i] + brr[j] - crr[(i, j)]\r\n arr[i] += 1\r\n brr[j] += 1\r\n crr[(i, j)] += 1\r\n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ndx = {}\r\ndy = {}\r\np = {}\r\nl = []\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n l.append((x,y))\r\n if x in dx:\r\n dx[x] += 1\r\n\r\n else:\r\n dx[x] = 1\r\n\r\n if y in dy:\r\n dy[y] += 1\r\n\r\n else:\r\n dy[y] = 1\r\n\r\n if (x,y) in p:\r\n p[(x,y)] += 1\r\n\r\n else:\r\n p[(x,y)] = 1\r\n\r\nans = 0\r\nfor x in l:\r\n # print(x)\r\n # print(dx)\r\n # print(dy)\r\n # print(p)\r\n e1 = x[0]\r\n e2 = x[1]\r\n c1 = dx[e1]-1\r\n r = p[(e1,e2)]-1\r\n c2 = dy[e2]-r-1\r\n ans += (c1+c2)\r\n # print(ans)\r\n p[(e1,e2)] -= 1\r\n dx[e1] -= 1\r\n dy[e2] -= 1\r\n\r\nprint(ans)", "import collections\r\n\r\n\r\ndx=collections.defaultdict(int)\r\ndy=collections.defaultdict(int)\r\ndxy=collections.defaultdict(int)\r\ncnt=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n dx[a]+=1\r\n dy[b]+=1\r\n temp=str(a)+str(b)\r\n dxy[temp]+=1\r\n\r\nans=0\r\nfor k in dx.keys():\r\n ans+=(dx[k]*(dx[k]-1))//2\r\nfor k in dy.keys():\r\n ans+=(dy[k]*(dy[k]-1))//2\r\nfor k in dxy.keys():\r\n ans-=(dxy[k]*(dxy[k]-1))//2\r\nprint(ans)", "n = int(input())\r\nl1 = []\r\nl2 = []\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n l1.append([a[0], a[1]])\r\n l2.append([a[1], a[0]])\r\n\r\nl1.sort()\r\nl2.sort()\r\nl = []\r\ncount = 1\r\ndp0 = [0]*n\r\ndp1 = [0]*n\r\nfor i in range(1,n):\r\n if l1[i][0]==l1[i-1][0] and l1[i][1]==l1[i-1][1]:\r\n count += 1\r\n else:\r\n l.append(count)\r\n count = 1\r\n \r\n if l1[i][0]==l1[i-1][0]:\r\n dp0[i] = dp0[i-1]+1\r\n else:\r\n dp0[i] = 0\r\n\r\n if l2[i][0]==l2[i-1][0]:\r\n dp1[i] = dp1[i-1]+1\r\n else:\r\n dp1[i] = 0\r\n\r\nl.append(count)\r\ncount = 0\r\nfor i in l:\r\n count += (i*(i-1))//2\r\nsum = 0\r\nfor i in range(n):\r\n sum += dp0[i]+dp1[i]\r\n\r\nprint(sum - count)\r\n\r\n", "def fn(arr):\r\n ans=0\r\n for i in (arr):\r\n ans+=(i*(i-1))//2\r\n return ans\r\n\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n \r\n \r\n a.append([x,y])\r\n b.append([y,x])\r\nb.sort()\r\na.sort()\r\nx_ans=1\r\nx=[]\r\ny_ans=1\r\ny=[]\r\ncommon=1\r\nc=[]\r\nfor i in range(n-1):\r\n if a[i][0]==a[i+1][0]:\r\n x_ans+=1 \r\n if i==n-2 and x_ans!=1:\r\n x.append(x_ans)\r\n else:\r\n if x_ans!=1:\r\n x.append(x_ans)\r\n x_ans=1\r\nfor i in range(n-1):\r\n if b[i][0]==b[i+1][0]:\r\n y_ans+=1 \r\n if i==n-2 and y_ans!=1:\r\n y.append(y_ans)\r\n else:\r\n if y_ans!=1:\r\n y.append(y_ans)\r\n y_ans=1\r\nfor i in range(n-1):\r\n if a[i]==a[i+1]:\r\n common+=1 \r\n if i==n-2:\r\n c.append(common)\r\n else:\r\n if common!=1:\r\n c.append(common)\r\n common=1 \r\na1=fn(x)\r\na2=fn(y)\r\na3=fn(c)\r\n\r\nprint(a1+a2-a3)\r\n \r\n \r\n # if a[i][1]==a[i+1][1]:\r\n # y_ans+=1 \r\n # if a[i]==a[i+1]:\r\n # common+=1\r\n\r\n# print(x_ans+y_ans-common)\r\n ", "n = int(input())\r\n\r\nx = [0] * 200005\r\ny = [0] * 200005\r\nmx = {}\r\nmy = {}\r\nmxy = {}\r\n\r\nfor i in range(n):\r\n x[i], y[i] = map(int, input().split())\r\n\r\n mx[x[i]] = mx.get(x[i], 0) + 1\r\n my[y[i]] = my.get(y[i], 0) + 1\r\n mxy[(x[i], y[i])] = mxy.get((x[i], y[i]), 0) + 1\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += mx[x[i]] + my[y[i]] - mxy[(x[i], y[i])] - 1\r\n mx[x[i]] -= 1\r\n my[y[i]] -= 1\r\n mxy[(x[i], y[i])] -= 1\r\n\r\nprint(ans)\r\n\r\n", "x, y, c, d = {}, {}, 0, {}\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a in x: x[a] += 1\r\n else: x[a] = 1\r\n if b in y: y[b][0] += 1\r\n else: y[b] = [1, 0]\r\n if (a, b) in d: d[(a, b)] += 1\r\n else: d[(a, b)] = 1\r\nfor i in d:\r\n y[i[1]][1] += d[i] * d[i]\r\nfor k in x.values(): c += k * (k - 1) // 2\r\nfor k in y.values(): c += (k[0] * k[0] - k[1]) // 2\r\nprint(c)", "from sys import stdout\r\nfrom sys import stdin\r\nfrom collections import defaultdict as dd\r\nclass IO:\r\n def read():\r\n return stdin.readline().strip()\r\n def readf():\r\n return [int(i) for i in IO.read().split()]\r\n def put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\n def putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\ndef main():\r\n n = int(IO.read())\r\n x = dd(int)\r\n y = dd(int)\r\n cnt = dd(int)\r\n h = 0\r\n ans = 0\r\n for i in range(n):\r\n a, b = IO.readf()\r\n x[a] += 1\r\n y[b] += 1\r\n cnt[a, b] += 1\r\n for i in cnt:\r\n h += cnt[i]*(cnt[i] - 1)//2\r\n ans = 0\r\n for i in x:\r\n ans += x[i]*(x[i] - 1)//2\r\n for i in y:\r\n ans += y[i]*(y[i] - 1)//2\r\n IO.put(ans - h)\r\nmain()\r\n", "from collections import defaultdict\r\nn=int(input())\r\nrow=defaultdict(int)\r\ncol=defaultdict(int)\r\nv=defaultdict(int)\r\nans=0\r\nfor _ in range(n):\r\n a,b=map(int, input().split())\r\n ans += row[a]\r\n ans += col[b]\r\n ans -= v[(a,b)]\r\n row[a]+=1\r\n col[b]+=1\r\n v[(a,b)]+=1\r\n \r\nprint(ans)", "x = dict(); y = dict(); s = dict(); ans= 0 \r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a in x : ans += x[a]; x[a]+=1\r\n else : x[a] = 1\r\n if b in y : ans += y[b]; y[b]+=1\r\n else : y[b] = 1\r\n if (a,b) in s : ans -= s[(a,b)]; s[(a,b)]+=1\r\n else : s[(a,b)] = 1\r\nprint(ans)\r\n\r\n", "import sys\r\nfrom collections import defaultdict as dd\r\ndef read():\r\n return sys.stdin.readline().strip()\r\ndef printf(a, sep = ' ', end = '\\n'):\r\n sys.stdout.write(sep.join(map(str, a)) + end)\r\n #printf([n])\r\ndef readf():\r\n return [int(i) for i in read().split()]\r\ndef main():\r\n n = int(read())\r\n x = dd(int)\r\n y = dd(int)\r\n cnt = dd(int)\r\n h = 0\r\n ans = 0\r\n for i in range(n):\r\n a, b = readf()\r\n x[a] += 1\r\n y[b] += 1\r\n cnt[a, b] += 1\r\n for i in cnt:\r\n h += cnt[i]*(cnt[i] - 1)//2\r\n ans = 0\r\n for i in x:\r\n ans += x[i]*(x[i] - 1)//2\r\n for i in y:\r\n ans += y[i]*(y[i] - 1)//2\r\n print(ans - h)\r\nmain()\r\n", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\nfrom collections import defaultdict\n\nn = int(input())\nans = 0\nx_points = defaultdict(int)\ny_points = defaultdict(int)\nx_y_points = defaultdict(int)\n\nwhile n:\n n -= 1\n\n x, y = map(int, input().split())\n ans += x_points[x] + y_points[y] - x_y_points[(x,y)]\n\n x_points[x] += 1\n y_points[y] += 1\n x_y_points[(x, y)] += 1\n\nprint(ans)\n", "import collections\r\n\r\ncounter_x = collections.Counter()\r\ncounter_y = collections.Counter()\r\ncounter_xy = collections.Counter()\r\n\r\ntotal_occurrences = 0\r\n\r\nnum_pairs = int(input())\r\nfor i in range(num_pairs):\r\n x, y = map(int, input().split())\r\n total_occurrences += counter_x[x] + counter_y[y] - counter_xy[(x, y)]\r\n counter_x[x] += 1\r\n counter_y[y] += 1\r\n counter_xy[(x, y)] += 1\r\n\r\nprint(total_occurrences)\r\n\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nX = defaultdict((lambda : 0))\r\nY = defaultdict((lambda : 0))\r\nXY = defaultdict((lambda : 0))\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n X[x] += 1\r\n Y[y] += 1\r\n XY[(x, y)] += 1\r\n\r\ncnt = 0\r\n\r\nfor x in X.keys():\r\n k = X[x]\r\n cnt += ((k) * (k - 1)) // 2\r\n\r\nfor y in Y.keys():\r\n k = Y[y]\r\n cnt += ((k) * (k - 1)) // 2\r\n\r\nfor (x, y) in XY.keys():\r\n k = XY[(x, y)]\r\n cnt -= ((k) * (k - 1)) // 2\r\n\r\nprint(cnt)", "class M(): {}\r\n\r\nn = int(input())\r\nm = M()\r\no = M()\r\np = M()\r\nf = 0\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n s = a + \" \" + b\r\n\r\n\r\n if (hasattr(m, s)):\r\n attrValue = getattr(m, s)\r\n f -= attrValue\r\n setattr(m, s, attrValue + 1)\r\n else:\r\n setattr(m, s, 1)\r\n\r\n\r\n if (hasattr(o, a)):\r\n attrValue = getattr(o, a)\r\n f += attrValue\r\n setattr(o, a, attrValue + 1)\r\n else:\r\n setattr(o, a, 1)\r\n\r\n\r\n if (hasattr(p, b)):\r\n attrValue = getattr(p, b)\r\n f += attrValue\r\n setattr(p, b, attrValue + 1)\r\n else:\r\n setattr(p, b, 1)\r\n\r\nprint(f)", "jc=[0,0,1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,276,300,325,351,378,406,435,465,496,528,561,595,630,666,703,741,780,820,861,903,946,990,1035,1081,1128,1176,1225,1275,1326,1378,1431,1485,1540,1596,1653,1711,1770,1830,1891,1953,2016,2080,2145,2211,2278,2346,2415,2485,2556,2628,2701,2775,2850,2926,3003,3081,3160,3240,3321,3403,3486,3570,3655,3741,3828,3916,4005,4095,4186,4278,4371,4465,4560,4656,4753,4851,4950,5050,5151,5253,5356,5460,5565,5671,5778,5886,5995,6105,6216,6328,6441,6555,6670,6786,6903,7021,7140,7260,7381,7503,7626,7750,7875,8001,8128,8256,8385,8515,8646,8778,8911,9045,9180,9316,9453,9591,9730,9870,10011,10153,10296,10440,10585,10731,10878,11026,11175,11325,11476,11628,11781,11935,12090,12246,12403,12561,12720,12880,13041,13203,13366,13530,13695,13861,14028,14196,14365,14535,14706,14878,15051,15225,15400,15576,15753,15931,16110,16290,16471,16653,16836,17020,17205,17391,17578,17766,17955,18145,18336,18528,18721,18915,19110,19306,19503,19701,19900,20100,20301,20503,20706,20910,21115,21321,21528,21736,21945,22155,22366,22578,22791,23005,23220,23436,23653,23871,24090,24310,24531,24753,24976,25200,25425,25651,25878,26106,26335,26565,26796,27028,27261,27495,27730,27966,28203,28441,28680,28920,29161,29403,29646,29890,30135,30381,30628,30876,31125,31375,31626,31878,32131,32385,32640,32896,33153,33411,33670,33930,34191,34453,34716,34980,35245,35511,35778,36046,36315,36585,36856,37128,37401,37675,37950,38226,38503,38781,39060,39340,39621,39903,40186,40470,40755,41041,41328,41616,41905,42195,42486,42778,43071,43365,43660,43956,44253,44551,44850,45150,45451,45753,46056,46360,46665,46971,47278,47586,47895,48205,48516,48828,49141,49455,49770,50086,50403,50721,51040,51360,51681,52003,52326,52650,52975,53301,53628,53956,54285,54615,54946,55278,55611,55945,56280,56616,56953,57291,57630,57970,58311,58653,58996,59340,59685,60031,60378,60726,61075,61425,61776,62128,62481,62835,63190,63546,63903,64261,64620,64980,65341,65703,66066,66430,66795,67161,67528,67896,68265,68635,69006,69378,69751,70125,70500,70876,71253,71631,72010,72390,72771,73153,73536,73920,74305,74691,75078,75466,75855,76245,76636,77028,77421,77815,78210,78606,79003,79401,79800,80200,80601,81003,81406,81810,82215,82621,83028,83436,83845,84255,84666,85078,85491,85905,86320,86736,87153,87571,87990,88410,88831,89253,89676,90100,90525,90951,91378,91806,92235,92665,93096,93528,93961,94395,94830,95266,95703,96141,96580,97020,97461,97903,98346,98790,99235,99681,100128,100576,101025,101475,101926,102378,102831,103285,103740,104196,104653,105111,105570,106030,106491,106953,107416,107880,108345,108811,109278,109746,110215,110685,111156,111628,112101,112575,113050,113526,114003,114481,114960,115440,115921,116403,116886,117370,117855,118341,118828,119316,119805,120295,120786,121278,121771,122265,122760,123256,123753,124251,124750,125250,125751,126253,126756,127260,127765,128271,128778,129286,129795,130305,130816,131328,131841,132355,132870,133386,133903,134421,134940,135460,135981,136503,137026,137550,138075,138601,139128,139656,140185,140715,141246,141778,142311,142845,143380,143916,144453,144991,145530,146070,146611,147153,147696,148240,148785,149331,149878,150426,150975,151525,152076,152628,153181,153735,154290,154846,155403,155961,156520,157080,157641,158203,158766,159330,159895,160461,161028,161596,162165,162735,163306,163878,164451,165025,165600,166176,166753,167331,167910,168490,169071,169653,170236,170820,171405,171991,172578,173166,173755,174345,174936,175528,176121,176715,177310,177906,178503,179101,179700,180300,180901,181503,182106,182710,183315,183921,184528,185136,185745,186355,186966,187578,188191,188805,189420,190036,190653,191271,191890,192510,193131,193753,194376,195000,195625,196251,196878,197506,198135,198765,199396,200028,200661,201295,201930,202566,203203,203841,204480,205120,205761,206403,207046,207690,208335,208981,209628,210276,210925,211575,212226,212878,213531,214185,214840,215496,216153,216811,217470,218130,218791,219453,220116,220780,221445,222111,222778,223446,224115,224785,225456,226128,226801,227475,228150,228826,229503,230181,230860,231540,232221,232903,233586,234270,234955,235641,236328,237016,237705,238395,239086,239778,240471,241165,241860,242556,243253,243951,244650,245350,246051,246753,247456,248160,248865,249571,250278,250986,251695,252405,253116,253828,254541,255255,255970,256686,257403,258121,258840,259560,260281,261003,261726,262450,263175,263901,264628,265356,266085,266815,267546,268278,269011,269745,270480,271216,271953,272691,273430,274170,274911,275653,276396,277140,277885,278631,279378,280126,280875,281625,282376,283128,283881,284635,285390,286146,286903,287661,288420,289180,289941,290703,291466,292230,292995,293761,294528,295296,296065,296835,297606,298378,299151,299925,300700,301476,302253,303031,303810,304590,305371,306153,306936,307720,308505,309291,310078,310866,311655,312445,313236,314028,314821,315615,316410,317206,318003,318801,319600,320400,321201,322003,322806,323610,324415,325221,326028,326836,327645,328455,329266,330078,330891,331705,332520,333336,334153,334971,335790,336610,337431,338253,339076,339900,340725,341551,342378,343206,344035,344865,345696,346528,347361,348195,349030,349866,350703,351541,352380,353220,354061,354903,355746,356590,357435,358281,359128,359976,360825,361675,362526,363378,364231,365085,365940,366796,367653,368511,369370,370230,371091,371953,372816,373680,374545,375411,376278,377146,378015,378885,379756,380628,381501,382375,383250,384126,385003,385881,386760,387640,388521,389403,390286,391170,392055,392941,393828,394716,395605,396495,397386,398278,399171,400065,400960,401856,402753,403651,404550,405450,406351,407253,408156,409060,409965,410871,411778,412686,413595,414505,415416,416328,417241,418155,419070,419986,420903,421821,422740,423660,424581,425503,426426,427350,428275,429201,430128,431056,431985,432915,433846,434778,435711,436645,437580,438516,439453,440391,441330,442270,443211,444153,445096,446040,446985,447931,448878,449826,450775,451725,452676,453628,454581,455535,456490,457446,458403,459361,460320,461280,462241,463203,464166,465130,466095,467061,468028,468996,469965,470935,471906,472878,473851,474825,475800,476776,477753,478731,479710,480690,481671,482653,483636,484620,485605,486591,487578,488566,489555,490545,491536,492528,493521,494515,495510,496506,497503,498501,499500]\n\ndef ajc(l):\n l+=1\n global jc\n while len(jc)<l:\n jc.append(len(jc)*(len(jc)-1)//2)\n\n\nA={}\nB={}\nC={}\nt=int(input())\nif t==1:\n print(0)\nelse:\n for ti in range(t):\n a,b=(int(i) for i in input().split(\" \"))\n if (a,b) not in C:\n C[(a,b)]=1\n else:\n C[(a,b)]+=1\n if a not in A:\n A[a]=1\n else:\n A[a]+=1\n if b not in B:\n B[b]=1\n else:\n B[b]+=1\n\n ans=0\n for k,v in A.items():\n ajc(v)\n ans+=jc[v]\n for k,v in B.items():\n ajc(v)\n ans+=jc[v]\n for k,v in C.items():\n ajc(v)\n ans-=jc[v]\n print(ans)\n\t \t\t \t \t\t \t \t\t\t\t \t\t\t \t \t", "import os,io\nimport sys\nimport collections\n\ndef sum1N(n):\n return n*(n-1)//2\n\nn = int(sys.stdin.readline().strip())\nxmap = collections.defaultdict(int)\nymap = collections.defaultdict(int)\ncnt = 0\n\n\nseen = {}\nfor i in range(n):\n xi, yi = list(map(int, sys.stdin.readline().strip().split(\" \")))\n if (xi, yi) in seen:\n seen[(xi, yi)] += 1\n else:\n seen[(xi, yi)] = 1\n xmap[xi] += 1\n ymap[yi] += 1\n\ntotal = 0\n\n\nfor k, v in xmap.items():\n total += sum1N(v)\n\n\nfor k, v in ymap.items():\n total += sum1N(v)\n\nfor k, v in seen.items():\n total -= sum1N(v)\n\nprint(total)\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nans = 0\r\nmp1 = defaultdict(int)\r\nmp2 = defaultdict(int)\r\nmp = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n ans += mp1[x]\r\n ans += mp2[y]\r\n ans -= mp[(x, y)]\r\n mp1[x] += 1\r\n mp2[y] += 1\r\n mp[(x, y)] += 1\r\n\r\nprint(ans)\r\n", "import random, math, sys\nfrom copy import deepcopy as dc\nfrom bisect import bisect_left, bisect_right\nfrom collections import Counter\n\ninput = sys.stdin.readline\n\n# Function to call the actual solution\ndef solution(li):\n\tx = {}; y = {}; xy = {}; c = 0\n\tfor i in li:\n\t\txc = x.get(i[0], 0)\n\t\tyc = y.get(i[1], 0)\n\t\txyc = xy.get(tuple(i), 0)\n\t\tc += xc + yc - xyc\n\t\tx[i[0]] = x.get(i[0], 0) + 1\n\t\ty[i[1]] = y.get(i[1], 0) + 1\n\t\txy[tuple(i)] = xy.get(tuple(i), 0) + 1\n\treturn c\n\n\n\n# Function to take input\ndef input_test():\n\t# n = int(input())\n\tli1 = []\n\tfor _ in range(int(input())):\n\t\t# x, y = map(int, input().strip().split(\" \"))\n\t\t# a, b, c = map(int, input().strip().split(\" \"))\n\t\tli = list(map(int, input().strip().split(\" \")))\n\t\tli1.append(li)\n\tout = solution(li1)\n\tprint(out)\n\n# Function to test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "from collections import Counter\r\nfrom math import comb\r\nfrom os import path\r\nfrom random import getrandbits\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\nRANDOM = getrandbits(32)\r\n\r\n\r\nclass Int(int):\r\n def __hash__(self):\r\n return super().__hash__() ^ RANDOM\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n a, b, c = Counter(), Counter(), Counter()\r\n for i in range(n):\r\n x, y = [Int(num) for num in input().split()]\r\n a[x] += 1\r\n b[y] += 1\r\n c[(x, y)] += 1\r\n ans = 0\r\n for v in a.values():\r\n ans += comb(v, 2)\r\n for v in b.values():\r\n ans += comb(v, 2)\r\n for v in c.values():\r\n ans -= comb(v, 2)\r\n print(ans)\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", "from math import comb\r\nfrom collections import Counter\r\n\r\ngraph = [tuple(map(int, input().split())) for _ in range(int(input()))]\r\n\r\ngraph_x = list(map(lambda x: x[0], graph))\r\ngraph_y = list(map(lambda x: x[1], graph))\r\n\r\ngraph_x.sort()\r\ngraph_y.sort()\r\n\r\ncx = sum(map(lambda val: comb(val, 2), Counter(graph_x).values()))\r\ncy = sum(map(lambda val: comb(val, 2), Counter(graph_y).values()))\r\ndp = sum(map(lambda val: comb(val, 2), Counter(graph).values()))\r\n\r\nprint(cx + cy - dp)\r\n", "\r\n\r\n#start the code from here\r\nt=int(input())\r\nl=[]\r\nans=0\r\nadic=dict()\r\nbdict=dict()\r\nabdict=dict()\r\n# print(abdict)\r\nfor i in range(t):\r\n\ta,b=map(int,input().split())\r\n\th=0\r\n\taac=0\r\n\tbbc=0\r\n\tabc=0\r\n\tif a in adic:\r\n\t\tans+=adic[a]\r\n\t\taac=1\r\n\tif b in bdict:\r\n\t\tans+=bdict[b]\r\n\t\tbbc=1\r\n\tif (a,b) in abdict:\r\n\t\tabc=1\r\n\t\tans-=abdict[(a,b)]\r\n\tif aac==1:\r\n\t\tadic[a]+=1\r\n\telse:\r\n\t\tadic[a]=1\r\n\tif bbc==1:\r\n\t\tbdict[b]+=1\r\n\telse:\r\n\t\tbdict[b]=1\r\n\tif abc==1:\r\n\t\tabdict[(a,b)]+=1\r\n\telse:\r\n\t\tabdict[(a,b)]=1\r\n\t\r\nprint(ans)", "import math\r\n\r\nn = int(input())\r\n\r\nwatchmen = []\r\n\r\nfor i in range(n):\r\n\r\n x, y = map(int, input().split())\r\n\r\n watchmen.append([x, y])\r\n\r\nxs = {}\r\nys = {}\r\n\r\niden_pts = {}\r\n\r\nfor i in watchmen:\r\n\r\n xs[i[0]] = xs.get(i[0], 0) + 1\r\n ys[i[1]] = ys.get(i[1], 0) + 1\r\n\r\n iden_pts[(i[0], i[1])] = iden_pts.get((i[0], i[1]), 0) + 1\r\n\r\nans = 0\r\n\r\nfor i in xs.keys():\r\n\r\n ans += xs[i] * (xs[i] - 1) // 2\r\n\r\nfor i in ys.keys():\r\n\r\n ans += ys[i] * (ys[i] - 1) // 2\r\n\r\nfor i in iden_pts.keys():\r\n\r\n ans -= iden_pts[i] * (iden_pts[i] - 1) // 2\r\n\r\nprint(ans)\r\n", "from collections import *\r\nC = Counter\r\nj = 0\r\ncx = C()\r\ncy = C()\r\np = C()\r\nn = int(input())\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n j += cx[x] + cy[y] - p[(x, y)]\r\n cx[x] += 1\r\n cy[y] += 1\r\n p[(x, y)] += 1\r\nprint(j)", "from collections import Counter\r\n\r\ncounterX, counterY, counterXY = Counter(), Counter(), Counter()\r\nans = 0\r\n\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n ans += counterX[x] + counterY[y] - counterXY[(x, y)]\r\n counterX[x] += 1\r\n counterY[y] += 1\r\n counterXY[(x, y)] += 1\r\nprint(ans)", "x={}\r\ny={}\r\nd={}\r\nans=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a in x:\r\n x[a]+=1\r\n else:\r\n x[a]=1\r\n if b in y:\r\n y[b]+=1\r\n else:\r\n y[b]=1\r\n if (a,b) in d:\r\n d[(a,b)]+=1\r\n else:\r\n d[(a,b)]=1\r\nx=list(x.values())\r\ny=list(y.values())\r\nd=list(d.values())\r\nfor i in x:\r\n ans+=(i*(i-1))//2\r\nfor i in y:\r\n ans+=(i*(i-1))//2\r\nfor i in d:\r\n ans-=(i*(i-1))//2\r\nprint(ans)", "n=int(input())\r\ndx={}\r\ndy={}\r\nd={}\r\nfor i in range(0,n):\r\n [x,y]=[int(j) for j in input().split()]\r\n if dx.get(x)==None:\r\n dx[x]=1\r\n else:\r\n dx[x]+=1\r\n if dy.get(y)==None:\r\n dy[y]=1\r\n else:\r\n dy[y]+=1\r\n if d.get((x,y))==None:\r\n d[(x,y)]=1\r\n else:\r\n d[(x,y)]+=1\r\nc=0\r\nfor i in dx.keys():\r\n if dx[i]>1:\r\n c+=(dx[i]*(dx[i]-1))//2\r\nfor i in dy.keys():\r\n if dy[i]>1:\r\n c+=(dy[i]*(dy[i]-1))//2\r\nfor i in d.keys():\r\n if d[i]>1:\r\n c-=(d[i]*(d[i]-1))//2\r\nprint(c)\r\n", "\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nd = {}\r\nx = {}\r\ny = {}\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if a in x:\r\n x[a] += 1\r\n elif a not in x:\r\n x[a] = 1\r\n \r\n if b in y:\r\n y[b] += 1\r\n elif b not in y:\r\n y[b] = 1\r\n \r\n if (a,b) not in d:\r\n d[(a,b)] = 1\r\n elif (a,b) in d:\r\n d[(a,b)] += 1\r\n \r\nc = 0\r\nfor i in x:\r\n c += (x[i]*(x[i]-1)//2)\r\nfor i in y:\r\n c += (y[i]*(y[i]-1)//2)\r\nfor i in d:\r\n c -= (d[i]*(d[i]-1)//2)\r\nprint(c)", "from collections import Counter\nimport sys\nfin = sys.stdin\n\n\ndef solve(points):\n x = Counter([x for x, y in points])\n y = Counter([y for x, y in points])\n x_y = Counter(points)\n # print(x)\n # print(y)\n # print(x_y)\n s = (\n sum([count * (count - 1) // 2 for count in x.values()])\n + sum([count * (count - 1) // 2 for count in y.values()])\n - sum([count * (count - 1) // 2 for count in x_y.values()])\n )\n\n return s\n\n\nn = int(fin.readline())\npoints = [\n tuple(map(int, fin.readline().split()))\n for _ in range(n)\n]\nprint(solve(points))\n", "from math import *\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nli1 = {}; li2 = {}; li3 = {}\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n li1[x] = li1.get(x, 0) + 1\r\n li2[y] = li2.get(y, 0) + 1\r\n li3[(x, y)] = li3.get((x, y), 0) + 1\r\nsum = 0\r\nfor x in [*li1.values()] + [*li2.values()]:\r\n sum += (x*(x-1))//2\r\nfor x in [*li3.values()]:\r\n sum -= (x*(x-1))//2\r\nprint(sum)", "from collections import Counter\r\n\r\n\r\ncx = Counter([])\r\ncy = Counter([])\r\ncxy = Counter([])\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n cx[x] += 1\r\n cy[y] += 1\r\n cxy[(x, y)] += 1\r\n\r\nc = 0\r\nfor i in cx.values():\r\n if i > 1:\r\n c += (i*(i-1))//2\r\nfor i in cy.values():\r\n if i > 1:\r\n c += (i*(i-1))//2\r\nfor i in cxy.values():\r\n if i > 1:\r\n c -= (i*(i-1))//2\r\n\r\nprint(c)\r\n", "from sys import stdin, stdout\n\ndef fin(): return stdin.readline().strip()\ndef fout(x): stdout.write(str(x) + '\\n')\n\nn = int(fin())\narr = []\nfor _ in range(n): arr.append(tuple(map(int, fin().split())))\narrMap = {}\nxMap = {}\nyMap = {}\nres = 0\nfor pair in arr: xMap[pair[0]], yMap[pair[1]], arrMap[pair] = xMap.get(pair[0], 0) + 1, yMap.get(pair[1], 0) + 1, arrMap.get(pair, 0) + 1\nfor x in xMap: res += ((xMap[x])*(xMap[x] - 1)) // 2\nfor y in yMap: res += ((yMap[y])*(yMap[y] - 1)) // 2\nfor d in arrMap: res -= ((arrMap[d])*(arrMap[d] - 1)) // 2\n\nfout(res)", "#!/usr/bin/python3\nfrom collections import Counter\nfrom functools import reduce\n\nn = int(input())\nx = Counter()\ny = Counter()\npoints = Counter()\nfor i in range(n):\n point = list(map(int, input().split()))\n x[point[0]] += 1\n y[point[1]] += 1\n points[(point[0], point[1])] += 1\n \ndef getPairsNumber(n):\n return n * (n-1) // 2\n\ndef getCounterPairsNumber(counter):\n return reduce(lambda s, n: s + getPairsNumber(n), counter.values(), 0)\n\ns = getCounterPairsNumber(x) + getCounterPairsNumber(y) - getCounterPairsNumber(points)\nprint(s)\n", "import collections\nr=0;a,b,c=[collections.Counter() for _ in [0,0,0]]\nfor _ in range(int(input())):\n\tx,y=map(int, input().split())\n\tr+=a[x]+b[y]-c[(x,y)]\n\ta[x]+=1;b[y]+=1;c[(x,y)]+=1\nprint(r)\n", "N = int(input())\ndx = {}\ndy = {}\nd = {}\nans = 0\nfor i in range(N):\n x, y = map(int, input().split())\n ans += dx.get(x, 0)\n ans += dy.get(y, 0)\n ans -= d.get((x, y), 0)\n\n dx[x] = dx.get(x, 0) + 1\n dy[y] = dy.get(y, 0) + 1\n d[(x, y)] = d.get((x, y), 0) + 1\n\nprint(ans)\n", "n = int(input())\r\ncount = 0\r\ndicx = {}\r\ndicy = {}\r\ndic = {}\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x not in dicx:\r\n dicx[x] = 1\r\n else:\r\n dicx[x] += 1\r\n if y not in dicy:\r\n dicy[y] = 1\r\n else:\r\n dicy[y] += 1\r\n if (x,y) not in dic:\r\n dic[(x,y)] = 1\r\n else:\r\n dic[(x,y)] += 1\r\nfor i in dicx:\r\n if dicx[i]!=1:\r\n count += (dicx[i]*(dicx[i]-1))//2\r\nfor i in dicy:\r\n if dicy[i]!=1:\r\n count += (dicy[i]*(dicy[i]-1))//2\r\nfor i in dic:\r\n if dic[i]!=1:\r\n count -= (dic[i]*(dic[i]-1))//2\r\nprint(count)\r\n", "n=int(input())\r\na={}\r\nb={}\r\nc={}\r\nk=0\r\nfor i in range(n) :\r\n x,y=map(int,input().split())\r\n n=a.get(x,0)\r\n v=b.get(y,0)\r\n z=c.get((x,y),0)\r\n \r\n k=k+n+v-z\r\n a[x]=n+1\r\n b[y]=v+1\r\n c[x,y]=z+1\r\nprint(k)\r\n \r\n", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n dx={}\r\n dy={}\r\n repeat={}\r\n ans=0\r\n for i in range(n):\r\n p,q=map(int,input().split())\r\n ans+=dx.get(p,0)+dy.get(q,0)-repeat.get((p,q),0)\r\n if dx.get(p,0):\r\n dx[p]+=1\r\n else:\r\n dx[p]=1\r\n if dy.get(q,0):\r\n dy[q]+=1\r\n else:\r\n dy[q]=1\r\n if repeat.get((p,q),0):\r\n repeat[(p,q)]+=1\r\n else:\r\n repeat[(p,q)]=1\r\n print(ans)\r\n\r\nobj=solve()", "from collections import Counter\n\n\ndef watchmen(n, W):\n X = Counter(w[0] for w in W)\n Y = Counter(w[1] for w in W)\n C = Counter(W)\n\n t = 0\n for x, c in X.items():\n t += c * (c-1) // 2\n for y, c in Y.items():\n t += c * (c-1) // 2\n for p, c in C.items():\n t -= c * (c-1) // 2\n return t\n\n\ndef main():\n n = readint()\n W = readinttl(n)\n print(watchmen(n, W))\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 readintl():\n return list(readinti())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef readinttl(k):\n return [readintt() 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 = int(input())\r\nx_map = {}\r\ny_map = {}\r\npoints = {}\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n points[(x,y)] = points.get((x,y),0)+1\r\n x_map[x] = x_map.get(x,0) + 1\r\n y_map[y] = y_map.get(y,0) + 1\r\nans = 0\r\nfor key,val in x_map.items():\r\n ans+=(val*(val-1))//2\r\nfor key,val in y_map.items():\r\n ans+=(val*(val-1))//2\r\nfor point,val in points.items():\r\n ans-=(val*(val-1))//2\r\nprint(ans)\r\n", "'''\r\nCreated on Apr 30, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn = int(input())\r\nx2 = {}\r\ny2 = {}\r\nwatchMen = {}\r\nfor i in range(n):\r\n watchman = tuple(map(int,input().split()))\r\n watchMen[watchman] = watchMen.get(watchman,0)+1\r\n #print(watchMen[watchman])\r\n x2[watchman[0]] = x2.get(watchman[0],0)+1\r\n #print(x2[watchman[0]])\r\n y2[watchman[1]] = y2.get(watchman[1],0)+1\r\npairs = 0\r\nfor i in watchMen.items():\r\n pairs -= i[1]*(i[1] - 1)//2\r\nfor i in x2.items():\r\n pairs += i[1]*(i[1] - 1)//2\r\nfor i in y2.items():\r\n pairs += i[1]*(i[1] - 1)//2\r\nprint(pairs) ", "from collections import *\n\nans=0\ncx=Counter()\ncy=Counter()\ncp=Counter()\nn=int(input())\nfor i in range(n):\n x,y=map(int,input().split())\n ans+=cx[x]+cy[y]-cp[(x,y)]\n cx[x]+=1\n cy[y]+=1\n cp[(x,y)]+=1\nprint(ans)", "def add(dic, v):\r\n if v not in dic:\r\n dic[v] = 1\r\n else:\r\n dic[v] += 1\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n s = tuple(map(int, input().split(' ')))\r\n a.append(s)\r\nans = 0\r\ndver = dict()\r\ndhor = dict()\r\ndeq = dict()\r\nfor i in range(n):\r\n add(dver, a[i][0])\r\n add(dhor, a[i][1])\r\n add(deq, a[i])\r\n\r\nfor x in dver.keys():\r\n ans += (dver[x] * (dver[x]-1)) // 2\r\nfor x in dhor.keys():\r\n ans += (dhor[x] * (dhor[x]-1)) // 2\r\nfor x in deq.keys():\r\n ans -= (deq[x] * (deq[x] - 1)) // 2\r\nprint(ans)", "z,zz=input,lambda:list(map(int,z().split()))\r\nfast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom string import *\r\nfrom re import *\r\nfrom collections import *\r\nfrom queue import *\r\nfrom sys import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom collections import Counter as cc\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom bisect import bisect_left as bsl\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef prime(x):\r\n p=ceil(x**.5)+1\r\n for i in range(2,p):\r\n if (x%i==0 and x!=2) or x==0:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=1\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\n\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\n\r\nnum=int(fast());ans=0\r\nlst_x={};lst_y={};lst_xy={}\r\nres1=0;res2=0;res3=0\r\nfor i in range( num ):\r\n x,y=zzz()\r\n try:lst_xy[(x,y)]\r\n except:lst_xy[(x,y)]=0;res3+=1\r\n try:lst_y[y]\r\n except:lst_y[y]=0;res2+=1\r\n try:lst_x[x]\r\n except:lst_x[x]=0;res1+=1\r\n lst_x[x]+=1;lst_y[y]+=1;lst_xy[(x,y)]+=1\r\nlst1=list(lst_x.values())\r\nlst2=list(lst_y.values())\r\nlst3=list(lst_xy.values())\r\nfor i in range(max(res1,res2,res3)):\r\n if i<res1:ans+=(lst1[i]*(lst1[i]-1))//2\r\n if i<res2:ans+=(lst2[i]*(lst2[i]-1))//2\r\n if i<res3:ans-=(lst3[i]*(lst3[i]-1))//2\r\nprint(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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nn = int(input())\nx = defaultdict(int)\ny = defaultdict(int)\nxy = defaultdict(int)\nc = 0\nfor i in range(n):\n xi, yi = map(int, input().split())\n c += x[xi] + y[yi] - xy[(xi, yi)]\n x[xi] += 1\n y[yi] += 1\n xy[(xi, yi)] += 1\n\nprint(c)\n", "from collections import*\r\nn=int(input())\r\nk=[tuple(map(int,input().split())) for i in range(n)]\r\na=Counter()\r\nb=Counter()\r\nc=Counter()\r\nans=0\r\nfor i in k:\r\n x,y=i\r\n ans+=a[x]+b[y]-c[(x,y)]\r\n a[x]+=1\r\n b[y]+=1\r\n c[(x,y)]+=1\r\nprint(ans)", "n = int(input())\n\nfx, fy = {}, {}\nf = {}\n\nfor i in range(n):\n x, y = map(int, input().split())\n fx[x] = fx.get(x, 0) + 1\n fy[y] = fy.get(y, 0) + 1\n pt = (x, y)\n f[pt] = f.get(pt, 0) + 1\n\nres = 0\n\nfor k, v in fx.items():\n res += v * (v - 1) // 2\nfor k, v in fy.items():\n res += v * (v - 1) // 2\n\nfor k, v in f.items():\n res -= v * (v - 1) // 2\n\nprint(res)\n", "#!/usr/bin/env python\r\n\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n # Read in the value of n\r\n n = int(input())\r\n\r\n # Initialize variables\r\n ans = 0\r\n X = defaultdict(int)\r\n Y = defaultdict(int)\r\n XY = defaultdict(int)\r\n\r\n # Read in n pairs of coordinates and update the dictionaries\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n ans += X[x] + Y[y] - XY[(x, y)]\r\n X[x] += 1\r\n Y[y] += 1\r\n XY[(x, y)] += 1\r\n\r\n # Print the final value of ans\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import defaultdict as dc\r\nx=int(input())\r\ndx=dc(lambda:0)\r\ndy=dc(lambda:0)\r\ndxy=dc(lambda:0)\r\n\r\nfor n in range(x):\r\n a,b=map(int,input().split())\r\n dx[a]+=1\r\n dy[b]+=1\r\n dxy[(a,b)]+=1\r\n\r\nres=0\r\nfor n in dx:\r\n res+=int(dx[n]!=1)*(dx[n]*(dx[n]-1)//2)\r\n\r\nfor n in dy:\r\n res+=int(dy[n]!=1)*(dy[n]*(dy[n]-1)//2)\r\n\r\nfor n in dxy:\r\n res-=int(dxy[n]!=1)*(dxy[n]*(dxy[n]-1)//2)\r\n\r\nprint(res)", "n = int(input())\r\nx2pts = {}\r\ny2pts = {}\r\nwatchmen = {}\r\nfor i in range(n):\r\n watchman = tuple(map(int,input().split()))\r\n watchmen[watchman] = watchmen.get(watchman,0)+1\r\n x2pts[watchman[0]] = x2pts.get(watchman[0],0)+1\r\n y2pts[watchman[1]] = y2pts.get(watchman[1],0)+1\r\npairs = 0\r\nfor i in watchmen.items():\r\n pairs -= i[1]*(i[1]-1)//2\r\nfor i in x2pts.items():\r\n pairs += i[1]*(i[1]-1)//2\r\nfor i in y2pts.items():\r\n pairs += i[1]*(i[1]-1)//2\r\nprint(pairs)\r\n", "import math\r\nimport random \r\nfrom queue import Queue\r\n\r\n \r\ndef main(arr):\r\n\r\n x_val={}\r\n y_val={}\r\n same_val={}\r\n for i in range(len(arr)):\r\n x,y=arr[i] \r\n if x not in x_val:\r\n x_val[x]=0\r\n if y not in y_val:\r\n y_val[y]=0 \r\n if (x,y) not in same_val:\r\n same_val[(x,y)]=0\r\n y_val[y]+=1\r\n x_val[x]+=1\r\n same_val[(x,y)]+=1\r\n ans=0\r\n for e in arr:\r\n x,y=e \r\n \r\n ans+=x_val[x]+y_val[y]-same_val[(x,y)]-1\r\n x_val[x]-=1 \r\n y_val[y]-=1 \r\n same_val[(x,y)]-=1\r\n\r\n return ans \r\n\r\narr=[] \r\nn=int(input()) \r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nprint(main(arr))\r\n\r\n", "n = int(input())\r\np = []\r\n\r\nfor i in range(n):\r\n p.append(list(map(int, input().split())))\r\n \r\n \r\np.sort()\r\n\r\nans = 0 \r\ncx, cy, ce = 1, 1, 1 \r\nfor i in range(1, n):\r\n if(p[i][0] == p[i - 1][0]):\r\n cx += 1 \r\n else:\r\n ans += cx * (cx - 1) // 2 \r\n cx = 1\r\n \r\nans += cx * (cx - 1) // 2 \r\n\r\nfor i in range(1, n):\r\n \r\n if(p[i][0] == p[i - 1][0] and p[i][1] == p[i - 1][1]):\r\n ce += 1 \r\n else:\r\n ans -= ce * (ce - 1) // 2 \r\n ce = 1\r\n \r\n\r\nans -= ce * (ce - 1) // 2 \r\n\r\np.sort(key = lambda x : x[1])\r\n\r\nfor i in range(1, n):\r\n \r\n if(p[i][1] == p[i - 1][1]):\r\n cy += 1 \r\n else:\r\n ans += cy * (cy - 1) // 2 \r\n cy = 1\r\n \r\nans += cy * (cy - 1) // 2\r\n\r\n\r\n \r\nprint(ans)", "\"\"\" import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w') \"\"\"\r\nq = {}\r\nw = {}\r\ne = {}\r\nr = 0\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n a, s, d = q.get(x, 0), w.get(y, 0), e.get((x, y), 0)\r\n r += a + s - d\r\n q[x], w[y], e[x, y] = a + 1, s + 1, d + 1\r\nprint(r)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nxCnt = defaultdict(int)\r\nyCnt = defaultdict(int)\r\nsame = defaultdict(int)\r\nfor x, y in a:\r\n xCnt[x] += 1\r\n yCnt[y] += 1\r\n same[(x, y)] += 1\r\nret = 0\r\nfor cnt in xCnt.values():\r\n ret += cnt * (cnt - 1) // 2\r\nfor cnt in yCnt.values():\r\n ret += cnt * (cnt - 1) // 2\r\nfor cnt in same.values():\r\n ret -= cnt * (cnt - 1) // 2\r\nprint(ret)", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n lx = {}\r\n ly = {}\r\n lp = {}\r\n ans = 0\r\n for _ in range(n):\r\n x, y = map(int, stdin.readline().split())\r\n if x in lx:\r\n ans += lx[x]\r\n lx[x] += 1\r\n else:\r\n lx[x] = 1\r\n if y in ly:\r\n ans += ly[y]\r\n ly[y] += 1\r\n else:\r\n ly[y] = 1\r\n if (x, y) in lp:\r\n ans -= lp[(x, y)]\r\n lp[(x, y)] += 1\r\n else:\r\n lp[(x, y)] = 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\n\nxi = {}\nyi = {}\nrep = {}\n\nfor i in range(n):\n x, y = input().split()\n try:\n xi[x]+=1\n except KeyError:\n xi[x]=1\n \n try:\n yi[y] += 1\n except KeyError:\n yi[y] = 1\n\n try:\n rep[f'{x},{y}'] += 1\n except KeyError:\n rep[f'{x},{y}'] = 1\n\ndef nc2(n):\n return n*(n-1)/2\nrepval = 0\nans = 0\nfor i in xi.keys():\n ans += nc2(xi[i])\nfor i in yi.keys():\n ans += nc2(yi[i])\nfor i in rep.keys():\n repval += nc2(rep[i])\n\nans = ans - repval\nprint(int(ans))", "n=int(input())\r\nx=[]\r\na=[]\r\nfor i in range(0,n):\r\n x=list(map(int,input().split()))\r\n a.append(x)\r\nc=0\r\nl={}\r\nr={}\r\nm={}\r\nfor i in range(0,n):\r\n s=str(a[i][0])+str(a[i][1])\r\n if(s in m):\r\n m[s]+=1\r\n else:\r\n m[s]=1\r\n if(a[i][0] in l):\r\n l[a[i][0]]+=1\r\n else:\r\n l[a[i][0]]=1\r\n if(a[i][1] in r):\r\n r[a[i][1]]+=1\r\n else:\r\n r[a[i][1]]=1\r\nls=0\r\nrs=0\r\nms=0\r\nfor i in l:\r\n t=int(l[i]*(l[i]-1)/2)\r\n ls+=t\r\nfor i in r:\r\n t=int(r[i]*(r[i]-1)/2)\r\n rs+=t\r\nfor i in m:\r\n t=int(m[i]*(m[i]-1)/2)\r\n ms+=t\r\nans=ls+rs-ms\r\nprint(ans)", "from collections import defaultdict\nimport sys\nfrom math import gcd, sqrt\nfrom typing import Counter, DefaultDict\n\nsys.setrecursionlimit(10 ** 5)\n\n\ninf = float(\"inf\")\nen = lambda x: list(enumerate(x))\n\nii = lambda: int(input())\nr = lambda: map(int, input().split())\nrr = lambda: list(r())\n\n\nn = ii()\nx = [rr() for _ in range(n)]\narr = defaultdict(lambda: 0)\nbrr = defaultdict(lambda: 0)\ncrr = defaultdict(lambda: 0)\n\nans = 0\nfor i, j in x:\n ans += arr[i] + brr[j] - crr[(i, j)]\n arr[i] += 1\n brr[j] += 1\n crr[(i, j)] += 1\n\nprint(ans)", "num = int(input())\nnum_same = 0\nsame_x = {}\nsame_y = {}\nsame = {}\nfor _ in range(num):\n str_pos = input().split(\" \")\n pos = (int(str_pos[0]), int(str_pos[1]))\n if pos[0] in same_x:\n num_same += same_x[pos[0]]\n same_x[pos[0]] += 1\n else:\n same_x[pos[0]] = 1\n if pos[1] in same_y:\n num_same += same_y[pos[1]]\n same_y[pos[1]] += 1\n else:\n same_y[pos[1]] = 1\n if pos in same:\n num_same -= same[pos]\n same[pos] += 1\n else:\n same[pos] = 1\nprint(num_same)\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\r\nmx = {}\r\nmy = {}\r\nmxy = {}\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n\r\n mx[x] = mx.get(x, 0) + 1\r\n my[y] = my.get(y, 0) + 1\r\n mxy[(x, y)] = mxy.get((x, y), 0) + 1\r\n\r\nans = 0\r\n\r\nfor k in mx.values():\r\n ans += (k * (k - 1)) // 2\r\n\r\nfor k in my.values():\r\n ans += (k * (k - 1)) // 2\r\n\r\nfor k in mxy.values():\r\n ans -= (k * (k - 1)) // 2\r\n\r\nprint(ans)\r\n\r\n", "q={}\r\nw={}\r\ne={}\r\nr=0\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n a,s,d=q.get(x,0),w.get(y,0),e.get((x,y),0)\r\n r+=a+s-d\r\n q[x],w[y],e[x,y]=a+1,s+1,d+1\r\nprint(r)\r\n", "n=int(input())\r\nx,y,z,a={},{},{},0\r\nfor i in range(n):\r\n q,w=map(int,input().split())\r\n x[q]=x[q]+1if q in x else 1\r\n y[w]=y[w]+1if w in y else 1\r\n p=str([q,w])\r\n z[p]=z[p]+1if p in z else 1\r\nfor i in x:o=x[i];a+=o*(o-1)//2\r\nfor i in y:o=y[i];a+=o*(o-1)//2\r\nfor i in z:o=z[i];a-=o*(o-1)//2\r\nprint(a)", "n = int(input());o = {}\r\nsame_x = {}\r\nsame_y = {}\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n\r\n\r\n if o.get((x, y)):o[x, y] += 1\r\n else:o[x, y] = 1\r\n if same_x.get(x):\r\n same_x[x] += 1\r\n else:\r\n same_x[x] = 1\r\n \r\n\r\n\r\n if same_y.get(y):\r\n same_y[y] += 1\r\n else:\r\n same_y[y] = 1\r\ntotal = 0\r\nfor key, value in same_x.items():\r\n\r\n\r\n\r\n\r\n value -= 1\r\n k = int(value*(value+1)/2)\r\n\r\n # k -= o[key]-1\r\n total += k\r\nfor key, value in same_y.items():\r\n\r\n\r\n\r\n\r\n value -= 1\r\n k = int(value*(value+1)/2)\r\n\r\n # k -= o[key]-1\r\n total += k\r\n\r\nfor key, value in o.items():\r\n value -= 1\r\n total -= int(value*(value+1)/2)\r\nprint(total)\r\n", "from collections import Counter\r\nn = int(input())\r\na, b = [], []\r\nfor i in range(n):\r\n ai, bi = [int(x) for x in input().split()]\r\n a.append(ai)\r\n b.append(bi)\r\nsum = 0\r\nfor k, v in dict(Counter(a)).items():\r\n if v > 1:\r\n sum += v*(v-1)//2\r\nfor k, v in dict(Counter(b)).items():\r\n if v > 1:\r\n sum += v*(v-1)//2\r\nr = [(x, y) for x, y in zip(a, b)]\r\nfor k, v in dict(Counter(r)).items():\r\n if v > 1:\r\n sum -= v*(v-1)//2\r\nprint(sum)", "from sys import stdin,stdout\r\nimport math\r\ninput = stdin.readline\r\ndef write(n,sep=\"\\n\"):\r\n\tstdout.write(str(n))\r\n\tstdout.write(sep)\r\ndef gil():\r\n\treturn list(map(int, input().split()))\r\n\t\r\ns = 0\r\nn = int(input())\r\np = []\r\nfrom collections import Counter as C\r\na = C()\r\nb = C()\r\nc = C()\r\nfor i in range(n):\r\n\tx,y = gil()\r\n\ts += a[x] + b[y] - c[(x,y)]\r\n\ta[x] += 1\r\n\tb[y] += 1\r\n\tc[(x,y)] += 1\r\nprint(s)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nmatches = {}\r\nmenr = {}\r\nmenl = {}\r\nhave = {}\r\nans = 0\r\nfor i in range(int(input())):\r\n l,r = map(int,input().split())\r\n lr = str(l)+str(r)\r\n if lr in matches:\r\n matches[lr]+=1\r\n else:\r\n matches[lr]=1\r\n if l in menl:\r\n menl[l]+=1\r\n else:\r\n menl[l]=1\r\n if r in menr:\r\n menr[r]+=1\r\n else:\r\n menr[r] = 1\r\n have[i]=[l,r] \r\nfor i in have:\r\n l,r = have[i][0],have[i][1]\r\n menl[l]-=1\r\n menr[r]-=1\r\n wait = menl[l]+menr[r]\r\n lr = str(l)+str(r)\r\n matches[lr]-=1\r\n wait-=matches[lr]\r\n ans+=wait\r\nprint(ans)", "a={}\r\nb={}\r\nc={}\r\ns=0\r\nn=int(input())\r\nfor i in range(n):\r\n l,m=map(int,input().split())\r\n if a.get(l)!=None:\r\n s+=a.get(l)\r\n if b.get(m)!=None:\r\n s+=b.get(m)\r\n if c.get((l,m))!=None:\r\n s-=c.get((l,m))\r\n a[l],b[m]=a.get(l,0)+1,b.get(m,0)+1\r\n c[l,m]=c.get((l,m),0)+1\r\nprint(s)", "a=[input().split() for _ in [0]*int(input())];count=0\r\nx=dict()\r\nfor i in a:\r\n try:x[i[0]]+=1\r\n except:x[i[0]]=1\r\nfor i in x.values():count+=i*(i-1)//2\r\nx=dict()\r\nfor i in a:\r\n try:x[i[1]]+=1\r\n except:x[i[1]]=1\r\nfor i in x.values():count+=i*(i-1)//2\r\nx=dict()\r\nfor i in a:\r\n m=' '.join(i)\r\n try:x[m]+=1\r\n except:x[m]=1\r\nfor i in x.values():count-=i*(i-1)//2\r\nprint(count)", "from collections import Counter\nn = int(input())\npoints = Counter([tuple(map(int, input().split(' '))) for i in range(n)])\n\nx, y = Counter([k for k, v in points.elements()]), Counter([v for k, v in points.elements()])\n\nans = sum([v*(v-1)//2 for k, v in x.items()])+sum([v*(v-1)//2 for k, v in y.items()])-sum([v*(v-1)//2 for k, v in points.items()])\nprint(ans)\n", "from sys import stdin, stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n x={}\r\n y={}\r\n mp={}\r\n for i in range(n):\r\n a,b=lst()\r\n x[a]=x.get(a,0)+1\r\n y[b]=y.get(b,0)+1\r\n mp[a,b]=mp.get((a,b),0)+1\r\n # print(x)\r\n # print(y)\r\n ans=sum((v*(v-1))//2 for k,v in x.items())\r\n ans+=sum((v*(v-1))//2 for k,v in y.items())\r\n for k,v in mp.items():\r\n ans-=(v*(v-1))//2\r\n print(ans)", "from collections import defaultdict, Counter\n\nn = int(input())\n\nw = []\nfor i in range(n):\n w.append(tuple(map(int, input().split())))\n\ndx = Counter()\ndy = Counter()\nfor x, y in w:\n dx[x] += 1\n dy[y] += 1\n\ncount = sum((v * (v-1) / 2) for v in dx.values()) + \\\n sum((v * (v-1) / 2) for v in dy.values())\n\ndc = Counter(w)\ncount -= sum((c * (c-1) / 2) for c in dc.values() if c > 1)\n\nprint(int(count))\n", "def count(t):\r\n return sum(v*(v-1)//2 for v in t.values())\r\na,b,c={},{},{}\r\nn=int(input())\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n a[x]=a.get(x,0)+1\r\n b[y]=b.get(y,0)+1\r\n c[(x,y)]=c.get((x,y),0)+1\r\nprint(count(a)+count(b)-count(c))", "l=[]\r\nlx,ly={},{}\r\ndic={}\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n l.append((x,y))\r\n if lx.get(x,0)==0:\r\n lx[x]=1\r\n else:\r\n lx[x]+=1\r\n if ly.get(y,0)==0:\r\n ly[y]=1\r\n else:\r\n ly[y]+=1\r\n if dic.get((x,y),0)==0:\r\n dic[(x,y)]=1\r\n else:\r\n dic[(x,y)]+=1\r\n#print(lx,\"\\n\",ly,\"\\n\",dic)\r\nans=0\r\nfor i in range(len(l)):\r\n x,y=l[i][0],l[i][1]\r\n lx[x]-=1\r\n ly[y]-=1\r\n c=lx[x]\r\n d=ly[y]\r\n ans+=c+d-dic[(x,y)]+1\r\n dic[(x,y)]-=1\r\n #print(x,y,ans)\r\nprint(ans)", "#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\ndef summa_maksonchik_top_potomu_chto_pishet_cod_na_scretche(n_maksonchik_top_potomu_chto_pishet_cod_na_scretche):\r\n ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche = 0\r\n while n_maksonchik_top_potomu_chto_pishet_cod_na_scretche > 0:\r\n ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche += n_maksonchik_top_potomu_chto_pishet_cod_na_scretche\r\n n_maksonchik_top_potomu_chto_pishet_cod_na_scretche -= 1\r\n return ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche \r\nimport sys\r\nn_maksonchik_top_potomu_chto_pishet_cod_na_scretche = int(sys.stdin.readline())\r\na_maksonchik_top_potomu_chto_pishet_cod_na_scretche = []\r\nans_maksonchik_top_potomu_chto_pishet_cod_na_scretche = 0\r\nfor i_maksonchik_top_potomu_chto_pishet_cod_na_scretche in range(n_maksonchik_top_potomu_chto_pishet_cod_na_scretche):\r\n a_maksonchik_top_potomu_chto_pishet_cod_na_scretche.append(tuple(map(int, sys.stdin.readline().split())))\r\nb_maksonchik_top_potomu_chto_pishet_cod_na_scretche = {}\r\nx_maksonchik_top_potomu_chto_pishet_cod_na_scretche = {} \r\nfor i_maksonchik_top_potomu_chto_pishet_cod_na_scretche in a_maksonchik_top_potomu_chto_pishet_cod_na_scretche:\r\n if i_maksonchik_top_potomu_chto_pishet_cod_na_scretche [0] not in x_maksonchik_top_potomu_chto_pishet_cod_na_scretche :\r\n x_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[0]] = [1, 0]\r\n b_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche] = 1\r\n else:\r\n if i_maksonchik_top_potomu_chto_pishet_cod_na_scretche not in b_maksonchik_top_potomu_chto_pishet_cod_na_scretche:\r\n b_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche] = 1\r\n else:\r\n b_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche] += 1\r\n x_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[0]][0] += 1\r\n x_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[0]][1] += x_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[0]][0]-1\r\nfor i_maksonchik_top_potomu_chto_pishet_cod_na_scretche in x_maksonchik_top_potomu_chto_pishet_cod_na_scretche.values():\r\n ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche += i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1] \r\ny_maksonchik_top_potomu_chto_pishet_cod_na_scretche = {}\r\nfor i_maksonchik_top_potomu_chto_pishet_cod_na_scretche in a_maksonchik_top_potomu_chto_pishet_cod_na_scretche:\r\n if i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1] not in y_maksonchik_top_potomu_chto_pishet_cod_na_scretche:\r\n y_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1]] = [1, 0]\r\n else:\r\n y_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1]][0] += 1\r\n y_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1]][1] += y_maksonchik_top_potomu_chto_pishet_cod_na_scretche[i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1]][0]-1\r\nfor i_maksonchik_top_potomu_chto_pishet_cod_na_scretche in y_maksonchik_top_potomu_chto_pishet_cod_na_scretche.values():\r\n ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche += i_maksonchik_top_potomu_chto_pishet_cod_na_scretche[1] \r\nfor i_maksonchik_top_potomu_chto_pishet_cod_na_scretche in b_maksonchik_top_potomu_chto_pishet_cod_na_scretche.values():\r\n if i_maksonchik_top_potomu_chto_pishet_cod_na_scretche > 1:\r\n ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche -= summa_maksonchik_top_potomu_chto_pishet_cod_na_scretche(i_maksonchik_top_potomu_chto_pishet_cod_na_scretche-1)\r\nprint(ans_maksonchik_top_potomu_chto_pishet_cod_na_scretche) \r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche\r\n#maksonchiktoppotomuchtopishetcodnascretche" ]